Complexity theory of parallel time and hardware
Information and Computation
An $\cal NC$ Algorithm for Evaluating Monotone Planar Circuits
SIAM Journal on Computing
The complexity of propositional linear temporal logics in simple cases
Information and Computation
The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
On Parallel Evaluation of Classes of Circuits
Proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science
Proceedings of the Conference on Logic of Programs
Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
Checking Finite Traces Using Alternating Automata
Formal Methods in System Design
Efficient monitoring of safety properties
International Journal on Software Tools for Technology Transfer (STTT) - Special section on tools and algorithms for the construction and analysis of systems
Combining System Level Modeling with Assertion Based Verification
ISQED '05 Proceedings of the 6th International Symposium on Quality of Electronic Design
Combining test case generation and runtime verification
Theoretical Computer Science - Abstract state machines and high-level system design and analysis
Automata-based assertion-checker synthesis of PSL properties
ACM Transactions on Design Automation of Electronic Systems (TODAES)
A note on the space complexity of some decision problems for finite automata
Information Processing Letters
One-input-face MPCVP is hard for l, but in LogDCFL
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Evaluating monotone circuits on cylinders, planes and tori
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Deterministic dynamic monitors for linear-time assertions
FATES'06/RV'06 Proceedings of the First combined international conference on Formal Approaches to Software Testing and Runtime Verification
Weak Kripke structures and LTL
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
| Hi-index | 0.00 |
We present an AC 1(logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a foundation for the parallelization of various applications in monitoring, testing, and verification.