On the public citation graph

Modular Primal-Dual Fixpoint Logic Solving for Temporal Verification

https://doi.org/10.1145/3571265
0 signed · 40 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.1007/s100090100049openalex-snapshot
Constraint-based deductive model checking
inferredcites →https://doi.org/10.1007/s10703-016-0249-4openalex-snapshot
SMT-based model checking for recursive programs
inferredcites →https://doi.org/10.1007/s10817-016-9388-yopenalex-snapshot
Analyzing Program Termination and Complexity Automatically with AProVE
inferredcites →https://doi.org/10.1007/s10817-019-09532-0openalex-snapshot
Automatically Verifying Temporal Properties of Pointer Programs with Cyclic Proof
inferredcites →https://doi.org/10.1016/0743-1066(94)90033-7openalex-snapshot
Constraint logic programming: a survey
inferredcites →https://doi.org/10.1017/s1471068411000627openalex-snapshot
Generalization strategies for the verification of infinite state systems
inferredcites →https://doi.org/10.1145/1133255.1134029openalex-snapshot
Termination proofs for systems code
inferredcites →https://doi.org/10.1145/1328897.1328459openalex-snapshot
Proving non-termination
inferredcites →https://doi.org/10.1145/1925844.1926431openalex-snapshot
Making prophecies with decision predicates
inferredcites →https://doi.org/10.1145/2345156.2254112openalex-snapshot
Synthesizing software verifiers from proof rules
inferredcites →https://doi.org/10.1145/2499370.2491969openalex-snapshot
Reasoning about nondeterminism in programs
inferredcites →https://doi.org/10.1145/2629488openalex-snapshot
Ranking Functions for Linear-Constraint Loops
inferredcites →https://doi.org/10.1145/2813885.2737993openalex-snapshot
Termination and non-termination specification inference
inferredcites →https://doi.org/10.1145/3060257openalex-snapshot
Verifying Increasingly Expressive Temporal Logics for Infinite-State Systems
inferredcites →https://doi.org/10.1145/3209108.3209204openalex-snapshot
A Fixpoint Logic and Dependent Effects for Temporal Property Verification
inferredcites →https://doi.org/10.1145/3373718.3394766openalex-snapshot
On Computability of Logical Approaches to Branching-Time Property Verification of Programs
inferredcites →https://doi.org/10.2307/2275338openalex-snapshot
μ-definable sets of integers

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-031-71162-6_31openalex-snapshot
Sound and Complete Witnesses for Template-Based Verification of LTL Properties on Polynomial Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-75387-9_17openalex-snapshot
Synthesis from Infinite-State Generalized Reactivity(1) Specifications
inferred← citeshttps://doi.org/10.1007/978-3-031-78750-8_9openalex-snapshot
CTL* Verification and Synthesis Using Existential Horn Clauses
inferred← citeshttps://doi.org/10.1007/978-3-031-97439-7_10openalex-snapshot
$$CTL^*$$ Verification and Synthesis Using Existential Horn Clauses
inferred← citeshttps://doi.org/10.1007/978-3-031-98682-6_16openalex-snapshot
Sprout: A Verifier for Symbolic Multiparty Protocols
inferred← citeshttps://doi.org/10.1007/978-3-031-98685-7_14openalex-snapshot
Issy: A Comprehensive Tool for Specification and Synthesis of Infinite-State Reactive Systems
inferred← citeshttps://doi.org/10.1007/978-3-032-22723-2_7openalex-snapshot
Efficient Ranking Function-Based Termination Analysis via Bidirectional Decompositional Search
inferred← citeshttps://doi.org/10.1007/978-3-032-22752-2_21openalex-snapshot
Modular Attractor Acceleration in Infinite-State Games
inferred← citeshttps://doi.org/10.1007/978-3-032-32526-6_4openalex-snapshot
Lagrangian-Based Duality for Quantified SMT Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-032-32537-2_3openalex-snapshot
KoAT: Automatic Complexity and Termination Analysis of Integer Programs
inferred← citeshttps://doi.org/10.1145/3632899openalex-snapshot
Solving Infinite-State Games via Acceleration
inferred← citeshttps://doi.org/10.1145/3656457openalex-snapshot
Inductive Approach to Spacer
inferred← citeshttps://doi.org/10.1145/3691620.3695599openalex-snapshot
Enhancing Compositional Static Analysis with Dynamic Analysis
inferred← citeshttps://doi.org/10.1145/3704888openalex-snapshot
Translation of Temporal Logic for Efficient Infinite-State Reactive Synthesis
inferred← citeshttps://doi.org/10.1145/3704904openalex-snapshot
A Primal-Dual Perspective on Program Verification Algorithms
inferred← citeshttps://doi.org/10.1145/3704914openalex-snapshot
Algebraic Temporal Effects: Temporal Verification of Recursively Typed Higher-Order Programs
inferred← citeshttps://doi.org/10.1145/3720493openalex-snapshot
Characterizing Implementability of Global Protocols with Infinite States and Data
inferred← citeshttps://doi.org/10.1145/3729320openalex-snapshot
Verifying Solutions to Semantics-Guided Synthesis Problems
inferred← citeshttps://doi.org/10.1145/3776726openalex-snapshot
Parameterized Infinite-State Reactive Synthesis
inferred← citeshttps://doi.org/10.1145/3779416openalex-snapshot
An Abstract Fixed-Point Theorem for Horn Formula Equations
inferred← citeshttps://doi.org/10.1145/3808205openalex-snapshot
Sound Termination and Non-termination Analysis of C Programs with Bit-Precise Bounded Semantics and Advanced Constructs
inferred← citeshttps://doi.org/10.1145/3808319openalex-snapshot
Implementability of Global Distributed Protocols Modulo Network Architectures
inferred← citeshttps://doi.org/10.1145/3808348openalex-snapshot
Supermartingales for Unique Fixed Points: A Unified Approach to Lower Bound Verification
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.