On the public citation graph

The power of QDDs (extended abstract)

0 signed · 86 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.1006/inco.1994.1092openalex-snapshot

Reasoning about Infinite Computations

inferredcites →https://doi.org/10.1007/3-540-58179-0_43openalex-snapshot

Symbolic verification with periodic sets

inferredcites →https://doi.org/10.1007/3-540-58179-0_69openalex-snapshot

Combining partial order reductions with on-the-fly model-checking

inferredcites →https://doi.org/10.1007/3-540-58201-0_78openalex-snapshot

Undecidable verification problems for programs with unreliable channels

inferredcites →https://doi.org/10.1007/3-540-60761-7openalex-snapshot

Partial-Order Methods for the Verification of Concurrent Systems

inferredcites →https://doi.org/10.1007/3-540-61474-5_53openalex-snapshot

Symbolic verification of communication protocols with infinite state spaces using QDDs

inferredcites →https://doi.org/10.1007/978-0-387-35079-0_23openalex-snapshot

Finitely Representing Infinite Reachability Graphs of CFSMs with Graph Grammars

inferredcites →https://doi.org/10.1007/978-1-4612-0931-7openalex-snapshot

The Temporal Logic of Reactive and Concurrent Systems

inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_23openalex-snapshot

On a Decision Method in Restricted Second Order Arithmetic

inferredcites →https://doi.org/10.1007/bf00709154openalex-snapshot

A stubborn attack on state explosion

inferredcites →https://doi.org/10.1007/bfb0020809openalex-snapshot

Testing for unboundedness of Fifo channels

inferredcites →https://doi.org/10.1016/0304-3975(87)90008-9openalex-snapshot

The complementation problem for Büchi automata with applications to temporal logic

inferredcites →https://doi.org/10.1016/0304-3975(93)90212-copenalex-snapshot

Testing for unboundedness of fifo channels

inferredcites →https://doi.org/10.1016/s1571-0661(05)80200-2openalex-snapshot

Model-Checking of Infinite Kripke Structures Defined by Simple Graph Grammars

inferredcites →https://doi.org/10.1023/a:1008719024240openalex-snapshot

Symbolic Verification of Communication Protocols with Infinite State Spaces using QDDs

inferredcites →https://doi.org/10.1109/lics.1996.561318openalex-snapshot

Symbolic protocol verification with queue BDDs

inferredcites →https://doi.org/10.1109/sfcs.1988.21948openalex-snapshot

On the complexity of omega -automata

inferredcites →https://doi.org/10.1145/300307.1040360openalex-snapshot

Elements of the Theory of Computation

inferredcites →https://doi.org/10.1145/322374.322380openalex-snapshot

On Communicating Finite-State Machines

inferredcites →https://doi.org/10.1145/512950.512973openalex-snapshot

Abstract interpretation

inferredcites →https://doi.org/10.1145/5397.5399openalex-snapshot

Automatic verification of finite-state concurrent systems using temporal logic specifications

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11562948_35openalex-snapshot

Flat Acceleration in Symbolic Model Checking

inferred← citeshttps://doi.org/10.1007/11562948_36openalex-snapshot

Flat Counter Automata Almost Everywhere!

inferred← citeshttps://doi.org/10.1007/11609773_17openalex-snapshot

Piecewise FIFO Channels Are Analyzable

inferred← citeshttps://doi.org/10.1007/11784180_17openalex-snapshot

Verification of Communication Protocols Using Abstract Interpretation of FIFO Queues

inferred← citeshttps://doi.org/10.1007/11812128_27openalex-snapshot

A Finite Union of DFAs in Symbolic Model Checking of Infinite Systems

inferred← citeshttps://doi.org/10.1007/3-540-36206-1_14openalex-snapshot

How to Compose Presburger-Accelerations: Applications to Broadcast Protocols

inferred← citeshttps://doi.org/10.1007/3-540-44618-4_40openalex-snapshot

Well-Abstracted Transition Systems

inferred← citeshttps://doi.org/10.1007/3-540-44685-0_1openalex-snapshot

Channel Representations in Protocol Verification

inferred← citeshttps://doi.org/10.1007/3-540-45294-x_14openalex-snapshot

Beyond Regular Model Checking

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/3-540-45694-5_9openalex-snapshot

Regular Model Checking Made Simple and Effcient*

inferred← citeshttps://doi.org/10.1007/3-540-45739-9_22openalex-snapshot

Eliminating Queues from RT UML Model Representations

inferred← citeshttps://doi.org/10.1007/3-540-46419-0_16openalex-snapshot

Transitive Closures of Regular Relations for Verifying Infinite-State Systems

inferred← citeshttps://doi.org/10.1007/3-540-48683-6_14openalex-snapshot

Handling Global Conditions in Parametrized System Verification

inferred← citeshttps://doi.org/10.1007/978-3-030-30806-3_12openalex-snapshot

Reachability Problems on Partially Lossy Queue Automata

inferred← citeshttps://doi.org/10.1007/978-3-030-76983-3_2openalex-snapshot

Flat Petri Nets (Invited Talk)

inferred← citeshttps://doi.org/10.1007/978-3-030-91384-7_5openalex-snapshot

Regular Model Checking: Evolution and Perspectives

inferred← citeshttps://doi.org/10.1007/978-3-319-47846-3_6openalex-snapshot

A Case Study of Formal Approach to Dynamically Reconfigurable Systems by Using Dynamic Linear Hybrid Automata

inferred← citeshttps://doi.org/10.1007/978-3-540-24730-2_41openalex-snapshot

Omega-Regular Model Checking

inferred← citeshttps://doi.org/10.1007/978-3-540-28644-8_26openalex-snapshot

On Flatness for 2-Dimensional Vector Addition Systems with States

inferred← citeshttps://doi.org/10.1007/978-3-540-28644-8_3openalex-snapshot

A Survey of Regular Model Checking

inferred← citeshttps://doi.org/10.1007/978-3-540-30476-0_22openalex-snapshot

Composition of Accelerations to Verify Infinite Heterogeneous Systems

inferred← citeshttps://doi.org/10.1007/978-3-540-30538-5_12openalex-snapshot

Symbolic Reachability Analysis of Higher-Order Context-Free Processes

inferred← citeshttps://doi.org/10.1007/978-3-540-69149-5_36openalex-snapshot

Scalable Software Model Checking Using Design for Verification

inferred← citeshttps://doi.org/10.1007/978-3-540-74061-2_12openalex-snapshot

Accelerated Data-Flow Analysis

inferred← citeshttps://doi.org/10.1007/978-3-540-74061-2_4openalex-snapshot

Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to Verification

inferred← citeshttps://doi.org/10.1007/978-3-642-02652-2_11openalex-snapshot

Extrapolation-Based Path Invariants for Abstraction Refinement of Fifo Systems

inferred← citeshttps://doi.org/10.1007/978-3-642-13089-2_4openalex-snapshot

Analysis of Communicating Automata

inferred← citeshttps://doi.org/10.1007/978-3-642-15375-4_4openalex-snapshot

Taming Distributed Asynchronous Systems

inferred← citeshttps://doi.org/10.1007/978-3-642-16164-3_16openalex-snapshot

An Automata-Based Symbolic Approach for Verifying Programs on Relaxed Memory Models

inferred← citeshttps://doi.org/10.1007/978-3-642-21461-5_13openalex-snapshot

Global State Estimates for Distributed Systems

inferred← citeshttps://doi.org/10.1007/978-3-642-22306-8_10openalex-snapshot

A Verification-Based Approach to Memory Fence Insertion in Relaxed Memory Systems

inferred← citeshttps://doi.org/10.1007/978-3-642-36742-7_24openalex-snapshot

A Verification-Based Approach to Memory Fence Insertion in PSO Memory Systems

inferred← citeshttps://doi.org/10.1007/978-3-642-38592-6_16openalex-snapshot

Asynchronously Communicating Visibly Pushdown Systems

inferred← citeshttps://doi.org/10.1007/bfb0028736openalex-snapshot

Verifying systems with infinite but regular state spaces

inferred← citeshttps://doi.org/10.1007/s00165-015-0340-4openalex-snapshot

Accelerating worst case execution time analysis of timed automata models with cyclic behaviour

inferred← citeshttps://doi.org/10.1007/s00224-021-10031-2openalex-snapshot

Reachability Problems on Reliable and Lossy Queue Automata

inferred← citeshttps://doi.org/10.1007/s10009-011-0206-xopenalex-snapshot

Domain-specific regular acceleration

inferred← citeshttps://doi.org/10.1007/s10009-011-0216-8openalex-snapshot

Regular model checking

inferred← citeshttps://doi.org/10.1016/j.entcs.2005.04.002openalex-snapshot

Regularity Results for FIFO Channels

inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.020openalex-snapshot

On the Use of Automata-based Techniques in Symbolic Model Checking

inferred← citeshttps://doi.org/10.1016/j.ic.2006.01.005openalex-snapshot

A Kleene theorem and model checking algorithms for existentially bounded communicating automata

inferred← citeshttps://doi.org/10.1016/j.scico.2004.08.002openalex-snapshot

Model-checking processes with data

inferred← citeshttps://doi.org/10.1016/j.tcs.2005.06.016openalex-snapshot

Parameterised boolean equation systems

inferred← citeshttps://doi.org/10.1016/j.tcs.2007.03.055openalex-snapshot

Algorithmic analysis of polygonal hybrid systems, part I: Reachability

inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00314-1openalex-snapshot

On iterating linear transformations over recognizable sets of integers

inferred← citeshttps://doi.org/10.1016/s0890-5401(02)00027-5openalex-snapshot

Well-abstracted transition systems: application to FIFO automata

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80473-0openalex-snapshot

Exact Acceleration of Real-Time Model Checking

inferred← citeshttps://doi.org/10.1023/a:1008719024240openalex-snapshot

Symbolic Verification of Communication Protocols with Infinite State Spaces using QDDs

inferred← citeshttps://doi.org/10.1023/b:form.0000033962.51898.1aopenalex-snapshot

Using Forward Reachability Analysis for Verification of Lossy Channel Systems

inferred← citeshttps://doi.org/10.1109/acsd.2006.29openalex-snapshot

Specification and Verification of Dynamic Communication Systems

inferred← citeshttps://doi.org/10.1109/gcce.2015.7398597openalex-snapshot

Formal verification of dynamically reconfigurable systems

inferred← citeshttps://doi.org/10.1109/sefm.2004.1347503openalex-snapshot

Symbolic verification of infinite systems using a finite union of DFAs

inferred← citeshttps://doi.org/10.1109/sefm.2004.40openalex-snapshot

Symbolic verification of infinite systems using a finite union of DFAs

inferred← citeshttps://doi.org/10.1145/1838552.1838554openalex-snapshot

On (Omega-)regular model checking

inferred← citeshttps://doi.org/10.1145/1993316.1993521openalex-snapshot

Partial-coherence abstractions for relaxed memory models

inferred← citeshttps://doi.org/10.1145/2071368.2071375openalex-snapshot

Reachability Problems in Piecewise FIFO Systems

inferred← citeshttps://doi.org/10.1145/332740.332746openalex-snapshot

Composite model-checking

inferred← citeshttps://doi.org/10.1145/773153.773154openalex-snapshot

E-services

inferred← citeshttps://doi.org/10.23638/lmcs-16(4:4)2020openalex-snapshot

Verification of Flat FIFO Systems

inferred← citeshttps://doi.org/10.4204/eptcs.370.13openalex-snapshot

Comparing Channel Restrictions of Communicating State Machines, High-level Message Sequence Charts, and Multiparty Session Types

inferred← citeshttps://doi.org/10.4236/jsea.2016.99030openalex-snapshot

Specification and Verification of Dynamically Reconfigurable Systems Using Dynamic Linear Hybrid Automata

inferred← citeshttps://doi.org/10.48550/arxiv.1709.07171openalex-snapshot

Computing Maximal Expected Termination Time of Probabilistic Timed Automata

inferred← citeshttps://doi.org/10.5282/edoc.12075openalex-snapshot

Behaviour and Refinement of Port-Based Components with Synchronous and Asynchronous Communication

inferred← citeshttps://doi.org/10.70675/61130ea1zef23z4950z81e1z91b74939ff7copenalex-snapshot

Vers la vériﬁcation de propriétés de sûreté pour des systèmes inﬁnis communicants : décidabilité et rafﬁnement des abstractions

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.