On the public citation graph
Hierarchical program specification and verification ? a many-sorted logical approach
0 signed · 45 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/bf00288660openalex-snapshot
Remarks on ?program proving: Jumps and functions by M. Clint and C. A. R. Hoare?
inferredcites →https://doi.org/10.1007/bf00288686openalex-snapshot
Program proving: Jumps and functions
inferredcites →https://doi.org/10.1007/bf00288746openalex-snapshot
Automatic program verification I: A logical basis and its implementation
inferredcites →https://doi.org/10.1007/bf00289507openalex-snapshot
Proof of correctness of data representations
inferredcites →https://doi.org/10.1007/bfb0022492openalex-snapshot
Formal description of programming concepts
inferredcites →https://doi.org/10.1109/tse.1975.6312816openalex-snapshot
Specification techniques for data abstractions
inferredcites →https://doi.org/10.1109/tse.1976.233830openalex-snapshot
An Introduction to the Construction and Verification of Alphard Programs
inferredcites →https://doi.org/10.1145/359657.359666openalex-snapshot
Abstract data types and software validation
inferredcites →https://doi.org/10.1145/390016.808426openalex-snapshot
Specification techniques for data abstractions
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-11490-4_24openalex-snapshot
Tecton: A language for manipulating generic objects
inferred← citeshttps://doi.org/10.1007/3-540-44518-8_7openalex-snapshot
Generic Facilities in Object-Oriented ASMs
inferred← citeshttps://doi.org/10.1007/3-540-61629-2_60openalex-snapshot
Modular algebraic specifications and the orientation of equations into rewrite rules
inferred← citeshttps://doi.org/10.1007/3-540-62064-8_5openalex-snapshot
Algebraic semantics of the Oberon target machine
inferred← citeshttps://doi.org/10.1007/978-1-4471-1486-4_24openalex-snapshot
HM Data Model and its Formal Definition
inferred← citeshttps://doi.org/10.1007/978-1-4471-3577-7_23openalex-snapshot
The database Specification Language Ruslan: Main Features
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/bf01068798openalex-snapshot
Formal system of definition of data sets as a high-level tool of data extraction
inferred← citeshttps://doi.org/10.1007/bf01101651openalex-snapshot
Semantics of algorithmic languages
inferred← citeshttps://doi.org/10.1007/bf03037423openalex-snapshot
Modularization and abstraction in logic programming
inferred← citeshttps://doi.org/10.1007/bfb0015471openalex-snapshot
The Kiv-approach to software verification
inferred← citeshttps://doi.org/10.1007/bfb0023884openalex-snapshot
MSL — A Mathematical Specification Language
inferred← citeshttps://doi.org/10.1016/0022-4049(95)00136-0openalex-snapshot
Lax naturality through enrichment
inferred← citeshttps://doi.org/10.1016/0167-6423(82)90004-1openalex-snapshot
Some notes on putting formal specifications to productive use
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90097-4openalex-snapshot
Specifications, models, and implementations of data abstractions
inferred← citeshttps://doi.org/10.1016/b978-0-444-86440-6.50008-6openalex-snapshot
PROBLEM SOLVING AND INFERENCE MECHANISMS
inferred← citeshttps://doi.org/10.1023/a:1023885412683openalex-snapshot
Modification of the IOTA Method for Non-Hierarchical Types
inferred← citeshttps://doi.org/10.1057/jit.1989.4openalex-snapshot
A Software Engineering Perspective
inferred← citeshttps://doi.org/10.1109/2.58215openalex-snapshot
A specifier's introduction to formal methods
inferred← citeshttps://doi.org/10.1109/cmpass.1995.521894openalex-snapshot
Interactive correctness proofs for software modules using KIV
inferred← citeshttps://doi.org/10.1109/tools.1997.713526openalex-snapshot
Algebraic semantics of object-oriented data models
inferred← citeshttps://doi.org/10.1109/tse.1985.232192openalex-snapshot
IOTA: A Modular Programming System
inferred← citeshttps://doi.org/10.1145/78969.78972openalex-snapshot
Linearizability: a correctness condition for concurrent objects
inferred← citeshttps://doi.org/10.1145/800223.806763openalex-snapshot
Operators and algebraic structures
inferred← citeshttps://doi.org/10.1145/9758.10500openalex-snapshot
Writing Larch interface language specifications
inferred← citeshttps://doi.org/10.1184/r1/6587516openalex-snapshot
A Larch specification of the library problem
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.