On the public citation graph

Assume-Guarantee Reasoning for Deadlock

0 signed · 43 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.1993.1021openalex-snapshot
Inference of Finite Automata Using Homing Sequences
inferredcites →https://doi.org/10.1007/11513988_18openalex-snapshot
The ComFoRT Reasoning Framework
inferredcites →https://doi.org/10.1007/11513988_49openalex-snapshot
Reasoning About Threads Communicating via Locks
inferredcites →https://doi.org/10.1007/11513988_51openalex-snapshot
Automated Assume-Guarantee Reasoning for Simulation Conformance
inferredcites →https://doi.org/10.1007/11513988_52openalex-snapshot
Symbolic Compositional Verification by Learning Assumptions
inferredcites →https://doi.org/10.1007/11531142_26openalex-snapshot
Static Deadlock Detection for Java Libraries
inferredcites →https://doi.org/10.1007/3-540-36577-x_24openalex-snapshot
Learning Assumptions for Compositional Verification
inferredcites →https://doi.org/10.1007/3-540-46002-0_25openalex-snapshot
Adaptive Model Checking
inferredcites →https://doi.org/10.1007/3-540-49213-5openalex-snapshot
Compositionality: The Significant Difference
inferredcites →https://doi.org/10.1007/3-540-63166-6_6openalex-snapshot
A compositional rule for hardware design refinement
inferredcites →https://doi.org/10.1007/978-0-387-35578-8_13openalex-snapshot
Black Box Checking
inferredcites →https://doi.org/10.1007/978-1-4757-3472-0_16openalex-snapshot
Communicating Sequential Processes
inferredcites →https://doi.org/10.1007/978-3-540-27813-9_19openalex-snapshot
Stuck-Free Conformance
inferredcites →https://doi.org/10.1007/978-3-540-45187-7_28openalex-snapshot
Abstract Patterns of Compositional Reasoning
inferredcites →https://doi.org/10.1007/978-3-642-82453-1_5openalex-snapshot
In Transition From Global to Modular Temporal Reasoning about Programs
inferredcites →https://doi.org/10.1007/bf01784721openalex-snapshot
Deadlock analysis in networks of communicating processes
inferredcites →https://doi.org/10.1016/0011-684x(85)90108-xopenalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1016/0890-5401(87)90052-6openalex-snapshot
Learning regular sets from queries and counterexamples
inferredcites →https://doi.org/10.1016/j.entcs.2005.01.044openalex-snapshot
Regular Model Checking Using Inference of Regular Languages
inferredcites →https://doi.org/10.1016/j.entcs.2005.08.003openalex-snapshot
Constructing Induction Rules for Deductive Synthesis Proofs
inferredcites →https://doi.org/10.1093/jigpal/jzl007openalex-snapshot
Adaptive Model Checking
inferredcites →https://doi.org/10.1109/32.908957openalex-snapshot
Dynamically discovering likely program invariants to support program evolution
inferredcites →https://doi.org/10.1109/9.566659openalex-snapshot
Supervisory control using failure semantics and partial specifications
inferredcites →https://doi.org/10.1109/ase.2002.1114984openalex-snapshot
Assumption generation for software component verification
inferredcites →https://doi.org/10.1109/fmcad.2006.8openalex-snapshot
Assume-Guarantee Reasoning for Deadlock
inferredcites →https://doi.org/10.1145/1040305.1040314openalex-snapshot
Synthesis of interface specifications for Java classes
inferredcites →https://doi.org/10.1145/177492.177725openalex-snapshot
Model checking and modular verification
inferredcites →https://doi.org/10.1145/302405.302467openalex-snapshot
Dynamically discovering likely program invariants to support program evolution
inferredcites →https://doi.org/10.21711/231766362003/rmc246openalex-snapshot
Automata on guarded strings and applications

What points at this work

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

inferred← citeshttps://doi.org/10.1002/spe.1118openalex-snapshot
Application of Deadlock Risk Evaluation of Architectural Models
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_22openalex-snapshot
Optimized L*-Based Assume-Guarantee Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-540-73368-3_8openalex-snapshot
SAT-Based Compositional Verification Using Lazy Learning
inferred← citeshttps://doi.org/10.1007/s10703-007-0042-5openalex-snapshot
Three optimizations for Assume–Guarantee reasoning with L*
inferred← citeshttps://doi.org/10.1007/s11334-011-0148-1openalex-snapshot
Automated assume-guarantee reasoning for omega-regular systems and specifications
inferred← citeshttps://doi.org/10.1109/cdc.2015.7403184openalex-snapshot
On compositional symbolic controller synthesis inspired by small-gain theorems
inferred← citeshttps://doi.org/10.1109/cdc.2016.7799148openalex-snapshot
Decomposing controller synthesis for safety specifications
inferred← citeshttps://doi.org/10.1109/seams.2009.5069079openalex-snapshot
Towards an assume-guarantee theory for adaptable systems
inferred← citeshttps://doi.org/10.1109/sies.2009.5196214openalex-snapshot
Deadlock risk assessment in architectural models of real-time systems
inferred← citeshttps://doi.org/10.1145/1629335.1629344openalex-snapshot
Compositional deadlock detection for rendezvous communication
inferred← citeshttps://doi.org/10.1145/1740582.1740584openalex-snapshot
On the completeness of compositional reasoning methods
inferred← citeshttps://doi.org/10.1145/2968478.2968490openalex-snapshot
Verifying cyber-physical systems by combining software model checking with hybrid systems reachability
inferred← citeshttps://doi.org/10.7916/d8n87jpxopenalex-snapshot
Efficient, Deterministic and Deadlock-free Concurrency
showing the first 13 of 14 · page through all 14
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.