On the public citation graph
Automatic program verification I: A logical basis and its implementation
0 signed · 157 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.1007/978-1-4612-6315-9_10openalex-snapshot
Proof of a Program: FIND
inferredcites →https://doi.org/10.1007/978-3-642-59412-0_9openalex-snapshot
The Programming Language Pascal
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_26openalex-snapshot
An Interactive Theorem-Proving Program
inferredcites →https://doi.org/10.1007/bf00288686openalex-snapshot
Program proving: Jumps and functions
inferredcites →https://doi.org/10.1007/bf00289504openalex-snapshot
An axiomatic definition of the programming language PASCAL
inferredcites →https://doi.org/10.1007/bfb0059696openalex-snapshot
Procedures and parameters: An axiomatic approach
inferredcites →https://doi.org/10.1016/b978-0-934613-12-5.50031-8openalex-snapshot
TOWARD INTERACTIVE DESIGN OF CORRECT PROGRAMS
inferredcites →https://doi.org/10.1090/psapm/019/0235771openalex-snapshot
Assigning meanings to programs
inferredcites →https://doi.org/10.1090/psapm/019/0242403openalex-snapshot
Correctness of a compiler for arithmetic expressions
inferredcites →https://doi.org/10.1145/357980.358001openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/800193.805820openalex-snapshot
The current state of proving programs correct
inferredcites →https://doi.org/10.3929/ethz-a-000814158openalex-snapshot
The programming language Pascal (Revised Report)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11856290_5openalex-snapshot
Labeled @-Calculus: Formalism for Time-Concerned Human Factors
inferred← citeshttps://doi.org/10.1007/3-540-06859-7_124openalex-snapshot
Proving program correctness in LCF
inferred← citeshttps://doi.org/10.1007/3-540-07854-1_157openalex-snapshot
Exercises in denotational semantics
inferred← citeshttps://doi.org/10.1007/3-540-08138-0_17openalex-snapshot
Formale Korrektheitsbeweise für While-Programme
inferred← citeshttps://doi.org/10.1007/3-540-08342-1_3openalex-snapshot
Semantics and proof theory of pascal procedures
inferred← citeshttps://doi.org/10.1007/3-540-10003-2_84openalex-snapshot
Present-day Hoare-like systems for programming languages with procedures: Power, limits and most likely extensions
inferred← citeshttps://doi.org/10.1007/3-540-10843-2_30openalex-snapshot
Automatic construction of verification condition generators from hoare logics
inferred← citeshttps://doi.org/10.1007/3-540-58450-1_48openalex-snapshot
Trustworthy tools for trustworthy programs: A verified verification condition generator
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_81openalex-snapshot
Mechanical verification of mutually recursive procedures
inferred← citeshttps://doi.org/10.1007/978-1-4612-3658-0_10openalex-snapshot
Mechanizing Programming Logics in Higher Order Logic
inferred← citeshttps://doi.org/10.1007/978-1-4612-5979-4_7openalex-snapshot
Abstraction and Verification in Alphard: Iteration and Generators
inferred← citeshttps://doi.org/10.1007/978-3-322-83911-4_10openalex-snapshot
Entwicklungstendenzen bei formalen Methoden im Bereich der Computersicherheit
inferred← citeshttps://doi.org/10.1007/978-3-642-46490-4_11openalex-snapshot
A systematics of software engineering: Structure, terminology and classification of techniques
inferred← citeshttps://doi.org/10.1007/978-3-642-68064-9_7openalex-snapshot
Methoden und Werkzeuge zur Software-Entwicklung: Einordnung und Überblick
inferred← citeshttps://doi.org/10.1007/978-3-642-69394-6_25openalex-snapshot
The Problem of Confidence in Fault-Tolerant Computer Design
inferred← citeshttps://doi.org/10.1007/978-3-642-72831-0_22openalex-snapshot
Programmverifikation und Künstliche Intelligenz
inferred← citeshttps://doi.org/10.1007/978-3-642-79361-5_3openalex-snapshot
Using Reflection to Explain and Enhance Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-662-02328-0_24openalex-snapshot
Program Veriflcation at Stanford: Past, Present, Future
inferred← citeshttps://doi.org/10.1007/bf00244288openalex-snapshot
An overview of automated reasoning and related fields
inferred← citeshttps://doi.org/10.1007/bf00261258openalex-snapshot
Sound and complete Hoare-like calculi based on copy rules
inferred← citeshttps://doi.org/10.1007/bf00276182openalex-snapshot
Proof of termination within a weak logic of programs
inferred← citeshttps://doi.org/10.1007/bf00288541openalex-snapshot
Hierarchical program specification and verification ? a many-sorted logical approach
inferred← citeshttps://doi.org/10.1007/bf00288637openalex-snapshot
Axiomatic approach to total correctness of programs
inferred← citeshttps://doi.org/10.1007/bf00288745openalex-snapshot
The verification and synthesis of data structures
inferred← citeshttps://doi.org/10.1007/bf00289246openalex-snapshot
Rules of inference for procedure calls
inferred← citeshttps://doi.org/10.1007/bf00982291openalex-snapshot
A pragmatic approach to resolution-based theorem proving
inferred← citeshttps://doi.org/10.1007/bf01068926openalex-snapshot
Axiomatic system for program correctness verification with respect to the structure of objects
inferred← citeshttps://doi.org/10.1007/bf01069058openalex-snapshot
Current methods for proving program correctness
inferred← citeshttps://doi.org/10.1007/bf01069174openalex-snapshot
Practical methods of program verification
inferred← citeshttps://doi.org/10.1007/bfb0013193openalex-snapshot
Problem-oriented means of program specification and verification in project SPECTRUM
inferred← citeshttps://doi.org/10.1007/bfb0014320openalex-snapshot
Tracing the origins of verification conditions
inferred← citeshttps://doi.org/10.1007/bfb0021434openalex-snapshot
Programming language design issues
inferred← citeshttps://doi.org/10.1007/bfb0025772openalex-snapshot
The refinement of specifications and the stability of Hoare's Logic
inferred← citeshttps://doi.org/10.1007/bfb0055137openalex-snapshot
Mechanical verification of total correctness through diversion verification conditions
inferred← citeshttps://doi.org/10.1007/s10817-017-9419-3openalex-snapshot
Automatic Synthesis of Logical Models for Order-Sorted First-Order Theories
inferred← citeshttps://doi.org/10.1016/0020-0190(75)90041-1openalex-snapshot
Structured implementation of symbolic execution: A first part in a program verifier
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90006-8openalex-snapshot
A decomposition rule for the hoare logic
inferred← citeshttps://doi.org/10.1016/0041-5553(78)90180-5openalex-snapshot
A new language for structured programming
inferred← citeshttps://doi.org/10.1016/0096-0551(80)90049-1openalex-snapshot
Toward modular verifiable exception handling
inferred← citeshttps://doi.org/10.1016/0096-0551(86)90010-xopenalex-snapshot
Two-level grammar as an implementable metalanguage for axiomatic semantics
inferred← citeshttps://doi.org/10.1016/0304-3975(77)90004-4openalex-snapshot
Pascal in LCF: Semantics and examples of proof
inferred← citeshttps://doi.org/10.1016/0304-3975(80)90005-5openalex-snapshot
Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90107-xopenalex-snapshot
Hoare's logic and Peano's arithmetic
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90033-2openalex-snapshot
The automated proof of a trace transformation for a bitonic sort
inferred← citeshttps://doi.org/10.1016/0743-1066(91)90008-dopenalex-snapshot
Automated theorem proving and logic programming: a natural symbiosis
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-0813-8.50033-2openalex-snapshot
Verification environments
inferred← citeshttps://doi.org/10.1016/j.cosrev.2011.02.002openalex-snapshot
Verification conditions for source-level imperative programs
inferred← citeshttps://doi.org/10.1016/s0020-7373(82)80047-3openalex-snapshot
Stereotyped program debugging: an aid for novice programmers
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80025-6openalex-snapshot
Types in Logic, Mathematics and Programming
inferred← citeshttps://doi.org/10.1016/s0304-3975(81)80001-1openalex-snapshot
Nondeterministic flowchart programs with recursive procedures: Semantics and correctness II
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00234-xopenalex-snapshot
Formal verification of a programming logic for a distributed programming language
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00133-0openalex-snapshot
Secure mechanical verification of mutually recursive procedures
inferred← citeshttps://doi.org/10.1023/a:1008762225520openalex-snapshot
Explanation-Based Scenario Generation for Reactive System Models
inferred← citeshttps://doi.org/10.1051/ita/1980140302471openalex-snapshot
Systèmes de déduction pour les arbres et les schémas de programmes (I)
inferred← citeshttps://doi.org/10.1109/32.277576openalex-snapshot
Modular verification of data abstractions with shared realizations
inferred← citeshttps://doi.org/10.1109/32.341844openalex-snapshot
A practical approach to programming with assertions
inferred← citeshttps://doi.org/10.1109/ase.1998.732596openalex-snapshot
Explanation based scenario generation for reactive system models
inferred← citeshttps://doi.org/10.1109/cmpsac.1989.65123openalex-snapshot
Rapid prototyping of programming language semantics using Prolog
inferred← citeshttps://doi.org/10.1109/dac.1982.1585588openalex-snapshot
A formal method for computer design verification
inferred← citeshttps://doi.org/10.1109/icdcs.1989.37994openalex-snapshot
An approach to verification of communication in distributed computing system software
inferred← citeshttps://doi.org/10.1109/icst.2011.50openalex-snapshot
An Empirical Evaluation of Assertions as Oracles
inferred← citeshttps://doi.org/10.1109/ismar67309.2025.00148openalex-snapshot
Ever: Edge-Assisted Auto-Verification for Mobile MR-Aided Operation
inferred← citeshttps://doi.org/10.1109/rfts.1991.212969openalex-snapshot
Verification of register transfer level (RTL) designs
inferred← citeshttps://doi.org/10.1109/tc.1976.1674538openalex-snapshot
Strum: Structured Microprogram Development System for Correct Firmware
inferred← citeshttps://doi.org/10.1109/tc.1976.1674703openalex-snapshot
The Use of Higher Order Logic in Program Verification
inferred← citeshttps://doi.org/10.1109/tc.1982.1676059openalex-snapshot
Formal Specification and Mechanical Verification of SIFT: A Fault-Tolerant Flight Control System
inferred← citeshttps://doi.org/10.1109/tc.1983.1676167openalex-snapshot
An Inductive Assertion Method for Register Transfer Level Design Verification
inferred← citeshttps://doi.org/10.1109/tencon.1989.176902openalex-snapshot
Verification of hardware descriptions at the functional level
inferred← citeshttps://doi.org/10.1109/tse.1978.231499openalex-snapshot
The Logic of Computer Programming
inferred← citeshttps://doi.org/10.1109/tse.1978.233869openalex-snapshot
Initial Report on a Lisp Programmer's Apprentice
inferred← citeshttps://doi.org/10.1109/tse.1979.230183openalex-snapshot
An Exercise in Automatic Program Verification
inferred← citeshttps://doi.org/10.1109/tse.1979.234207openalex-snapshot
Symbolic Evaluation and the Analysis of Programs
inferred← citeshttps://doi.org/10.1137/0205030openalex-snapshot
Proof Theory of Partial Correctness Verification Systems
inferred← citeshttps://doi.org/10.1137/0207005openalex-snapshot
Soundness and Completeness of an Axiom System for Program Verification
inferred← citeshttps://doi.org/10.1145/1005913.1005914openalex-snapshot
Workshop on formal verification
inferred← citeshttps://doi.org/10.1145/1040305.1040330openalex-snapshot
A semantics for procedure local heaps and its abstractions
inferred← citeshttps://doi.org/10.1145/1127878.1127900openalex-snapshot
A historical perspective on runtime assertion checking in software development
inferred← citeshttps://doi.org/10.1145/1408800.1408873openalex-snapshot
Synthesis of a software security system
inferred← citeshttps://doi.org/10.1145/1411798.1411808openalex-snapshot
A system to understand incorrect programs
inferred← citeshttps://doi.org/10.1145/1499949.1500020openalex-snapshot
A synthesizer of inductive assertions
inferred← citeshttps://doi.org/10.1145/27632.28054openalex-snapshot
Formal models of stepwise refinements of programs
inferred← citeshttps://doi.org/10.1145/322092.322104openalex-snapshot
Assignment Commands with Array References
inferred← citeshttps://doi.org/10.1145/322248.322250openalex-snapshot
A Decision Procedure for the Correctness of a Class of Programs
inferred← citeshttps://doi.org/10.1145/322276.322288openalex-snapshot
Deciding Linear Inequalities by Computing Loop Residues
inferred← citeshttps://doi.org/10.1145/3426428.3426922openalex-snapshot
Putting the semantics into semantic versioning
inferred← citeshttps://doi.org/10.1145/3544585.3544593openalex-snapshot
Dijkstra’s Legacy on Program Verification
inferred← citeshttps://doi.org/10.1145/356674.356677openalex-snapshot
An Introduction to Proving the Correctness of Programs
inferred← citeshttps://doi.org/10.1145/357073.357078openalex-snapshot
Verification of Array, Record, and Pointer Operations in Pascal
inferred← citeshttps://doi.org/10.1145/357094.357100openalex-snapshot
Ada exception handling: an axiomatic approach
inferred← citeshttps://doi.org/10.1145/357114.357119openalex-snapshot
Assignment and Procedure Call Proof Rules
inferred← citeshttps://doi.org/10.1145/357146.357150openalex-snapshot
Ten Years of Hoare's Logic: A Survey—Part I
inferred← citeshttps://doi.org/10.1145/359461.359483openalex-snapshot
Proof techniques for hierarchically structured programs
inferred← citeshttps://doi.org/10.1145/359657.359667openalex-snapshot
An example of hierarchical design and proof
inferred← citeshttps://doi.org/10.1145/359763.359782openalex-snapshot
Abstraction and verification in Alphard
inferred← citeshttps://doi.org/10.1145/384281.808240openalex-snapshot
An axiomatization of low-level parallelism in microarchitectures
inferred← citeshttps://doi.org/10.1145/390016.808420openalex-snapshot
The impact of language design on the production of reliable software
inferred← citeshttps://doi.org/10.1145/390016.808421openalex-snapshot
An assessment of the programming language PASCAL
inferred← citeshttps://doi.org/10.1145/390016.808434openalex-snapshot
Towards automatic debugging of programs
inferred← citeshttps://doi.org/10.1145/390016.808435openalex-snapshot
A methodology for verifying programs
inferred← citeshttps://doi.org/10.1145/390016.808445openalex-snapshot
SELECT—a formal system for testing and debugging programs by symbolic execution
inferred← citeshttps://doi.org/10.1145/390016.808454openalex-snapshot
Constructing correct and efficient concurrent programs
inferred← citeshttps://doi.org/10.1145/390016.808466openalex-snapshot
Proving structured programs correct, level by level
inferred← citeshttps://doi.org/10.1145/390016.808471openalex-snapshot
Verifying programs by algebraic and logical reduction
inferred← citeshttps://doi.org/10.1145/390016.808472openalex-snapshot
An interactive program verification system
inferred← citeshttps://doi.org/10.1145/512644.512673openalex-snapshot
A mechanically certified theorem about optimal concurrency of sorting networks
inferred← citeshttps://doi.org/10.1145/512760.512774openalex-snapshot
Unrestricted procedure calls in Hoare's logic
inferred← citeshttps://doi.org/10.1145/567532.567549openalex-snapshot
Program verification based on denotation semantics
inferred← citeshttps://doi.org/10.1145/800004.807941openalex-snapshot
A practical method of documenting and verifying Ada programs with packages
inferred← citeshttps://doi.org/10.1145/800027.808421openalex-snapshot
An assessment of the programming language PASCAL
inferred← citeshttps://doi.org/10.1145/800105.803415openalex-snapshot
A complete axiomatic system for proving deductions about recursive programs
inferred← citeshttps://doi.org/10.1145/800105.803417openalex-snapshot
On the theory of programming logics
inferred← citeshttps://doi.org/10.1145/800116.803758openalex-snapshot
Proving assertions about programs that manipulate data structures
inferred← citeshttps://doi.org/10.1145/800127.804078openalex-snapshot
A Report On The Development Of Gypsy
inferred← citeshttps://doi.org/10.1145/800182.810412openalex-snapshot
The application of a symbolic mathematical system to program verification
inferred← citeshttps://doi.org/10.1145/981009.981013openalex-snapshot
A survey of semantic description frameworks for programming languages
inferred← citeshttps://doi.org/10.31274/rtd-180813-2499openalex-snapshot
Toward a verification system for the programming language KL-1 using weakest preconditions
inferred← citeshttps://doi.org/10.4230/dagsemproc.05161.2openalex-snapshot
CAViT: a Consistency Maintenance Framework based on Transformation Contracts
inferred← citeshttps://doi.org/10.5555/800091.802923openalex-snapshot
Pragmatic techniques for program analysis and verification
inferred← citeshttps://doi.org/10.5555/800091.802950openalex-snapshot
A system to improve incorrect programs
inferred← citeshttps://doi.org/10.5555/800099.803224openalex-snapshot
Symbolic interpretation and tracing of PASCAL-programs
inferred← citeshttps://doi.org/10.5555/800253.807646openalex-snapshot
Verification of fairness in an implementation of monitors
inferred← citeshttps://doi.org/10.5555/800253.807658openalex-snapshot
A laboratory for the development and evaluation of BMD software quality enhancement techniques
inferred← citeshttps://doi.org/10.5555/800263.809294openalex-snapshot
A formal method for computer design verification
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.