On the public citation graph
Verifying Increasingly Expressive Temporal Logics for Infinite-State Systems
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.
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/11817963_14openalex-snapshot
Lazy Abstraction with Interpolants
inferredcites →https://doi.org/10.1007/978-1-4612-4222-2openalex-snapshot
Temporal Verification of Reactive Systems
inferredcites →https://doi.org/10.1007/978-3-540-74061-2_26openalex-snapshot
Arithmetic Strengthening for Shape Analysis
inferredcites →https://doi.org/10.1007/978-3-540-78499-9_14openalex-snapshot
The Complexity of CTL* + Linear Past
inferredcites →https://doi.org/10.1007/978-3-642-28756-5_9openalex-snapshot
Pushdown Model Checking for Malware Detection
inferredcites →https://doi.org/10.1007/978-3-642-36742-7_4openalex-snapshot
Ramsey vs. Lexicographic Termination Proving
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_61openalex-snapshot
Solving Existentially Quantified Horn Clauses
inferredcites →https://doi.org/10.1007/978-3-662-46681-0_30openalex-snapshot
Fairness for Infinite-State Systems
inferredcites →https://doi.org/10.1007/978-3-662-49674-9_22openalex-snapshot
T2: Temporal Property Verification
inferredcites →https://doi.org/10.1016/0167-6423(87)90036-0openalex-snapshot
Modalities for model checking: branching time logic strikes back
inferredcites →https://doi.org/10.1016/0304-3975(91)90224-popenalex-snapshot
The existence of refinement mappings
inferredcites →https://doi.org/10.1016/0304-3975(95)00035-uopenalex-snapshot
A hierarchy of temporal logics with past
inferredcites →https://doi.org/10.1016/j.tcs.2004.09.023openalex-snapshot
A compositional approach to CTL* verification
inferredcites →https://doi.org/10.1023/a:1008700623084openalex-snapshot
Verifying Temporal Properties of Reactive Systems: A STeP Tutorial
inferredcites →https://doi.org/10.1109/fmcad.2014.6987598openalex-snapshot
Faster temporal reasoning for infinite-state programs
inferredcites →https://doi.org/10.1137/s0097539793304741openalex-snapshot
The Complexity of Tree Automata and Logics of Programs
inferredcites →https://doi.org/10.1145/1028664.1028776openalex-snapshot
A lightweight LTL runtime verification tool for java
inferredcites →https://doi.org/10.1145/1190215.1190257openalex-snapshot
Proving that programs eventually do something good
inferredcites →https://doi.org/10.1145/1190216.1190257openalex-snapshot
Proving that programs eventually do something good
inferredcites →https://doi.org/10.1145/1218063.1217943openalex-snapshot
Thorough static analysis of device drivers
inferredcites →https://doi.org/10.1145/1925844.1926431openalex-snapshot
Making prophecies with decision predicates
inferredcites →https://doi.org/10.1145/1926385.1926431openalex-snapshot
Making prophecies with decision predicates
inferredcites →https://doi.org/10.1145/2491956.2491969openalex-snapshot
Reasoning about nondeterminism in programs
inferredcites →https://doi.org/10.1145/2535838.2535860openalex-snapshot
A constraint-based approach to solving games on infinite graphs
inferredcites →https://doi.org/10.1145/2578855.2535860openalex-snapshot
A constraint-based approach to solving games on infinite graphs
inferredcites →https://doi.org/10.1145/2632362.2632364openalex-snapshot
CTL+FO verification as constraint solving
inferredcites →https://doi.org/10.1145/4904.4999openalex-snapshot
“Sometimes” and “not never” revisited
inferredcites →https://doi.org/10.1145/567446.567462openalex-snapshot
On the temporal analysis of fairness
inferredcites →https://doi.org/10.1145/567446.567463openalex-snapshot
"Sometime" is sometimes "not never"
inferredcites →https://doi.org/10.2307/2695091openalex-snapshot
An axiomatization of full Computation Tree Logic
inferredcites →https://doi.org/10.5555/2682923.2682942openalex-snapshot
Faster Temporal Reasoning for Infinite-State Programs
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-030-32304-2_20openalex-snapshot
Temporal Verification of Programs via First-Order Fixpoint Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-67067-2_6openalex-snapshot
Proving the Existence of Fair Paths in Infinite-State Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-88885-5_3openalex-snapshot
Automatic Discovery of Fair Paths in Infinite-State Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-89963-3_16openalex-snapshot
Geometric Nontermination Arguments
inferred← citeshttps://doi.org/10.1007/978-981-19-0390-8_121openalex-snapshot
Formal Verification for VRM Requirement Models
inferred← citeshttps://doi.org/10.1016/j.ic.2022.104977openalex-snapshot
LTL falsification in infinite-state systems
inferred← citeshttps://doi.org/10.1016/j.jlamp.2024.101021openalex-snapshot
First order Büchi automata and their application to verification of LTL specifications
inferred← citeshttps://doi.org/10.1109/ispa-bdcloud-sustaincom-socialcom48970.2019.00097openalex-snapshot
Model Checking for the Goal-Feedback-Result Pattern in ROS
inferred← citeshttps://doi.org/10.1145/3294032.3294077openalex-snapshot
Reduction from branching-time property verification of higher-order programs to HFL validity checking
inferred← citeshttps://doi.org/10.1145/3571264openalex-snapshot
Temporal Verification with Answer-Effect Modification: Dependent Temporal Type-and-Effect System with Delimited Continuations
inferred← citeshttps://doi.org/10.1145/3571265openalex-snapshot
Modular Primal-Dual Fixpoint Logic Solving for Temporal Verification
inferred← citeshttps://doi.org/10.23919/mixdes.2018.8436870openalex-snapshot
Towards Embedded Systems Formal Verification Translation from SysML into Petri Nets
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.