Local model checking for infinite state spaces
Selected papers of the Second Workshop on Concurrency and compositionality
Model checking and boolean graphs
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Symbolic model checking for real-time systems
Information and Computation
A modal logic for message passing processes
Acta Informatica
On natural deduction in first-order fixpoint logics
Fundamenta Informaticae
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Model checking
A Model Checker for Value-Passing Mu-Calculus Using Logic Programming
PADL '01 Proceedings of the Third International Symposium on Practical Aspects of Declarative Languages
Local Model Checking for Value-Passing Processes (Extended Abstract)
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
Efficient Verification of Timed Automata with BDD-Like Data-Structures
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Timing Assumptions and Verification of Finite-State Concurrent Systems
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Testing-Based Abstractions for Value-Passing Systems
CONCUR '94 Proceedings of the Concurrency Theory
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal Mu-Calculus
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Local Model Checking for Real-Time Systems (Extended Abstract)
Proceedings of the 7th International Conference on Computer Aided Verification
Symbolic Model Checking of Infinite State Systems Using Presburger Arithmetic
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Multiple Counters Automata, Safety Analysis and Presburger Arithmetic
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Approximate reachability analysis of timed automata
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Model checking and theorem proving: a unified framework
Model checking and theorem proving: a unified framework
Tabled resolution + constraints: a recipe for model checking real-time systems
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Efficient temporal-logic query checking for presburger systems
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
Invariants for Parameterised Boolean Equation Systems
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Invariants for Parameterised Boolean Equation Systems
Theoretical Computer Science
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Consistent consequence for boolean equation systems
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Equivalence checking for infinite systems using parameterized Boolean equation systems
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
This paper shows how predicate equation systems (PESs) may be used to solve model-checking problems for systems, such as those involving real-time or value passing, that manipulate data. PESs are first defined and the encoding of model-checking problems described; then generic global and local approaches for solving PESs are given. Real-time model checking is then considered in detail, and a new, efficient on-the-fly technique for real-time model checking based on proof search in PESs is developed and experimentally shown to significantly outperform existing approaches when system specifications or formula specifications contain errors and to be competitive when both are correct.