On the public citation graph

A Perfect Model for Bounded Verification

0 signed · 53 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/11532231_25openalex-snapshot
On the Complexity of Equational Horn Clauses
inferredcites →https://doi.org/10.1007/11562948_36openalex-snapshot
Flat Counter Automata Almost Everywhere!
inferredcites →https://doi.org/10.1007/978-3-540-30476-0_22openalex-snapshot
Composition of Accelerations to Verify Infinite Heterogeneous Systems
inferredcites →https://doi.org/10.1007/978-3-540-30538-5_34openalex-snapshot
Visibly Pushdown Games
inferredcites →https://doi.org/10.1007/978-3-540-31980-1_7openalex-snapshot
Context-Bounded Model Checking of Concurrent Software
inferredcites →https://doi.org/10.1007/978-3-540-85114-1_2openalex-snapshot
The Case for Context-Bounded Verification of Concurrent Programs
inferredcites →https://doi.org/10.1007/978-3-642-22110-1_60openalex-snapshot
Model Checking Recursive Programs with Numeric Data Types
inferredcites →https://doi.org/10.1007/s10009-008-0064-3openalex-snapshot
FAST: acceleration from theory to practice
inferredcites →https://doi.org/10.1016/0020-0190(74)90043-xopenalex-snapshot
A note on semilinear sets and bounded-reversal multihead pushdown automata
inferredcites →https://doi.org/10.1016/0020-0271(67)90007-1openalex-snapshot
The mathematical theory of context-free languages
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0304-3975(82)90115-3openalex-snapshot
The complexity of presburger arithmetic with bounded quantifier alternation depth
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/s0019-9958(74)90994-2openalex-snapshot
Bounded-reversal multihead finite automata languages
inferredcites →https://doi.org/10.1016/s0304-3975(99)00033-xopenalex-snapshot
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
inferredcites →https://doi.org/10.1023/a:1011276507260openalex-snapshot
Bounded Model Checking Using Satisfiability Solving
inferredcites →https://doi.org/10.1090/s0002-9939-1978-0500555-0openalex-snapshot
A Bound on Solutions of Linear Integer Equalities and Inequalities
inferredcites →https://doi.org/10.1109/focs.1965.19openalex-snapshot
On multi-head finite automata
inferredcites →https://doi.org/10.1109/lics.2007.9openalex-snapshot
A Robust Class of Context-Sensitive Languages
inferredcites →https://doi.org/10.1109/lics.2012.39openalex-snapshot
A Perfect Model for Bounded Verification
inferredcites →https://doi.org/10.1145/1516512.1516518openalex-snapshot
Adding nesting structure to words
inferredcites →https://doi.org/10.1145/1925844.1926443openalex-snapshot
Complexity of pattern-based verification for multithreaded programs
inferredcites →https://doi.org/10.1145/1926385.1926443openalex-snapshot
Complexity of pattern-based verification for multithreaded programs
inferredcites →https://doi.org/10.1145/322047.322058openalex-snapshot
Reversal-Bounded Multicounter Machines and Their Decision Problems
inferredcites →https://doi.org/10.1145/322374.322380openalex-snapshot
On Communicating Finite-State Machines
inferredcites →https://doi.org/10.1145/775832.775928openalex-snapshot
Behavioral consistency of C and verilog programs using bounded model checking
inferredcites →https://doi.org/10.1145/800133.804361openalex-snapshot
Presburger arithmetic with bounded quantifier alternation
inferredcites →https://doi.org/10.1147/rd.105.0388openalex-snapshot
On Multi-Head Finite Automata
inferredcites →https://doi.org/10.21236/ada461052openalex-snapshot
Behavioral Consistency of C and Verilog Programs Using Bounded Model Checking
inferredcites →https://doi.org/10.2168/lmcs-7(4:4)2011openalex-snapshot
Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads
inferredcites →https://doi.org/10.25596/jalc-2001-519openalex-snapshot
Conjunctive Grammars
inferredcites →https://doi.org/10.4204/eptcs.63.13openalex-snapshot
Bounded Parikh Automata

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-24886-4_12openalex-snapshot
On Timed Scope-Bounded Context-Sensitive Languages
inferred← citeshttps://doi.org/10.1007/978-3-031-30829-1openalex-snapshot
Foundations of Software Science and Computation Structures
inferred← citeshttps://doi.org/10.1007/978-3-031-30829-1_12openalex-snapshot
Unboundedness Problems for Machines with Reversal-Bounded Counters
inferred← citeshttps://doi.org/10.1007/978-3-319-11936-6_19openalex-snapshot
The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-44522-8_32openalex-snapshot
A Unifying Approach for Multistack Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-662-49674-9_45openalex-snapshot
Acceleration in Multi-PushDown Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-53132-7_4openalex-snapshot
A Perfect Class of Context-Sensitive Timed Languages
inferred← citeshttps://doi.org/10.1007/s00236-016-0290-1openalex-snapshot
Reachability analysis of reversal-bounded automata on series–parallel graphs
inferred← citeshttps://doi.org/10.1016/j.ic.2016.07.010openalex-snapshot
On the path-width of integer linear programming
inferred← citeshttps://doi.org/10.1109/lics.2013.9openalex-snapshot
On the Context-Freeness Problem for Vector Addition Systems
inferred← citeshttps://doi.org/10.1142/s0129054115500367openalex-snapshot
Asynchronous Parallel Communicating Systems of Pushdown Automata
inferred← citeshttps://doi.org/10.1145/3062341.3062384openalex-snapshot
Flatten and conquer: a framework for efficient analysis of string constraints
inferred← citeshttps://doi.org/10.1145/3140587.3062384openalex-snapshot
Flatten and conquer: a framework for efficient analysis of string constraints
inferred← citeshttps://doi.org/10.23638/lmcs-16(4:4)2020openalex-snapshot
Verification of Flat FIFO Systems
inferred← citeshttps://doi.org/10.4204/eptcs.161.9openalex-snapshot
On the Path-Width of Integer Linear Programming
inferred← citeshttps://doi.org/10.4204/eptcs.193.8openalex-snapshot
Reachability Analysis of Reversal-bounded Automata on Series-Parallel Graphs
inferred← citeshttps://doi.org/10.4230/lipics.csl.2021.37openalex-snapshot
On Flat Lossy Channel Machines
inferred← citeshttps://doi.org/10.46298/lmcs-18(1:19)2022openalex-snapshot
Bounded Reachability Problems are Decidable in FIFO Machines
inferred← citeshttps://doi.org/10.48550/arxiv.1206.4860openalex-snapshot
Asynchronous Multi-Tape Automata Intersection: Undecidability and Approximation
inferred← citeshttps://doi.org/10.70675/aaf5ababzf26dz49d5zb693z1b5e47ced775openalex-snapshot
Formal Verification of Communicating Automata
showing the first 20 of 21 · page through all 21
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.