Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Languages that capture complexity classes
SIAM Journal on Computing
Modalities for model checking: branching time logic strikes back
Science of Computer Programming
Handbook of theoretical computer science (vol. B)
Evolving algebras 1993: Lipari guide
Specification and validation methods
Why Use Evolving Algebras for Hardware and Software Engineering?
SOFSEM '95 Proceedings of the 22nd Seminar on Current Trends in Theory and Practice of Informatics
Model Checking and Transitive-Closure Logic
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Towards a Methodology for Model Checking ASM: Lessons Learned from the FLASH Case Study
ASM '00 Proceedings of the International Workshop on Abstract State Machines, Theory and Applications
Model Checking Abstract State Machines and Beyond
ASM '00 Proceedings of the International Workshop on Abstract State Machines, Theory and Applications
AsmetaSMV: a way to link high-level ASM models to low-level NuSMV specifications
ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
ASM2Bogor: An approach for verification of models specified through Asmeta language
Journal of Visual Languages and Computing
| Hi-index | 0.00 |
Abstract state machines (ASMs) provide the basis of a successful methodology for specification and verification of software and hardware systems. Nevertheless, computer aided verification of ASM-programs has not yet been well-developed. In this paper we try to shed some light on the limits of automatic verifiability of ASM-programs. We introduce a class of restricted ASM-programs, which are called nullary programs, and provide an algorithm that decides whether a given nullary program satisfies a given correctness property (expressible in a CTL*-like temporal logic) on all inputs. Our decision algorithm runs in Pspace and we show that this is optimal. We also show that straightforward generalizations of nullary programs cannot be verified algorithmically, as some basic verification problems become undecidable.