On the public citation graph
A logic covering undefinedness in program proofs
0 signed · 178 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/malq.19610071705openalex-snapshot
The Calculus of Partial Predicates and Its Extension to Set Theory I
inferredcites →https://doi.org/10.1002/malq.19790251304openalex-snapshot
On a Formalization of the Non‐Definedness Notion
inferredcites →https://doi.org/10.1007/3-540-11492-0openalex-snapshot
An Introduction to the PL/CV2 Programming Logic
inferredcites →https://doi.org/10.1007/978-94-010-3272-8_6openalex-snapshot
Logic and Truth Value Gaps
inferredcites →https://doi.org/10.1007/978-94-017-0462-5openalex-snapshot
Handbook of Philosophical Logic
inferredcites →https://doi.org/10.1007/bfb0036465openalex-snapshot
Partial functions in comstructive formal theories
inferredcites →https://doi.org/10.1007/bfb0061839openalex-snapshot
Identity and existence in intuitionistic logic
inferredcites →https://doi.org/10.1016/0066-4138(69)90005-6openalex-snapshot
On the formal description of PL/I
inferredcites →https://doi.org/10.1016/0167-6423(83)90018-7openalex-snapshot
Formal specification and software development
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7102-2openalex-snapshot
Computer Programming and Formal Systems
inferredcites →https://doi.org/10.1016/s0049-237x(09)70099-0openalex-snapshot
A Basis for a Mathematical Theory of Computation
inferredcites →https://doi.org/10.1145/800235.807083openalex-snapshot
Formal development of correct algorithms
inferredcites →https://doi.org/10.1145/942578.807083openalex-snapshot
Formal development of correct algorithms
inferredcites →https://doi.org/10.21236/ada239419openalex-snapshot
Mathematical Theory of Computation
inferredcites →https://doi.org/10.2307/2218270openalex-snapshot
Computer Programming and Formal Systems.
inferredcites →https://doi.org/10.25405/ncl.34123362openalex-snapshot
Software Development: A Rigorous Approach
inferredcites →https://doi.org/10.25405/ncl.34123365openalex-snapshot
Formal Specification and Software Development
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-15199-0_3openalex-snapshot
The role of proof obligations in software design
inferred← citeshttps://doi.org/10.1007/3-540-17654-3_15openalex-snapshot
VDM proof obligations and their justification
inferred← citeshttps://doi.org/10.1007/3-540-17654-3_7openalex-snapshot
Heap storage specification and development
inferred← citeshttps://doi.org/10.1007/3-540-18341-8_20openalex-snapshot
Software development based on formal methods
inferred← citeshttps://doi.org/10.1007/3-540-45648-1_13openalex-snapshot
On Using Conditional Definitions in Formal Theories
inferred← citeshttps://doi.org/10.1007/3-540-48119-2_2openalex-snapshot
Scientific Decisions which Characterize VDM
inferred← citeshttps://doi.org/10.1007/3-540-50214-9_13openalex-snapshot
A support system for formal reasoning: Requirements and status
inferred← citeshttps://doi.org/10.1007/3-540-50214-9_19openalex-snapshot
A three-valued logic for software specification and validation
inferred← citeshttps://doi.org/10.1007/3-540-50214-9_20openalex-snapshot
Three-valued predicates for software specification and validation
inferred← citeshttps://doi.org/10.1007/3-540-50214-9_23openalex-snapshot
Proof rules for VDM statements
inferred← citeshttps://doi.org/10.1007/3-540-50214-9_24openalex-snapshot
Muffin: A user interface design experiment for a Theorem Proving Assistant
inferred← citeshttps://doi.org/10.1007/3-540-52513-0_20openalex-snapshot
Two approaches towards the formalisation of VDM
inferred← citeshttps://doi.org/10.1007/3-540-54345-7_71openalex-snapshot
Two over three: a two-valued logic for software specification and validation over a three-valued predicate calculus
inferred← citeshttps://doi.org/10.1007/3-540-54834-3_18openalex-snapshot
LPF and MPLω — A logical comparison of VDM SL and COLD-K
inferred← citeshttps://doi.org/10.1007/3-540-54834-3_21openalex-snapshot
Reasoning about VDM specifications
inferred← citeshttps://doi.org/10.1007/3-540-56992-8_12openalex-snapshot
Reasoning with higher order partial functions
inferred← citeshttps://doi.org/10.1007/3-540-58555-9_96openalex-snapshot
On transferring VDM verification techniques to Z
inferred← citeshttps://doi.org/10.1007/3-540-63533-5_15openalex-snapshot
Towards an Integrated CASE and theorem proving tool for VDM-SL
inferred← citeshttps://doi.org/10.1007/978-1-4471-3229-5_4openalex-snapshot
The Static Part of the Design Language COLD-K
inferred← citeshttps://doi.org/10.1007/978-1-4471-3229-5_6openalex-snapshot
Experiences in Developing a Proof Theory for VDM Specifications
inferred← citeshttps://doi.org/10.1007/978-1-4471-3550-0_13openalex-snapshot
Using Metavariables in Natural Deduction Proofs
inferred← citeshttps://doi.org/10.1007/978-1-4471-3558-6_8openalex-snapshot
Formal Verification of Ada Programs
inferred← citeshttps://doi.org/10.1007/978-1-4471-3864-8_10openalex-snapshot
VVSL Specification of a Transaction-oriented Access Handler
inferred← citeshttps://doi.org/10.1007/978-1-4471-3864-8_6openalex-snapshot
Reasoning about a Modular Model-Oriented Formal Specification
inferred← citeshttps://doi.org/10.1007/978-1-4757-3851-3_4openalex-snapshot
Semantical Analysis of Specification Logic, 2
inferred← citeshttps://doi.org/10.1007/978-3-031-07727-2_2openalex-snapshot
Empowering the Event-B Method Using External Theories
inferred← citeshttps://doi.org/10.1007/978-3-031-08166-8_15openalex-snapshot
Further Lessons from the JML Project
inferred← citeshttps://doi.org/10.1007/978-3-031-66676-6_6openalex-snapshot
Verification Technology for VDM: Craft and Automation
inferred← citeshttps://doi.org/10.1007/978-3-031-73997-2_22openalex-snapshot
The Suitability of Upper Boundary Algebra for Solving Partial Fuzzy Relational Equations
inferred← citeshttps://doi.org/10.1007/978-3-319-22969-0_1openalex-snapshot
Reasoning about Separation Using Abstraction and Reification
inferred← citeshttps://doi.org/10.1007/978-3-540-39656-7_11openalex-snapshot
How the Design of JML Accommodates Both Runtime Assertion Checking and Formal Verification
inferred← citeshttps://doi.org/10.1007/978-3-540-68237-0_7openalex-snapshot
Checking Well-Formedness of Pure-Method Specifications
inferred← citeshttps://doi.org/10.1007/978-3-540-71070-7_8openalex-snapshot
Efficient Well-Definedness Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-74107-7_7openalex-snapshot
The Logic of the RAISE Specification Language
inferred← citeshttps://doi.org/10.1007/978-3-540-74107-7_9openalex-snapshot
The Typed Logic of Partial Functions and the Vienna Development Method
inferred← citeshttps://doi.org/10.1007/978-3-540-88194-0_16openalex-snapshot
A Practical Approach to Partiality – A Proof Based Approach
inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_36openalex-snapshot
Partial Functions and Equality in Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-16901-4_5openalex-snapshot
Proof Obligation Generation and Discharging for Recursive Definitions in VDM
inferred← citeshttps://doi.org/10.1007/978-3-642-24559-6_42openalex-snapshot
Term Rewriting in Logics of Partial Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-30885-7_18openalex-snapshot
A Semantic Analysis of Logics That Cope with Partial Terms
inferred← citeshttps://doi.org/10.1007/978-3-642-41071-0_3openalex-snapshot
Unifying Theories of Logic and Specification
inferred← citeshttps://doi.org/10.1007/978-3-642-87374-4_7openalex-snapshot
Program Specification and Verification in VDM
inferred← citeshttps://doi.org/10.1007/978-94-015-9309-0_1openalex-snapshot
Negation: Two Points of View
inferred← citeshttps://doi.org/10.1007/978-94-017-0437-3_11openalex-snapshot
Deduction-Based Software Component Retrieval
inferred← citeshttps://doi.org/10.1007/978-94-017-0464-9_5openalex-snapshot
On Negation, Completeness and Consistency
inferred← citeshttps://doi.org/10.1007/bf00245294openalex-snapshot
Using typed lambda calculus to implement formal systems on a machine
inferred← citeshttps://doi.org/10.1007/bf00290146openalex-snapshot
General correctness: A unification of partial and total correctness
inferred← citeshttps://doi.org/10.1007/bf00292109openalex-snapshot
Partial-predicate logic in computer science
inferred← citeshttps://doi.org/10.1007/bf01135375openalex-snapshot
Reasoning about partial functions with the aid of a computer
inferred← citeshttps://doi.org/10.1007/bf01178666openalex-snapshot
A typed logic of partial functions reconstructed classically
inferred← citeshttps://doi.org/10.1007/bf01211049openalex-snapshot
A logical framework for evolving software systems
inferred← citeshttps://doi.org/10.1007/bf01211555openalex-snapshot
Partial logics reconsidered: A conservative approach
inferred← citeshttps://doi.org/10.1007/bf01214955openalex-snapshot
Modular structuring of VDM specifications in VVSL
inferred← citeshttps://doi.org/10.1007/bf01530787openalex-snapshot
Many-valued logic and mixed integer programming
inferred← citeshttps://doi.org/10.1007/bf01888232openalex-snapshot
Proof obligations for blocks and procedures
inferred← citeshttps://doi.org/10.1007/bfb0016244openalex-snapshot
Relational specifications and observational semantics
inferred← citeshttps://doi.org/10.1007/bfb0028382openalex-snapshot
An Isabelle-based theorem prover for VDM-SL
inferred← citeshttps://doi.org/10.1007/bfb0028972openalex-snapshot
A first order logic for partial functions
inferred← citeshttps://doi.org/10.1007/bfb0029619openalex-snapshot
A first-order logic for partial recursive functions
inferred← citeshttps://doi.org/10.1007/bfb0030623openalex-snapshot
Protective interface specifications
inferred← citeshttps://doi.org/10.1007/bfb0039698openalex-snapshot
A three-valued logic for refinement
inferred← citeshttps://doi.org/10.1007/bfb0053580openalex-snapshot
Some mistakes I have and what I have learned from them
inferred← citeshttps://doi.org/10.1007/pl00003926openalex-snapshot
Protective Interface Specifications
inferred← citeshttps://doi.org/10.1007/s00165-006-0016-1openalex-snapshot
Are the Logical Foundations of Verifying Compiler Prototypes Matching user Expectations?
inferred← citeshttps://doi.org/10.1007/s10817-012-9253-6openalex-snapshot
A Two-Valued Logic for Properties of Strict Functional Programs Allowing Partial Functions
inferred← citeshttps://doi.org/10.1007/s11225-009-9175-4openalex-snapshot
Proof Systems for Reasoning about Computation Errors
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90158-xopenalex-snapshot
A note on undefined expression values in programming logics
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90033-6openalex-snapshot
A guided tour of the mathematics of Metasoft'88
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90211-qopenalex-snapshot
Quasi-boolean equivalence
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00042-bopenalex-snapshot
Partial functions and logics: A warning
inferred← citeshttps://doi.org/10.1016/0167-6423(91)90008-lopenalex-snapshot
Symbolic execution: a semantic approach
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90005-3openalex-snapshot
A first order logic for partial functions
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90077-7openalex-snapshot
A simple sequent calculus for partial functions
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90045-jopenalex-snapshot
Semantical analysis of specification logic
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90023-uopenalex-snapshot
Simple consequence relations
inferred← citeshttps://doi.org/10.1016/0950-5849(94)90033-7openalex-snapshot
(In)completeness in specifications
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50004-6openalex-snapshot
History of Interactive Theorem Proving
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50020-2openalex-snapshot
Methods and Logics for Proving Programs
inferred← citeshttps://doi.org/10.1016/b978-0-7506-0749-0.50008-xopenalex-snapshot
Discrete mathematics
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.10.002openalex-snapshot
Reasoning About Partial Functions in the Formal Development of Programs
inferred← citeshttps://doi.org/10.1016/j.fss.2022.06.014openalex-snapshot
On solvability of systems of partial fuzzy relational equations
inferred← citeshttps://doi.org/10.1016/j.ijar.2019.07.004openalex-snapshot
Missing values and dragonfly operations in fuzzy relational compositions
inferred← citeshttps://doi.org/10.1016/j.ijar.2022.12.001openalex-snapshot
Preservation of properties of residuated algebraic structure by structures for the partial fuzzy set theory
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.02.005openalex-snapshot
The connection between two ways of reasoning about partial functions
inferred← citeshttps://doi.org/10.1016/j.jal.2011.03.001openalex-snapshot
Inversive meadows and divisive meadows
inferred← citeshttps://doi.org/10.1016/j.jlamp.2024.100977openalex-snapshot
Bunch theory: Axioms, logic, applications and model
inferred← citeshttps://doi.org/10.1016/j.scico.2004.05.015openalex-snapshot
How the design of JML accommodates both runtime assertion checking and formal verification
inferred← citeshttps://doi.org/10.1016/j.scico.2013.09.007openalex-snapshot
Revising basic theorem proving algorithms to cope with the logic of partial functions
inferred← citeshttps://doi.org/10.1016/j.sysconle.2015.04.007openalex-snapshot
An algebraic expression of finite horizon optimal control algorithm for stochastic logical dynamical systems
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00083-0openalex-snapshot
Kleene's three-valued logic and process algebra
inferred← citeshttps://doi.org/10.1016/s0167-6423(98)00019-7openalex-snapshot
E3: A logic for reasoning equationally in the presence of partiality
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72710-5openalex-snapshot
On a Nonlinear Hyperbolic Integrodifferential Equation with a Singular Kernel
inferred← citeshttps://doi.org/10.1017/s002248120003142xopenalex-snapshot
European summer meeting of the Association for Symbolic Logic, Manchester, England, 1984
inferred← citeshttps://doi.org/10.1017/s0960129514000115openalex-snapshot
Partiality and recursion in interactive theorem provers – an overview
inferred← citeshttps://doi.org/10.1017/s1471068410000517openalex-snapshot
Functional answer set programming
inferred← citeshttps://doi.org/10.1017/s1471068413000069openalex-snapshot
Truth versus information in logic programming
inferred← citeshttps://doi.org/10.1023/a:1005060022386openalex-snapshot
Encoding Modal Logics in Logical Frameworks
inferred← citeshttps://doi.org/10.1023/a:1005702928286openalex-snapshot
Partial Functions in a Total Setting
inferred← citeshttps://doi.org/10.1023/a:1026554217992openalex-snapshot
Executing Formal Specifications with Concurrent Constraint Programming
inferred← citeshttps://doi.org/10.1049/sej.1992.0022openalex-snapshot
Specification of interfering programs based on interconditions
inferred← citeshttps://doi.org/10.1080/11663081.1993.10510795openalex-snapshot
Two over three: a two-valued logic for software specification and validation over a three-valued predicate calculus
inferred← citeshttps://doi.org/10.1080/11663081.2000.10510987openalex-snapshot
Process algebra with four-valued logic
inferred← citeshttps://doi.org/10.1093/comjnl/40.10.640openalex-snapshot
Treating Partiality in a Logic of Total Functions
inferred← citeshttps://doi.org/10.1093/comjnl/42.2.73openalex-snapshot
Adapting Calculational Logic to the Undefined
inferred← citeshttps://doi.org/10.1093/jigpal/jzi032openalex-snapshot
Many-Valued Logic, Partiality, and Abstraction in Formal Specification Languages
inferred← citeshttps://doi.org/10.1093/logcom/exaa084openalex-snapshot
On the strongest three-valued paraconsistent logic contained in classical logic and its dual
inferred← citeshttps://doi.org/10.1093/logcom/exm030openalex-snapshot
A Structural Proof of the Soundness of Rely/guarantee Rules
inferred← citeshttps://doi.org/10.1109/32.713327openalex-snapshot
Subtypes for specifications: predicate subtyping in PVS
inferred← citeshttps://doi.org/10.1109/ase.1999.802189openalex-snapshot
Retrenchment: extending the reach of refinement
inferred← citeshttps://doi.org/10.1109/dexa.2001.953072openalex-snapshot
Partial probabilistic interpretations and general imaging
inferred← citeshttps://doi.org/10.1109/fuzz-ieee60900.2024.10612160openalex-snapshot
Upper Boundary Algebra for Modeling the Missing Values Is a Residuated Lattice
inferred← citeshttps://doi.org/10.1109/kse.2018.8573362openalex-snapshot
Compositions of Partial Fuzzy Relations Employing the Lower Estimation Approach
inferred← citeshttps://doi.org/10.1109/mahc.2003.1203057openalex-snapshot
The early search for tractable ways of reasoning about programs
inferred← citeshttps://doi.org/10.1109/sefm.2005.26openalex-snapshot
Logical foundations of program assertions: what do practitioners want?
inferred← citeshttps://doi.org/10.1109/tse.2009.59openalex-snapshot
Engineering a Sound Assertion Semantics for the Verifying Compiler
inferred← citeshttps://doi.org/10.1109/tse.2010.45openalex-snapshot
Guest Editors' Introduction to the Special Section on Exception Handling: From Requirements to Software Maintenance
inferred← citeshttps://doi.org/10.1145/133233.129397openalex-snapshot
A model parametric real-time logic
inferred← citeshttps://doi.org/10.1145/182824.182843openalex-snapshot
Understanding the differences between VDM and Z
inferred← citeshttps://doi.org/10.1145/2187671.2187678openalex-snapshot
Behavioral interface specification languages
inferred← citeshttps://doi.org/10.1145/3326168openalex-snapshot
Analysis of Spatio-temporal Properties of Stochastic Systems Using TSTL
inferred← citeshttps://doi.org/10.1145/3477355.3477369openalex-snapshot
Hoare and He’s Unifying Theories of Programming
inferred← citeshttps://doi.org/10.1145/351268.351291openalex-snapshot
Semantic analysis of pointer aliasing, allocation and disposal in Hoare logic
inferred← citeshttps://doi.org/10.1145/372202.372465openalex-snapshot
Formal semantics of an algorithm for translating model-based specifications to concurrent constraint programs
inferred← citeshttps://doi.org/10.1145/96559.96569openalex-snapshot
Unification in primal algebras, their powers and their varieties
inferred← citeshttps://doi.org/10.1215/00294527-2022-0034openalex-snapshot
A Completeness Proof for a Regular Predicate Logic with Undefined Truth Value
inferred← citeshttps://doi.org/10.14236/ewic/nfm1998.9openalex-snapshot
Investigating Miraculous Specifications
inferred← citeshttps://doi.org/10.2307/2274919openalex-snapshot
Natural 3-valued logics—characterization and proof theory
inferred← citeshttps://doi.org/10.25405/ncl.34129797openalex-snapshot
Guaranteeing the soundness of rely/guarantee rules
inferred← citeshttps://doi.org/10.25405/ncl.34130049openalex-snapshot
A structural proof of the soundness of rely/guarantee rules (revised)
inferred← citeshttps://doi.org/10.25405/ncl.34175385openalex-snapshot
Towards a Mechanisation of a Logic that Copes with Partial Terms
inferred← citeshttps://doi.org/10.25405/ncl.34240359openalex-snapshot
Tackling Separation via Abstraction (with proofs)
inferred← citeshttps://doi.org/10.26686/ajl.v11i2.2020openalex-snapshot
Discriminator logics (Research announcement)
inferred← citeshttps://doi.org/10.29007/65ltopenalex-snapshot
Howard Barringer: the Man who Invented the Past
inferred← citeshttps://doi.org/10.2991/eusflat-19.2019.45openalex-snapshot
Missing Values and Indeterminable Values in Fuzzy Relational Compositions
inferred← citeshttps://doi.org/10.3233/fi-1991-14403openalex-snapshot
A Three-Valued Logic for Software Specification and Validation. Tertium tamen datur
inferred← citeshttps://doi.org/10.3929/ethz-a-006750722openalex-snapshot
Term rewriting in logics of partial functions
inferred← citeshttps://doi.org/10.48550/arxiv.1911.04344openalex-snapshot
Bunch theory: working notes on applications, axioms and models
inferred← citeshttps://doi.org/10.5381/jot.2006.5.2.c8openalex-snapshot
Not a Number of Floating Point Problems.
inferred← citeshttps://doi.org/10.7146/ece.v1i4.21219openalex-snapshot
Enhancing Formal Modelling Tool Support with Increased Automation
inferred← citeshttps://doi.org/10.7146/ece.v2i13.21228openalex-snapshot
Semantics of the VDM Real-Time Dialect
inferred← citeshttps://doi.org/10.82444/warw.33642034openalex-snapshot
Verification and abstraction of flow-graph programs with pointers and computed jumps
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.