Efficient Well-Definedness Checking
From MaRDI portal
Publication:3541692
DOI10.1007/978-3-540-71070-7_8zbMath1165.68404OpenAlexW1772698657MaRDI QIDQ3541692
Arsenii Rudich, Farhad Mehta, Ádám Darvas
Publication date: 27 November 2008
Published in: Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-71070-7_8
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
A completeness proof for a regular predicate logic with undefined truth value ⋮ Classical logic with partial functions ⋮ Classical Logic with Partial Functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A logic covering undefinedness in program proofs
- Isabelle/HOL. A proof assistant for higher-order logic
- Are the logical foundations of verifying compiler prototypes matching user expectations?
- On a Formalization of the Non-Definedness Notion
- Simplify: a theorem prover for program checking
- The B-Book
- Adapting Calculational Logic to the Undefined
- The TPTP problem library
- Computer Aided Verification
- Many-Valued Logic, Partiality, and Abstraction in Formal Specification Languages
- On notation for ordinal numbers
This page was built for publication: Efficient Well-Definedness Checking
