On the public citation graph
Proof rules for the programming language Euclid
0 signed · 113 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-3-540-37500-5openalex-snapshot
PASCAL User Manual and Report
inferredcites →https://doi.org/10.1007/bf00288745openalex-snapshot
The verification and synthesis of data structures
inferredcites →https://doi.org/10.1007/bf00289246openalex-snapshot
Rules of inference for procedure calls
inferredcites →https://doi.org/10.1007/bf00289504openalex-snapshot
An axiomatic definition of the programming language PASCAL
inferredcites →https://doi.org/10.1007/bf00289507openalex-snapshot
Proof of correctness of data representations
inferredcites →https://doi.org/10.1007/bfb0025364openalex-snapshot
Complementary Definitions of Programming Language Semantics
inferredcites →https://doi.org/10.1007/bfb0059696openalex-snapshot
Procedures and parameters: An axiomatic approach
inferredcites →https://doi.org/10.1145/357980.358001openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/359657.359666openalex-snapshot
Abstract data types and software validation
inferredcites →https://doi.org/10.1145/512950.512952openalex-snapshot
Programming language constructs for which it is impossible to obtain good hoare-like axiom systems
inferredcites →https://doi.org/10.1145/954666.971189openalex-snapshot
Report on the programming language Euclid
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1099-1689(199906)9:2<85::aid-stvr178>3.0.co;2-2openalex-snapshot
Towards a transformational approach to program verification
inferred← citeshttps://doi.org/10.1002/spe.4380140805openalex-snapshot
Compile—time detection of aliasing in euclid programs
inferred← citeshttps://doi.org/10.1002/spe.649openalex-snapshot
Model variables: cleanly supporting abstraction in design by contract
inferred← citeshttps://doi.org/10.1002/stvr.236openalex-snapshot
Additional transformations for multiple‐level escape statements
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-15199-0_17openalex-snapshot
Application of PROLOG to test sets generation from algebraic specifications
inferred← citeshttps://doi.org/10.1007/3-540-15648-8_29openalex-snapshot
A simple programming language with data types: semantics and verification
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-4118-8_7openalex-snapshot
Idealized Algol and its Specification Logic
inferred← citeshttps://doi.org/10.1007/978-1-4612-5196-5_3openalex-snapshot
The Impact of Modelling and Abstraction Concerns on Modern Programming Languages
inferred← citeshttps://doi.org/10.1007/978-1-4612-5979-4_5openalex-snapshot
Remarks on the Impact of Program Verification on Language Design
inferred← citeshttps://doi.org/10.1007/978-1-4615-3506-5_12openalex-snapshot
Proving Correctness of Executable Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-59412-0_22openalex-snapshot
Assertions: A Personal Perspective
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/978-94-009-7893-5_3openalex-snapshot
A General Axiom of Assignment
inferred← citeshttps://doi.org/10.1007/bf00261258openalex-snapshot
Sound and complete Hoare-like calculi based on copy rules
inferred← citeshttps://doi.org/10.1007/bf00264252openalex-snapshot
The axiomatic semantics of programs based on Hoare's logic
inferred← citeshttps://doi.org/10.1007/bf00264494openalex-snapshot
Problematic features of programming languages: a situational-calculus approach
inferred← citeshttps://doi.org/10.1007/bf00269810openalex-snapshot
Language design methods based on semantic principles: Algol 68, a Language Designed using Semantic Principles
inferred← citeshttps://doi.org/10.1007/bf01101651openalex-snapshot
Semantics of algorithmic languages
inferred← citeshttps://doi.org/10.1007/bf02252958openalex-snapshot
A complete axiomatic semantics of spawning
inferred← citeshttps://doi.org/10.1007/bfb0014665openalex-snapshot
A case study in language design: Euclid
inferred← citeshttps://doi.org/10.1007/bfb0014680openalex-snapshot
Programing languages for reliable computing systems
inferred← citeshttps://doi.org/10.1007/bfb0021429openalex-snapshot
Remarks on the impact of program verification on language design
inferred← citeshttps://doi.org/10.1007/bfb0022497openalex-snapshot
Abstract data types: A retrospective and prospective view
inferred← citeshttps://doi.org/10.1007/bfb0025790openalex-snapshot
A critique of the foundations of Hoare-style programming logics
inferred← citeshttps://doi.org/10.1007/pl00003937openalex-snapshot
Stream-Based Specification of Mobile Systems
inferred← citeshttps://doi.org/10.1007/s00165-019-00501-3openalex-snapshot
Fifty years of Hoare’s logic
inferred← citeshttps://doi.org/10.1007/s001650050057openalex-snapshot
Hoare Logic and Auxiliary Variables
inferred← citeshttps://doi.org/10.1016/0020-0190(79)90132-7openalex-snapshot
Aliasing among pointers in EUCLID
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90058-popenalex-snapshot
Axiomatic semantics for “escape” statements
inferred← citeshttps://doi.org/10.1016/0096-0551(79)90017-1openalex-snapshot
Testing and verification aspects of Pascal-like languages
inferred← citeshttps://doi.org/10.1016/0164-1212(81)90004-2openalex-snapshot
Software requirements and specifications: A survey of needs and languages
inferred← citeshttps://doi.org/10.1016/0164-1212(86)90004-xopenalex-snapshot
Test sets generation from algebraic specifications using logic programming
inferred← citeshttps://doi.org/10.1016/0164-1212(87)90019-7openalex-snapshot
Language definition-based compiler development
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90009-9openalex-snapshot
On the notion of expressiveness and the rule of adaptation
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/b978-0-444-88074-1.50020-2openalex-snapshot
Methods and Logics for Proving Programs
inferred← citeshttps://doi.org/10.1016/j.ipl.2022.106329openalex-snapshot
Weakest preconditioned goto axiom
inferred← citeshttps://doi.org/10.1016/j.scico.2021.102679openalex-snapshot
Loop invariance with break and continue
inferred← citeshttps://doi.org/10.1016/s0065-2458(08)60131-xopenalex-snapshot
Specification and Implementation of Abstract Data Types
inferred← citeshttps://doi.org/10.1080/03155986.1983.11731896openalex-snapshot
A Comparative Evaluation Of Ada And Euclidf†
inferred← citeshttps://doi.org/10.1080/03155986.1983.11731898openalex-snapshot
Experience With Verification Of Parallel Modula Programs
inferred← citeshttps://doi.org/10.1098/rstb.1982.0085openalex-snapshot
The population and production dynamics of benthic algae in an artificial recirculating hard-water stream
inferred← citeshttps://doi.org/10.1109/32.277576openalex-snapshot
Modular verification of data abstractions with shared realizations
inferred← citeshttps://doi.org/10.1109/hicss.1989.47999openalex-snapshot
An abstract axiomatization of pointer types
inferred← citeshttps://doi.org/10.1109/hicss.1992.183254openalex-snapshot
Design languages for cleanroom software engineering
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/ms.1984.229453openalex-snapshot
Abstraction Techniques in Modern Programming Languages
inferred← citeshttps://doi.org/10.1109/proc.1980.11811openalex-snapshot
The impact of abstraction concerns on modern programming languages
inferred← citeshttps://doi.org/10.1109/tse.1980.230209openalex-snapshot
Notes on Type Abstraction (Version 2)
inferred← citeshttps://doi.org/10.1109/tse.1980.230459openalex-snapshot
Abstract Data Type Specification in the Affirm System
inferred← citeshttps://doi.org/10.1109/tse.1985.231549openalex-snapshot
Abstract Data Type Development and Implementation: An Example
inferred← citeshttps://doi.org/10.1145/1010782.1010784openalex-snapshot
Some verification problems in Pascal-like languages
inferred← citeshttps://doi.org/10.1145/1173706.1173740openalex-snapshot
Roadmap for enhanced languages and methods to aid verification
inferred← citeshttps://doi.org/10.1145/1500412.1500468openalex-snapshot
Principles of good software specification and their implications for specification languages
inferred← citeshttps://doi.org/10.1145/154766.155378openalex-snapshot
Recollections about the development of Pascal
inferred← citeshttps://doi.org/10.1145/234286.1057812openalex-snapshot
Recollections about the development of Pascal
inferred← citeshttps://doi.org/10.1145/2489837.2489838openalex-snapshot
An overview of the Leon verification system
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/357073.357078openalex-snapshot
Verification of Array, Record, and Pointer Operations in Pascal
inferred← citeshttps://doi.org/10.1145/357114.357117openalex-snapshot
Specification of Abstract Data Types in Modula
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/358728.358748openalex-snapshot
A critique of the foundations of Hoare style programming logics
inferred← citeshttps://doi.org/10.1145/3816707openalex-snapshot
Tony Hoare: his path to the ACM Turing Award
inferred← citeshttps://doi.org/10.1145/512760.512774openalex-snapshot
Unrestricted procedure calls in Hoare's logic
inferred← citeshttps://doi.org/10.1145/609769.609777openalex-snapshot
Denotational semantics of programming languages and compiler generation in PowerEpsilon
inferred← citeshttps://doi.org/10.1145/66068.66078openalex-snapshot
A translator from small euclid to pascal
inferred← citeshttps://doi.org/10.1145/69622.357191openalex-snapshot
Formal Specification of Graphic Data Types
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/800176.809971openalex-snapshot
A preliminary evaluation of verifiability in Ada
inferred← citeshttps://doi.org/10.1145/947658.947661openalex-snapshot
Procedure semantics and language definition
inferred← citeshttps://doi.org/10.1145/948576.948584openalex-snapshot
Some remarks on records with variants
inferred← citeshttps://doi.org/10.1145/954373.954377openalex-snapshot
Isolation of machine dependencies in Euclid
inferred← citeshttps://doi.org/10.1145/954666.971189openalex-snapshot
Report on the programming language Euclid
inferred← citeshttps://doi.org/10.1145/987515.987517openalex-snapshot
Parameter validation for software reliability
inferred← citeshttps://doi.org/10.2478/ppb-2014-0041openalex-snapshot
Cognitive dysfunctions associated with white matter damage due to cardiovascular burden – determinants and interpretations
inferred← citeshttps://doi.org/10.2514/3.56055openalex-snapshot
Design of a Verifiable Subset for HAL/S
inferred← citeshttps://doi.org/10.2514/6.1981-2154openalex-snapshot
Program verification and embedded aerospace software
inferred← citeshttps://doi.org/10.26021/2692openalex-snapshot
The Semantics, Formal Correctness and Implementation of History Variables in an Imperative Programming Language.
inferred← citeshttps://doi.org/10.31274/rtd-180813-2499openalex-snapshot
Toward a verification system for the programming language KL-1 using weakest preconditions
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.