On the public citation graph

Detecting deadlocks in concurrent systems

https://doi.org/10.1007/bfb0055632
0 signed · 91 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.1007/3-540-51285-3_35openalex-snapshot
Eliminating redundant interleavings during concurrent program verification
inferredcites →https://doi.org/10.1007/3-540-60973-3_102openalex-snapshot
Model checking in practice: An analysis of the ACCESS.bus™ protocol using SPIN
inferredcites →https://doi.org/10.1007/3-540-63166-6_35openalex-snapshot
Deadlock checking using net unfoldings
inferredcites →https://doi.org/10.1007/978-1-4757-3472-0_2openalex-snapshot
Cooperating Sequential Processes
inferredcites →https://doi.org/10.1007/978-1-84882-032-6openalex-snapshot
Principles of Programming Languages
inferredcites →https://doi.org/10.1007/bf00709154openalex-snapshot
A stubborn attack on state explosion
inferredcites →https://doi.org/10.1007/bf01384077openalex-snapshot
State-space caching revisited
inferredcites →https://doi.org/10.1007/bfb0015245openalex-snapshot
Algebraic topology and distributed computing a primer
inferredcites →https://doi.org/10.1007/bfb0084796openalex-snapshot
Homology of higher dimensional automata
inferredcites →https://doi.org/10.1016/0196-6774(81)90023-7openalex-snapshot
A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems
inferredcites →https://doi.org/10.1016/0890-5401(92)90017-aopenalex-snapshot
Symbolic model checking: 1020 States and beyond
inferredcites →https://doi.org/10.1038/213129a0openalex-snapshot
Programming Languages
inferredcites →https://doi.org/10.1090/dimacs/003/04openalex-snapshot
A stubborn attack on state explosion
inferredcites →https://doi.org/10.1093/logcom/2.4.511openalex-snapshot
Abstract Interpretation Frameworks
inferredcites →https://doi.org/10.1109/32.106975openalex-snapshot
Automated analysis of concurrent systems with the constrained expression toolset
inferredcites →https://doi.org/10.1109/32.489078openalex-snapshot
Evaluating deadlock detection methods for concurrent software
inferredcites →https://doi.org/10.1109/32.538606openalex-snapshot
Using partial-order methods in the formal validation of industrial concurrent programs
inferredcites →https://doi.org/10.1109/lics.1990.113767openalex-snapshot
Symbolic model checking: 10/sup 20/ states and beyond
inferredcites →https://doi.org/10.1145/120807.120812openalex-snapshot
Compositional reachability analysis using process algebra
inferredcites →https://doi.org/10.1145/193173.195295openalex-snapshot
Data flow analysis for verifying properties of concurrent programs
inferredcites →https://doi.org/10.1145/215465.215593openalex-snapshot
Semantic analysis of shared-memory concurrent languages using abstract model-checking
inferredcites →https://doi.org/10.1145/226295.226324openalex-snapshot
Using partial-order methods in the formal validation of industrial concurrent programs
inferredcites →https://doi.org/10.1145/331524.331529openalex-snapshot
The topological structure of asynchronous computability
inferredcites →https://doi.org/10.1145/512950.512973openalex-snapshot
Abstract interpretation
inferredcites →https://doi.org/10.1145/9758.9759openalex-snapshot
The geometry of semaphore programs
inferredcites →https://doi.org/10.1145/99583.99625openalex-snapshot
Modeling concurrency with geometry
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-36440-4_27openalex-snapshot
Parallel Rewriting P Systems with Deadlock
inferred← citeshttps://doi.org/10.1007/3-540-45627-9_30openalex-snapshot
Software Geography: Physical and Economic Aspects
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_8openalex-snapshot
Dihomotopy as a Tool in State Space Analysis Tutorial
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_9openalex-snapshot
Algorithms for Local Alignment with Length Constraints*
inferred← citeshttps://doi.org/10.1007/3-540-49099-x_7openalex-snapshot
Types for Safe Locking
inferred← citeshttps://doi.org/10.1007/978-3-031-68279-7_4openalex-snapshot
Irrationality of Process Replication for Higher-Dimensional Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-45177-0_8openalex-snapshot
Local Traces: An Over-Approximation of the Behaviour of the Proteins in Rule-Based Models
inferred← citeshttps://doi.org/10.1007/978-3-540-30206-3_23openalex-snapshot
Computing Schedules for Multithreaded Real-Time Programs Using Geometry
inferred← citeshttps://doi.org/10.1007/978-3-642-03409-1_25openalex-snapshot
Open Maps Bisimulations for Higher Dimensional Automata Models
inferred← citeshttps://doi.org/10.1007/978-3-642-19056-8_6openalex-snapshot
Linear Process Algebra
inferred← citeshttps://doi.org/10.1007/978-3-642-28869-2_14openalex-snapshot
Trace Spaces: An Efficient New Technique for State-Space Reduction
inferred← citeshttps://doi.org/10.1007/978-3-662-48653-5_29openalex-snapshot
From Geometric Semantics to Asynchronous Computability
inferred← citeshttps://doi.org/10.1007/s00200-012-0165-9openalex-snapshot
Execution spaces for simple higher dimensional automata
inferred← citeshttps://doi.org/10.1007/s00446-018-0328-4openalex-snapshot
Geometric and combinatorial views on asynchronous computability
inferred← citeshttps://doi.org/10.1007/s10485-007-9082-7openalex-snapshot
Components of the Fundamental Category II
inferred← citeshttps://doi.org/10.1007/s10817-024-09710-9openalex-snapshot
Single-Set Cubical Categories and Their Formalisation with a Proof Assistant
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101942openalex-snapshot
Connectivity of spaces of directed paths in geometric models for concurrent computation
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.09.005openalex-snapshot
Directed Homology
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.11.026openalex-snapshot
On the Expressiveness of Higher Dimensional Automata
inferred← citeshttps://doi.org/10.1016/j.entcs.2012.05.007openalex-snapshot
Formal Relationships Between Geometrical and Classical Models for Concurrency
inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.10.009openalex-snapshot
ST-structures
inferred← citeshttps://doi.org/10.1016/j.scico.2006.03.006openalex-snapshot
Type inference against races
inferred← citeshttps://doi.org/10.1016/j.scico.2007.12.001openalex-snapshot
Atomizer: A dynamic atomicity checker for multithreaded programs
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.02.012openalex-snapshot
On the expressiveness of higher dimensional automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.03.022openalex-snapshot
Algebraic topology and concurrency
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.06.024openalex-snapshot
Erratum to “On the expressiveness of higher dimensional automata”
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.07.052openalex-snapshot
Deadlocks and dihomotopy in mutual exclusion models
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.11.013openalex-snapshot
Combinatorics of labelling in higher-dimensional automata
inferred← citeshttps://doi.org/10.1016/s0303-2647(03)00033-9openalex-snapshot
P systems with deadlock
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80497-3openalex-snapshot
On the Specification of Higher Dimensional Automata
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80832-6openalex-snapshot
The Geometry of Timed PV Programs
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)01147-3openalex-snapshot
Infinitely running concurrent processes with loops from a geometric viewpoint
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)01149-7openalex-snapshot
From Concurrency to Algebraic Topology
inferred← citeshttps://doi.org/10.1017/s0960129500003133openalex-snapshot
Geometry and concurrency: a user's guide
inferred← citeshttps://doi.org/10.1017/s0960129500003145openalex-snapshot
On the classification of dipaths in geometric models for concurrency
inferred← citeshttps://doi.org/10.1017/s0960129500003157openalex-snapshot
Loops, ditopology and deadlocks
inferred← citeshttps://doi.org/10.1017/s0960129500003169openalex-snapshot
Higher dimensional automata revisited
inferred← citeshttps://doi.org/10.1017/s0960129500003182openalex-snapshot
Homotopy invariants of higher dimensional categories and concurrency in computer science
inferred← citeshttps://doi.org/10.1017/s0960129502003705openalex-snapshot
Investigation of concurrent processes by means of homotopy functors
inferred← citeshttps://doi.org/10.1017/s0960129503004031openalex-snapshot
Transition and cancellation in concurrency and branching time
inferred← citeshttps://doi.org/10.1023/b:apcs.0000013812.75342.deopenalex-snapshot
Components of the Fundamental Category
inferred← citeshttps://doi.org/10.1109/icraie.2014.6909202openalex-snapshot
Debugging and visualization techniques for multithreaded programs: A survey
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1303345openalex-snapshot
Atomizer: a dynamic atomicity checker for multithreaded programs (summary)
inferred← citeshttps://doi.org/10.1109/tcbb.2018.2812195openalex-snapshot
Local Traces: An Over-Approximation of the Behavior of the Proteins in Rule-Based Models
inferred← citeshttps://doi.org/10.1142/s0218216522500213openalex-snapshot
Stratified spaces, directed algebraic topology, and state-sum TQFTs
inferred← citeshttps://doi.org/10.1145/1119479.1119480openalex-snapshot
Types for safe locking
inferred← citeshttps://doi.org/10.1145/1176887.1176928openalex-snapshot
Scheduling for multi-threaded real-time programs via path planning
inferred← citeshttps://doi.org/10.1145/964001.964023openalex-snapshot
Atomizer
inferred← citeshttps://doi.org/10.2140/agt.2010.10.1683openalex-snapshot
Simplicial models of trace spaces
inferred← citeshttps://doi.org/10.23638/lmcs-17(2:5)2021openalex-snapshot
Sculptures in Concurrency
inferred← citeshttps://doi.org/10.2514/6.2008-7844openalex-snapshot
A Formal Approach for the Verification Process of Space Software
inferred← citeshttps://doi.org/10.3233/fi-2012-742openalex-snapshot
Unifying Equivalences for Higher Dimensional Automata
inferred← citeshttps://doi.org/10.4310/hha.2003.v5.n2.a1openalex-snapshot
Discovering spaces
inferred← citeshttps://doi.org/10.4310/hha.2003.v5.n2.a5openalex-snapshot
Some geometric perspectives in concurrency theory
inferred← citeshttps://doi.org/10.4310/hha.2003.v5.n2.a9openalex-snapshot
State spaces and dipaths up to dihomotopy
inferred← citeshttps://doi.org/10.48550/arxiv.0708.3584openalex-snapshot
Globular realization and cubical underlying homotopy type of time flow of process algebra
inferred← citeshttps://doi.org/10.48550/arxiv.0710.3553openalex-snapshot
Homotopical interpretation of globular complex by multipointed d-space
inferred← citeshttps://doi.org/10.48550/arxiv.0802.0212openalex-snapshot
A topological formal treatment for scenario-based software specification of concurrent real-time systems
inferred← citeshttps://doi.org/10.48550/arxiv.math/0002216openalex-snapshot
About the globular homology of higher dimensional automata
inferred← citeshttps://doi.org/10.5772/5230openalex-snapshot
A Geometric Approach to Scheduling of Concurrent Real-time Processes Sharing Resources
inferred← citeshttps://doi.org/10.70675/905efb32zc648z4451z89dfz3fd03c3bec63openalex-snapshot
A syntactic approach to the directed semantics of concurrent programs
inferred← citeshttps://doi.org/10.70675/aa80e889z0cc4z4358zb7c6z9dc22bf0d1dfopenalex-snapshot
Geometric semantics for asynchronous computability
inferred← citeshttps://doi.org/10.70930/tac/fwbwxn3iopenalex-snapshot
Towards a homotopy theory of higher dimensional transition systems
inferred← citeshttps://doi.org/10.70930/tac/ukt5iiqdopenalex-snapshot
Homotopical interpretation of globular complex by multipointed d-space
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.