Programming languages and their definition
Programming languages and their definition
Process algebra
Verifying temporal properties of systems
Verifying temporal properties of systems
There exist 6n/13 ordinary points
Discrete & Computational Geometry
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
Communication and Concurrency
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Verification of Temporal Properties of Processes in a Setting with Data
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Efficient Diagnostic Generation for Boolean Equation Systems
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
Small Progress Measures for Solving Parity Games
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Symbolic Transition Graph with Assignment
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
A Discrete Strategy Improvement Algorithm for Solving Parity Games
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Model-checking processes with data
Science of Computer Programming
International Journal on Software Tools for Technology Transfer (STTT) - Special section on Tools and Algorithms for the Construction and Analysis of Systems
Parameterised boolean equation systems
Theoretical Computer Science - Formal methods for components and objects
There Are Not Too Many Magic Configurations
Discrete & Computational Geometry
Implementing Influence Analysis Using Parameterised Boolean Equation Systems
ISOLA '06 Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation
A Model Checking Language for Concurrent Value-Passing Systems
FM '08 Proceedings of the 15th international symposium on Formal Methods
Instantiation for Parameterised Boolean Equation Systems
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Invariants for Parameterised Boolean Equation Systems
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
A Multi-Core Solver for Parity Games
Electronic Notes in Theoretical Computer Science (ENTCS)
Static Analysis Techniques for Parameterised Boolean Equation Systems
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Solving Parity Games in Practice
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Solving parity games in big steps
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Bisimulation minimisations for boolean equation systems
HVC'09 Proceedings of the 5th international Haifa verification conference on Hardware and software: verification and testing
Equivalence checking for infinite systems using parameterized Boolean equation systems
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
An overview of the mCRL2 toolset and its recent advances
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Hi-index | 0.00 |
Verification problems for finite- and infinite-state processes, like model checking and equivalence checking, can effectively be encoded in Parameterised Boolean Equation Systems (PBESs). Solving the PBES then solves the encoded problem. The decidability of solving a PBES depends on the data sorts that occur in the PBES. We describe a pragmatic methodology for solving PBESs, viz., by attempting to instantiate them to the sub-fragment of Boolean Equation Systems (BESs). Unlike solving PBESs, solving BESs is a decidable problem. Based on instantiation, verification using PBESs can effectively be done fully automatically in most practical cases. We demonstrate this by solving several complex verification problems using a prototype implementation of our instantiation technique. In addition, practical issues concerning this implementation are addressed. Furthermore, we illustrate the effectiveness of instantiation as a transformation on PBESs when solving verification problems involving systems of infinite size.