Adequate proof principles for invariance and liveness properties of concurrent programs
Science of Computer Programming
A linear algorithm to solve fixed-point equations on transition systems
Information Processing Letters
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
Model checking mobile processes
Information and Computation
Formal verification of a leader election protocol in process algebra
ACP '95 Proceedings from the international workshop on Algebra of communicating processes
A Bounded Retransmission Protocol for Large Data Packets
AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
Invariants in Process Algebra with Data
CONCUR '94 Proceedings of the Concurrency Theory
A Linear Algorithm for Solving Fixed-Point Equations on Transition Systems
CAAP '92 Proceedings of the 17th Colloquium on Trees in Algebra and Programming
Verification of temporal properties of processes in a setting with data
Verification of temporal properties of processes in a setting with data
The tree identify protocol of IEEE 1394 in $\mu$CRL
The tree identify protocol of IEEE 1394 in $\'mu$CRL
Focus Points and Convergent Process Operators
Focus Points and Convergent Process Operators
A note on {\it n} similar parallel processes
A note on {\'it n} similar parallel processes
Formal Specification and Proof Techniques for Mixed Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
An Adequate Logic for Full LOTOS
FME '01 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity
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
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Suitability of mCRL2 for concurrent-system design: a 2 × 2 switch case study
FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
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
A linear process-algebraic format with data for probabilistic automata
Theoretical Computer Science
Fundamenta Informaticae
Equivalence checking for infinite systems using parameterized Boolean equation systems
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
We define a value-based modal µ-calculus, built from first-order formulas, modalities, and fixed point operators parameterized by data variables, which allows to express temporal properties involving data. We interpret this logic over µCrl terms defined by linear process equations. The satisfaction of a temporal formula by a µCrl term is translated to the satisfaction of a first-order formula containing parameterized fixed point operators. We provide proof rules for these fixed point operators and show their applicability on various examples.