Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
An introduction to modal and temporal logics for CCS
Proceedings of the UK/Japan workshop on Concurrency : theory, language, and architecture: theory, language, and architecture
Action versus state based logics for transition systems
Proceedings of the LITP spring school on theoretical computer science on Semantics of systems of concurrent processes
An action-based framework for verifying logical and behavioural properties of concurrent systems
Computer Networks and ISDN Systems - Special issue on tools for FDTs
A Formal Verification Environment for Railway Signaling System Design
Formal Methods in System Design - Special issue: industrial critical systems
Communication and Concurrency
Verifying hardware components within JACK
CHARME '95 Proceedings of the IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Automatic Verification of a Hydroelectric Power Plant
FME '96 Proceedings of the Third International Symposium of Formal Methods Europe on Industrial Benefit and Advances in Formal Methods
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
CADP - A Protocol Validation and Verification Toolbox
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
The NCSU Concurrency Workbench
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Hardware Verification, Boolean Logic Programming, Boolean Functional Programming
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Symbolic Model Checking of Logics with Actions
Model Checking and Artificial Intelligence
| Hi-index | 0.00 |
We present SAM, a symbolic model checker for ACTL, the action-based version of CTL. SAM relies on implicit representations of Labeled Transition Systems (LTSs), the semantic domain for ACTL formulae, and uses symbolic manipulation algorithms. SAM has been realized by translating (networks of) LTSs and, possibly recursive, ACTL formulae into BSP (Boolean Symbolic Programming), a programming language aiming at defining computations on boolean functions, and by using the BSP interpreter to carry out computations (i.e. verifications).