Model Checking Abstract State Machines and Beyond

Authors:
Marc Spielmann
Affiliations:
-
Venue:
ASM '00 Proceedings of the International Workshop on Abstract State Machines, Theory and Applications
Year:
2000

Citing 11
Cited 0

The complexity of propositional linear temporal logics

Journal of the ACM (JACM)
Automatic verification of finite-state concurrent systems using temporal logic specifications

ACM Transactions on Programming Languages and Systems (TOPLAS)
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
Equivalence, query-reachability and satisfiability in Datalog extensions

PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Evolving algebras 1993: Lipari guide

Specification and validation methods
Verification of relational tranducers for electronic commerce

PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Existential Fixed-Point Logic

Computation Theory and Logic, In Memory of Dieter Rödding
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
Logspace Reducibility via Abstract State Machines

FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
Automatic Verification of Abstract State Machines

CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Model Checking and Transitive-Closure Logic

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a systematic investigation of the (semi-) automatic verifiability of ASMs. As a first step, we put forward two verification problems concerning the correctness of ASMs and investigate the decidability and complexity of both problems.