Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

TAME: Using PVS strategies for special-purpose theorem proving

From MaRDI portal
Publication:1601865
Jump to:navigation, search

DOI10.1023/A:1018913028597zbMath1001.68127OpenAlexW1870235599MaRDI QIDQ1601865

Myla M. Archer

Publication date: 27 June 2002

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018913028597


zbMATH Keywords

theorem provingstrategiesPVStimed automata modeling environment


Mathematics Subject Classification ID


Related Items (6)

Verification of distributed systems with local-global predicates ⋮ A Brief Overview of PVS ⋮ A Formalized Theory for Verifying Stability and Convergence of Automata in PVS ⋮ TAME ⋮ Operating system verification---an overview ⋮ Translation Templates to Support Strategy Development in PVS


Uses Software

  • PVS
  • SCR
  • CLAM






This page was built for publication: TAME: Using PVS strategies for special-purpose theorem proving

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1601865&oldid=13898040"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 02:37.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki