Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
A distributed mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
Model checking
Symbolic Model Checking
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Specification of real-time and hybrid systems in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Checking Safety Properties Using Induction and a SAT-Solver
FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Formal analysis of Suzuki & Kasami distributed mutual exclusion algorithm
FMOODS '02 Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Methods for Open Object-Based Distributed Systems V
Analysis of the Suzuki-Kasami Algorithm with SAL Model Checkers
CIT '05 Proceedings of the The Fifth International Conference on Computer and Information Technology
Analysis of the Suzuki-Kasami Algorithm with the Maude Model Checker
APSEC '05 Proceedings of the 12th Asia-Pacific Software Engineering Conference
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
The maude LTL model checker and its implementation
SPIN'03 Proceedings of the 10th international conference on Model checking software
Approximate reachability for linear systems
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
A fast linear-arithmetic solver for DPLL(T)
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
| Hi-index | 0.00 |
SAL is a toolkit for analyzing transition systems, providing several different tools. Among the tools are a BDD-based symbolic model checker (SMC) and an SMT-based infinite bounded model checker (infBMC). The unique functionality provided by SAL is k-induction, which is supported by infBMC. Given appropriate lemmas, infBMC can prove automatically by k-induction that an infinite-state transition system satisfies invariant properties. Maude is a specification language and system based on membership equational logic and rewriting logic. Maude is equipped with an on-the-fly explicit state model checker. The unique functionality provided by the Maude model checker supports inductive data types. We make a comparison of SAL (especially SMC and infBMC) and the Maude model checker by conducting case studies in which the Suzuki-Kasami distributed mutual exclusion algorithm is analyzed. The purpose of the comparison is to clarify some of the two tools' functionalities, especially the unique ones, through the case studies.