Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Proceedings of the Fourth Annual Symposium on Logic in computer science
Verification of synchronous sequential machines based on symbolic execution
Proceedings of the international workshop on Automatic verification methods for finite state systems
Using symbolic execution for verification of Ada tasking programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Concurrent programming: principles and practice
Concurrent programming: principles and practice
Verifying temporal properties of systems
Verifying temporal properties of systems
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Finite transition systems: semantics of communicating systems
Finite transition systems: semantics of communicating systems
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Symbolic exploration of large circuits with enhanced forward/backward traversals
EURO-DAC '94 Proceedings of the conference on European design automation
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Transitive closure of infinite graphs and its applications
Transitive closure of infinite graphs and its applications
The Omega Library interface guide
The Omega Library interface guide
Compositional verification by model checking for counter-examples
ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Automatic generation of invariants and intermediate assertions
Theoretical Computer Science - Special issue: principles and practice of constraint programming
Verifying systems with integer constraints and Boolean predicates: a composite approach
Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis
An Introduction to Proving the Correctness of Programs
ACM Computing Surveys (CSUR)
Automatic discovery of linear restraints among variables of a program
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Symbolic Model Checking
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Automatic Symbolic Verification of Embedded Systems
IEEE Transactions on Software Engineering
Efficient State Space Pruning in Symbolic Backward Traversal
ICCS '94 Proceedings of the1994 IEEE International Conference on Computer Design: VLSI in Computer & Processors
Mona: Monadic Second-Order Logic in Practice
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Mona: Decidable Arithmetic in Practice
FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
A Note on Abstract Interpretation Strategies for Hybrid Automata
Hybrid Systems II
Verifying Temporal Properties of Sequential Machines Without Building their State Diagrams
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Delay Analysis in Synchronous Programs
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Hardware Verification using Monadic Second-Order Logic
Proceedings of the 7th International Conference on Computer Aided Verification
Proceedings of the 7th International Conference on Computer Aided Verification
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Mona & Fido: The Logic-Automaton Connection in Practice
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Symbolic Verification with Periodic Sets
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Symbolic Protocol Verification with Queue BDDs
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
STeP: The Stanford Temporal Prover
STeP: The Stanford Temporal Prover
Composite model-checking: verification with type-specific symbolic representations
ACM Transactions on Software Engineering and Methodology (TOSEM)
Proceedings of the 22nd international conference on Software engineering
Automatic abstraction for model checking software systems with interrelated numeric constraints
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Lightweight Reasoning about Program Correctness
Information Systems Frontiers
BRAIN: Backward Reachability Analysis with Integers
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
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
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
Verification of Vortex Workflows
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Reachability Analysis for Some Models of Infinite-State Transition Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Accurate Widenings and Boundedness Properties of Timed Systems
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Heuristics for Efficient Manipulation of Composite Constraints
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
Automated Verification of Concurrent Linked Lists with Counters
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Formal Verification of e-Services and Workflows
CAiSE '02/ WES '02 Revised Papers from the International Workshop on Web Services, E-Business, and the Semantic Web
Constraint-Based Verification of Client-Server Protocols
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Using Canonical Representations of Solutions to Speed Up Infinite-State Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Verification in loosely synchronous queue-connected discrete timed automata
Theoretical Computer Science
Lightweight reasoning about program correctness
CASCON '01 Proceedings of the 2001 conference of the Centre for Advanced Studies on Collaborative research
Proceedings of the 16th IEEE international conference on Automated software engineering
Counting the solutions of Presburger equations without enumerating them
Theoretical Computer Science - Implementation and application automata
Automatic discovery of API-level exploits
Proceedings of the 27th international conference on Software engineering
Precise widening operators for convex polyhedra
Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
Bounded model checking of infinite state systems
Formal Methods in System Design
Approximated parameterized verification of infinite-state processes with global conditions
Formal Methods in System Design
Approximated Context-Sensitive Analysis for Parameterized Verification
FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
Verification of Parameterized Systems with Combinations of Abstract Domains
FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
Light-Weight SMT-based Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Theoretical Computer Science
Model Checking Linear Programs with Arrays
Electronic Notes in Theoretical Computer Science (ENTCS)
Exact join detection for convex polyhedra and other numerical abstractions
Computational Geometry: Theory and Applications
Action Language verifier: an infinite-state model checker for reactive software specifications
Formal Methods in System Design
Data constraints for validation of real-time software
SE '08 Proceedings of the IASTED International Conference on Software Engineering
Automata-based representations for arithmetic constraints in automated verification
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Precise widening operators for convex polyhedra
SAS'03 Proceedings of the 10th international conference on Static analysis
Parameterized verification of infinite-state processes with global conditions
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Building SMT-based software model checkers: an experience report
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
On the decidability of model-checking for P systems
Journal of Automata, Languages and Combinatorics
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
Transitive closures of affine integer tuple relations and their overapproximations
SAS'11 Proceedings of the 18th international conference on Static analysis
Improving reachability analysis of infinite state systems by specialization
RP'11 Proceedings of the 5th international conference on Reachability problems
On model-checking of p systems
UC'05 Proceedings of the 4th international conference on Unconventional Computation
Signaling p systems and verification problems
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Model checking of systems employing commutative functions
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Improving Reachability Analysis of Infinite State Systems by Specialization
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Counterexample-guided abstraction refinement for linear programs with arrays
Automated Software Engineering
| Hi-index | 0.00 |
Model checking is a powerful technique for analyzing large, finite-state systems. In an infinite state system, however, many basic properties are undecidable. In this article, we present a new symbolic model checker which conservatively evaluates safety and liveness properties on programs with unbounded integer variables. We use Presburger formulas to symbolically encode a program's transition system, as well as its model-checking computations. All fixpoint calculations are executed symbolically, and their convergence is guaranteed by using approximation techniques. We demonstrate the promise of this technology on some well-known infinite-state concurrency problems.