On the public citation graph
Consistent and complementary formal theories of the semantics of programming languages
0 signed · 150 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.1016/0066-4138(69)90005-6openalex-snapshot
On the formal description of PL/I
inferredcites →https://doi.org/10.1016/b978-0-08-011356-2.50008-2openalex-snapshot
A λ-CALCULUS APPROACH
inferredcites →https://doi.org/10.1016/s0022-0000(69)80009-7openalex-snapshot
The correctness of programs
inferredcites →https://doi.org/10.1016/s0049-237x(08)72018-4openalex-snapshot
A Basis for a Mathematical Theory of Computation )
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.1093/comjnl/12.1.41openalex-snapshot
Proving Properties of Programs by Structural Induction
inferredcites →https://doi.org/10.1093/comjnl/6.4.308openalex-snapshot
The Mechanical Evaluation of Expressions
inferredcites →https://doi.org/10.1145/321239.321240openalex-snapshot
Random-Access Stored-Program Machines, an Approach to Programming Languages
inferredcites →https://doi.org/10.1145/357980.358001openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/363744.363749openalex-snapshot
Correspondence between ALGOL 60 and Church's Lambda-notation
inferredcites →https://doi.org/10.1145/366193.366201openalex-snapshot
Revised report on the algorithmic language ALGOL 60
inferredcites →https://doi.org/10.1145/367177.367199openalex-snapshot
Recursive functions of symbolic expressions and their computation by machine, Part I
inferredcites →https://doi.org/10.21236/ad0785072openalex-snapshot
Logic for Computable Functions Description of a Machine Implementation
inferredcites →https://doi.org/10.25405/ncl.34131156openalex-snapshot
A formal definition of ALGOL 60
inferredcites →https://doi.org/10.7551/mitpress/12274.003.0023openalex-snapshot
Recursive Functions of Symbolic Expressions and Their Computation by Machine (1960)
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-07389-2_222openalex-snapshot
Relational definition of computer languages
inferred← citeshttps://doi.org/10.1007/3-540-08065-1_7openalex-snapshot
Metalanguage for formal definition of semantics of programming languages
inferred← citeshttps://doi.org/10.1007/3-540-08353-7_170openalex-snapshot
Total correctness for procedures
inferred← citeshttps://doi.org/10.1007/3-540-08446-0_45openalex-snapshot
Intermediate languages: Current status
inferred← citeshttps://doi.org/10.1007/3-540-10003-2_87openalex-snapshot
Semantics :Algebras,fixed points,axioms
inferred← citeshttps://doi.org/10.1007/3-540-11160-3_4openalex-snapshot
Propositional dynamic logics of programs: A survey
inferred← citeshttps://doi.org/10.1007/3-540-15648-8_15openalex-snapshot
Partial-correctness theories as first-order theories
inferred← citeshttps://doi.org/10.1007/3-540-15648-8_28openalex-snapshot
Semantical analysis of specification logic
inferred← citeshttps://doi.org/10.1007/3-540-16442-1_1openalex-snapshot
Compiler generation from relational semantics
inferred← citeshttps://doi.org/10.1007/3-540-44577-3_10openalex-snapshot
Abstract Interpretation Based Formal Methods and Future Challenges
inferred← citeshttps://doi.org/10.1007/3-540-44929-9_49openalex-snapshot
The Varieties of Programming Language Semantics
inferred← citeshttps://doi.org/10.1007/3-540-45575-2_18openalex-snapshot
The Varieties of Programming Language Semantics And Their Uses
inferred← citeshttps://doi.org/10.1007/3-540-51285-3_49openalex-snapshot
Single-assignment semantics for imperative programs
inferred← citeshttps://doi.org/10.1007/3-540-61626-8_100openalex-snapshot
Laws of data parallel assignment
inferred← citeshttps://doi.org/10.1007/978-1-4757-3851-3_3openalex-snapshot
Semantical Analysis of Specification Logic
inferred← citeshttps://doi.org/10.1007/978-1-84882-912-1_1openalex-snapshot
Insight, Inspiration and Collaboration
inferred← citeshttps://doi.org/10.1007/978-3-030-31038-7_3openalex-snapshot
Whither Specifications as Programs
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-319-73579-5openalex-snapshot
Dynamic Logic. New Trends and Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-73579-5_10openalex-snapshot
Dynamic Logic: A Personal Perspective
inferred← citeshttps://doi.org/10.1007/978-3-642-60858-2_21openalex-snapshot
Unified Theories of Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-66319-2_1openalex-snapshot
The Semantical Definition of Programming Languages in Terms of Their Data Spaces
inferred← citeshttps://doi.org/10.1007/978-3-642-87956-2_13openalex-snapshot
The connection between Axiomatic and Denotational Semantics of Programming Languages
inferred← citeshttps://doi.org/10.1007/978-94-011-2779-0_1openalex-snapshot
Complementarity - Polarity - Dialectic - Autology a Conceptual Analysis of Opposition and Unity
inferred← citeshttps://doi.org/10.1007/bf00263992openalex-snapshot
Proving correctness of coroutines without history variables
inferred← citeshttps://doi.org/10.1007/bf00264252openalex-snapshot
The axiomatic semantics of programs based on Hoare's logic
inferred← citeshttps://doi.org/10.1007/bf00268134openalex-snapshot
An axiomatic proof technique for parallel programs I
inferred← citeshttps://doi.org/10.1007/bf00289066openalex-snapshot
The clean termination of Pascal programs
inferred← citeshttps://doi.org/10.1007/bf00289244openalex-snapshot
On an equivalence between continuation and stack semantics
inferred← citeshttps://doi.org/10.1007/bf00289309openalex-snapshot
The formal definition of a real-time language
inferred← citeshttps://doi.org/10.1007/bf00289468openalex-snapshot
Axiomatic approach to side effects and general jumps
inferred← citeshttps://doi.org/10.1007/bf00290146openalex-snapshot
General correctness: A unification of partial and total correctness
inferred← citeshttps://doi.org/10.1007/bf01069058openalex-snapshot
Current methods for proving program correctness
inferred← citeshttps://doi.org/10.1007/bf01211307openalex-snapshot
Correct translation of data parallel assignment onto array processors
inferred← citeshttps://doi.org/10.1007/bf01211604openalex-snapshot
Predicate transformers as power operations
inferred← citeshttps://doi.org/10.1007/bf01212525openalex-snapshot
Equivalence of formal semantics definition methods
inferred← citeshttps://doi.org/10.1007/bf01744573openalex-snapshot
Some applications of topology to program semantics
inferred← citeshttps://doi.org/10.1007/bfb0014334openalex-snapshot
A categorical characterization of consistency results
inferred← citeshttps://doi.org/10.1007/bfb0014674openalex-snapshot
A study on transformational semantics
inferred← citeshttps://doi.org/10.1007/bfb0025791openalex-snapshot
Some applications of topology to program semantics
inferred← citeshttps://doi.org/10.1007/bfb0026562openalex-snapshot
Time and information in sequential and concurrent computation
inferred← citeshttps://doi.org/10.1007/pl00003923openalex-snapshot
Unification of Four Versions of Program Semantics
inferred← citeshttps://doi.org/10.1007/s00126-019-00923-2openalex-snapshot
The polyphase evolution of a late Variscan W/Au deposit (Salau, French Pyrenees): insights from REE and U/Pb LA-ICP-MS analyses
inferred← citeshttps://doi.org/10.1007/s00165-019-00501-3openalex-snapshot
Fifty years of Hoare’s logic
inferred← citeshttps://doi.org/10.1007/s10270-021-00943-5openalex-snapshot
CaRE: a refinement calculus for requirements engineering based on argumentation theory
inferred← citeshttps://doi.org/10.1007/s11023-023-09621-5openalex-snapshot
Three Early Formal Approaches to the Verification of Concurrent Programs
inferred← citeshttps://doi.org/10.1016/0020-0190(80)90048-4openalex-snapshot
A simple relation between relational and predicate transformer semantics for nondeterministic programs
inferred← citeshttps://doi.org/10.1016/0022-0000(79)90046-1openalex-snapshot
Propositional dynamic logic of regular programs
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/0167-9236(86)90030-8openalex-snapshot
Flexible management of computational models
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90001-9openalex-snapshot
Floyd's principle, correctness theories and program equivalence
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90065-3openalex-snapshot
Proving program inclusion using Hoare's logic
inferred← citeshttps://doi.org/10.1016/0306-4379(80)90075-7openalex-snapshot
The application of data types to database semantic integrity
inferred← citeshttps://doi.org/10.1016/0306-4379(82)90028-xopenalex-snapshot
Axiomatic definitions for data model semantics
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90045-jopenalex-snapshot
Semantical analysis of specification logic
inferred← citeshttps://doi.org/10.1016/b978-0-12-528540-7.50005-8openalex-snapshot
LANGUAGE AS A TOOL FOR SCIENTIFIC PROGRAMMING
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/s0167-9236(99)00008-1openalex-snapshot
An agent-based framework for building decision support systems
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/s1389-0417(03)00006-8openalex-snapshot
Formalization, implementation and validation of conversation policies using a protocol operational semantics
inferred← citeshttps://doi.org/10.1051/ita/197610r200051openalex-snapshot
Une formalisation de la sémantique des langages de programmation
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.1080/07421222.1988.11517830openalex-snapshot
Evolutionary Development of Information Systems
inferred← citeshttps://doi.org/10.1080/09528139408953788openalex-snapshot
A deductive clustering approach
inferred← citeshttps://doi.org/10.1093/comjnl/19.2.151openalex-snapshot
On Interpreter-Oriented Definitions of Programming Languages
inferred← citeshttps://doi.org/10.1109/32.6172openalex-snapshot
Functional development of database applications
inferred← citeshttps://doi.org/10.1109/iceccs.2005.76openalex-snapshot
Sequencing operations and creating objects
inferred← citeshttps://doi.org/10.1109/mahc.2003.1203056openalex-snapshot
Assertions: a personal perspective
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/qrs-c.2016.36openalex-snapshot
A UTP Refinement Model of the STeC Language
inferred← citeshttps://doi.org/10.1109/sfcs.1977.25openalex-snapshot
Program invariants as fixed points
inferred← citeshttps://doi.org/10.1109/sfcs.1981.4openalex-snapshot
A decidable mu-calculus: Preliminary report
inferred← citeshttps://doi.org/10.1109/soac.1990.82152openalex-snapshot
Denotational semantics-directed compilation using Prolog
inferred← citeshttps://doi.org/10.1109/telfor.2012.6419526openalex-snapshot
Formalization of the general rules of the Hoare logic using S-formulas
inferred← citeshttps://doi.org/10.1137/0207005openalex-snapshot
Soundness and Completeness of an Axiom System for Program Verification
inferred← citeshttps://doi.org/10.1145/1010782.1010784openalex-snapshot
Some verification problems in Pascal-like languages
inferred← citeshttps://doi.org/10.1145/1127716.1127726openalex-snapshot
Exploring an information-based approach to computation and computational complexity
inferred← citeshttps://doi.org/10.1145/2147774.2147776openalex-snapshot
Functions in information systems
inferred← citeshttps://doi.org/10.1145/242224.242451openalex-snapshot
On the need for a popular formal semantics
inferred← citeshttps://doi.org/10.1145/251595.251617openalex-snapshot
On the need for a popular formal semantics
inferred← citeshttps://doi.org/10.1145/322047.322062openalex-snapshot
A New Incompleteness Result for Hoare's System
inferred← citeshttps://doi.org/10.1145/322077.322088openalex-snapshot
Some Properties of Predicate Transformers
inferred← citeshttps://doi.org/10.1145/322108.322121openalex-snapshot
Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems
inferred← citeshttps://doi.org/10.1145/322186.322197openalex-snapshot
On the Correctness of Semantic-Syntax-Directed Translations
inferred← citeshttps://doi.org/10.1145/322307.322324openalex-snapshot
Axiomatic Definitions of Programming Languages
inferred← citeshttps://doi.org/10.1145/328239.333386openalex-snapshot
A prescriptive semantics of Fortran 95
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/3477355.3477369openalex-snapshot
Hoare and He’s Unifying Theories of Programming
inferred← citeshttps://doi.org/10.1145/3477355.3477375openalex-snapshot
List of Tony Hoare’s Publications
inferred← citeshttps://doi.org/10.1145/356669.356672openalex-snapshot
A Sampler of Formal Definitions
inferred← citeshttps://doi.org/10.1145/357146.357151openalex-snapshot
Specifying the Semantics of while Programs: A Tutorial and Critique of a Paper by Hoare and Lauer
inferred← citeshttps://doi.org/10.1145/359897.359904openalex-snapshot
A language for formal problem specification
inferred← citeshttps://doi.org/10.1145/360303.360308openalex-snapshot
The denotational semantics of programming languages
inferred← citeshttps://doi.org/10.1145/3816707openalex-snapshot
Tony Hoare: his path to the ACM Turing Award
inferred← citeshttps://doi.org/10.1145/503643.503680openalex-snapshot
Proving the correctness of coroutines without history variables
inferred← citeshttps://doi.org/10.1145/512950.512952openalex-snapshot
Programming language constructs for which it is impossible to obtain good hoare-like axiom systems
inferred← citeshttps://doi.org/10.1145/567446.567466openalex-snapshot
Axiomatic definitions of programming languages
inferred← citeshttps://doi.org/10.1145/567532.567549openalex-snapshot
Program verification based on denotation semantics
inferred← citeshttps://doi.org/10.1145/567752.567769openalex-snapshot
Specifying programming language semantics
inferred← citeshttps://doi.org/10.1145/65293.71204openalex-snapshot
A first course in program verification and the semantics of programming languages
inferred← citeshttps://doi.org/10.1145/65294.71204openalex-snapshot
A first course in program verification and the semantics of programming languages
inferred← citeshttps://doi.org/10.1145/800068.802136openalex-snapshot
How to define a language using PROLOG
inferred← citeshttps://doi.org/10.1145/800105.803418openalex-snapshot
Propositional modal logic of programs
inferred← citeshttps://doi.org/10.1145/800113.803634openalex-snapshot
A consistent and complete deductive system for the verification of parallel programs
inferred← citeshttps://doi.org/10.1145/800113.803635openalex-snapshot
A new incompleteness result for Hoare's system
inferred← citeshttps://doi.org/10.1145/800116.803758openalex-snapshot
Proving assertions about programs that manipulate data structures
inferred← citeshttps://doi.org/10.1145/800191.805513openalex-snapshot
The assignment axiom and programming language design
inferred← citeshttps://doi.org/10.1145/953411.953416openalex-snapshot
A note on some limits of the algebraic specification method
inferred← citeshttps://doi.org/10.1145/953997.954002openalex-snapshot
Traversable stack with fewer errors
inferred← citeshttps://doi.org/10.1145/954063.954070openalex-snapshot
Traversable stack with fewer errors
inferred← citeshttps://doi.org/10.1145/9758.10501openalex-snapshot
On the algebraic definition of programming languages
inferred← citeshttps://doi.org/10.1145/984532.984535openalex-snapshot
An informal approach to formal specifications
inferred← citeshttps://doi.org/10.1145/984540.984544openalex-snapshot
An informal approach to formal specifications
inferred← citeshttps://doi.org/10.1145/984555.1108830openalex-snapshot
Final report of the ANSI/X3/SPARC DBS-SG relational database task group
inferred← citeshttps://doi.org/10.21236/ada019569openalex-snapshot
Automatic Program Verification 4: Proof of Termination within a Weak Logic of Programs
inferred← citeshttps://doi.org/10.2172/5051765openalex-snapshot
Formal analysis of name accessing in programming languages
inferred← citeshttps://doi.org/10.2298/ns20101213kupusinacopenalex-snapshot
Analyses of characteristics of dynamic postconditions in Hoare triplets
inferred← citeshttps://doi.org/10.3233/fi-1997-29302openalex-snapshot
HOW TO INTERPRET AND ESTABLISH CONSISTENCY RESULTS FOR SEMANTICS OF CONCURRENT PROGRAMMING LANGUAGES
inferred← citeshttps://doi.org/10.48550/arxiv.1308.6810openalex-snapshot
Herding Cats - Modelling, simulation, testing, and data-mining for weak memory
inferred← citeshttps://doi.org/10.48550/arxiv.1906.03557openalex-snapshot
Whither Programs as Specifications
inferred← citeshttps://doi.org/10.7551/mitpress/3054.003.0004openalex-snapshot
Introduction to operational semantics
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.