On the public citation graph
Formal verification using edge-valued binary decision diagrams
0 signed · 54 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-52148-8_30openalex-snapshot
Verification of synchronous sequential machines based on symbolic execution
inferredcites →https://doi.org/10.1007/978-3-642-85823-9openalex-snapshot
Boolean Methods in Operations Research and Related Areas
inferredcites →https://doi.org/10.1023/a:1008647823331openalex-snapshot
Multi-Terminal Binary Decision Diagrams: An Efficient Data Structure for Matrix Representation
inferredcites →https://doi.org/10.1109/12.144618openalex-snapshot
On the OBDD-representation of general Boolean functions
inferredcites →https://doi.org/10.1109/12.30850openalex-snapshot
Representational and denotational semantics of digital systems
inferredcites →https://doi.org/10.1109/43.298033openalex-snapshot
EVBDD-based algorithms for integer linear programming, spectral transformation, and function decomposition
inferredcites →https://doi.org/10.1109/dac.1990.114826openalex-snapshot
Efficient implementation of a BDD package
inferredcites →https://doi.org/10.1109/dac.1992.227813openalex-snapshot
Edge-valued binary decision for multi-level hierarchical verification
inferredcites →https://doi.org/10.1109/iccad.1990.129849openalex-snapshot
Algorithms for discrete function manipulation
inferredcites →https://doi.org/10.1109/iccad.1993.580162openalex-snapshot
FGILP: An integer linear program solver based on function graphs
inferredcites →https://doi.org/10.1109/iccd.1992.276313openalex-snapshot
Boolean matching using binary decision diagrams with applications to logic synthesis and verification
inferredcites →https://doi.org/10.1109/tc.1982.1675978openalex-snapshot
Hardware Specification with Temporal Logic: An Example
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1112/jlms/s1-44.1.663bopenalex-snapshot
BOOLEAN METHODS IN OPERATIONS RESEARCH AND RELATED AREAS
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.164569openalex-snapshot
Spectral transforms for large boolean functions with applications to technology mapping
inferredcites →https://doi.org/10.1145/157485.165078openalex-snapshot
BDD based decomposition of logic functions with application to FPGA synthesis
inferredcites →https://doi.org/10.1145/3318.3322openalex-snapshot
CIRCAL and the representation of communication, concurrency, and time
inferredcites →https://doi.org/10.1145/37888.37890openalex-snapshot
COSMOS: a compiled simulator for MOS circuits
inferredcites →https://doi.org/10.1145/5397.5399openalex-snapshot
Automatic verification of finite-state concurrent systems using temporal logic specifications
inferredcites →https://doi.org/10.1184/r1/6607613openalex-snapshot
Multi-Terminal Binary Decision Diagrams: An Efficient Data Structure for Matrix Representation
inferredcites →https://doi.org/10.25549/usctheses-c20-173557openalex-snapshot
Logic verification and synthesis using function graphs
inferredcites →https://doi.org/10.5555/113938.149642openalex-snapshot
Edge-valued binary decision diagrams for multi-level hierarchical verification
inferredcites →https://doi.org/10.5555/259794.259903openalex-snapshot
FGILP: an integer linear program solver based on function graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11549970_2openalex-snapshot
Implicit Representations and Algorithms for the Logic and Stochastic Analysis of Discrete–State Systems
inferred← citeshttps://doi.org/10.1007/3-540-36126-x_16openalex-snapshot
Using Edge-Valued Decision Diagrams for Symbolic Generation of Shortest Paths
inferred← citeshttps://doi.org/10.1007/978-1-4613-1385-4_5openalex-snapshot
Edge Valued Binary Decision Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-319-10885-8_17openalex-snapshot
Explicit State Space and Markov Chain Generation Using Decision Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-642-13675-7_19openalex-snapshot
GreatSPN Enhanced with Decision Diagram Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-29072-5_3openalex-snapshot
Ten Years of Saturation: A Petri Net Perspective
inferred← citeshttps://doi.org/10.1016/j.artint.2024.104174openalex-snapshot
Boosting optimal symbolic planning: Operator-potential heuristics
inferred← citeshttps://doi.org/10.1016/j.peva.2009.12.008openalex-snapshot
Symbolic partition refinement with automatic balancing of time and space
inferred← citeshttps://doi.org/10.1023/a:1008691605584openalex-snapshot
Factored Edge-Valued Binary Decision Diagrams
inferred← citeshttps://doi.org/10.1049/iet-cds:20060263openalex-snapshot
Fastest linearly independent arithmetic transforms and their calculation on systolic array processors
inferred← citeshttps://doi.org/10.1109/icece.2010.875openalex-snapshot
Design of Microsecond Level and High Current Pulse Driver Systems for Quantum Cascade Lasers
inferred← citeshttps://doi.org/10.1109/qest.2008.14openalex-snapshot
Symbolic Partition Refinement with Dynamic Balancing of Time and Space
inferred← citeshttps://doi.org/10.1109/qest.2010.34openalex-snapshot
Meddly: Multi-terminal and Edge-Valued Decision Diagram LibrarY
inferred← citeshttps://doi.org/10.1109/tr.2015.2449292openalex-snapshot
Transient Reward Approximation for Continuous-Time Markov Chains
inferred← citeshttps://doi.org/10.1109/vlsi.2008.108openalex-snapshot
Enhanced TED: A New Data Structure for RTL Verification
inferred← citeshttps://doi.org/10.1109/vtest.2000.843855openalex-snapshot
Using arithmetic transform for verification of datapath circuits via error modeling
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.8853openalex-snapshot
A Knowledge Compilation Map for Ordered Real-Valued Decision Diagrams
inferred← citeshttps://doi.org/10.1609/aaai.v32i1.12088openalex-snapshot
On the Relationship Between State-Dependent Action Costs and Conditional Effects in Planning
inferred← citeshttps://doi.org/10.1609/aaai.v35i13.17422openalex-snapshot
Symbolic Search for Oversubscription Planning
inferred← citeshttps://doi.org/10.1609/icaps.v26i1.13742openalex-snapshot
Abstractions for Planning with State-Dependent Action Costs
inferred← citeshttps://doi.org/10.1609/icaps.v28i1.13890openalex-snapshot
Symbolic Planning with Edge-Valued Multi-Valued Decision Diagrams
inferred← citeshttps://doi.org/10.1609/icaps.v29i1.3481openalex-snapshot
Planning with Global State Constraints and State-Dependent Action Costs
inferred← citeshttps://doi.org/10.32657/10356/3489openalex-snapshot
Spectral techniques : algorithms, analyses and applications
inferred← citeshttps://doi.org/10.5451/unibas-ep45218openalex-snapshot
State-dependent Cost Partitionings for Cartesian Abstractions in Classical Planning
inferred← citeshttps://doi.org/10.5539/cis.v1n2p0openalex-snapshot
Computer and Information Science, Vol. 1, No. 2, May 2008, all in one file
inferred← citeshttps://doi.org/10.5539/cis.v1n2p56openalex-snapshot
An Efficient Method for Generating Optimal OBDD of Boolean Functions
inferred← citeshttps://doi.org/10.6109/jicce.2011.9.3.276openalex-snapshot
Switching Function using Edge-Valued Decision Diagram
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.