On the public citation graph

Proof of algorithms by general snapshots

https://doi.org/10.1007/bf01966091

0 signed · 153 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.

Claim with ORCID

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.

See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9780470757017.ch24openalex-snapshot

Methodology of Computer Science

inferred← citeshttps://doi.org/10.1002/spe.4380060102openalex-snapshot

The new programming discipline

inferred← citeshttps://doi.org/10.1007/3-540-06786-8_260openalex-snapshot

Reliability and integrity of large computer programs

inferred← citeshttps://doi.org/10.1007/3-540-07131-8_36openalex-snapshot

Programmierte Strukturen

inferred← citeshttps://doi.org/10.1007/3-540-07168-7_80openalex-snapshot

Reliability

inferred← citeshttps://doi.org/10.1007/3-540-07389-2_222openalex-snapshot

Relational definition of computer languages

inferred← citeshttps://doi.org/10.1007/3-540-08860-1_20openalex-snapshot

Arithmetical completeness in logics of programs

inferred← citeshttps://doi.org/10.1007/3-540-10699-5_91openalex-snapshot

The algebra of functional programs: Function level reasoning, linear equations, and extended definitions

inferred← citeshttps://doi.org/10.1007/3-540-32743-6_14openalex-snapshot

Softwarequalität — Geschichte und Trends

inferred← citeshttps://doi.org/10.1007/3-540-44914-0_1openalex-snapshot

Partial Completeness of Abstract Fixpoint Checking

inferred← citeshttps://doi.org/10.1007/3-540-49213-5_1openalex-snapshot

The Need for Compositional Proof Systems: A Survey

inferred← citeshttps://doi.org/10.1007/978-1-4419-8596-5_11openalex-snapshot

Reference

inferred← citeshttps://doi.org/10.1007/978-1-4612-4984-9_10openalex-snapshot

Applied Logic

inferred← citeshttps://doi.org/10.1007/978-1-4612-5979-4_4openalex-snapshot

Abstraction and Verification in Alphard: Introduction to Language and Methodology

inferred← citeshttps://doi.org/10.1007/978-1-4613-9614-7_9openalex-snapshot

A First Course in Computer Science: Mathematical Principles for Software Engineering

inferred← citeshttps://doi.org/10.1007/978-1-4899-5841-9_3openalex-snapshot

Semantics of Programming Languages

inferred← citeshttps://doi.org/10.1007/978-1-84882-555-0_10openalex-snapshot

The Logic of Correctness in Software Engineering

inferred← citeshttps://doi.org/10.1007/978-3-030-03418-4_13openalex-snapshot

This Is Not a Model

inferred← citeshttps://doi.org/10.1007/978-3-030-38800-3_9openalex-snapshot

Origins and Development of Formal Methods

inferred← citeshttps://doi.org/10.1007/978-3-030-54997-8_3openalex-snapshot

Reasoning About Shared-Variable Concurrency: Interactions Between Research Threads

inferred← citeshttps://doi.org/10.1007/978-3-031-10461-9_4openalex-snapshot

Scalable Computing Through Reusability: Encapsulation, Specification, and Verification for a Navigable Tree Position

inferred← citeshttps://doi.org/10.1007/978-3-032-13711-1_6openalex-snapshot

On the Design of Program Logics

inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_23openalex-snapshot

Transfer of Model Checking to Industrial Practice

inferred← citeshttps://doi.org/10.1007/978-3-319-47016-0_6openalex-snapshot

Hybrid CSP

inferred← citeshttps://doi.org/10.1007/978-3-319-99933-3_5openalex-snapshot

Robust Non-termination Analysis of Numerical Software

inferred← citeshttps://doi.org/10.1007/978-3-322-96753-4_7openalex-snapshot

The Classical Methods of Floyd

inferred← citeshttps://doi.org/10.1007/978-3-540-30579-8_1openalex-snapshot

Proving Program Invariance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semidefinite Programming

inferred← citeshttps://doi.org/10.1007/978-3-642-15187-3_3openalex-snapshot

Logical Abstract Domains and Interpretations

inferred← citeshttps://doi.org/10.1007/978-3-642-39721-9_5openalex-snapshot

Formal Modelling, Analysis and Verification of Hybrid Systems

inferred← citeshttps://doi.org/10.1007/978-3-642-48354-7_17openalex-snapshot

An Axiomatic Basis for Computer Programming

inferred← citeshttps://doi.org/10.1007/978-3-642-59412-0_23openalex-snapshot

An Axiomatic Basis for Computer Programming

inferred← citeshttps://doi.org/10.1007/978-3-642-65586-9_19openalex-snapshot

Programmierung digitaler Datenverarbeitungssysteme

inferred← citeshttps://doi.org/10.1007/978-3-642-66319-2_22openalex-snapshot

On Generating Verification Conditions for Correctness Proofs

inferred← citeshttps://doi.org/10.1007/978-3-642-67091-6_2openalex-snapshot

Methoden der Programm- und Systemkonstruktion: Ein Statusbericht

inferred← citeshttps://doi.org/10.1007/978-3-642-73405-2_4openalex-snapshot

Programmverifikation

inferred← citeshttps://doi.org/10.1007/978-3-642-84542-0_6openalex-snapshot

Proving the Correctness of ATES Programs

inferred← citeshttps://doi.org/10.1007/978-3-642-96078-9_4openalex-snapshot

Syntaktische und semantische Definition algorithmischer Sprachen

inferred← citeshttps://doi.org/10.1007/978-3-642-99976-5_11openalex-snapshot

Computer Programs can be Proved Correct

inferred← citeshttps://doi.org/10.1007/978-3-662-09507-2_1openalex-snapshot

Programming Languages—The First 25 Years

inferred← citeshttps://doi.org/10.1007/978-3-662-46081-8_2openalex-snapshot

Abstracting Induction by Extrapolation and Interpolation

inferred← citeshttps://doi.org/10.1007/978-94-011-1793-7_1openalex-snapshot

Computer Science and Philosophy

inferred← citeshttps://doi.org/10.1007/978-94-011-1793-7_5openalex-snapshot

An Axiomatic Basis for Computer Programming

inferred← citeshttps://doi.org/10.1007/bf00999304openalex-snapshot

Field analysis: A mathematical method of analysis for information handling processes

inferred← citeshttps://doi.org/10.1007/bf01069058openalex-snapshot

Current methods for proving program correctness

inferred← citeshttps://doi.org/10.1007/bf01932305openalex-snapshot

A note on the for statement

inferred← citeshttps://doi.org/10.1007/bf01933419openalex-snapshot

A constructive approach to the problem of program correctness

inferred← citeshttps://doi.org/10.1007/bf01936865openalex-snapshot

Proving programs correct: Some techniques and examples

inferred← citeshttps://doi.org/10.1007/bf01940894openalex-snapshot

ALGOL programming

inferred← citeshttps://doi.org/10.1007/bf01941128openalex-snapshot

Datalogy — The copenhagen tradition of computer science

inferred← citeshttps://doi.org/10.1007/bf01946816openalex-snapshot

Programming by action clusters

inferred← citeshttps://doi.org/10.1007/bfb0014661openalex-snapshot

Current ideas in programming methodology

inferred← citeshttps://doi.org/10.1007/bfb0014674openalex-snapshot

A study on transformational semantics

inferred← citeshttps://doi.org/10.1007/bfb0027049openalex-snapshot

Concepts for concurrent programming

inferred← citeshttps://doi.org/10.1007/s00165-019-00501-3openalex-snapshot

Fifty years of Hoare’s logic

inferred← citeshttps://doi.org/10.1007/s10703-009-0089-6openalex-snapshot

Why does Astrée scale up?

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.1007/s11191-021-00202-5openalex-snapshot

Computational Thinking, Between Papert and Wing

inferred← citeshttps://doi.org/10.1007/s11704-009-0074-7openalex-snapshot

Recent advances in program verification through computer algebra

inferred← citeshttps://doi.org/10.1016/0004-3702(74)90015-0openalex-snapshot

Reasoning about programs

inferred← citeshttps://doi.org/10.1016/0004-3702(75)90003-xopenalex-snapshot

Summary of MYCROFT: A system for understanding simple picture programs

inferred← citeshttps://doi.org/10.1016/0004-3702(80)90023-5openalex-snapshot

LAURA, a system to debug student programs

inferred← citeshttps://doi.org/10.1016/0304-3975(76)90032-3openalex-snapshot

Correctness of parallel programs: The Church-Rosser approach

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(91)90301-hopenalex-snapshot

Static semantics, types, and binding time analysis

inferred← citeshttps://doi.org/10.1016/b978-0-12-122950-4.50027-9openalex-snapshot

References

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-934613-03-3.50022-2openalex-snapshot

Achieving Several Goals Simultaneously**The research reported herein was sponsored by the National Science Foundation under Grant GJ-36146.

inferred← citeshttps://doi.org/10.1016/b978-0-934613-10-1.50018-9openalex-snapshot

BIBLIOGRAPHY

inferred← citeshttps://doi.org/10.1016/b978-0-934613-12-5.50009-4openalex-snapshot

Mechanical proofs about computer programs

inferred← citeshttps://doi.org/10.1016/b978-075067555-0.50269-3openalex-snapshot

References, Part 7

inferred← citeshttps://doi.org/10.1016/j.cosrev.2008.02.003openalex-snapshot

A survey of state vectors

inferred← citeshttps://doi.org/10.1016/j.tcs.2010.03.016openalex-snapshot

Alternating states for dual nondeterminism in imperative programming

inferred← citeshttps://doi.org/10.1016/j.tcs.2013.11.003openalex-snapshot

An observationally complete program logic for imperative higher-order functions

inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71197-2openalex-snapshot

Problems in the Theory of Programming Languages

inferred← citeshttps://doi.org/10.1016/s0065-2458(08)60431-3openalex-snapshot

Three Computer Cultures: Computer Technology, Computer Mathematics, and Computer Science

inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00313-3openalex-snapshot

Constructive design of a hierarchy of semantics of a transition system by abstract interpretation

inferred← citeshttps://doi.org/10.1016/s0747-7171(86)80013-xopenalex-snapshot

Non-standard algorithmic and dynamic logic

inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80202-6openalex-snapshot

Chapter 5 Software engineering

inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80168-9openalex-snapshot

Constructive Design of a Hierarchy of Semantics of a Transition System by Abstract Interpretation (Extended Abstract)

inferred← citeshttps://doi.org/10.1080/03155986.1973.11731542openalex-snapshot

Software Reliability

inferred← citeshttps://doi.org/10.1080/08993400802332332openalex-snapshot

Three traditions of computing: what educators should know

inferred← citeshttps://doi.org/10.1098/rsta.1984.0066openalex-snapshot

Mechanical proofs about computer programs

inferred← citeshttps://doi.org/10.1109/32.24704openalex-snapshot

Mathematical principles for a first course in software engineering

inferred← citeshttps://doi.org/10.1109/85.397057openalex-snapshot

The automation of proof: a historical and sociological exploration

inferred← citeshttps://doi.org/10.1109/c-m.1971.216741openalex-snapshot

Software Reliability

inferred← citeshttps://doi.org/10.1109/dasa63652.2024.10836654openalex-snapshot

A Comprehensive Overview of Formal Methods and Deep Learning for Verification and Optimization

inferred← citeshttps://doi.org/10.1109/dsa52907.2021.00115openalex-snapshot

Proof of Greatest Number Program and Find

inferred← citeshttps://doi.org/10.1109/eit.2006.252147openalex-snapshot

Automated Testing Design and Description for Certain Functions

inferred← citeshttps://doi.org/10.1109/iri-05.2005.1506533openalex-snapshot

A testing and analysis tool for certain 3-variable functions

inferred← citeshttps://doi.org/10.1109/itng.2013.20openalex-snapshot

A Boundary Value Analysis Tool - Design and Description

inferred← citeshttps://doi.org/10.1109/mahc.1984.10017openalex-snapshot

An Early Program Proof by Alan Turing

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/mahc.2021.3133136openalex-snapshot

History of Abstract Interpretation

inferred← citeshttps://doi.org/10.1109/synasc.2015.10openalex-snapshot

Algorithmic Logic-Based Verification with SeaHorn

inferred← citeshttps://doi.org/10.1109/tase52547.2021.00011openalex-snapshot

Program Verification: a 70+- Year History

inferred← citeshttps://doi.org/10.1145/1016848.1016874openalex-snapshot

From process logic to program logic

inferred← citeshttps://doi.org/10.1145/1016850.1016874openalex-snapshot

From process logic to program logic

inferred← citeshttps://doi.org/10.1145/1057958.1057964openalex-snapshot

Test for (IN) equality, subtraction, proof of correctness

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/1188913.1188922openalex-snapshot

Computing versus human thinking

inferred← citeshttps://doi.org/10.1145/1592434.1592437openalex-snapshot

Automated deduction for verification

inferred← citeshttps://doi.org/10.1145/2103621.2103687openalex-snapshot

An abstract interpretation framework for termination

inferred← citeshttps://doi.org/10.1145/2103656.2103687openalex-snapshot

An abstract interpretation framework for termination

inferred← citeshttps://doi.org/10.1145/2766189.2766195openalex-snapshot

Algorithmic logic-based verification

inferred← citeshttps://doi.org/10.1145/322092.322103openalex-snapshot

Path Calculus in Program Verification

inferred← citeshttps://doi.org/10.1145/336512.336546openalex-snapshot

Formal specification

inferred← citeshttps://doi.org/10.1145/3375258.3375265openalex-snapshot

Is Deductive Program Verification Mature Enough to be Taught to Software Engineers?

inferred← citeshttps://doi.org/10.1145/3386320openalex-snapshot

Thriving in a crowded and changing world: C++ 2006–2020

inferred← citeshttps://doi.org/10.1145/3477355.3477358openalex-snapshot

Finding Effective Abstractions

inferred← citeshttps://doi.org/10.1145/3477355.3477359openalex-snapshot

Assessing the Success and Impact of Hoare’s Logic

inferred← citeshttps://doi.org/10.1145/3540250.3558917openalex-snapshot

Python-by-contract dataset

inferred← citeshttps://doi.org/10.1145/3544585.3544594openalex-snapshot

Development of Correct Programs

inferred← citeshttps://doi.org/10.1145/356599.356602openalex-snapshot

An Assessment of Techniques for Proving Program Correctness

inferred← citeshttps://doi.org/10.1145/357980.358001openalex-snapshot

An axiomatic basis for computer programming

inferred← citeshttps://doi.org/10.1145/361454.361460openalex-snapshot

Fixpoint approach to the theory of computation

inferred← citeshttps://doi.org/10.1145/361454.361490openalex-snapshot

The production of better mathematical software

inferred← citeshttps://doi.org/10.1145/362258.362271openalex-snapshot

Syntax-directed documentation for PL360

inferred← citeshttps://doi.org/10.1145/362384.362502openalex-snapshot

Algorithm 382: combinations of M out of N objects [G6]

inferred← citeshttps://doi.org/10.1145/362384.362507openalex-snapshot

Certification of algorithm 245 [M1]:treesort 3:proof of algorithms—a new kind of certification

inferred← citeshttps://doi.org/10.1145/362384.362513openalex-snapshot

Remark on algorithm 361 [G6]: permanent function of a square matrix I and II

inferred← citeshttps://doi.org/10.1145/362452.362489openalex-snapshot

Proof of a program

inferred← citeshttps://doi.org/10.1145/363235.363259openalex-snapshot

An axiomatic basis for computer programming

inferred← citeshttps://doi.org/10.1145/3632849openalex-snapshot

Calculational Design of [In]Correctness Transformational Program Logics by Abstract Interpretation

inferred← citeshttps://doi.org/10.1145/3632863openalex-snapshot

An Axiomatic Basis for Computer Programming on the Relaxed Arm-A Architecture: The AxSL Logic

inferred← citeshttps://doi.org/10.1145/3708559openalex-snapshot

Synthesizing Invariants for Polynomial Programs by Semidefinite Programming

inferred← citeshttps://doi.org/10.1145/3715275.3732201openalex-snapshot

In Which Areas of Technical AI Safety Could Geopolitical Rivals Cooperate?

inferred← citeshttps://doi.org/10.1145/3786762openalex-snapshot

An Axiomatic Basis for Computer Programming on Relaxed Hardware Architectures: The AxSL Logics

inferred← citeshttps://doi.org/10.1145/379486.379512openalex-snapshot

The limits of correctness

inferred← citeshttps://doi.org/10.1145/3816707openalex-snapshot

Tony Hoare: his path to the ACM Turing Award

inferred← citeshttps://doi.org/10.1145/3840586.3843210openalex-snapshot

Assignment Has Never Existed: Programs Have Always Been Difference Equations

inferred← citeshttps://doi.org/10.1145/3841644.3842686openalex-snapshot

Introducing Hoare Logic in the Undergraduate CS Curriculum

inferred← citeshttps://doi.org/10.1145/390016.808459openalex-snapshot

How to write correct programs and know it

inferred← citeshttps://doi.org/10.1145/69575.69577openalex-snapshot

Tentative steps toward a development method for interfering programs

inferred← citeshttps://doi.org/10.1145/800027.808459openalex-snapshot

How to write correct programs and know it

inferred← citeshttps://doi.org/10.1145/800037.800995openalex-snapshot

Teaching problem solving in an introductory computer science class

inferred← citeshttps://doi.org/10.1145/800168.811553openalex-snapshot

Verifying formal specifications of synchronous processes

inferred← citeshttps://doi.org/10.1145/800194.805859openalex-snapshot

Programming with(out) the GOTO

inferred← citeshttps://doi.org/10.1145/942578.807070openalex-snapshot

Inductive methods for proving properties of programs

inferred← citeshttps://doi.org/10.1145/942580.807070openalex-snapshot

Inductive methods for proving properties of programs

inferred← citeshttps://doi.org/10.1145/953049.800995openalex-snapshot

Teaching problem solving in an introductory computer science class

inferred← citeshttps://doi.org/10.1145/953224.953226openalex-snapshot

Structured programming, programming teaching and the language Pascal

inferred← citeshttps://doi.org/10.1145/987361.987370openalex-snapshot

Programming with(out) the GOTO

inferred← citeshttps://doi.org/10.1145/987361.987372openalex-snapshot

A case against the GOTO

inferred← citeshttps://doi.org/10.1145/990555.990636openalex-snapshot

The roots of structured programming

inferred← citeshttps://doi.org/10.1145/990654.990636openalex-snapshot

The roots of structured programming

inferred← citeshttps://doi.org/10.1155/2014/549398openalex-snapshot

Experiments in Computing: A Survey

inferred← citeshttps://doi.org/10.1201/b17764-17openalex-snapshot

Empirical Computer Science

inferred← citeshttps://doi.org/10.15388/infedu.2010.07openalex-snapshot

Invariant Based Programming in Education - An Analysis of Student Difficulties

inferred← citeshttps://doi.org/10.28945/204openalex-snapshot

Know Your Discipline: Teaching the Philosophy of Computer Science

inferred← citeshttps://doi.org/10.28945/3155openalex-snapshot

Know Your Discipline: Teaching the Philosophy of Computer Science

inferred← citeshttps://doi.org/10.70675/933f49a0z0075z4108z99a1z6cc67f80e603openalex-snapshot

Static analysis of functional programs with an application to the frame problem in deductive verification

inferred← citeshttps://doi.org/10.70777/si.v2i5.15509openalex-snapshot

In Which Areas of Technical AI Safety Could Geopolitical Rivals Cooperate?

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.