Programming languages and their definition
Programming languages and their definition
Verifying temporal properties of systems
Verifying temporal properties of 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
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Model-checking processes with data
Science of Computer Programming
Parameterised boolean equation systems
Theoretical Computer Science - Formal methods for components and objects
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
Equivalence checking for infinite systems using parameterized Boolean equation systems
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Invariants for Parameterised Boolean Equation Systems
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
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,
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems
Information and Computation
Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems
Information and Computation
Experiences in developing the mCRL2 toolset
Software—Practice & Experience
Datalog-Based program analysis with BES and RWL
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
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 solves the encoded problem. The decidability of solving a PBES depends on the data sorts that occur in the PBES. We describe a manipulation for transforming a given PBES to a simpler PBES that may admit solution methods that are not applicable to the original one. Depending on whether the data sorts occurring in the PBES are finite or countable, the resulting PBES can be a Boolean Equation System (BES) or an Infinite Boolean Equation System (IBES). Computing the solution to a BES is decidable. Computing the global solution to an IBES is still undecidable, but for partial solutions (which suffices for e.g.local model checking), effective tooling is possible. We give examples that illustrate the efficacy of our techniques.