On the public citation graph
Generality in design and compositional verification usingTav
0 signed · 47 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-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-15670-4_14openalex-snapshot
An improved failures model for communicating processes
inferredcites →https://doi.org/10.1007/3-540-18088-5_11openalex-snapshot
Verifying a protocol using relativized bisimulation
inferredcites →https://doi.org/10.1007/3-540-51237-3_14openalex-snapshot
The use of static constructs in a model process logic
inferredcites →https://doi.org/10.1007/3-540-56496-9_18openalex-snapshot
A case study in safety-critical design
inferredcites →https://doi.org/10.1007/3-540-56496-9_4openalex-snapshot
Efficient local correctness checking
inferredcites →https://doi.org/10.1007/bfb0015727openalex-snapshot
Linear and branching structures in the semantics and logics of reactive systems
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1007/bfb0029004openalex-snapshot
Deciding bisimulation equivalences for a class of non-finite-state programs
inferredcites →https://doi.org/10.1016/0141-9331(86)90196-1openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1016/0167-6423(90)90076-popenalex-snapshot
Communication and concurrency
inferredcites →https://doi.org/10.1016/0169-7552(87)90085-7openalex-snapshot
Introduction to the ISO specification language LOTOS
inferredcites →https://doi.org/10.1016/0304-3975(83)90114-7openalex-snapshot
Calculi for synchrony and asynchrony
inferredcites →https://doi.org/10.1016/0304-3975(84)90113-0openalex-snapshot
Testing equivalences for processes
inferredcites →https://doi.org/10.1016/0304-3975(90)90038-jopenalex-snapshot
Proof systems for satisfiability in Hennessy-Milner Logic with recursion
inferredcites →https://doi.org/10.1016/0304-3975(91)90071-9openalex-snapshot
Partial specifications and compositional verification
inferredcites →https://doi.org/10.1016/0890-5401(90)90025-dopenalex-snapshot
CCS expressions, finite state processes, and three problems of equivalence
inferredcites →https://doi.org/10.1016/0890-5401(90)90048-mopenalex-snapshot
Bisimulation and divergence
inferredcites →https://doi.org/10.1016/j.jlap.2004.05.001openalex-snapshot
A structural approach to operational semantics
inferredcites →https://doi.org/10.1016/s0019-9958(84)80025-xopenalex-snapshot
Process algebra for synchronous communication
inferredcites →https://doi.org/10.1109/lics.1990.113738openalex-snapshot
Equation solving using modal transition systems
inferredcites →https://doi.org/10.1145/2455.2460openalex-snapshot
Algebraic laws for nondeterminism and concurrency
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-56922-7_21openalex-snapshot
Timed modal specification — Theory and tools
inferred← citeshttps://doi.org/10.1007/3-540-61648-9_46openalex-snapshot
Dynamic scheduling in the presence of faults: Specification and verification
inferred← citeshttps://doi.org/10.1007/3-540-61648-9_53openalex-snapshot
Verification of embedded systems using synchronous observers
inferred← citeshttps://doi.org/10.1007/978-0-387-34867-4_21openalex-snapshot
Automatic Verification of Real-Timed Systems Using Epsilon
inferred← citeshttps://doi.org/10.1007/978-0-387-34945-9_7openalex-snapshot
Formal Verification of a Protocol for Communications over faulty channels
inferred← citeshttps://doi.org/10.1007/978-3-030-30923-7_1openalex-snapshot
Model Verification Through Dependency Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-15629-8_13openalex-snapshot
Equivalence Checking 40 Years After: A Review of Bisimulation Tools
inferred← citeshttps://doi.org/10.1007/978-3-319-63121-9_3openalex-snapshot
30 Years of Modal Transition Systems: Survey of Extensions and Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_8openalex-snapshot
On Modal Refinement and Consistency
inferred← citeshttps://doi.org/10.1007/978-3-642-32943-2_9openalex-snapshot
Modal Process Rewrite Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-39718-9_13openalex-snapshot
On Refinements of Boolean and Parametric Modal Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-40184-8_7openalex-snapshot
Hennessy-Milner Logic with Greatest Fixed Points as a Complete Behavioural Specification Theory
inferred← citeshttps://doi.org/10.1007/bfb0000478openalex-snapshot
On bisimulation, fault-monotonicity and provable fault-tolerance
inferred← citeshttps://doi.org/10.1007/s10009-020-00578-9openalex-snapshot
Dependency graphs with applications to verification
inferred← citeshttps://doi.org/10.1016/j.ic.2019.104487openalex-snapshot
Logical vs. behavioural specifications
inferred← citeshttps://doi.org/10.1017/s0960129509990260openalex-snapshot
Modal and mixed specifications: key decision problems and their complexities
inferred← citeshttps://doi.org/10.1023/a:1026537232278openalex-snapshot
Dynamic Scheduling and Fault-Tolerance: Specification and Verification
inferred← citeshttps://doi.org/10.1109/32.663997openalex-snapshot
Formal verification of concurrent programs using the Larch prover
inferred← citeshttps://doi.org/10.54337/aau510736584openalex-snapshot
Abstract Dependency Graphs for Model Verification
inferred← citeshttps://doi.org/10.7146/brics.v4i11.18802openalex-snapshot
Timed Modal Specification —Theory and Tools
inferred← citeshttps://doi.org/10.7146/dpb.v21i417.6730openalex-snapshot
Design, analysis and Reasoning about Tools: Abstracts from the Second Workshop (Aalborg, 1992, 20-21 August)
inferred← citeshttps://doi.org/10.7146/dpb.v22i457.6930openalex-snapshot
Design, Analysis and Reasoning about Tools: Abstracts from the Third Workshop
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.