On the public citation graph
An experience in proving regular networks of processes by modular model checking
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-11494-7_22openalex-snapshot
Specification and verification of concurrent systems in CESAR
inferredcites →https://doi.org/10.1007/3-540-52148-8_16openalex-snapshot
On-line model-checking for finite linear temporal logic specifications
inferredcites →https://doi.org/10.1007/3-540-52148-8_18openalex-snapshot
Specifying, programming and verifying real-time systems using a synchronous declarative language
inferredcites →https://doi.org/10.1007/3-540-52148-8_30openalex-snapshot
Verification of synchronous sequential machines based on symbolic execution
inferredcites →https://doi.org/10.1007/3-540-52148-8_6openalex-snapshot
Verifying properties of large sets of processes with network invariants
inferredcites →https://doi.org/10.1007/3-540-55179-4_18openalex-snapshot
“On the fly” verification of behavioural equivalences and preorders
inferredcites →https://doi.org/10.1007/978-1-4471-3534-0openalex-snapshot
Specification and Verification of Concurrent Systems
inferredcites →https://doi.org/10.1007/bfb0013024openalex-snapshot
The anchored version of the temporal framework
inferredcites →https://doi.org/10.1007/bfb0023716openalex-snapshot
Verifying temporal properties of sequential machines without building their state diagrams
inferredcites →https://doi.org/10.1007/bfb0023732openalex-snapshot
Compositional minimization of finite state systems
inferredcites →https://doi.org/10.1016/0020-0190(86)90071-2openalex-snapshot
Limits for automatic verification of finite-state concurrent systems
inferredcites →https://doi.org/10.1016/0020-0190(88)90211-6openalex-snapshot
Proving properties of a ring of finite-state machines
inferredcites →https://doi.org/10.1016/0890-5401(89)90026-6openalex-snapshot
Reasoning about networks with many identical finite state processes
inferredcites →https://doi.org/10.1016/0890-5401(92)90017-aopenalex-snapshot
Symbolic model checking: 1020 States and beyond
inferredcites →https://doi.org/10.1090/dimacs/003/06openalex-snapshot
Compositional minimization of finite state systems
inferredcites →https://doi.org/10.1109/5.97300openalex-snapshot
The synchronous data flow programming language LUSTRE
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1109/tse.1987.233206openalex-snapshot
Automated Protocol Validation in Argos: Assertion Proving and Scatter Searching
inferredcites →https://doi.org/10.1145/10590.10611openalex-snapshot
Reasoning about networks with many identical finite-state processes
inferredcites →https://doi.org/10.1145/123041.123062openalex-snapshot
Programming and verifying critical systems by means of the synchronous data-flow language LUSTRE
inferredcites →https://doi.org/10.1145/125083.123062openalex-snapshot
Programming and verifying critical systems by means of the synchronous data-flow language LUSTRE
inferredcites →https://doi.org/10.1145/41625.41641openalex-snapshot
LUSTRE: a declarative language for real-time programming
inferredcites →https://doi.org/10.1145/5397.5399openalex-snapshot
Automatic verification of finite-state concurrent systems using temporal logic specifications
inferredcites →https://doi.org/10.1145/72981.72998openalex-snapshot
A structural induction theorem for processes
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-44585-4_19openalex-snapshot
Parameterized Verification with Automatically Computed Inductive Assertions?
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_7openalex-snapshot
Automatic Deductive Verification with Invisible Invariants
inferred← citeshttps://doi.org/10.1007/3-540-45449-7_8openalex-snapshot
Verification of Embedded Software: Problems and Perspectives
inferred← citeshttps://doi.org/10.1007/3-540-45694-5_8openalex-snapshot
Network Invariants in Action*
inferred← citeshttps://doi.org/10.1007/3-540-46419-0_14openalex-snapshot
Abstracting WS1S Systems to Verify Parameterized Networks
inferred← citeshttps://doi.org/10.1007/3-540-47813-2_22openalex-snapshot
Parameterized Verification of a Cache Coherence Protocol: Safety and Liveness
inferred← citeshttps://doi.org/10.1007/3-540-49519-3_23openalex-snapshot
Verification of Data-Insensitive Circuits: An In-Order-Retirement Case Study
inferred← citeshttps://doi.org/10.1007/3-540-56922-7_28openalex-snapshot
Delay analysis in synchronous programs
inferred← citeshttps://doi.org/10.1007/3-540-58179-0_74openalex-snapshot
Compositional semantics of Esterel and verification by compositional reductions
inferred← citeshttps://doi.org/10.1007/3-540-58485-4_40openalex-snapshot
About synchronous programming and abstract interpretation
inferred← citeshttps://doi.org/10.1007/3-540-63166-6_41openalex-snapshot
Symbolic model checking with rich assertional languages
inferred← citeshttps://doi.org/10.1007/978-1-4471-3227-1_8openalex-snapshot
Synchronous Observers and the Verification of Reactive Systems
inferred← citeshttps://doi.org/10.1007/bfb0000481openalex-snapshot
Invariants of parameterized binary tree networks as greatest fixpoints
inferred← citeshttps://doi.org/10.1007/bfb0055757openalex-snapshot
Modularization and abstraction: The keys to practical formal verification
inferred← citeshttps://doi.org/10.1007/s100090050040openalex-snapshot
Control and data abstraction: the cornerstones of practical formal verification
inferred← citeshttps://doi.org/10.1016/j.cl.2004.02.006openalex-snapshot
Model checking and abstraction to the aid of parameterized systems (a survey)
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.01.005openalex-snapshot
A novel approach to verifying context free properties of programs
inferred← citeshttps://doi.org/10.1016/s0167-6423(96)00041-xopenalex-snapshot
About synchronous programming and abstract interpretation
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00103-1openalex-snapshot
Symbolic model checking with rich assertional languages
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00104-3openalex-snapshot
Automatic verification of parameterized networks of processes
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00190-2openalex-snapshot
Networks of Processes with Parameterized State Space
inferred← citeshttps://doi.org/10.1023/a:1008678014487openalex-snapshot
Verification of Real-Time Systems using Linear Relation Analysis
inferred← citeshttps://doi.org/10.1109/32.159839openalex-snapshot
Programming and verifying real-time systems by means of the synchronous data-flow language LUSTRE
inferred← citeshttps://doi.org/10.1109/32.798329openalex-snapshot
Automatic distribution of reactive systems for asynchronous networks of processors
inferred← citeshttps://doi.org/10.1109/5.97300openalex-snapshot
The synchronous data flow programming language LUSTRE
inferred← citeshttps://doi.org/10.1109/asap.1994.331806openalex-snapshot
Verification of regular architectures using ALPHA: a case study
inferred← citeshttps://doi.org/10.1109/memcod.2003.1210111openalex-snapshot
Verification of control properties in the polyhedral model
inferred← citeshttps://doi.org/10.1145/1067915.1067917openalex-snapshot
Verification of safety properties for parameterized regular systems
inferred← citeshttps://doi.org/10.1145/123041.123062openalex-snapshot
Programming and verifying critical systems by means of the synchronous data-flow language LUSTRE
inferred← citeshttps://doi.org/10.1145/263699.263747openalex-snapshot
Automatic verification of parameterized linear networks of processes
inferred← citeshttps://doi.org/10.5555/823453.823833openalex-snapshot
Verification of control properties in the polyhedral model
inferred← citeshttps://doi.org/10.70675/60c377dbzbda4z4881z81b9ze3b12355d4c6openalex-snapshot
Modular analysis of numerical properties by abstract interpretation
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.