Model Checking Abstract State Machines and Beyond

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.

[1]  Kirsten Winter,et al.  Model Checking Support for the ASM High-Level Language , 2000, TACAS.

[2]  Yuri Gurevich,et al.  Evolving algebras 1993: Lipari guide , 1995, Specification and validation methods.

[3]  Egon Börger,et al.  Why Use Evolving Algebras for Hardware and Software Engineering? , 1995, SOFSEM.

[4]  Andreas Blass,et al.  The Linear Time Hierarchy Theorems for Abstract State Machines and RAMs , 1997, J. Univers. Comput. Sci..

[5]  E. Börger.  Computation Theory and Logic , 1987, Lecture Notes in Computer Science.

[6]  Marc Spielmann.  Verification of relational tranducers for electronic commerce , 2000, PODS '00.

[7]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[8]  Marc Spielmann,et al.  Abstract state machines: verification problems and complexity , 2000 .

[9]  Marc Spielmann.  Automatic Verification of Abstract State Machines , 1999, CAV.

[10]  Serge Abiteboul,et al.  Relational transducers for electronic commerce , 1998, J. Comput. Syst. Sci..

[11]  Angelo Gargantini,et al.  Encoding Abstract State Machines in PVS , 2000, Abstract State Machines.

[12]  Kirsten Winter,et al.  Towards a Methodology for Model Checking ASM: Lessons Learned from the FLASH Case Study , 2000, Abstract State Machines.

[13]  Neil Immerman,et al.  Model Checking and Transitive-Closure Logic , 1997, CAV.

[14]  Jan Van den Bussche,et al.  Abstract State Machines and Computationally Complete Query Languages , 2002, Inf. Comput..

[15]  Kirsten Winter,et al.  Model Checking for Abstract State Machines , 2008, J. Univers. Comput. Sci..

[16]  Andreas Blass,et al.  Existential Fixed-Point Logic , 1987, Computation Theory and Logic.

[17]  Eric Rosen,et al.  An existential fragment of second order logic , 1999, Arch. Math. Log..

[18]  Egon Börger,et al.  Abstract State Machines 1988-1998: Commented ASM Bibliography , 1998, Bull. EATCS.

[19]  Erich Grädel,et al.  Logspace Reducibility via Abstract State Machines , 1999, World Congress on Formal Methods.

[20]  Jörg Flum,et al.  Finite model theory , 1995, Perspectives in Mathematical Logic.

[21]  Yuri Gurevich,et al.  The Sequential ASM Thesis , 2001, Bull. EATCS.

[22]  Alon Y. Halevy,et al.  Equivalence, query-reachability and satisfiability in Datalog extensions , 1993, PODS '93.

[23]  Saharon Shelah,et al.  Choiceless Polynomial Time , 1997, Ann. Pure Appl. Log..