HOL-Z 2.0: A Proof Environment for Z-Specifications

dc.creatorBrucker,Achim
dc.creatorRittinger,Frank
dc.creatorWolff,Burkhart
dc.date2003
dc.date.accessioned2024-02-06T12:52:14Z
dc.date.available2024-02-06T12:52:14Z
dc.descriptionWe present a new proof environment for the specification language Z. The basis is a semantic representation of Z in a structure-preserving, shallow embedding in Isabelle/HOL. On top of the embedding, new proof support for the Z schema calculus and for proof structuring are developed. Thus, we integrate Z into a well-known and trusted theorem prover with advanced deduction technology such as higher-order rewriting, tableaux-based provers and arithmetic decision procedures. A further achievement of this work is the integration of our embedding into a new tool-chain providing a Z-oriented type checker, documentation facilities and macro support for refinement proofs, as a result, the gap has been closed between a logical embedding proven correct and a tool suited for applications of nontrivial size.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-009-02-0152
dc.identifierhttps://lib.jucs.org/article/27933/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/8293
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 9(2): 152-172
dc.subjecttheorem proving
dc.subjectrefinement
dc.subjectZ
dc.titleHOL-Z 2.0: A Proof Environment for Z-Specifications
dc.typeResearch Article
Файлы