On the public citation graph

Logic programming and model checking

0 signed · 65 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.1006/inco.1993.1024openalex-snapshot
Model-Checking in Dense Real-Time
inferredcites →https://doi.org/10.1006/inco.1994.1045openalex-snapshot
Symbolic Model Checking for Real-Time Systems
inferredcites →https://doi.org/10.1007/3-540-11494-7_22openalex-snapshot
Specification and verification of concurrent systems in CESAR
inferredcites →https://doi.org/10.1007/3-540-16492-8_66openalex-snapshot
OLD resolution with tabulation
inferredcites →https://doi.org/10.1007/3-540-60045-0_52openalex-snapshot
Local model checking for real-time systems
inferredcites →https://doi.org/10.1007/3-540-61474-5_85openalex-snapshot
The state of Spin
inferredcites →https://doi.org/10.1007/3-540-61474-5_88openalex-snapshot
The Concurrency Factory: A development environment for concurrent systems
inferredcites →https://doi.org/10.1007/3-540-61474-5_93openalex-snapshot
Symbolic model checking
inferredcites →https://doi.org/10.1007/3-540-61511-3_98openalex-snapshot
An abstract machine for fixed-order dynamically stratified programs
inferredcites →https://doi.org/10.1007/3-540-63166-6_16openalex-snapshot
Efficient model checking using tabled resolution
inferredcites →https://doi.org/10.1007/978-3-540-69850-0_12openalex-snapshot
DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bfb0025774openalex-snapshot
Design and synthesis of synchronization skeletons using branching time temporal logic
inferredcites →https://doi.org/10.1007/bfb0031987openalex-snapshot
The theory of timed automata
inferredcites →https://doi.org/10.1007/bfb0054161openalex-snapshot
Fully local and efficient evaluation of alternating fixed points
inferredcites →https://doi.org/10.1016/0304-3975(82)90125-6openalex-snapshot
Results on the propositional μ-calculus
inferredcites →https://doi.org/10.1016/0304-3975(83)90114-7openalex-snapshot
Calculi for synchrony and asynchrony
inferredcites →https://doi.org/10.1016/0304-3975(94)90010-8openalex-snapshot
A theory of timed automata
inferredcites →https://doi.org/10.1109/lics.1990.113766openalex-snapshot
Model-checking for real-time systems
inferredcites →https://doi.org/10.1109/lics.1994.316076openalex-snapshot
A compositional proof system for the modal μ-calculus
inferredcites →https://doi.org/10.1145/116825.116838openalex-snapshot
The well-founded semantics for general logic programs
inferredcites →https://doi.org/10.1145/227595.227597openalex-snapshot
Tabled evaluation with delaying for general logic programs
inferredcites →https://doi.org/10.1145/242223.242257openalex-snapshot
Formal methods
inferredcites →https://doi.org/10.1145/41625.41635openalex-snapshot
Constraint logic programming
inferredcites →https://doi.org/10.1145/512644.512661openalex-snapshot
Expressing interesting properties of programs in propositional temporal logic
inferredcites →https://doi.org/10.1145/512950.512973openalex-snapshot
Abstract interpretation
inferredcites →https://doi.org/10.1145/5397.5399openalex-snapshot
Automatic verification of finite-state concurrent systems using temporal logic specifications
inferredcites →https://doi.org/10.25405/ncl.34123050openalex-snapshot
Formal Methods: State of the Art and Future Directions
inferredcites →https://doi.org/10.6100/ir462072openalex-snapshot
Abstract interpretation and partition refinement for model checking
inferredcites →https://doi.org/10.7146/brics.v1i34.21609openalex-snapshot
A Compositional Proof System for the Modal mu-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/10704567_24openalex-snapshot
A Parameterized Unfold/Fold Transformation Framework for Definite Logic Programs
inferred← citeshttps://doi.org/10.1007/11532231_5openalex-snapshot
Tabling for Higher-Order Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_8openalex-snapshot
Verification Using Tabled Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_40openalex-snapshot
Model Checking for Timed Logic Processes
inferred← citeshttps://doi.org/10.1007/3-540-45241-9_2openalex-snapshot
Design and Implementation of the High-Level Specification Language CSP(LP) in Prolog
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_19openalex-snapshot
A Proof-Theoretic Foundation for Tabled Higher-Order Logic Programming
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-46674-6_27openalex-snapshot
Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs
inferred← citeshttps://doi.org/10.1007/978-0-387-35578-8_14openalex-snapshot
An Optimizing Compiler for Efficient Model Checking
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-45236-2_46openalex-snapshot
ProB: A Model Checker for B
inferred← citeshttps://doi.org/10.1007/978-3-540-69611-7_16openalex-snapshot
ARMC: The Logical Choice for Software Model Checking with Abstraction Refinement
inferred← citeshttps://doi.org/10.1007/978-3-642-39799-8_61openalex-snapshot
Solving Existentially Quantified Horn Clauses
inferred← citeshttps://doi.org/10.1007/s10009-003-0128-3openalex-snapshot
Model-based testing for real
inferred← citeshttps://doi.org/10.1007/s10009-007-0063-9openalex-snapshot
ProB: an automated analysis toolset for the B method
inferred← citeshttps://doi.org/10.1007/s10009-009-0132-3openalex-snapshot
Seven at one stroke: LTL model checking for high-level specifications in B, Z, CSP, and more
inferred← citeshttps://doi.org/10.1007/s10703-005-2254-xopenalex-snapshot
Two Case Studies of Semantics Execution in Maude: CCS and LOTOS
inferred← citeshttps://doi.org/10.1016/s0164-1212(03)00076-1openalex-snapshot
Model based testing in incremental system development
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00447-4openalex-snapshot
On temporal logic versus datalog
inferred← citeshttps://doi.org/10.1016/s0743-1066(00)00005-4openalex-snapshot
An abstract machine for efficiently computing queries to well-founded models
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80509-7openalex-snapshot
Memoization-Based Proof Search in LF
inferred← citeshttps://doi.org/10.1017/s1471068411000500openalex-snapshot
XSB: Extending Prolog with Tabled Logic Programming
inferred← citeshttps://doi.org/10.1023/a:1018990308362openalex-snapshot
Tabling for non‐monotonic programming
inferred← citeshttps://doi.org/10.1109/ecbs.2000.839894openalex-snapshot
Model checking the Java meta-locking algorithm
inferred← citeshttps://doi.org/10.1145/1141277.1141703openalex-snapshot
A UML model consistency verification approach based on meta-modeling formalization
inferred← citeshttps://doi.org/10.1145/1243987.1243990openalex-snapshot
Model checking the Java metalocking algorithm
inferred← citeshttps://doi.org/10.1145/1389449.1389450openalex-snapshot
Declarative programming for verification
inferred← citeshttps://doi.org/10.1145/504077.504079openalex-snapshot
Datalog LITE
inferred← citeshttps://doi.org/10.1145/508171.508175openalex-snapshot
Model-Carrying Code (MCC)
inferred← citeshttps://doi.org/10.1145/571157.571171openalex-snapshot
Transforming the .NET intermediate language using path logic programming
inferred← citeshttps://doi.org/10.1145/778348.778359openalex-snapshot
From CTL to datalog
inferred← citeshttps://doi.org/10.1504/ijaose.2007.016267openalex-snapshot
West2East: exploiting WEb Service Technologies to Engineer Agent-based SofTware
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0510012openalex-snapshot
On relating CTL to Datalog
inferred← citeshttps://doi.org/10.5381/jot.2018.17.1.a1openalex-snapshot
Implementation of LMNtal Model Checkers: a Metaprogramming Approach. .
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.