On the public citation graph
Predicate Abstraction via Symbolic Decision Procedures
0 signed · 57 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/11513988_5openalex-snapshot
Predicate Abstraction via Symbolic Decision Procedures
inferredcites →https://doi.org/10.1007/3-540-45657-0_16openalex-snapshot
Deciding Separation Formulas with SAT
inferredcites →https://doi.org/10.1007/3-540-45657-0_19openalex-snapshot
Applying SAT Methods in Unbounded Symbolic Model Checking
inferredcites →https://doi.org/10.1007/3-540-48683-6_16openalex-snapshot
Experience with Predicate Abstraction
inferredcites →https://doi.org/10.1007/3-540-48683-6_38openalex-snapshot
Abstract and Model Check while You Prove
inferredcites →https://doi.org/10.1007/3-540-63166-6_10openalex-snapshot
Construction of abstract state graphs with PVS
inferredcites →https://doi.org/10.1007/978-3-540-24730-2_30openalex-snapshot
Refining Approximations in Software Predicate Abstraction
inferredcites →https://doi.org/10.1007/978-3-540-27813-9_36openalex-snapshot
Zapato: Automatic Theorem Proving for Predicate Abstraction Refinement
inferredcites →https://doi.org/10.1007/978-3-540-45069-6_15openalex-snapshot
A Symbolic Approach to Predicate Abstraction
inferredcites →https://doi.org/10.1016/0097-3165(73)90004-6openalex-snapshot
Fourier-Motzkin elimination and its dual
inferredcites →https://doi.org/10.1023/b:form.0000040025.89719.f3openalex-snapshot
Predicate Abstraction of ANSI-C Programs Using SAT
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/lics.2001.932482openalex-snapshot
Successive approximation of abstract transition relations
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1109/tse.2004.22openalex-snapshot
Modular verification of software components in C
inferredcites →https://doi.org/10.1145/2442776.2442783openalex-snapshot
Automatic predicate abstraction of C programs
inferredcites →https://doi.org/10.1145/322186.322198openalex-snapshot
Fast Decision Procedures Based on Congruence Closure
inferredcites →https://doi.org/10.1145/357073.357079openalex-snapshot
Simplification by Cooperating Decision Procedures
inferredcites →https://doi.org/10.1145/378795.378846openalex-snapshot
Automatic predicate abstraction of C programs
inferredcites →https://doi.org/10.1145/381694.378846openalex-snapshot
Automatic predicate abstraction of C programs
inferredcites →https://doi.org/10.1145/503272.503291openalex-snapshot
Predicate abstraction for software verification
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11576280_23openalex-snapshot
Using Stålmarck’s Algorithm to Prove Inequalities
inferred← citeshttps://doi.org/10.1007/11591191_2openalex-snapshot
Zap: Automated Theorem Proving for Software Analysis
inferred← citeshttps://doi.org/10.1007/11691372_16openalex-snapshot
Approximating Predicate Images for Bit-Vector Logic
inferred← citeshttps://doi.org/10.1007/11817963_39openalex-snapshot
SMT Techniques for Fast Predicate Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-540-69149-5_46openalex-snapshot
Decision Procedures for the Grand Challenge
inferred← citeshttps://doi.org/10.1007/978-3-540-73368-3_23openalex-snapshot
Array Abstractions from Proofs
inferred← citeshttps://doi.org/10.1007/978-3-540-78739-6_16openalex-snapshot
Cover Algorithms and Their Combination
inferred← citeshttps://doi.org/10.1007/978-3-540-88387-6_10openalex-snapshot
Loop Summarization Using Abstract Transformers
inferred← citeshttps://doi.org/10.1007/978-3-642-15297-9_4openalex-snapshot
A Framework for Verification of Software with Time and Probabilities
inferred← citeshttps://doi.org/10.1007/978-3-642-20398-5_11openalex-snapshot
Efficient Predicate Abstraction of Program Summaries
inferred← citeshttps://doi.org/10.1007/978-3-642-35873-9_8openalex-snapshot
Reductions for Synthesis Procedures
inferred← citeshttps://doi.org/10.1007/s10703-012-0176-yopenalex-snapshot
Loop summarization using state and transition invariants
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.10.016openalex-snapshot
A Term Rewriting Technique for Decision Graphs
inferred← citeshttps://doi.org/10.1093/comjnl/bxl039openalex-snapshot
Verifying an ATM Protocol Using a Combination of Formal Techniques
inferred← citeshttps://doi.org/10.1109/date.2010.5457090openalex-snapshot
Tighter integration of BDDs and SMT for Predicate Abstraction
inferred← citeshttps://doi.org/10.1109/famcad.2007.35openalex-snapshot
Computing Predicate Abstractions by Integrating BDDs and SMT Solvers
inferred← citeshttps://doi.org/10.1145/1217935.1217943openalex-snapshot
Thorough static analysis of device drivers
inferred← citeshttps://doi.org/10.1145/1218063.1217943openalex-snapshot
Thorough static analysis of device drivers
inferred← citeshttps://doi.org/10.1145/1250734.1250750openalex-snapshot
Automatic inference of optimizer flow functions from semantic meanings
inferred← citeshttps://doi.org/10.1145/1273442.1250750openalex-snapshot
Automatic inference of optimizer flow functions from semantic meanings
inferred← citeshttps://doi.org/10.1145/1529282.1529404openalex-snapshot
The synergy of precise and fast abstractions for program verification
inferred← citeshttps://doi.org/10.1145/3686153openalex-snapshot
Invariant Checking for SMT-Based Systems with Quantifiers
inferred← citeshttps://doi.org/10.4204/eptcs.10.3openalex-snapshot
Automated Predicate Abstraction for Real-Time Models
inferred← citeshttps://doi.org/10.5075/epfl-thesis-5581openalex-snapshot
Programming with Specifications
inferred← citeshttps://doi.org/10.5287/ora-y0bamqrpdopenalex-snapshot
Automated quantitative software verification
inferred← citeshttps://doi.org/10.5555/1998496.1998508openalex-snapshot
SLAM2: static driver verification with under 4% false alarms
showing the first 32 of 33 · page through all 33
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.