Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Algorithms for mutual exclusion
Algorithms for mutual exclusion
Process algebra
Local model checking for infinite state spaces
Selected papers of the Second Workshop on Concurrency and compositionality
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Communication and Concurrency
Efficient on-the-fly model-checking for regular alternation-free mu-calculus
Science of Computer Programming - Special issure on formal methods for industrial critical systems (FMICS 2000)
The Power of QDDs (Extended Abstract)
SAS '97 Proceedings of the 4th International Symposium on Static Analysis
On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Liveness with (0, 1, infty)-Counter Abstraction
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Deciding Separation Formulas with SAT
CAV '02 Proceedings of the 14th 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
Equational binary decision diagrams
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Parameterised boolean equation systems
Theoretical Computer Science - Formal methods for components and objects
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
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,
Invariants for Parameterised Boolean Equation Systems
Theoretical Computer Science
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
Structural Analysis of Boolean Equation Systems
ACM Transactions on Computational Logic (TOCL)
A linear process-algebraic format with data for probabilistic automata
Theoretical Computer Science
Analysing the control software of the compact muon solenoid experiment at the large hadron collider
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Using Model Checking to Analyze the System Behavior of the LHC Production Grid
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
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
Using model checking to analyze the system behavior of the LHC production grid
Future Generation Computer Systems
| Hi-index | 0.00 |
We propose a procedure for automatically verifying properties (expressed in an extension of the modal µ-calculus) over processes with data, specified in µCRL. We first briefly review existing work, such as the theory of µCRL and we discuss the logic, called first order modal µ-calculus in more detail. Then, we introduce the formalism of first order boolean equation systems and focus on several lemmata that are at the basis of the soundness of our decision procedure. We discuss our findings on three non-trivial applications for a prototype implementation of this procedure. The results show that our prototype can deal with quite complex and interesting properties and systems, showing the efficacy of the approach.