“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
A linear-time model-checking algorithm for the alternation-free modal mu-calculus
Formal Methods in System Design - Special issue on computer-aided verification: special methods II
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
Patterns in property specifications for finite-state verification
Proceedings of the 21st international conference on Software engineering
Modal and temporal properties of processes
Modal and temporal properties of processes
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)
Action versus State based Logics for Transition Systems
Proceedings of the LITP Spring School on Theoretical Computer Science: Semantics of Systems of Concurrent Processes
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
OPEN/CÆSAR: An OPen Software Architecture for Verification, Simulation, and Testing
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
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
The ForSpec Temporal Logic: A New Temporal Property-Specification Language
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
On Combining Functional Verification and Performance Evaluation Using CADP
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Branching Time Regular Temporal Logic for Model Checking with Linear Time Complexity
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Proof System for Hennessy-Milner Logic with Recursion
CAAP '88 Proceedings of the 13th Colloquium on Trees in Algebra and Programming
A Linear Algorithm for Solving Fixed-Point Equations on Transition Systems
CAAP '92 Proceedings of the 17th Colloquium on Trees in Algebra and Programming
Model Checking Mobile Processes (Full version)
Model Checking Mobile Processes (Full version)
Development of a verified Erlang program for resource locking
International Journal on Software Tools for Technology Transfer (STTT)
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
Formal Verification of CHP Specifications with CADP Illustration on an Asynchronous Network-on-Chip
ASYNC '07 Proceedings of the 13th IEEE International Symposium on Asynchronous Circuits and Systems
CADP 2006: a toolbox for the construction and analysis of distributed processes
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Distributed on-the-fly model checking and test case generation
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Instantiation for Parameterised Boolean Equation Systems
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Computation Tree Regular Logic for Genetic Regulatory Networks
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
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,
Verification of GALS Systems by Combining Synchronous Languages and Process Calculi
Proceedings of the 16th International SPIN Workshop on Model Checking Software
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
A study of shared-memory mutual exclusion protocols using CADP
FMICS'10 Proceedings of the 15th international conference on Formal methods for industrial critical systems
Translating Pi-calculus into LOTOS NT
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
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
Bisimulation minimisations for boolean equation systems
HVC'09 Proceedings of the 5th international Haifa verification conference on Hardware and software: verification and testing
Theoretical Computer Science
CADP 2010: a toolbox for the construction and analysis of distributed processes
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Property-dependent reductions for the modal Mu-calculus
Proceedings of the 18th international SPIN conference on Model checking software
Model checking and co-simulation of a dynamic task dispatcher circuit using CADP
FMICS'11 Proceedings of the 16th international conference on Formal methods for industrial critical systems
Datalog-Based program analysis with BES and RWL
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
A logical verification methodology for service-oriented computing
ACM Transactions on Software Engineering and Methodology (TOSEM)
Verification of a self-configuration protocol for distributed applications in the cloud
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Partial model checking using networks of labelled transition systems and boolean equation systems
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Counterexample guided synthesis of monitors for realizability enforcement
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
PIC2LNT: model transformation for model checking an applied pi-calculus
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Science of Computer Programming
An experience report on the verification of autonomic protocols in the cloud
Innovations in Systems and Software Engineering
Large-scale Distributed Verification Using CADP: Beyond Clusters to Grids
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal analysis of a hardware dynamic task dispatcher with CADP
Science of Computer Programming
Science of Computer Programming
| Hi-index | 0.00 |
Modal μ-calculus is an expressive specification formalism for temporal properties of concurrent programs represented as Labeled Transition Systems (Ltss). However, its practical use is hampered by the complexity of the formulas, which makes the specification task difficult and error-prone. In this paper, we propose Mcl(Model Checking Language), an enhancement of modal μ-calculus with high-level operators aimed at improving expressiveness and conciseness of formulas. The main Mclingredients are parameterized fixed points, action patterns extracting data values from Ltsactions, modalities on transition sequences described using extended regular expressions and programming language constructs, and an infinite looping operator specifying fairness. We also present a method for on-the-fly model checking of Mclformulas on finite Ltss, based on the local resolution of boolean equation systems, which has a linear-time complexity for alternation-free and fairness formulas. Mclis supported by the Evaluator4.0 model checker developed within the Cadpverification toolbox.