On the public citation graph
An efficient verification method for parallel and distributed programs
0 signed · 58 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-13345-3_37openalex-snapshot
Partial order semantics versus interleaving semantics for CSP — like languages and its impact on fairness
inferredcites →https://doi.org/10.1007/bfb0027047openalex-snapshot
Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends
inferredcites →https://doi.org/10.1007/bfb0028836openalex-snapshot
Partial ordering derivations for CCS
inferredcites →https://doi.org/10.1016/0167-6423(83)90013-8openalex-snapshot
Decomposition of distributed programs into communication-closed layers
inferredcites →https://doi.org/10.1016/0304-3975(83)90082-8openalex-snapshot
Alternative semantics for temporal logics
inferredcites →https://doi.org/10.1145/357103.357110openalex-snapshot
A Proof System for Communicating Sequential Processes
inferredcites →https://doi.org/10.1145/357172.357178openalex-snapshot
Proving Liveness Properties of Concurrent Programs
inferredcites →https://doi.org/10.1145/357980.358021openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/359576.359585openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/360933.360975openalex-snapshot
Guarded commands, nondeterminacy and formal derivation of programs
inferredcites →https://doi.org/10.1145/4904.4999openalex-snapshot
“Sometimes” and “not never” revisited
inferredcites →https://doi.org/10.1145/567067.567082openalex-snapshot
How to cook a temporal proof system for your pet language
inferredcites →https://doi.org/10.21236/ada106750openalex-snapshot
Verification of Concurrent Programs. Part I. The Temporal Framework,
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11888116_19openalex-snapshot
Reducing Software Architecture Models Complexity: A Slicing and Abstraction Approach
inferred← citeshttps://doi.org/10.1007/3-540-51687-5_47openalex-snapshot
Designing distributed algorithms by means of formal sequentially phased reasoning
inferred← citeshttps://doi.org/10.1007/3-540-52753-2_49openalex-snapshot
A concurrent branching time temporal logic
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_5openalex-snapshot
Modular completeness for Communication Closed Layers
inferred← citeshttps://doi.org/10.1007/978-1-4419-5998-0_2openalex-snapshot
Overview of Formal Verification
inferred← citeshttps://doi.org/10.1007/978-1-4471-3860-0_16openalex-snapshot
Defining Conditional Independence Using Collapses
inferred← citeshttps://doi.org/10.1007/978-3-031-90643-5_11openalex-snapshot
Token Elimination in Model Checking of Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-63516-3_12openalex-snapshot
Parallel Model Checking Algorithms for Linear-Time Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-77935-5_19openalex-snapshot
Optimal Storage of Combinatorial State Spaces
inferred← citeshttps://doi.org/10.1007/978-3-319-77935-5_20openalex-snapshot
Stubborn Transaction Reduction
inferred← citeshttps://doi.org/10.1007/978-3-642-38088-4_3openalex-snapshot
Improved on-the-Fly Livelock Detection
inferred← citeshttps://doi.org/10.1007/978-3-642-39176-7_15openalex-snapshot
Guard-Based Partial-Order Reduction
inferred← citeshttps://doi.org/10.1007/978-3-662-46681-0_61openalex-snapshot
LTSmin: High-Performance Language-Independent Model Checking
inferred← citeshttps://doi.org/10.1007/bf00121262openalex-snapshot
Combining partial order reductions with on-the-fly model-checking
inferred← citeshttps://doi.org/10.1007/bf02252682openalex-snapshot
Verification of distributed programs using representative interleaving sequences
inferred← citeshttps://doi.org/10.1007/bf02811341openalex-snapshot
Models and logics for true concurrency
inferred← citeshttps://doi.org/10.1007/bf03259394openalex-snapshot
A Principle for Sequential Reasoning about Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/bfb0023731openalex-snapshot
Using partial orders to improve automatic verification methods
inferred← citeshttps://doi.org/10.1007/bfb0032058openalex-snapshot
Proving partial order liveness properties
inferred← citeshttps://doi.org/10.1007/bfb0036207openalex-snapshot
Behavioural characterizations of partial order logics
inferred← citeshttps://doi.org/10.1007/s00236-015-0226-1openalex-snapshot
Compositional verification of asynchronous concurrent systems using CADP
inferred← citeshttps://doi.org/10.1007/s10009-014-0363-9openalex-snapshot
Guard-based partial-order reduction
inferred← citeshttps://doi.org/10.1007/s11334-019-00341-7openalex-snapshot
Optimal compression of combinatorial state spaces
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90007-iopenalex-snapshot
On undecidability of propositional temporal logics on trace systems
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90054-jopenalex-snapshot
Defining conditional independence using collapses
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90181-eopenalex-snapshot
A logical characterization of well branching event structures
inferred← citeshttps://doi.org/10.1016/j.ic.2009.02.001openalex-snapshot
Partitioned PLTL model-checking for refined transition systems
inferred← citeshttps://doi.org/10.1080/03081079.2012.757437openalex-snapshot
Automated formal analysis and verification: an overview
inferred← citeshttps://doi.org/10.1109/icse.2004.1317444openalex-snapshot
Compositional verification of middleware-based software architecture descriptions
inferred← citeshttps://doi.org/10.1109/qest.2004.38openalex-snapshot
Saturation for a general class of models
inferred← citeshttps://doi.org/10.1109/tse.2006.81openalex-snapshot
Saturation for a General Class of Models
inferred← citeshttps://doi.org/10.1145/1067915.1067918openalex-snapshot
PLTL-partitioned model checking for reactive systems under fairness assumptions
inferred← citeshttps://doi.org/10.22028/d291-26025openalex-snapshot
Model checking finite paths and trees
inferred← citeshttps://doi.org/10.23919/acc.2004.1386738openalex-snapshot
Utilizing the structure of safety properties to aid in the verification of hybrid controllers
inferred← citeshttps://doi.org/10.3217/jucs-009-02-0106openalex-snapshot
Checking Object System Designs Incrementally
inferred← citeshttps://doi.org/10.4018/978-1-60960-215-4.ch005openalex-snapshot
Architecture-Centered Integrated Verification
inferred← citeshttps://doi.org/10.4018/978-1-61350-456-7.ch2.2openalex-snapshot
Architecture-Centered Integrated Verification
inferred← citeshttps://doi.org/10.4018/978-1-61350-456-7.ch202openalex-snapshot
Architecture-Centered Integrated Verification
inferred← citeshttps://doi.org/10.48456/tr-601openalex-snapshot
Combining model checking and theorem proving
inferred← citeshttps://doi.org/10.5555/998675.999427openalex-snapshot
Compositional verification of middleware-based software architecture descriptions
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.