A logic covering undefinedness in program proofs
There is a growing literature on proving that programs satisfy their specifications. Most methods employ propositional and predicate calculus. Such logical systems do not reflect the possibility of undefined values. However, recursive definition often results in partial functions and iteration gives rise to programs that may fail to terminate for some inputs. This paper provides and demonstrates a logic in which the logical operators give defined results even if no value is known for some of their operands. It is claimed that this logical system is useful in program proofs.
- An introduction to the PL/CV2 programming logic
- Edinburgh LCF. A mechanized logic of computation
- scientific article; zbMATH DE number 3833274 (Why is no real title available?)
- scientific article; zbMATH DE number 3650529 (Why is no real title available?)
- scientific article; zbMATH DE number 3660783 (Why is no real title available?)
- scientific article; zbMATH DE number 3740740 (Why is no real title available?)
- scientific article; zbMATH DE number 3532923 (Why is no real title available?)
- scientific article; zbMATH DE number 3550181 (Why is no real title available?)
- scientific article; zbMATH DE number 3557186 (Why is no real title available?)
- scientific article; zbMATH DE number 3574936 (Why is no real title available?)
- scientific article; zbMATH DE number 1734464 (Why is no real title available?)
- scientific article; zbMATH DE number 1028816 (Why is no real title available?)
- scientific article; zbMATH DE number 3795950 (Why is no real title available?)
- scientific article; zbMATH DE number 3451824 (Why is no real title available?)
- scientific article; zbMATH DE number 3241254 (Why is no real title available?)
- scientific article; zbMATH DE number 3309188 (Why is no real title available?)
- scientific article; zbMATH DE number 3346088 (Why is no real title available?)
- scientific article; zbMATH DE number 3392404 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- On a Formalization of the Non-Definedness Notion
- Partial abstract types
- Separation properties and Boolean powers
- The Calculus of Partial Predicates and Its Extension to Set Theory I
- Proof systems for reasoning about computation errors
- Partial-predicate logic in computer science
- A note on undefined expression values in programming logics
- A guided tour of the mathematics of MetaSoft '88
- Modular structuring of VDM specifications in VVSL
- Partial logics reconsidered: A conservative approach
- A typed logic of partial functions reconstructed classically
- A logical framework for evolving software systems
- Many-valued logic and mixed integer programming
- Empowering the Event-B method using external theories
- General correctness: A unification of partial and total correctness
- Weak logic theory
- Missing values and dragonfly operations in fuzzy relational compositions
- Quasi-boolean equivalence
- A simple sequent calculus for partial functions
- Are the logical foundations of verifying compiler prototypes matching user expectations?
- Ours Is to Reason Why
- Truth versus information in logic programming
- Kleene's three-valued logic and process algebra
- A two-valued logic for properties of strict functional programs allowing partial functions
- Efficient Well-Definedness Checking
- Natural 3-valued logics—characterization and proof theory
- scientific article; zbMATH DE number 4123706 (Why is no real title available?)
- Inversive meadows and divisive meadows
- Why the constant ‘undefined’? Logics of partial terms for strict and non-strict functional programming languages
- Two over three: a two-valued logic for software specification and validation over a three-valued predicate calculus
- Process algebra with four-valued logic
- A first order logic for partial functions (extended abstract)
- Reasoning about separation using abstraction and reification
- Reasoning About Incompletely Defined Programs
- Partial Functions and Equality in Answer Set Programming
- Partiality and recursion in interactive theorem provers -- an overview
- On solvability of systems of partial fuzzy relational equations
- Preservation of properties of residuated algebraic structure by structures for the partial fuzzy set theory
- A completeness proof for a regular predicate logic with undefined truth value
- Bunch theory: axioms, logic, applications and model
- Analysis of spatio-temporal properties of stochastic systems using TSTL
- Partial functions and logics: A warning
- Using typed lambda calculus to implement formal systems on a machine
- Simple consequence relations
- An algebraic expression of finite horizon optimal control algorithm for stochastic logical dynamical systems
- A first order logic for partial functions
- Proof obligations for blocks and procedures
- The connection between two ways of reasoning about partial functions
This page was built for publication: A logic covering undefinedness in program proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790610)