Theory of linear and integer programming
Theory of linear and integer programming
Counting solutions to Presburger formulas: how and why
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
An efficient incremental algorithm for solving systems of linear Diophantine equations
Information and Computation
Avoiding slack variables in the solving of linear diophantine equations and inequations
Theoretical Computer Science - Special issue: principles and practice of constraint programming
Verification of Real-Time Systems using Linear Relation Analysis
Formal Methods in System Design - Special issue on computer aided verification (CAV 93)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Action Language: a specification language for model checking reactive systems
Proceedings of the 22nd international conference on Software engineering
Algorithmic analysis of programs with well quasi-ordered domains
Information and Computation - Special issue: LICS 1996—Part 1
Model Checking of Safety Properties
Formal Methods in System Design
An Algorithm for Solving Systems of Linear Diophantine Equations in Naturals
EPIA '97 Proceedings of the 8th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
A Library for Composite Symbolic Representations
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Automatic Verification of Parameterized Cache Coherence Protocols
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
On the Verification of Broadcast Protocols
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
BRAIN: Backward Reachability Analysis with Integers
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Model Checking of Control-User Component-Based Parametrised Systems
CBSE '08 Proceedings of the 11th International Symposium on Component-Based Software Engineering
Light-Weight SMT-based Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Automated Computing of the Maximal Number of Handled Clients for Client-Server Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Basis of solutions for a system of linear inequalities in integers: computation and applications
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
From automata to semilinear sets: a logical solution for sets L (C, P)
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
In this paper we discuss reachability analysis for infinite-state systems in which states can be represented by a vector of integers. We propose a new algorithm for verifying reachability properties based on canonical representations of solutions to systems of linear inequations over integers instead of decision procedures for integer or real arithmetic. Experimental results demonstrate that problems in protocol verification which are beyond the reach of other existing systems can be solved completely automatically.