On the public citation graph
On-the-fly analysis of systems with unbounded, lossy FIFO channels
0 signed · 138 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.1006/inco.1996.0003openalex-snapshot
Unreliable Channels Are Easier to Verify Than Perfect Channels
inferredcites →https://doi.org/10.1006/inco.1996.0053openalex-snapshot
Verifying Programs with Unreliable Channels
inferredcites →https://doi.org/10.1006/inco.1996.0083openalex-snapshot
Undecidable Verification Problems for Programs with Unreliable Channels
inferredcites →https://doi.org/10.1007/3-540-55179-4_7openalex-snapshot
Automatic temporal verification of buffer systems
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-61474-5_53openalex-snapshot
Symbolic verification of communication protocols with infinite state spaces using QDDs
inferredcites →https://doi.org/10.1007/3-540-63165-8_211openalex-snapshot
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
inferredcites →https://doi.org/10.1007/bf00121128openalex-snapshot
Memory-efficient algorithms for the verification of temporal properties
inferredcites →https://doi.org/10.1016/0020-0271(72)90029-0openalex-snapshot
Computers and artificial intelligence
inferredcites →https://doi.org/10.1016/0376-5075(78)90015-6openalex-snapshot
Finite state description of communication protocols
inferredcites →https://doi.org/10.1016/s0304-3975(99)00033-xopenalex-snapshot
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
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.1112/plms/s3-2.1.326openalex-snapshot
Ordering by Divisibility in Abstract Algebras
inferredcites →https://doi.org/10.1145/117009.117015openalex-snapshot
Data flow analysis of communicating finite state machines
inferredcites →https://doi.org/10.1145/322374.322380openalex-snapshot
On Communicating Finite-State Machines
inferredcites →https://doi.org/10.5555/27738.27740openalex-snapshot
On deadlock detection in systems of communicating finite state machines
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10719839_37openalex-snapshot
Undecidable Problems in Unreliable Computations
inferred← citeshttps://doi.org/10.1007/10722167_26openalex-snapshot
Liveness and Acceleration in Parameterized Verification
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/3-540-44585-4_34openalex-snapshot
TReX: A Tool for Reachability Analysis of Complex 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-45500-0_19openalex-snapshot
Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems
inferred← citeshttps://doi.org/10.1007/3-540-45510-8_8openalex-snapshot
Verification of Systems with an Infinite State Space
inferred← citeshttps://doi.org/10.1007/3-540-45657-0_46openalex-snapshot
Extrapolating Tree Transformations
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-45687-2_45openalex-snapshot
On Verifying Fair Lossy Channel Systems
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-45789-5_7openalex-snapshot
Representing and Approximating Transfer Functions in Abstract Interpretation of Hetereogeneous Datatypes
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-47764-0_19openalex-snapshot
Analyzing Fair Parametric Extended Automata
inferred← citeshttps://doi.org/10.1007/3-540-48068-4_17openalex-snapshot
Tackling the Infinite State Space of a Multimedia Control Protocol Service Specification
inferred← citeshttps://doi.org/10.1007/3-540-48092-7_9openalex-snapshot
On the Existence of Network Invariants for Verifying Parameterized Systems
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_3openalex-snapshot
Languages, Rewriting Systems, and Verification of Infinite-State Systems
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_53openalex-snapshot
Effective Lossy Queue Languages
inferred← citeshttps://doi.org/10.1007/3-540-48294-6_11openalex-snapshot
State Space Reduction Based on Live Variables Analysis
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/3-540-48683-6_15openalex-snapshot
Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis
inferred← citeshttps://doi.org/10.1007/3-540-48778-6_3openalex-snapshot
Establishing Qualitative Properties for Probabilistic Lossy Channel Systems
inferred← citeshttps://doi.org/10.1007/3-540-49059-0_15openalex-snapshot
Symbolic Verification of Lossy Channel Systems: Application to the Bounded Retransmission Protocol
inferred← citeshttps://doi.org/10.1007/3-540-49253-4_10openalex-snapshot
Effective Recognizability and Model Checking of Reactive Fiffo Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-25540-4_6openalex-snapshot
Verifying Asynchronous Interactions via Communicating Session Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-72016-2_24openalex-snapshot
General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
inferred← citeshttps://doi.org/10.1007/978-3-030-72019-3_2openalex-snapshot
Data Flow Analysis of Asynchronous Systems using Infinite Abstract Domains
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-031-37709-9_17openalex-snapshot
Complete Multiparty Session Type Projection with Automata
inferred← citeshttps://doi.org/10.1007/978-3-031-56222-8_11openalex-snapshot
Newton’s Method – There and Back Again
inferred← citeshttps://doi.org/10.1007/978-3-031-91121-7_13openalex-snapshot
An Automata-theoretic Basis for Specification and Type Checking of Multiparty Protocols
inferred← citeshttps://doi.org/10.1007/978-3-319-07602-7_19openalex-snapshot
Compatibility Checking for Asynchronously Communicating Software
inferred← citeshttps://doi.org/10.1007/978-3-319-32582-8_1openalex-snapshot
Automated Analysis of Asynchronously Communicating Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-45994-3_1openalex-snapshot
The Ideal Theory for WSTS
inferred← citeshttps://doi.org/10.1007/978-3-540-24732-6_14openalex-snapshot
Polynomial Time Image Computation with Interval-Definable Counters Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-27813-9_28openalex-snapshot
Image Computation in Infinite State Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-27813-9_29openalex-snapshot
Abstract Regular Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_70openalex-snapshot
Complexity of Decision Problems for Simple Regular Expressions
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-30101-1_10openalex-snapshot
A Checker for Modal Formulae for Processes with Data
inferred← citeshttps://doi.org/10.1007/978-3-540-30206-3_24openalex-snapshot
Forward Reachability Analysis of Timed Petri Nets
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-30538-5_24openalex-snapshot
Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS
inferred← citeshttps://doi.org/10.1007/978-3-540-45069-6_24openalex-snapshot
Iterating Transducers in the Large (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-540-45099-3_4openalex-snapshot
A Transformational Approach for Generating Non-linear Invariants
inferred← citeshttps://doi.org/10.1007/978-3-540-85780-8_24openalex-snapshot
Derivation Tree Analysis for Accelerated Fixed-Point Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-02930-1_16openalex-snapshot
Forward Analysis for WSTS, Part II: Complete WSTS
inferred← citeshttps://doi.org/10.1007/978-3-642-28756-5_31openalex-snapshot
Bounded Phase Analysis of Message-Passing Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-31131-4_2openalex-snapshot
The Theory of WSTS: The Case of Complete WSTS
inferred← citeshttps://doi.org/10.1007/978-3-642-35743-5_10openalex-snapshot
Realizability of Choreographies for Services Interacting Asynchronously
inferred← citeshttps://doi.org/10.1007/978-3-642-39799-8_10openalex-snapshot
Incremental, Inductive Coverability
inferred← citeshttps://doi.org/10.1007/b87738openalex-snapshot
Static analysis : 7th International Symposium, SAS 2000, Santa Barbara, CA, USA, June 29 - July 1, 2000 : proceedings
inferred← citeshttps://doi.org/10.1007/s00236-005-0168-0openalex-snapshot
π-calculus with noisy channels
inferred← citeshttps://doi.org/10.1007/s10009-011-0206-xopenalex-snapshot
Domain-specific regular acceleration
inferred← citeshttps://doi.org/10.1007/s10009-011-0208-8openalex-snapshot
Widening techniques for regular tree model checking
inferred← citeshttps://doi.org/10.1007/s10009-011-0209-7openalex-snapshot
Extrapolating (omega-)regular model checking
inferred← citeshttps://doi.org/10.1007/s10009-013-0276-zopenalex-snapshot
Bounded phase analysis of message-passing programs
inferred← citeshttps://doi.org/10.1007/s10703-017-0285-8openalex-snapshot
Automated verification of automata communicating via FIFO and bag buffers
inferred← citeshttps://doi.org/10.1016/j.entcs.2003.10.007openalex-snapshot
The Affine Hull of a Binary Automaton is Computable in Polynomial Time
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.01.044openalex-snapshot
Regular Model Checking Using Inference of Regular Languages
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.04.002openalex-snapshot
Regularity Results for FIFO Channels
inferred← citeshttps://doi.org/10.1016/j.ic.2005.11.007openalex-snapshot
Permutation rewriting and algorithmic verification
inferred← citeshttps://doi.org/10.1016/j.ic.2017.11.001openalex-snapshot
Handling infinitely branching well-structured transition systems
inferred← citeshttps://doi.org/10.1016/j.jcss.2005.09.001openalex-snapshot
Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS
inferred← citeshttps://doi.org/10.1016/j.scico.2004.08.002openalex-snapshot
Model-checking processes with data
inferred← citeshttps://doi.org/10.1016/j.scico.2020.102569openalex-snapshot
Compatibility checking for asynchronously communicating software
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.06.016openalex-snapshot
Parameterised boolean equation systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.03.020openalex-snapshot
Derivation tree analysis for accelerated fixed-point computation
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.03.002openalex-snapshot
Value-passing CCS with noisy channels
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00337-4openalex-snapshot
Verifying lossy channel systems has nonprimitive recursive complexity
inferred← citeshttps://doi.org/10.1016/s0167-6423(02)00133-8openalex-snapshot
State space reduction based on live variables analysis
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00342-5openalex-snapshot
Some complexity results for polynomial rational expressions
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00646-1openalex-snapshot
Undecidable problems in unreliable computations
inferred← citeshttps://doi.org/10.1023/a:1024480913162openalex-snapshot
Dynamic Partitioning in Linear Relation Analysis: Application to the Verification of Reactive Systems
inferred← citeshttps://doi.org/10.1051/ita:2007029openalex-snapshot
Efficiency of automata in semi-commutation verification techniques
inferred← citeshttps://doi.org/10.1093/comjnl/bxn006openalex-snapshot
A Hierarchy of Behavioral Equivalences in the -calculus with Noisy Channels
inferred← citeshttps://doi.org/10.1109/acsd.2012.26openalex-snapshot
An Algorithmic Framework for Coverability in Well-Structured Systems
inferred← citeshttps://doi.org/10.1109/ams.2007.75openalex-snapshot
On Verification of Communicating Finite State Machines Using Residual Languages
inferred← citeshttps://doi.org/10.1109/apsec53868.2021.00058openalex-snapshot
Probabilistic testing of asynchronously communicating systems
inferred← citeshttps://doi.org/10.1109/iceccs.2001.930166openalex-snapshot
Compositional construction of protocol behaviours with arbitrary channel capacities
inferred← citeshttps://doi.org/10.1109/jproc.2004.831197openalex-snapshot
Formal verification of timed systems: a survey and perspective
inferred← citeshttps://doi.org/10.1109/lics.2001.932515openalex-snapshot
Permutation rewriting and algorithmic verification
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.1109/tc.2011.147openalex-snapshot
Reliability of Mobile Processes with Noisy Channels
inferred← citeshttps://doi.org/10.1109/tcad.2008.2006159openalex-snapshot
Verification of Analog/Mixed-Signal Circuits Using Symbolic Methods
inferred← citeshttps://doi.org/10.1137/080743457openalex-snapshot
Complexity of Decision Problems for XML Schemas and Chain Regular Expressions
inferred← citeshttps://doi.org/10.1145/2989225.2989228openalex-snapshot
Precise and scalable static analysis of jQuery using a regular expression domain
inferred← citeshttps://doi.org/10.1145/3009837.3009860openalex-snapshot
A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
inferred← citeshttps://doi.org/10.1145/3092282.3092292openalex-snapshot
Backward coverability with pruning for lossy channel systems
inferred← citeshttps://doi.org/10.1145/3093333.3009860openalex-snapshot
A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
inferred← citeshttps://doi.org/10.1155/2018/3193974openalex-snapshot
An SAT‐Based Method to Multithreaded Program Verification for Mobile Crowdsourcing Networks
inferred← citeshttps://doi.org/10.2168/lmcs-8(3:28)2012openalex-snapshot
Forward Analysis for WSTS, Part II: Complete WSTS
inferred← citeshttps://doi.org/10.2200/s00689ed1v01y201512aim031openalex-snapshot
Representing and Reasoning with Qualitative Preferences: Tools and Applications
inferred← citeshttps://doi.org/10.22028/d291-26587openalex-snapshot
Synthesis and control of infinite-state systems with partial observability
inferred← citeshttps://doi.org/10.23638/lmcs-16(4:4)2020openalex-snapshot
Verification of Flat FIFO Systems
inferred← citeshttps://doi.org/10.23638/lmcs-17(1:20)2021openalex-snapshot
A Sound Algorithm for Asynchronous Session Subtyping and its Implementation
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25cfeopenalex-snapshot
General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25d28openalex-snapshot
Data Flow Analysis of Asynchronous Systems using Infinite Abstract Domains
inferred← citeshttps://doi.org/10.3166/tsi.25.289-315openalex-snapshot
Contrôle de systèmes symboliques, discrets ou hybrides
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.4230/lipics.concur.2021.35openalex-snapshot
Generalising Projection in Asynchronous Multiparty Session Types
inferred← citeshttps://doi.org/10.46298/lmcs-18(4:2)2022openalex-snapshot
General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
inferred← citeshttps://doi.org/10.48550/arxiv.0902.1587openalex-snapshot
Forward analysis for WSTS, Part I: Completions
inferred← citeshttps://doi.org/10.48550/arxiv.2112.06828openalex-snapshot
Statures and Sobrification Ranks of Noetherian Spaces
inferred← citeshttps://doi.org/10.6100/ir562056openalex-snapshot
Semantics and verification in process algebras with data and timing
inferred← citeshttps://doi.org/10.70675/4a3d121bzbb9az47ebzb688z4c3e0339c01bopenalex-snapshot
On Effective Representations of Well Quasi-Orderings
inferred← citeshttps://doi.org/10.70675/61130ea1zef23z4950z81e1z91b74939ff7copenalex-snapshot
Vers la vérification de propriétés de sûreté pour des systèmes infinis communicants : décidabilité et raffinement des abstractions
inferred← citeshttps://doi.org/10.70675/ac4131abz125bz48a0zb249z94e706479cddopenalex-snapshot
On Post’s embedding problem and the complexity of lossy channels
inferred← citeshttps://doi.org/10.70675/d9876feez8666z4209z936bz4c82f1fe825bopenalex-snapshot
Vers des outils efficaces pour la vérification de systèmes concurrents
inferred← citeshttps://doi.org/10.7146/brics.v7i38.20204openalex-snapshot
Dynamic Partitioning in Linear Relation Analysis. Application to the Verification of Synchronous Programs
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.