On the public citation graph
STP: A mechanized logic for specification and verification
0 signed · 43 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/3-540-09526-8_11openalex-snapshot
Lcf: A way of doing proofs with a machine
inferredcites →https://doi.org/10.1007/3-540-10009-1_8openalex-snapshot
Decision procedures for some fragments of set theory
inferredcites →https://doi.org/10.1016/0004-3702(74)90015-0openalex-snapshot
Reasoning about programs
inferredcites →https://doi.org/10.1016/b978-0-934613-03-3.50016-7openalex-snapshot
Prolegomena to a Theory of Mechanized Formal Reasoning
inferredcites →https://doi.org/10.1109/proc.1978.11114openalex-snapshot
SIFT: Design and analysis of a fault-tolerant computer for aircraft control
inferredcites →https://doi.org/10.1109/tc.1982.1676059openalex-snapshot
Formal Specification and Mechanical Verification of SIFT: A Fault-Tolerant Flight Control System
inferredcites →https://doi.org/10.1109/tse.1980.230459openalex-snapshot
Abstract Data Type Specification in the Affirm System
inferredcites →https://doi.org/10.1145/322123.322137openalex-snapshot
A Practical Decision Procedure for Arithmetic with Function Symbols
inferredcites →https://doi.org/10.1145/355602.361309openalex-snapshot
A technique for software module specification with examples
inferredcites →https://doi.org/10.1145/357073.357078openalex-snapshot
Verification of Array, Record, and Pointer Operations in Pascal
inferredcites →https://doi.org/10.1145/359461.359483openalex-snapshot
Proof techniques for hierarchically structured programs
inferredcites →https://doi.org/10.1145/390016.808471openalex-snapshot
Verifying programs by algebraic and logical reduction
inferredcites →https://doi.org/10.1145/512760.512775openalex-snapshot
A simplifier based on efficient decision algorithms
inferredcites →https://doi.org/10.1145/567752.567757openalex-snapshot
Principles of proving concurrent programs in Gypsy
inferredcites →https://doi.org/10.1145/800027.808471openalex-snapshot
Verifying programs by algebraic and logical reduction
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/spe.4380200804openalex-snapshot
Formal verification of safety‐critical systems
inferred← citeshttps://doi.org/10.1007/3-540-12896-4_380openalex-snapshot
An interval-based temporal logic
inferred← citeshttps://doi.org/10.1007/3-540-16047-7_35openalex-snapshot
From state machines to temporal logic: Specification methods for protocol standards
inferred← citeshttps://doi.org/10.1007/3-540-59047-1_53openalex-snapshot
A tutorial on using PVS for hardware verification
inferred← citeshttps://doi.org/10.1007/978-0-387-34768-4_4openalex-snapshot
EKL—A Mathematically Oriented Proof Checker
inferred← citeshttps://doi.org/10.1007/978-1-4020-6254-4_17openalex-snapshot
Beyond Satisfiability: Extensions and Applications
inferred← citeshttps://doi.org/10.1007/978-1-4471-3431-2_6openalex-snapshot
Real-Time and Safety-Critical Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-69394-6_25openalex-snapshot
The Problem of Confidence in Fault-Tolerant Computer Design
inferred← citeshttps://doi.org/10.1007/978-3-642-95432-0_11openalex-snapshot
Verification of VLSI Designs
inferred← citeshttps://doi.org/10.1007/978-3-7091-8871-2_5openalex-snapshot
A History of Research in Fault Tolerant Computing at SRI International
inferred← citeshttps://doi.org/10.1007/bfb0012842openalex-snapshot
A decision procedure for unquantified formulas of graph theory
inferred← citeshttps://doi.org/10.1016/0004-3702(84)90044-4openalex-snapshot
Verify: A program for proving correctness of digital hardware designs
inferred← citeshttps://doi.org/10.1109/hol.1991.596287openalex-snapshot
Design Choices In Specification Languages And Verification Systems
inferred← citeshttps://doi.org/10.1109/tc.1982.1676059openalex-snapshot
Formal Specification and Mechanical Verification of SIFT: A Fault-Tolerant Flight Control System
inferred← citeshttps://doi.org/10.1109/tcom.1982.1095451openalex-snapshot
From State Machines to Temporal Logic: Specification Methods for Protocol Standards
inferred← citeshttps://doi.org/10.1145/1592434.1592437openalex-snapshot
Automated deduction for verification
inferred← citeshttps://doi.org/10.1145/2422.322411openalex-snapshot
Deciding Combinations of Theories
inferred← citeshttps://doi.org/10.1145/3477355.3477362openalex-snapshot
The First Fifteen Years of the Verified Software Project
inferred← citeshttps://doi.org/10.1145/800221.806720openalex-snapshot
An interval logic for higher-level temporal reasoning
inferred← citeshttps://doi.org/10.20868/upm.thesis.35305openalex-snapshot
Método para el análisis independiente de problemas
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.