On the public citation graph
Sequentializing Parameterized Programs
0 signed · 45 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/3-540-45657-0_9openalex-snapshot
Liveness with (0,1, ∞)- Counter Abstraction
inferredcites →https://doi.org/10.1007/3-540-45694-5_8openalex-snapshot
Network Invariants in Action*
inferredcites →https://doi.org/10.1007/3-540-63166-6_41openalex-snapshot
Symbolic model checking with rich assertional languages
inferredcites →https://doi.org/10.1007/978-3-540-30124-0_26openalex-snapshot
Parameterized Model Checking of Ring-Based Message Passing Systems
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-70545-1_15openalex-snapshot
Local Proofs for Linear-Time Properties of Concurrent Programs
inferredcites →https://doi.org/10.1007/978-3-540-85114-1_19openalex-snapshot
Symbolic Context-Bounded Analysis of Multithreaded Java Programs
inferredcites →https://doi.org/10.1007/978-3-642-00768-2_11openalex-snapshot
Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
inferredcites →https://doi.org/10.1007/978-3-642-02658-4openalex-snapshot
Computer Aided Verification
inferredcites →https://doi.org/10.1007/978-3-642-02658-4_36openalex-snapshot
Reducing Context-Bounded Concurrent Reachability to Sequential Reachability
inferredcites →https://doi.org/10.1007/978-3-642-02658-4_38openalex-snapshot
Static and Precise Detection of Concurrency Errors in Systems Code Using SMT Solvers
inferredcites →https://doi.org/10.1007/978-3-642-02658-4_9openalex-snapshot
Symbolic Counter Abstraction for Concurrent Software
inferredcites →https://doi.org/10.1007/978-3-642-14295-6_54openalex-snapshot
Model-Checking Parameterized Concurrent Programs Using Linear Interfaces
inferredcites →https://doi.org/10.1007/978-3-642-16164-3_17openalex-snapshot
Context-Bounded Translations for Concurrent Software: An Empirical Evaluation
inferredcites →https://doi.org/10.1007/978-3-642-19835-9_4openalex-snapshot
Compositionality Entails Sequentializability
inferredcites →https://doi.org/10.1007/s10703-009-0078-9openalex-snapshot
Reducing concurrent analysis under a context bound to sequential analysis
inferredcites →https://doi.org/10.1145/1250734.1250785openalex-snapshot
Iterative context bounding for systematic testing of multithreaded programs
inferredcites →https://doi.org/10.1145/1542476.1542500openalex-snapshot
Analyzing recursive programs using a fixed-point calculus
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-43264-4_8openalex-snapshot
Verifying Programs by Bounded Tree-Width Behavior Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-08867-9_39openalex-snapshot
Bounded Model Checking of Multi-threaded C Programs via Lazy Sequentialization
inferred← citeshttps://doi.org/10.1007/978-3-319-46520-3_12openalex-snapshot
Lazy Sequentialization for the Safety Verification of Unbounded Concurrent Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-51963-0_2openalex-snapshot
Verifying Parametric Thread Creation
inferred← citeshttps://doi.org/10.1007/978-3-319-59647-1_20openalex-snapshot
Concurrent Program Verification with Lazy Sequentialization and Interval Analysis
inferred← citeshttps://doi.org/10.1007/978-3-319-63390-9_9openalex-snapshot
Model-Checking Linear-Time Properties of Parametrized Asynchronous Shared-Memory Pushdown Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-66197-1_12openalex-snapshot
Using Shared Memory Abstractions to Design Eager Sequentializations for Weak Memory Models
inferred← citeshttps://doi.org/10.1007/978-3-642-19835-9_4openalex-snapshot
Compositionality Entails Sequentializability
inferred← citeshttps://doi.org/10.1007/978-3-642-23217-6_14openalex-snapshot
Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations
inferred← citeshttps://doi.org/10.1007/978-3-642-28756-5_31openalex-snapshot
Bounded Phase Analysis of Message-Passing Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-36742-7_46openalex-snapshot
CSeq: A Sequentialization Tool for C
inferred← citeshttps://doi.org/10.1007/978-3-642-54862-8_29openalex-snapshot
Lazy-CSeq: A Lazy Sequentialization Tool for C
inferred← citeshttps://doi.org/10.1007/978-3-642-54862-8_30openalex-snapshot
MU-CSeq: Sequentialization of C Programs by Shared Memory Unwindings
inferred← citeshttps://doi.org/10.1007/s10009-013-0276-zopenalex-snapshot
Bounded phase analysis of message-passing programs
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104588openalex-snapshot
Reachability of scope-bounded multistack pushdown systems
inferred← citeshttps://doi.org/10.1109/ase.2013.6693139openalex-snapshot
CSeq: A concurrency pre-processor for sequential C verification tools
inferred← citeshttps://doi.org/10.1109/ase.2015.108openalex-snapshot
Lazy-CSeq: A Context-Bounded Model Checking Tool for Multi-threaded C-Programs
inferred← citeshttps://doi.org/10.1145/2889160.2891045openalex-snapshot
Code parallelization through sequential code search
inferred← citeshttps://doi.org/10.1145/3478536openalex-snapshot
Bounded Verification of Multi-threaded Programs via Lazy Sequentialization
inferred← citeshttps://doi.org/10.1145/3519939.3523727openalex-snapshot
Sound sequentialization for concurrent program verification
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2012.173openalex-snapshot
Scope-bounded Multistack Pushdown Systems: Fixed-Point, Sequentialization, and Tree-Width
inferred← citeshttps://doi.org/10.48550/arxiv.1606.08707openalex-snapshot
On parametrized verification of asynchronous, shared-memory pushdown systems
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.