LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Decidable First-Order Transition Logics for PA-Processes
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Linear reachability problems and minimal solutions to linear Diophantine equation systems
Theoretical Computer Science - Implementation and application of automata
Verification of qualitative constraints
CONCUR 2005 - Concurrency Theory
Decidable first-order transition logics for PA-processes
Information and Computation
LTL Over integer periodicity constraints
Theoretical Computer Science
On the freeze quantifier in Constraint LTL: Decidability and complexity
Information and Computation
An automata-theoretic approach to constraint LTL
Information and Computation
Model-Checking Large Finite-State Systems and Beyond
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Verification of qualitative Z constraints
Theoretical Computer Science
Reachability is decidable for weakly extended process rewrite systems
Information and Computation
Reachability Analysis of Synchronized PA Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Decidable first-order transition logics for PA-processes
Information and Computation
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Refining the process rewrite systems hierarchy via ground tree rewrite systems
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
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
Reachability of hennessy-milner properties for weakly extended PRS
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Towards a model-checker for counter systems
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Verification of gap-order constraint abstractions of counter systems
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Verification of gap-order constraint abstractions of counter systems
Theoretical Computer Science
| Hi-index | 0.00 |