Model checking and abstraction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model checking, abstraction, and compositional verification
Model checking, abstraction, and compositional verification
Abstract interpretation: a semantics-based tool for program analysis
Handbook of logic in computer science (vol. 4)
A practical method for verifying event-driven software
Proceedings of the 21st international conference on Software engineering
Automatically validating temporal safety properties of interfaces
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
JavaSpaces Principles, Patterns, and Practice
JavaSpaces Principles, Patterns, and Practice
Bebop: A Symbolic Model Checker for Boolean Programs
Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
Abstraction in Software Model Checking: Principles and Practice (Tutorial Overview and Bibliography)
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Results on the Propositional µ-Calculus
Proceedings of the 9th Colloquium on Automata, Languages and Programming
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Verification of JavaSpacesTM Parallel Programs
ACSD '03 Proceedings of the Third International Conference on Application of Concurrency to System Design
Foundations of the Bandera abstraction tools
The essence of computation
A Prover for the muCRL toolset with applications -- version 0.1
A Prover for the muCRL toolset with applications -- version 0.1
Abstraction of Parallel Uniform Processes with Data
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
| Hi-index | 0.00 |
This paper describes a toolkit that assists in the task of generating abstract approximations of process algebraic specifications written in the language @mCRL. Abstractions are represented by Modal Labelled Transition Systems, which are mixed transition systems with may and must modalities. The approach permits to infer the satisfaction or refutation of safety and liveness properties expressed in the (action-based) @m-calculus. The tool supports the abstraction of states and action labels which allows to deal with infinitely branching systems.