On the public citation graph

Abstraction Refinement for Termination

https://doi.org/10.1007/11547662_8
0 signed · 129 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/10722167_14openalex-snapshot
On the Completeness of Compositional Reasoning
inferredcites →https://doi.org/10.1007/3-540-44685-0_2openalex-snapshot
Bigraphical Reactive Systems
inferredcites →https://doi.org/10.1007/3-540-44685-0_5openalex-snapshot
Using the Bandera Tool Set to Model-Check Properties of Concurrent Java Software
inferredcites →https://doi.org/10.1007/3-540-44914-0_1openalex-snapshot
Partial Completeness of Abstract Fixpoint Checking
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-45319-9_8openalex-snapshot
Incremental Verification by Abstraction
inferredcites →https://doi.org/10.1007/3-540-45657-0_36openalex-snapshot
Practical Methods for Proving Program Termination
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-24622-0_20openalex-snapshot
A Complete Method for the Synthesis of Linear Ranking Functions
inferredcites →https://doi.org/10.1007/978-3-540-24622-0_23openalex-snapshot
Analysis of Recursive Game Graphs Using Data Flow Equations
inferredcites →https://doi.org/10.1007/978-3-540-24730-2_35openalex-snapshot
A Temporal Logic of Nested Calls and Returns
inferredcites →https://doi.org/10.1007/978-3-540-24756-2_1openalex-snapshot
SLAM and Static Driver Verifier: Technology Transfer of Formal Methods inside Microsoft
inferredcites →https://doi.org/10.1007/978-3-540-27813-9_6openalex-snapshot
Termination of Linear Programs
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_26openalex-snapshot
Localization and Register Sharing for Predicate Abstraction
inferredcites →https://doi.org/10.1007/978-3-540-31987-0_8openalex-snapshot
Summaries for While Programs with Recursion
inferredcites →https://doi.org/10.1007/978-3-540-73580-9openalex-snapshot
Abstraction, Reformulation, and Approximation
inferredcites →https://doi.org/10.1016/s1571-0661(04)80410-9openalex-snapshot
Liveness Checking as Safety Checking
inferredcites →https://doi.org/10.1109/icse.2003.1201217openalex-snapshot
Modular verification of software components in C
inferredcites →https://doi.org/10.1109/lics.2001.932482openalex-snapshot
Successive approximation of abstract transition relations
inferredcites →https://doi.org/10.1109/lics.2004.50openalex-snapshot
Transition invariants
inferredcites →https://doi.org/10.1109/tse.2004.22openalex-snapshot
Modular verification of software components in C
inferredcites →https://doi.org/10.1145/1040305.1040317openalex-snapshot
Transition predicate abstraction and fair termination
inferredcites →https://doi.org/10.1145/2641638.2641655openalex-snapshot
Abstractions from proofs
inferredcites →https://doi.org/10.1145/512760.512770openalex-snapshot
Automatic discovery of linear restraints among variables of a program
inferredcites →https://doi.org/10.1145/512950.512973openalex-snapshot
Abstract interpretation

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11575467_19openalex-snapshot
Termination Analysis of Higher-Order Functional Programs
inferred← citeshttps://doi.org/10.1007/11691372_10openalex-snapshot
SAT-Based Software Certification
inferred← citeshttps://doi.org/10.1007/11691372_21openalex-snapshot
A Region Graph Based Approach to Termination Proofs
inferred← citeshttps://doi.org/10.1007/11817949_7openalex-snapshot
Proving Liveness by Backwards Reachability
inferred← citeshttps://doi.org/10.1007/11817963_16openalex-snapshot
Counterexamples with Loops for Predicate Abstraction
inferred← citeshttps://doi.org/10.1007/11817963_35openalex-snapshot
Automatic Termination Proofs for Programs with Shape-Shifting Heaps
inferred← citeshttps://doi.org/10.1007/11817963_36openalex-snapshot
Termination Analysis with Calling Context Graphs
inferred← citeshttps://doi.org/10.1007/11817963_37openalex-snapshot
Terminator: Beyond Safety
inferred← citeshttps://doi.org/10.1007/11817963_47openalex-snapshot
Programs with Lists Are Counter Automata
inferred← citeshttps://doi.org/10.1007/11901433_39openalex-snapshot
Discovering Likely Method Specifications
inferred← citeshttps://doi.org/10.1007/11921240_23openalex-snapshot
Model Checking Duration Calculus: A Practical Approach
inferred← citeshttps://doi.org/10.1007/978-3-031-65627-9_13openalex-snapshot
Toward Liveness Proofs at Scale
inferred← citeshttps://doi.org/10.1007/978-3-031-90643-5_20openalex-snapshot
Implicit Rankings for Verifying Liveness Properties in First-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-98685-7_8openalex-snapshot
Branching Bisimulation Learning
inferred← citeshttps://doi.org/10.1007/978-3-540-69149-5_37openalex-snapshot
Model-Checking Software Using Precise Abstractions
inferred← citeshttps://doi.org/10.1007/978-3-540-70590-1_7openalex-snapshot
Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-71493-4_76openalex-snapshot
A Sound and Complete Proof Rule for Region Stability of Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-73370-6_19openalex-snapshot
ACSAR: Software Model Checking with Transfinite Refinement
inferred← citeshttps://doi.org/10.1007/978-3-540-75596-8_12openalex-snapshot
Proving Termination of Tree Manipulating Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-78163-9_21openalex-snapshot
All You Need Is Compassion
inferred← citeshttps://doi.org/10.1007/978-3-540-78800-3_16openalex-snapshot
A SAT-Based Approach to Size Change Termination with Global Ranking Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-85114-1_14openalex-snapshot
Dependency Analysis for Control Flow Cycles in Reactive Communicating Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-02348-4_3openalex-snapshot
Proving Termination of Integer Term Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-642-02959-2_22openalex-snapshot
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-02979-0_20openalex-snapshot
Automata-Based Termination Proofs
inferred← citeshttps://doi.org/10.1007/978-3-642-11512-7_7openalex-snapshot
Explicit Fair Scheduling for Dynamic Control
inferred← citeshttps://doi.org/10.1007/978-3-642-12002-2_19openalex-snapshot
Ranking Function Synthesis for Bit-Vector Relations
inferred← citeshttps://doi.org/10.1007/978-3-642-13754-9_4openalex-snapshot
The Localization Reduction and Counterexample-Guided Abstraction Refinement
inferred← citeshttps://doi.org/10.1007/978-3-642-14295-6_9openalex-snapshot
Termination Analysis with Compositional Transition Invariants
inferred← citeshttps://doi.org/10.1007/978-3-642-15769-1_19openalex-snapshot
Alternation for Termination
inferred← citeshttps://doi.org/10.1007/978-3-642-16265-7_10openalex-snapshot
A Compositional Method for Deciding Equivalence and Termination of Nondeterministic Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-18275-4_26openalex-snapshot
Decision Procedures for Automating Termination Proofs
inferred← citeshttps://doi.org/10.1007/978-3-642-19325-5_8openalex-snapshot
A Compositional Method for Deciding Program Termination
inferred← citeshttps://doi.org/10.1007/978-3-642-19835-9_9openalex-snapshot
Loop Summarization and Termination Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-27705-4_21openalex-snapshot
Termination Analysis of Imperative Programs Using Bitvector Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-642-28756-5_17openalex-snapshot
Compositional Termination Proofs for Multi-threaded Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-28891-3_32openalex-snapshot
Abstract Model Repair
inferred← citeshttps://doi.org/10.1007/978-3-642-31424-7_12openalex-snapshot
Termination Analysis with Algorithmic Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-33125-1_28openalex-snapshot
Termination Proofs for Linear Simple Loops
inferred← citeshttps://doi.org/10.1007/978-3-642-39611-3_9openalex-snapshot
Proving Mutual Termination of Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-39799-8_27openalex-snapshot
Proving Termination Starting from the End
inferred← citeshttps://doi.org/10.1007/978-3-642-54013-4_25openalex-snapshot
Policy Iteration-Based Conditional Termination and Ranking Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-54833-8_21openalex-snapshot
Automatic Termination Verification for Higher-Order Functional Programs
inferred← citeshttps://doi.org/10.1007/s00165-007-0029-4openalex-snapshot
Program verification with interacting analysis plugins
inferred← citeshttps://doi.org/10.1007/s00165-009-0110-2openalex-snapshot
Verification and falsification of programs with loops using predicate abstraction
inferred← citeshttps://doi.org/10.1007/s00165-012-0252-5openalex-snapshot
Proving termination of nonlinear command sequences
inferred← citeshttps://doi.org/10.1007/s10009-006-0021-yopenalex-snapshot
Some current topics in model checking
inferred← citeshttps://doi.org/10.1007/s10009-009-0100-yopenalex-snapshot
Special section on advances in reachability analysis and decision procedures: contributions to abstraction-based system verification
inferred← citeshttps://doi.org/10.1007/s10009-013-0288-8openalex-snapshot
Termination proofs for linear simple loops
inferred← citeshttps://doi.org/10.1007/s10703-012-0176-yopenalex-snapshot
Loop summarization using state and transition invariants
inferred← citeshttps://doi.org/10.1007/s10703-013-0186-4openalex-snapshot
Ranking function synthesis for bit-vector relations
inferred← citeshttps://doi.org/10.1007/s10703-015-0234-3openalex-snapshot
Proving mutual termination
inferred← citeshttps://doi.org/10.1007/s10703-023-00439-6openalex-snapshot
Thread-modular counter abstraction: automated safety and termination proofs of parameterized software by reduction to sequential program verification
inferred← citeshttps://doi.org/10.1007/s10817-016-9389-xopenalex-snapshot
Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic
inferred← citeshttps://doi.org/10.1007/s11241-015-9238-8openalex-snapshot
Reliable social sensing with physical constraints: analytic bounds and performance evaluation
inferred← citeshttps://doi.org/10.1007/s11334-006-0021-9openalex-snapshot
State-rich model checking
inferred← citeshttps://doi.org/10.1007/s13218-010-0015-5openalex-snapshot
Static Termination Analysis for Prolog Using Term Rewriting and SAT Solving
inferred← citeshttps://doi.org/10.1016/bs.adcom.2014.12.002openalex-snapshot
Proving Programs Terminate Using Well-Founded Orderings, Ramsey's Theorem, and Matrices
inferred← citeshttps://doi.org/10.1016/j.apal.2015.08.002openalex-snapshot
An intuitionistic version of Ramsey's Theorem and its use in Program Termination
inferred← citeshttps://doi.org/10.1016/j.ic.2012.03.003openalex-snapshot
A new look at the automatic synthesis of linear ranking functions
inferred← citeshttps://doi.org/10.1109/bife.2013.3openalex-snapshot
Termination of Two Variable Homogeneous Linear Loops
inferred← citeshttps://doi.org/10.1109/iccps.2011.24openalex-snapshot
Abstraction Refinement for Stability
inferred← citeshttps://doi.org/10.1109/icsess.2015.7339097openalex-snapshot
Termination of initialized two variable homogeneous linear loops
inferred← citeshttps://doi.org/10.1109/icst.2017.78openalex-snapshot
Abstraction refinement for non-zeno fairness verification of linear hybrid automata
inferred← citeshttps://doi.org/10.1109/iscsct.2008.58openalex-snapshot
Termination of Nested Loop
inferred← citeshttps://doi.org/10.1109/sefm.2007.32openalex-snapshot
Proving Termination by Divergence.
inferred← citeshttps://doi.org/10.1109/synasc.2009.70openalex-snapshot
Automated Methods for Proving Program Termination and Liveness
inferred← citeshttps://doi.org/10.1109/tbdata.2017.2669308openalex-snapshot
Scalable Uncertainty-Aware Truth Discovery in Big Data Social Sensing Applications for Cyber-Physical Systems
inferred← citeshttps://doi.org/10.1109/tcad.2008.923410openalex-snapshot
A Survey of Automated Techniques for Formal Software Verification
inferred← citeshttps://doi.org/10.1142/s0129054107004553openalex-snapshot
MODULAR RANKING ABSTRACTION
inferred← citeshttps://doi.org/10.1145/1040305.1040317openalex-snapshot
Transition predicate abstraction and fair termination
inferred← citeshttps://doi.org/10.1145/1133255.1134029openalex-snapshot
Termination proofs for systems code
inferred← citeshttps://doi.org/10.1145/1133981.1134029openalex-snapshot
Termination proofs for systems code
inferred← citeshttps://doi.org/10.1145/1190215.1190249openalex-snapshot
Variance analyses from invariance analyses
inferred← citeshttps://doi.org/10.1145/1190215.1190257openalex-snapshot
Proving that programs eventually do something good
inferred← citeshttps://doi.org/10.1145/1190216.1190249openalex-snapshot
Variance analyses from invariance analyses
inferred← citeshttps://doi.org/10.1145/1190216.1190257openalex-snapshot
Proving that programs eventually do something good
inferred← citeshttps://doi.org/10.1145/1217935.1217943openalex-snapshot
Thorough static analysis of device drivers
inferred← citeshttps://doi.org/10.1145/1218063.1217943openalex-snapshot
Thorough static analysis of device drivers
inferred← citeshttps://doi.org/10.1145/1353445.1353450openalex-snapshot
Size-change termination with difference constraints
inferred← citeshttps://doi.org/10.1145/1709093.1709095openalex-snapshot
A termination analyzer for Java bytecode based on path-length
inferred← citeshttps://doi.org/10.1145/1838552.1838553openalex-snapshot
A counterexample-guided abstraction-refinement framework for markov decision processes
inferred← citeshttps://doi.org/10.1145/1965724.1965743openalex-snapshot
A decade of software model checking with SLAM
inferred← citeshttps://doi.org/10.1145/2429069.2429085openalex-snapshot
Quantitative abstraction refinement
inferred← citeshttps://doi.org/10.1145/2480359.2429085openalex-snapshot
Quantitative abstraction refinement
inferred← citeshttps://doi.org/10.1145/2737924.2737993openalex-snapshot
Termination and non-termination specification inference
inferred← citeshttps://doi.org/10.1145/2813885.2737993openalex-snapshot
Termination and non-termination specification inference
inferred← citeshttps://doi.org/10.1145/2933575.2935310openalex-snapshot
Proving Liveness of Parameterized Programs
inferred← citeshttps://doi.org/10.1145/3290352openalex-snapshot
Trace abstraction modulo probability
inferred← citeshttps://doi.org/10.1145/3704904openalex-snapshot
A Primal-Dual Perspective on Program Verification Algorithms
inferred← citeshttps://doi.org/10.1145/3808348openalex-snapshot
Supermartingales for Unique Fixed Points: A Unified Approach to Lower Bound Verification
inferred← citeshttps://doi.org/10.15514/syrcose-2008-2-14openalex-snapshot
How to Cook an Automated System for Linux Driver Verification
inferred← citeshttps://doi.org/10.22028/d291-25913openalex-snapshot
Verification of the C0 compiler implementation on the source code level
inferred← citeshttps://doi.org/10.3929/ethz-a-005170555openalex-snapshot
Liveness checking as safety checking to find shortest counterexamples to linear time properties
inferred← citeshttps://doi.org/10.3929/ethz-a-006707337openalex-snapshot
Termination Analysis for Bit-Vector Programs
inferred← citeshttps://doi.org/10.4204/eptcs.169.5openalex-snapshot
Generalised Interpolation by Solving Recursion-Free Horn Clauses
inferred← citeshttps://doi.org/10.4230/lipics.rta.2011.41openalex-snapshot
Termination Analysis of C Programs Using Compiler Intermediate Languages
inferred← citeshttps://doi.org/10.48550/arxiv.1905.12734openalex-snapshot
Sub-Turing Islands in the Wild
inferred← citeshttps://doi.org/10.5075/epfl-thesis-5220openalex-snapshot
Decision Procedures for Program Synthesis and Verification
inferred← citeshttps://doi.org/10.5287/ora-y0bamqrpdopenalex-snapshot
Automated quantitative software verification
inferred← citeshttps://doi.org/10.5555/1946284.1946310openalex-snapshot
Decision procedures for automating termination proofs
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.