PVS strategies for proving abstraction properties of automata

zbMATH Open1272.68363MaRDI QIDQ2848044FDOQ2848044

Authors: Sayan Mitra, Myla Archer 

Publication date: 25 September 2013

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (7)

• A Brief Overview of PVS
• Title not available (Why is that?)
• Correct Hardware Design and Verification Methods
• Title not available (Why is that?)
• 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

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)