On the public citation graph
The verification and synthesis of data structures
0 signed · 56 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-642-59412-0_24openalex-snapshot
Proof of Correctness of Data Representations
inferredcites →https://doi.org/10.1007/bf00288746openalex-snapshot
Automatic program verification I: A logical basis and its implementation
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.1145/362566.362568openalex-snapshot
Toward automatic program synthesis
inferredcites →https://doi.org/10.21236/ada459656openalex-snapshot
Application of Theorem Proving to Problem Solving
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-08442-8_74openalex-snapshot
Algebraic Semantics of Type Definitions and Structured Variables
inferred← citeshttps://doi.org/10.1007/3-540-08921-7_93openalex-snapshot
On algorithmic theory of stacks
inferred← citeshttps://doi.org/10.1007/3-540-09541-1_25openalex-snapshot
A formal specification technique for abstract data types with parallelism
inferred← citeshttps://doi.org/10.1007/3-540-10009-1_18openalex-snapshot
The AFFIRM theorem prover: Proof forests and management of large proofs
inferred← citeshttps://doi.org/10.1007/3-540-11494-7_16openalex-snapshot
Proving the correctness of implementations of shared data abstractions
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-3-642-22655-7_17openalex-snapshot
Verifying Multi-object Invariants with Relationships
inferred← citeshttps://doi.org/10.1007/978-3-642-48354-7_16openalex-snapshot
Abstract Data Types and the Development of Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-59412-0_29openalex-snapshot
Abstract Data Types and the Development of Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-662-09507-2_14openalex-snapshot
Abstraction Mechanisms in CLU
inferred← citeshttps://doi.org/10.1007/bf00260921openalex-snapshot
Proof rules for the programming language Euclid
inferred← citeshttps://doi.org/10.1007/bf00260922openalex-snapshot
The algebraic specification of abstract data types
inferred← citeshttps://doi.org/10.1007/bf00276183openalex-snapshot
Extended directed graphs, a formalism for structured data and data structures
inferred← citeshttps://doi.org/10.1007/bfb0014666openalex-snapshot
Proof rules for the programming language Euclid
inferred← citeshttps://doi.org/10.1007/bfb0014668openalex-snapshot
Specifications and proofs for abstract data types in concurrent programs
inferred← citeshttps://doi.org/10.1007/bfb0022497openalex-snapshot
Abstract data types: A retrospective and prospective view
inferred← citeshttps://doi.org/10.1016/0096-0551(78)90005-xopenalex-snapshot
Recent developments in the theory of data structures
inferred← citeshttps://doi.org/10.1016/0304-3975(79)90059-8openalex-snapshot
Data types, abstract data types and their specification problem
inferred← citeshttps://doi.org/10.1016/j.jss.2010.07.031openalex-snapshot
A property based specification formalism classification
inferred← citeshttps://doi.org/10.1016/s0065-2458(08)60131-xopenalex-snapshot
Specification and Implementation of Abstract Data Types
inferred← citeshttps://doi.org/10.1109/32.277576openalex-snapshot
Modular verification of data abstractions with shared realizations
inferred← citeshttps://doi.org/10.1109/cmpsac.1990.139466openalex-snapshot
EASE: an embedded algebraic specification environment
inferred← citeshttps://doi.org/10.1109/tse.1976.233830openalex-snapshot
An Introduction to the Construction and Verification of Alphard Programs
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.1982.235093openalex-snapshot
A Functional Approach to Module Verification
inferred← citeshttps://doi.org/10.1145/1013879.802654openalex-snapshot
Formal specification and verification of a connection establishment protocol
inferred← citeshttps://doi.org/10.1145/248621.248623openalex-snapshot
Algebraic approaches to nondeterminism—an overview
inferred← citeshttps://doi.org/10.1145/321941.321957openalex-snapshot
Proving Properties of Complex Data Structures
inferred← citeshttps://doi.org/10.1145/357073.357078openalex-snapshot
Verification of Array, Record, and Pointer Operations in Pascal
inferred← citeshttps://doi.org/10.1145/359605.359618openalex-snapshot
Abstract data types and the development of data structures
inferred← citeshttps://doi.org/10.1145/359657.359666openalex-snapshot
Abstract data types and software validation
inferred← citeshttps://doi.org/10.1145/567446.567461openalex-snapshot
On proving inductive properties of abstract data types
inferred← citeshttps://doi.org/10.1145/800081.802654openalex-snapshot
Formal specification and verification of a connection establishment protocol
inferred← citeshttps://doi.org/10.1145/800087.802789openalex-snapshot
A constructive alternative to axiomatic data type definitions
inferred← citeshttps://doi.org/10.1145/800237.807124openalex-snapshot
Abstract data types and the development of data structures
inferred← citeshttps://doi.org/10.1145/954627.954630openalex-snapshot
Limits of the "algebraic" specification of abstract data types
inferred← citeshttps://doi.org/10.21236/ada034827openalex-snapshot
The Design of Data Type Specifications
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.5555/800253.807714openalex-snapshot
The design of data type specifications
inferred← citeshttps://doi.org/10.6028/nbs.ir.87-3559openalex-snapshot
Annotated bibliography on reliable system design
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.