PVS strategies for proving abstraction properties of automata

MaRDI QIDQ2848044zbMATH OpenFDO

Authors Sayan Mitra, Myla Archer

Publication date 25 September 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066105000952

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 2102725
• TAME: Using PVS strategies for special-purpose theorem proving
• Abstraction as the key for invariant verification
• scientific article; zbMATH DE number 1670518
• Abstraction and abstraction refinement

Cited in

(8)

• A Brief Overview of PVS
• scientific article; zbMATH DE number 1670518 (Why is no real title available?)
• Correct Hardware Design and Verification Methods
• scientific article; zbMATH DE number 1696765 (Why is no real title available?)
• Automated polyhedral abstraction proving
• TAME: Using PVS strategies for special-purpose theorem proving
• Translation templates to support strategy development in PVS
• A Formalized Theory for Verifying Stability and Convergence of Automata in PVS

Describes a project that uses

Uses Software

• PVS

This page was built for publication: PVS strategies for proving abstraction properties of automata

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