Model checking abstract state machines and beyond

DOI10.1007/3-540-44518-8_18MaRDI QIDQ2753716zbMATH OpenFDO

Authors Marc Spielmann

Publication date 11 November 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44518-8_18

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 1951200
• Decidable properties for monadic abstract state machines
• scientific article; zbMATH DE number 2102724
• scientific article; zbMATH DE number 1543047
• Model Checking Abstract State Machines with Answer Set Programming

Cited in

(22)

• Symbolic model checking: \(10^{20}\) states and beyond
• Verification of relational transducers for electronic commerce
• Moded and continuous abstract state machines
• Incompleteness of states w.r.t. traces in model checking
• Decidable properties for monadic abstract state machines
• Infinite state model checking by abstract interpretation and program specialisation
• scientific article; zbMATH DE number 1670518 (Why is no real title available?)
• scientific article; zbMATH DE number 1670520 (Why is no real title available?)
• Refinements in Typed Abstract State Machines
• Normalization of Some Extended Abstract State Machines
• scientific article; zbMATH DE number 1324665 (Why is no real title available?)
• scientific article; zbMATH DE number 1951200 (Why is no real title available?)
• scientific article; zbMATH DE number 1979542 (Why is no real title available?)
• scientific article; zbMATH DE number 1543047 (Why is no real title available?)
• scientific article; zbMATH DE number 2102724 (Why is no real title available?)
• Abstract State Machines and System Theoretic Process Analysis for Safety-Critical Systems
• Model checking abstract state machines with answer set programming
• scientific article; zbMATH DE number 5173926 (Why is no real title available?)
• Model Checking Abstract State Machines with Answer Set Programming
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• Specification and verification of data-driven Web applications
• The computable kernel of abstract state machines

This page was built for publication: Model checking abstract state machines and beyond

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2753716)