On the public citation graph
Boolean Satisfiability with Transitivity Constraints
0 signed · 74 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/10722167_6openalex-snapshot
Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits
inferredcites →https://doi.org/10.1007/11527695_13openalex-snapshot
Using DPLL for Efficient OBDD Construction
inferredcites →https://doi.org/10.1007/3-540-46029-2_13openalex-snapshot
PRISM: Probabilistic Symbolic Model Checker
inferredcites →https://doi.org/10.1007/3-540-46419-0_27openalex-snapshot
Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
inferredcites →https://doi.org/10.1007/3-540-48159-1_5openalex-snapshot
The Impact of Branching Heuristics in Propositional Satisfiability Algorithms
inferredcites →https://doi.org/10.1007/3-540-49519-3_18openalex-snapshot
A Performance Study of BDD-Based Model Checking
inferredcites →https://doi.org/10.1007/3-540-52148-8_30openalex-snapshot
Verification of synchronous sequential machines based on symbolic execution
inferredcites →https://doi.org/10.1007/3-540-57568-5_270openalex-snapshot
The complexity of the optimal variable ordering problems of shared binary decision diagrams
inferredcites →https://doi.org/10.1007/978-1-4613-2821-6openalex-snapshot
Logic Minimization Algorithms for VLSI Synthesis
inferredcites →https://doi.org/10.1007/978-3-540-69850-0_9openalex-snapshot
A View from the Engine Room: Computational Support for Symbolic Model Checking
inferredcites →https://doi.org/10.1007/bfb0031826openalex-snapshot
BDDs vs. Zero-Suppressed BDDs: for CTL symbolic model checking of Petri nets
inferredcites →https://doi.org/10.1007/s10009-005-0188-7openalex-snapshot
The saturation algorithm for symbolic state-space exploration
inferredcites →https://doi.org/10.1007/s100090100042openalex-snapshot
Efficient manipulation of decision diagrams
inferredcites →https://doi.org/10.1007/s100090100056openalex-snapshot
Binary decision diagrams in theory and practice
inferredcites →https://doi.org/10.1016/0020-0190(93)90256-9openalex-snapshot
Reduction of OBDDs in linear time
inferredcites →https://doi.org/10.1016/0022-247x(70)90282-9openalex-snapshot
Triangulated graphs and the elimination process
inferredcites →https://doi.org/10.1016/0890-5401(92)90017-aopenalex-snapshot
Symbolic model checking: 1020 States and beyond
inferredcites →https://doi.org/10.1016/j.entcs.2013.07.009openalex-snapshot
Multi-Core BDD Operations for Symbolic Reachability
inferredcites →https://doi.org/10.1038/218306c0openalex-snapshot
“Memo” Functions and Machine Learning
inferredcites →https://doi.org/10.1109/12.537122openalex-snapshot
Improving the variable ordering of OBDDs is NP-complete
inferredcites →https://doi.org/10.1109/12.73590openalex-snapshot
On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
inferredcites →https://doi.org/10.1109/43.275352openalex-snapshot
Symbolic model checking for sequential circuit verification
inferredcites →https://doi.org/10.1109/43.913762openalex-snapshot
CMOS circuit verification with symbolic switch-level timing simulation
inferredcites →https://doi.org/10.1109/aspdac.1998.669515openalex-snapshot
Space- and time-efficient BDD construction via working set control
inferredcites →https://doi.org/10.1109/dac.1999.781225openalex-snapshot
Using lower bounds during dynamic BDD minimization
inferredcites →https://doi.org/10.1109/iccad.1988.122451openalex-snapshot
Logic verification using binary decision diagrams in a logic synthesis environment
inferredcites →https://doi.org/10.1109/iccad.1993.580054openalex-snapshot
Algebraic decision diagrams and their applications
inferredcites →https://doi.org/10.1109/iccad.1995.479994openalex-snapshot
Who are the variables in your neighbourhood
inferredcites →https://doi.org/10.1109/iccad.2001.968669openalex-snapshot
Faster SAT and smaller BDDs via common function structure
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1145/123186.123222openalex-snapshot
Efficient implementation of a BDD package
inferredcites →https://doi.org/10.1145/136035.136043openalex-snapshot
Symbolic Boolean manipulation with ordered binary-decision diagrams
inferredcites →https://doi.org/10.1145/157485.164890openalex-snapshot
Zero-suppressed BDDs for set manipulation in combinatorial problems
inferredcites →https://doi.org/10.1145/1837210.1837222openalex-snapshot
Parallel disk-based computation for large, monolithic binary decision diagrams
inferredcites →https://doi.org/10.1145/196244.196379openalex-snapshot
BDD variable ordering for interacting finite state machines
inferredcites →https://doi.org/10.1145/240518.240623openalex-snapshot
Techniques for verifying superscalar microprocessors
inferredcites →https://doi.org/10.1145/240518.240639openalex-snapshot
Implementation of an efficient parallel BDD package
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.1145/371282.371364openalex-snapshot
Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic
inferredcites →https://doi.org/10.1145/776038.776039openalex-snapshot
Checking satisfiability of a conjunction of BDDs
inferredcites →https://doi.org/10.13182/nse70-a19705openalex-snapshot
The Art of Computer Programming
inferredcites →https://doi.org/10.5555/191326.191593openalex-snapshot
Efficient breadth-first manipulation of binary decision diagrams
inferredcites →https://doi.org/10.5555/224841.225047openalex-snapshot
Binary decision diagrams and beyond: enabling technologies for formal verification
inferredcites →https://doi.org/10.5555/259794.259803openalex-snapshot
Breadth-first manipulation of very large binary-decision diagrams
inferredcites →https://doi.org/10.5555/285730.285764openalex-snapshot
Proving circuit correctness using formal comparison between expected and extracted behaviour
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10722167_10openalex-snapshot
Boolean Satisfiability with Transitivity Constraints
inferred← citeshttps://doi.org/10.1007/11513988_32openalex-snapshot
Yet Another Decision Procedure for Equality Logic
inferred← citeshttps://doi.org/10.1007/3-540-36126-x_10openalex-snapshot
On Solving Presburger and Linear Arithmetic with SAT
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_13openalex-snapshot
Finite Instantiations in Equivalence Logic with Uninterpreted Functions
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_20openalex-snapshot
EVC: A Validity Checker for the Logic of Equality with Uninterpreted Functions and Memories, Exploiting Positive Equality, and Conservative Transformations
inferred← citeshttps://doi.org/10.1007/3-540-45294-x_27openalex-snapshot
Range Allocation for Equivalence Logic
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_18openalex-snapshot
Automatic Abstraction of Memories in the Formal Verification of Superscalar Microprocessors
inferred← citeshttps://doi.org/10.1007/3-540-45657-0_7openalex-snapshot
Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-45069-6_34openalex-snapshot
Theorem Proving Using Lazy Proof Explication
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-03351-3_30openalex-snapshot
Formal Verification of Gate-Level Computer Systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.04.077openalex-snapshot
Generating Minimum Transitivity Constraints in P-time for Deciding Equality Logic
inferred← citeshttps://doi.org/10.1016/j.ic.2005.08.001openalex-snapshot
Building small equality graphs for deciding equality logic with uninterpreted functions
inferred← citeshttps://doi.org/10.1023/a:1022988809947openalex-snapshot
BDD Based Procedures for a Theory of Equality with Uninterpreted Functions
inferred← citeshttps://doi.org/10.1109/dac.2002.1012720openalex-snapshot
Satometer: how much have we searched?
inferred← citeshttps://doi.org/10.1109/hldvt.2001.972803openalex-snapshot
Symbolic simulation heuristics for high-level design descriptions with uninterpreted functions
inferred← citeshttps://doi.org/10.1109/hldvt.2001.972806openalex-snapshot
Symbolic simulation techniques-state-of-the-art and applications
inferred← citeshttps://doi.org/10.1109/hldvt.2001.972816openalex-snapshot
Experience with term level modeling and verification of the M*CORE/sup TM/ microprocessor core
inferred← citeshttps://doi.org/10.1109/memcod.2011.5970508openalex-snapshot
Controller synthesis for pipelined circuits using uninterpreted functions
inferred← citeshttps://doi.org/10.1109/tcad.2003.814960openalex-snapshot
Satometer: how much have we searched?
inferred← citeshttps://doi.org/10.1145/775832.775945openalex-snapshot
A hybrid SAT-based decision procedure for separation logic with uninterpreted functions
inferred← citeshttps://doi.org/10.18260/1-2--11927openalex-snapshot
Integrating Formal Verification Into An Advanced Computer Architecture Course
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.