The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Structural complexity 1
Journal of the ACM (JACM)
Theoretical Computer Science
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Reasoning about infinite computations
Information and Computation
Information Processing Letters
An access control model supporting periodicity constraints and temporal reasoning
ACM Transactions on Database Systems (TODS)
Reversal-Bounded Multicounter Machines and Their Decision Problems
Journal of the ACM (JACM)
Abstraction from counters: an application on real-time systems
DATE '00 Proceedings of the conference on Design, automation and test in Europe
Introduction to constraint databases
Introduction to constraint databases
On infinite transition graphs having a decidable monadic theory
Theoretical Computer Science
Deciding Properties of Integral Relational Automata
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Calendars, Time Granularities, and Automata
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Multiple Counters Automata, Safety Analysis and Presburger Arithmetic
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Presburger liveness verification of discrete timed automata
Theoretical Computer Science
On the Verification Problem of Nonregular Properties for Nonregular Processes
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
On the Verification of Broadcast Protocols
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
DP Lower bounds for equivalence-checking and model-checking of one-counter automata
Information and Computation
NEXP TIME-complete description logics with concrete domains
ACM Transactions on Computational Logic (TOCL)
A classification of symbolic transition systems
ACM Transactions on Computational Logic (TOCL)
Computation: finite and infinite machines
Computation: finite and infinite machines
Verification of qualitative constraints
CONCUR 2005 - Concurrency Theory
LTL Over integer periodicity constraints
Theoretical Computer Science
An automata-theoretic approach to constraint LTL
Information and Computation
On the complexity of omega -automata
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Flat parametric counter automata
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Programs with lists are counter automata
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Analysis of modular arithmetic
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Towards a model-checker for counter systems
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Verification of gap-order constraint abstractions of counter systems
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Satisfiability of CTL* with constraints
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Verification of gap-order constraint abstractions of counter systems
Theoretical Computer Science
| Hi-index | 5.23 |
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z. The constraint language includes periodicity constraints and comparison constraints of the form x=y and x