On the public citation graph

Deciding combinations of theories

https://doi.org/10.1007/bfb0000061
0 signed · 35 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bfb0000050openalex-snapshot
STP: A mechanized logic for specification and verification
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.1145/321879.321884openalex-snapshot
Efficiency of a Good But Not Linear Set Union Algorithm
inferredcites →https://doi.org/10.1145/322123.322137openalex-snapshot
A Practical Decision Procedure for Arithmetic with Function Symbols
inferredcites →https://doi.org/10.1145/322186.322198openalex-snapshot
Fast Decision Procedures Based on Congruence Closure
inferredcites →https://doi.org/10.1145/322217.322228openalex-snapshot
Variations on the Common Subexpression Problem
inferredcites →https://doi.org/10.1145/357073.357079openalex-snapshot
Simplification by Cooperating Decision Procedures
inferredcites →https://doi.org/10.1145/359545.359570openalex-snapshot
An algorithm for reasoning about equality

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-16780-3_102openalex-snapshot
Theory links in semantic graphs
inferred← citeshttps://doi.org/10.1007/3-540-49477-4_37openalex-snapshot
Automated Theorem Proving in a Combination of Theories with Disjoint Signatures
inferred← citeshttps://doi.org/10.1007/3-540-49519-3_25openalex-snapshot
Formally Verifying Data and Control with Weak Reachability Invariants
inferred← citeshttps://doi.org/10.1007/978-3-319-08867-9_49openalex-snapshot
Yices 2.2
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_27openalex-snapshot
Twenty Years Later
inferred← citeshttps://doi.org/10.1007/978-3-540-74105-3openalex-snapshot
Decision Procedures: An Algorithmic Point of View
inferred← citeshttps://doi.org/10.1007/978-3-642-31365-3_26openalex-snapshot
Tableaux Modulo Theories Using Superdeduction
inferred← citeshttps://doi.org/10.1007/978-3-642-95432-0_11openalex-snapshot
Verification of VLSI Designs
inferred← citeshttps://doi.org/10.1007/bf02432150openalex-snapshot
A decision procedure for combinations of propositional temporal logic and other specialized theories
inferred← citeshttps://doi.org/10.1007/bfb0000050openalex-snapshot
STP: A mechanized logic for specification and verification
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2018.03.004openalex-snapshot
Satisfiability modulo theories for process systems engineering
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.08.030openalex-snapshot
From diagrammatic confluence to modularity
inferred← citeshttps://doi.org/10.1016/s0747-7171(87)80064-0openalex-snapshot
Theory links: Applications to automated theorem proving
inferred← citeshttps://doi.org/10.1023/a:1015707001763openalex-snapshot
A General Setting for Flexibly Combining and Augmenting Decision Procedures
inferred← citeshttps://doi.org/10.1109/lics.1988.5110openalex-snapshot
Unification in free extensions of Boolean rings and Abelian groups
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.1145/1010809.1010810openalex-snapshot
The proof of SIFT
inferred← citeshttps://doi.org/10.1145/170791.170810openalex-snapshot
A multi-theory constraint satisfaction system
inferred← citeshttps://doi.org/10.1145/2888393openalex-snapshot
Control Explicit--Data Symbolic Model Checking
inferred← citeshttps://doi.org/10.1145/298595.298603openalex-snapshot
Checking properties of safety critical specifications using efficient decision procedures
inferred← citeshttps://doi.org/10.1145/64135.65018openalex-snapshot
TEAM: a support environment for testing, evaluation, and analysis
inferred← citeshttps://doi.org/10.1201/b19569-25openalex-snapshot
Formal Property Verification
inferred← citeshttps://doi.org/10.15514/ispras-2013-24-12openalex-snapshot
Introduction to CEGAR — Counter-Example Guided Abstraction Refinement
inferred← citeshttps://doi.org/10.1609/aimag.v11i4.877openalex-snapshot
A bibliography on hybrid reasoning
inferred← citeshttps://doi.org/10.70675/3ca47f5aza306z4af4z9346zaa1e7a1b40f8openalex-snapshot
Méthodes pour le raisonnement d'ordre supérieur dans SMT
inferred← citeshttps://doi.org/10.7146/brics.v6i18.20075openalex-snapshot
Solving Bit-Vector Equations of Fixed and Non-Fixed Size
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.