On the public citation graph

Set-based analysis of reactive infinite-state systems

https://doi.org/10.1007/bfb0054183
0 signed · 47 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/3-540-63141-0_10openalex-snapshot
Reachability analysis of pushdown automata: Application to model-checking
inferredcites →https://doi.org/10.1007/3-540-63166-6_16openalex-snapshot
Efficient model checking using tabled resolution
inferredcites →https://doi.org/10.1007/bf01384313openalex-snapshot
Property preserving abstractions for the verification of concurrent systems
inferredcites →https://doi.org/10.1007/bfb0017430openalex-snapshot
Solving classes of set constraints with tree automata
inferredcites →https://doi.org/10.1007/s002360050074openalex-snapshot
Decidability of model checking for infinite-state concurrent systems
inferredcites →https://doi.org/10.1016/0167-6423(83)90017-5openalex-snapshot
Using branching time temporal logic to synthesize synchronization skeletons
inferredcites →https://doi.org/10.1016/0168-0072(91)90066-uopenalex-snapshot
Verification of concurrent programs: the automata-theoretic framework*
inferredcites →https://doi.org/10.1016/0743-1066(94)90033-7openalex-snapshot
Constraint logic programming: a survey
inferredcites →https://doi.org/10.1023/a:1005812220011openalex-snapshot
SPASS - Version 0.49
inferredcites →https://doi.org/10.1109/lics.1990.113732openalex-snapshot
A decision procedure for a class of set constraints
inferredcites →https://doi.org/10.1109/lics.1991.151654openalex-snapshot
Logic programs as types for logic programs
inferredcites →https://doi.org/10.1145/143165.143184openalex-snapshot
Inductive definitions, semantics and abstract interpretations
inferredcites →https://doi.org/10.1145/143165.143235openalex-snapshot
Model checking and abstraction
inferredcites →https://doi.org/10.1145/173262.155095openalex-snapshot
Abstract debugging of higher-order imperative languages
inferredcites →https://doi.org/10.1145/567752.567776openalex-snapshot
Flow analysis and optimization of LISP-like structures
inferredcites →https://doi.org/10.1145/96709.96729openalex-snapshot
A finite presentation theorem for approximating logic programs
inferredcites →https://doi.org/10.6100/ir462072openalex-snapshot
Abstract interpretation and partition refinement for model checking
inferredcites →https://doi.org/10.7146/brics.v3i54.20057openalex-snapshot
Pushdown Processes: Games and Model Checking

What points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.2001.2952openalex-snapshot
Set Constraints with Intersection
inferred← citeshttps://doi.org/10.1007/10720327_3openalex-snapshot
Constraint Logic Programming Applied to Model Checking
inferred← citeshttps://doi.org/10.1007/10720327_5openalex-snapshot
Infinite State Model Checking by Abstract Interpretation and Program Specialisation
inferred← citeshttps://doi.org/10.1007/11562931_22openalex-snapshot
Techniques for Scaling Up Analyses Based on Pre-interpretations
inferred← citeshttps://doi.org/10.1007/11562931_23openalex-snapshot
Deductive Multi-valued Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-44755-5_25openalex-snapshot
Experiments with Finite Tree Automata in Coq
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_26openalex-snapshot
Constraint Logic Programming for Local and Symbolic Model-Checking
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_7openalex-snapshot
Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction
inferred← citeshttps://doi.org/10.1007/3-540-45587-6_16openalex-snapshot
Abstract Interpretation over Non-deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-45607-4_6openalex-snapshot
Abstract Conjunctive Partial Deduction Using Regular Types and Its Application to Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-45619-8_9openalex-snapshot
Constraint-Based Infinite Model Checking and Tabulation for Stratified CLP
inferred← citeshttps://doi.org/10.1007/3-540-45627-9_13openalex-snapshot
Model Checking Communication Protocols
inferred← citeshttps://doi.org/10.1007/3-540-46425-5_5openalex-snapshot
Directional Type Checking for Logic Programs: Beyond Discriminative Types
inferred← citeshttps://doi.org/10.1007/3-540-49059-0_16openalex-snapshot
Model Checking in CLP
inferred← citeshttps://doi.org/10.1007/3-540-49099-x_12openalex-snapshot
Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs
inferred← citeshttps://doi.org/10.1007/978-1-4615-1567-8_19openalex-snapshot
Linear Time Datalog and Branching Time Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-45099-3_2openalex-snapshot
Model Checking as Constraint Solving
inferred← citeshttps://doi.org/10.1007/bfb0017466openalex-snapshot
Set constraints: A pearl in research on constraints
inferred← citeshttps://doi.org/10.1007/s100090100049openalex-snapshot
Constraint-based deductive model checking
inferred← citeshttps://doi.org/10.1016/j.ic.2006.12.006openalex-snapshot
Alternating two-way AC-tree automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00447-4openalex-snapshot
On temporal logic versus datalog
inferred← citeshttps://doi.org/10.1109/lics.1998.705643openalex-snapshot
The Horn mu-calculus
inferred← citeshttps://doi.org/10.1145/2370776.2370784openalex-snapshot
Layered fixed point logic
inferred← citeshttps://doi.org/10.1145/325694.325697openalex-snapshot
Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
inferred← citeshttps://doi.org/10.1145/351268.351298openalex-snapshot
Solving coverability problems of petri nets by partial deduction
inferred← citeshttps://doi.org/10.1145/504077.504079openalex-snapshot
Datalog LITE
inferred← citeshttps://doi.org/10.1145/778348.778359openalex-snapshot
From CTL to datalog
inferred← citeshttps://doi.org/10.22028/d291-25722openalex-snapshot
Set based failure diagnosis for concurrent constraint programming
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0510012openalex-snapshot
On relating CTL to Datalog
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.