Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Model checking
Alloy: a lightweight object modelling notation
ACM Transactions on Software Engineering and Methodology (TOSEM)
Model Checking Support for the ASM High-Level Language
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
Encoding Abstract State Machines in PVS
ASM '00 Proceedings of the International Workshop on Abstract State Machines, Theory and Applications
Symbolic model checking of declarative relational models
Proceedings of the 28th international conference on Software engineering
Interfacing ASM with the MDG tool
ASM'03 Proceedings of the abstract state machines 10th international conference on Advances in theory and practice
Optimizations for compiling declarative models into boolean formulas
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Tutorial: the ASM method for system design and analysis. a tutorial introduction
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Analyzing temporal properties of abstract models
ASE '11 Proceedings of the 2011 26th IEEE/ACM International Conference on Automated Software Engineering
| Hi-index | 0.00 |
We show how static properties of declarative models can be efficiently analyzed in a symbolic model checker; in particular, we use Cadence SMV to analyze Alloy models by translating Alloy to SMV. The computational paths of the SMV models represent interpretations of the Alloy models. The produced SMV model satisfies its LTL specifications if and only if the original Alloy model is inconsistent with respect to its finite scopes; counterexamples produced by the model checker are valid instances of the Alloy model. Our experiments show that the translation of many frequently used constructs of Alloy to SMV results in optimized models such that their analysis in SMV is much faster than in the Alloy Analyzer. Model checking is faster than SAT solving for static problems when an interpretation can be eliminated by early decisions in the model checking search.