“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
A closed-form evaluation for Datalog queries with integer (gap)-order constraints
ICDT Selected papers of the 4th international conference on Database theory
Reasoning about infinite computations
Information and Computation
The benefits of relaxing punctuality
Journal of the ACM (JACM)
Computability and complexity: from a programming perspective
Computability and complexity: from a programming perspective
Reversal-Bounded Multicounter Machines and Their Decision Problems
Journal of the ACM (JACM)
An automata-theoretic approach to modular model checking
ACM Transactions on Programming Languages and Systems (TOPLAS)
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Automata For Modeling Real-Time Systems
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Deciding Properties of Integral Relational Automata
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
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
Symbolic Verification with Gap-Order Constraints
LOPSTR '96 Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Multiple Counters Automata, Safety Analysis and Presburger Arithmetic
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
On the Verification Problem of Nonregular Properties for Nonregular Processes
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Exponential space complete problems for Petri nets and commutative semigroups (Preliminary Report)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Computation: finite and infinite machines
Computation: finite and infinite machines
An automata-theoretic approach to constraint LTL
Information and Computation
Size-change termination with difference constraints
ACM Transactions on Programming Languages and Systems (TOPLAS)
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis
SAS '08 Proceedings of the 15th international symposium on Static Analysis
Verification of qualitative Z constraints
Theoretical Computer Science
Approximated parameterized verification of infinite-state processes with global conditions
Formal Methods in System Design
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Branching-time temporal logic extended with qualitative presburger constraints
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Programs with lists are counter automata
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Towards a model-checker for counter systems
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Hi-index | 5.23 |
We investigate verification problems for gap-order constraint systems (GCS), an (infinitely-branching) abstract model of counter machines, in which constraints (over Z) between the variables of the source state and the target state of a transition are gap-order constraints (GC) [32]. GCS extend monotonicity constraint systems [7], integral relation automata [16], and constraint automata in [19]. First, we address termination and fairness analysis of GCS. Since GCS are infinitely-branching, termination does not imply strong termination, i.e. the existence of an upper bound on the lengths of the runs from a given state. We show that the termination problem, the strong termination problem, and the fairness problem for GCS (the latter consisting in checking the existence of infinite runs in GCS satisfying acceptance conditions a la Buchi) are decidable and Pspace-complete. Moreover, for each control location of the given GCS, one can build a GC representation of the set of counter variable valuations from which termination (resp., strong termination, resp., fairness) does not hold (resp., does not hold, resp., does hold). Next, we consider a constrained branching-time logic, GCCTL^@?, obtained by enriching CTL^@? with GC, thus enabling expressive properties and subsuming the setting of [16]. We establish that, while model-checking GCS against the universal fragment of GCCTL^@? is undecidable, model-checking against the existential fragment, and satisfiability of both the universal and existential fragments are instead decidable and Pspace-complete (note that the two fragments are not dual since GC are not closed under negation). Moreover, our results imply Pspace-completeness of known verification problems that were shown to be decidable in [16] with no elementary upper bounds.