Model checking abstract state machines with answer set programming

Authors:
Calvin Kai Fan Tang;Eugenia Ternovska
Affiliations:
School of Computing Science, Simon Fraser University, Burnaby, BC, Canada;School of Computing Science, Simon Fraser University, Burnaby, BC, Canada
Venue:
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2005

Citing 7
Cited 1

The Semantics of Predicate Logic as a Programming Language

Journal of the ACM (JACM)
Model checking

Model checking
Symbolic Model Checking

Symbolic Model Checking
Fighting Livelock in the i-Protocol: A Comparative Study of Verification Tools

TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Abstract State Machines: A Method for High-Level System Design and Analysis

Abstract State Machines: A Method for High-Level System Design and Analysis
Bounded LTL model checking with stable models

Theory and Practice of Logic Programming
Using spin to generate tests from ASM specifications

ASM'03 Proceedings of the abstract state machines 10th international conference on Advances in theory and practice

Direct Support for Model Checking Abstract State Machines by Utilizing Simulation

ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z

Quantified Score

Hi-index	0.00

Visualization

Abstract

Answer Set Programming (ASP) has been demonstrated as an effective tool in various application areas, including formal verification. In this paper we present Bounded Model Checking (BMC) of Abstract State Machines (ASMs) based on ASP. We show how to succinctly translate an ASM and a temporal property into a logic program and solve the BMC problem for the ASM by computing an answer set for the corresponding program. Experimental results for our method using the answer set solvers SMODELS and CMODELS are also given.