Encoding abstract state machines in PVS

DOI10.1007/3-540-44518-8_17MaRDI QIDQ2753715zbMATH OpenFDO

Authors Angelo Gargantini, Elvinia Riccobene

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_17

Mathematics Subject Classification ID

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

Recommendations

• Model checking support for the ASM high-level language
• scientific article; zbMATH DE number 2102724
• PVS strategies for proving abstraction properties of automata
• Model checking abstract state machines and beyond
• scientific article; zbMATH DE number 1543047

Cited in

(4)

• Construction and analysis of ground models and their refinements as a foundation for validating computer-based systems
• PVS strategies for proving abstraction properties of automata
• Ambient abstract state machines with applications
• A logic for secure memory access of abstract state machines

This page was built for publication: Encoding abstract state machines in PVS

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