On the public citation graph

Proving Liveness by Backwards Reachability

https://doi.org/10.1007/11817949_7
0 signed · 54 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.1996.0053openalex-snapshot
Verifying Programs with Unreliable Channels
inferredcites →https://doi.org/10.1006/inco.1996.0083openalex-snapshot
Undecidable Verification Problems for Programs with Unreliable Channels
inferredcites →https://doi.org/10.1006/inco.1999.2843openalex-snapshot
Algorithmic Analysis of Programs with Well Quasi-ordered Domains
inferredcites →https://doi.org/10.1007/10722167_26openalex-snapshot
Liveness and Acceleration in Parameterized Verification
inferredcites →https://doi.org/10.1007/10722167_31openalex-snapshot
Regular Model Checking
inferredcites →https://doi.org/10.1007/11513988_48openalex-snapshot
Linear Ranking with Reachability
inferredcites →https://doi.org/10.1007/11539452_37openalex-snapshot
Termination Analysis of Integer Linear Loops
inferredcites →https://doi.org/10.1007/11547662_8openalex-snapshot
Abstraction Refinement for Termination
inferredcites →https://doi.org/10.1007/3-540-45319-9_6openalex-snapshot
Synthesis of Linear Ranking Functions
inferredcites →https://doi.org/10.1007/3-540-45657-0_36openalex-snapshot
Practical Methods for Proving Program Termination
inferredcites →https://doi.org/10.1007/3-540-45657-0_9openalex-snapshot
Liveness with (0,1, ∞)- Counter Abstraction
inferredcites →https://doi.org/10.1007/3-540-48683-6_14openalex-snapshot
Handling Global Conditions in Parametrized System Verification
inferredcites →https://doi.org/10.1007/3-540-61474-5_53openalex-snapshot
Symbolic verification of communication protocols with infinite state spaces using QDDs
inferredcites →https://doi.org/10.1007/978-3-540-24622-0_19openalex-snapshot
Liveness with Invisible Ranking
inferredcites →https://doi.org/10.1007/978-3-540-24730-2_36openalex-snapshot
Liveness with Incomprehensible Ranking
inferredcites →https://doi.org/10.1007/978-3-540-27813-9_27openalex-snapshot
Regular Model Checking for LTL(MSO)
inferredcites →https://doi.org/10.1007/978-3-540-27813-9_29openalex-snapshot
Abstract Regular Model Checking
inferredcites →https://doi.org/10.1007/978-3-540-28644-8_3openalex-snapshot
A Survey of Regular Model Checking
inferredcites →https://doi.org/10.1007/978-3-540-30579-8_1openalex-snapshot
Proving Program Invariance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semidefinite Programming
inferredcites →https://doi.org/10.1007/978-3-540-30579-8_12openalex-snapshot
Shape Analysis by Predicate Abstraction
inferredcites →https://doi.org/10.1007/978-3-540-30579-8_8openalex-snapshot
Termination of Polynomial Programs
inferredcites →https://doi.org/10.1007/978-3-540-31980-1_9openalex-snapshot
Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems
inferredcites →https://doi.org/10.1007/bfb0028736openalex-snapshot
Verifying systems with infinite but regular state spaces
inferredcites →https://doi.org/10.1007/s10009-005-0193-xopenalex-snapshot
Liveness with invisible ranking
inferredcites →https://doi.org/10.1007/s100090050035openalex-snapshot
State space reduction using partial order techniques
inferredcites →https://doi.org/10.1016/0141-9331(89)90152-xopenalex-snapshot
Parallel program design: a foundation
inferredcites →https://doi.org/10.1016/0167-6423(84)90003-0openalex-snapshot
Adequate proof principles for invariance and liveness properties of concurrent programs
inferredcites →https://doi.org/10.1023/a:1008719024240openalex-snapshot
Symbolic Verification of Communication Protocols with Infinite State Spaces using QDDs
inferredcites →https://doi.org/10.1023/b:form.0000033962.51898.1aopenalex-snapshot
Using Forward Reachability Analysis for Verification of Lossy Channel Systems
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/32.588521openalex-snapshot
The model checker SPIN
inferredcites →https://doi.org/10.1109/jcit.1990.128275openalex-snapshot
Mutual exclusion revisited
inferredcites →https://doi.org/10.1109/lics.2004.1319598openalex-snapshot
Transition invariants
inferredcites →https://doi.org/10.1109/lics.2004.50openalex-snapshot
Transition invariants
inferredcites →https://doi.org/10.1145/1040305.1040317openalex-snapshot
Transition predicate abstraction and fair termination
inferredcites →https://doi.org/10.1145/2442776.2442783openalex-snapshot
Automatic predicate abstraction of C programs
inferredcites →https://doi.org/10.1145/360204.360210openalex-snapshot
The size-change principle for program termination
inferredcites →https://doi.org/10.1145/378795.378846openalex-snapshot
Automatic predicate abstraction of C programs
inferredcites →https://doi.org/10.1145/876638.876643openalex-snapshot
Counterexample-guided abstraction refinement for symbolic model checking
inferredcites →https://doi.org/10.21236/ada227320openalex-snapshot
Tools and Rules for the Practicing Verifier

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-032-02602-6_14openalex-snapshot
A New Approach for Showing Termination of Parameterized Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-41540-6_7openalex-snapshot
Liveness of Randomised Parameterised Systems under Arbitrary Schedulers
inferred← citeshttps://doi.org/10.1007/978-3-540-73230-3_6openalex-snapshot
Static Detection of Livelocks in Ada Multitasking Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-73368-3_16openalex-snapshot
Systematic Acceleration in Regular Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-00867-2_3openalex-snapshot
Temporal Verification of Fault-Tolerant Protocols
inferred← citeshttps://doi.org/10.1007/s10009-011-0209-7openalex-snapshot
Extrapolating (omega-)regular model checking
inferred← citeshttps://doi.org/10.1007/s10703-021-00377-1openalex-snapshot
Temporal prophecy for proving temporal properties of infinite-state systems
inferred← citeshttps://doi.org/10.1007/s10703-022-00390-yopenalex-snapshot
Parameterized verification of leader/follower systems via first-order temporal logic
inferred← citeshttps://doi.org/10.1109/time.2008.15openalex-snapshot
Practical First-Order Temporal Reasoning
inferred← citeshttps://doi.org/10.1145/3158114openalex-snapshot
Reducing liveness to safety in first-order logic
inferred← citeshttps://doi.org/10.23919/fmcad.2018.8603008openalex-snapshot
Temporal Prophecy for Proving Temporal Properties of Infinite-State Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1606.01451openalex-snapshot
Liveness of Randomised Parameterised Systems under Arbitrary Schedulers (Technical Report)
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0702036openalex-snapshot
Efficient First-Order Temporal Logic for Infinite-State Systems
inferred← citeshttps://doi.org/10.5555/1769168.1769174openalex-snapshot
Static detection of Livelocks in Ada multitasking programs
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.