Executing the formal semantics of the Accellera property specification language by mechanised theorem proving

DOI10.1007/B93958zbMATH Open1179.68085OpenAlexW219731125MaRDI QIDQ5897068FDOQ5897068

Authors: Mike Gordon, Joe Hurd, Konrad Slind 

Publication date: 5 February 2010

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

Full work available at URL: https://doi.org/10.1007/b93958

Recommendations

• Validating the PSL/Sugar semantics using automated reasoning
• Theorem Proving in Higher Order Logics
• Correct Hardware Design and Verification Methods
• scientific article; zbMATH DE number 1260557
• Formal verification for non-formalists

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55)

Cited In (4)

• Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms
• Validating the PSL/Sugar semantics using automated reasoning
• Theorem Proving in Higher Order Logics
• Runtime verification of embedded real-time systems

Uses Software

• ML
• FoCs
• HOL
• PROSPER

This page was built for publication: Executing the formal semantics of the Accellera property specification language by mechanised theorem proving

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