Verifying infinite state processes with sequential and parallel composition
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model checking of systems with many identical timed processes
Theoretical Computer Science
Symbolic Representation of Upward-Closed Sets
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Handling Global Conditions in Parameterized System Verification
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
General decidability theorems for infinite-state systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Better is Better than Well: On Efficient Verification of Infinite-State Systems
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
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
Verification of qualitative Z constraints
Theoretical Computer Science
An Automata-based Approach for CTL*; With Constraints
Electronic Notes in Theoretical Computer Science (ENTCS)
A classification of the expressive power of well-structured transition systems
Information and Computation
The complexity of reversal-bounded model-checking
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
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
Verification of gap-order constraint abstractions of counter systems
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Strong termination for gap-order constraint abstractions of counter systems
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Comparing the expressive power of well-structured transition systems
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
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
Computable fixpoints in well-structured symbolic model checking
Formal Methods in System Design
| Hi-index | 0.00 |