Constraints and constraint solving: an introduction
Constraints in computational logics
Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
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
Counting the Solutions of Presburger Equations without Enumerating Them
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction
CL '00 Proceedings of the First International Conference on Computational Logic
Well-abstracted transition systems: application to FIFO automata
Information and Computation
Counting the solutions of Presburger equations without enumerating them
Theoretical Computer Science - Implementation and application automata
On the Computational Power of 1-Deterministic and Sequential P Systems
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Petri nets with simple circuits
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Combining logic programs and monadic second order logics by program transformation
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
A Modular Static Analysis Approach to Affine Loop Invariants Detection
Electronic Notes in Theoretical Computer Science (ENTCS)
Extending Abstract Acceleration Methods to Data-Flow Programs with Numerical Inputs
Electronic Notes in Theoretical Computer Science (ENTCS)
Constrained monotonic abstraction: a CEGAR for parameterized verification
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Program specialization for verifying infinite state systems: an experimental evaluation
LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
Forward analysis and model checking for trace bounded WSTS
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Flat acceleration in symbolic model checking
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Derivation of non-structural invariants of petri nets using abstract interpretation
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Towards a model-checker for counter systems
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Applying abstract acceleration to (co-)reachability analysis of reactive programs
Journal of Symbolic Computation
On the Computational Power of 1-Deterministic and Sequential P Systems
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
| Hi-index | 0.00 |