On the public citation graph

LTL Satisfiability Checking Revisited

0 signed · 51 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-45657-0_29openalex-snapshot
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
inferredcites →https://doi.org/10.1007/3-540-48683-6_23openalex-snapshot
Improved Automata Generation for Linear Temporal Logic
inferredcites →https://doi.org/10.1007/3-540-69778-0_28openalex-snapshot
A New One-Pass Tableau Calculus for PLTL
inferredcites →https://doi.org/10.1007/978-1-4419-9228-4openalex-snapshot
Assertion-Based Design
inferredcites →https://doi.org/10.1007/978-3-540-69738-1_10openalex-snapshot
Automata-Theoretic Model Checking Revisited
inferredcites →https://doi.org/10.1007/978-3-540-73368-3_53openalex-snapshot
Boolean Abstraction for Temporal Logic Satisfiability
inferredcites →https://doi.org/10.1007/978-3-540-73370-6_11openalex-snapshot
LTL Satisfiability Checking
inferredcites →https://doi.org/10.1007/978-3-540-78800-3_6openalex-snapshot
Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking
inferredcites →https://doi.org/10.1007/978-3-642-21437-0_31openalex-snapshot
A Multi-encoding Approach for LTL Symbolic Satisfiability Checking
inferredcites →https://doi.org/10.1007/978-3-642-24372-1_28openalex-snapshot
Evaluating LTL Satisfiability Solvers
inferredcites →https://doi.org/10.1007/bf00121128openalex-snapshot
Memory-efficient algorithms for the verification of temporal properties
inferredcites →https://doi.org/10.1007/s10009-010-0140-3openalex-snapshot
LTL satisfiability checking
inferredcites →https://doi.org/10.1007/s100090050046openalex-snapshot
NUSMV: a new symbolic model checker
inferredcites →https://doi.org/10.1016/0890-5401(92)90017-aopenalex-snapshot
Symbolic model checking: 1020 States and beyond
inferredcites →https://doi.org/10.1016/j.entcs.2010.04.009openalex-snapshot
Tableau Tool for Testing Satisfiability in LTL: Implementation and Experimental Analysis
inferredcites →https://doi.org/10.1109/32.588521openalex-snapshot
The model checker SPIN
inferredcites →https://doi.org/10.1109/dac.2006.229231openalex-snapshot
Formal analysis of hardware requirements
inferredcites →https://doi.org/10.1109/mascot.2004.1348184openalex-snapshot
SPOT: an extensible model checking library using transition-based generalized buchi automata
inferredcites →https://doi.org/10.1145/1146909.1147119openalex-snapshot
Formal analysis of hardware requirements
inferredcites →https://doi.org/10.1145/298595.298598openalex-snapshot
Property specification patterns for finite-state verification
inferredcites →https://doi.org/10.1145/371282.371311openalex-snapshot
Clausal temporal resolution
inferredcites →https://doi.org/10.1145/3828.3837openalex-snapshot
The complexity of propositional linear temporal logics

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-99253-8_17openalex-snapshot
Temporal Stream Logic modulo Theories
inferred← citeshttps://doi.org/10.1007/978-3-031-37706-8_20openalex-snapshot
Guessing Winning Policies in LTL Synthesis by Semantic Learning
inferred← citeshttps://doi.org/10.1007/978-3-031-37709-9_18openalex-snapshot
Early Verification of Legal Compliance via Bounded Satisfiability Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-26287-1_13openalex-snapshot
SAT-Based Explicit LTL Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-319-48869-1_2openalex-snapshot
Specification: The Biggest Bottleneck in Formal Methods and Autonomy
inferred← citeshttps://doi.org/10.1007/978-3-319-63390-9_29openalex-snapshot
EAHyper: Satisfiability, Implication, and Equivalence Checking of Hyperproperties
inferred← citeshttps://doi.org/10.1007/978-3-319-77935-5_26openalex-snapshot
Consistency of Property Specification Patterns with Boolean and Constrained Numerical Signals
inferred← citeshttps://doi.org/10.1007/978-981-19-7510-3_1openalex-snapshot
Finite Quantified Linear Temporal Logic and Its Satisfiability Checking
inferred← citeshttps://doi.org/10.1007/s00165-017-0442-2openalex-snapshot
An explicit transition system construction approach to LTL satisfiability checking
inferred← citeshttps://doi.org/10.1007/s10703-018-00326-5openalex-snapshot
SAT-based explicit LTL reasoning and its application to satisfiability checking
inferred← citeshttps://doi.org/10.1007/s10703-025-00483-4openalex-snapshot
Bounded satisfiability checking of $$\hbox {FOL}^*$$ formulas with aggregations
inferred← citeshttps://doi.org/10.1007/s11334-019-00339-1openalex-snapshot
Property specification patterns at work: verification and inconsistency explanation
inferred← citeshttps://doi.org/10.1016/j.artint.2020.103369openalex-snapshot
SAT-based explicit LTLf satisfiability checking
inferred← citeshttps://doi.org/10.1093/logcom/exy013openalex-snapshot
Accelerating LTL satisfiability checking by SAT solvers
inferred← citeshttps://doi.org/10.1109/ase56229.2023.00173openalex-snapshot
SAT-Verifiable LTL Satisfiability Checking via Graph Representation Learning
inferred← citeshttps://doi.org/10.1109/icse.2015.84openalex-snapshot
Efficient Scalable Verification of LTL Specifications
inferred← citeshttps://doi.org/10.1109/memcod.2015.7340472openalex-snapshot
Metric interval temporal logic specification elicitation and debugging
inferred← citeshttps://doi.org/10.1109/tse.2020.3014394openalex-snapshot
On How Bit-Vector Logic Can Help Verify LTL-Based Specifications
inferred← citeshttps://doi.org/10.1145/2635868.2661669openalex-snapshot
Aalta: an LTL satisfiability checker over Infinite/Finite traces
inferred← citeshttps://doi.org/10.1145/3147451openalex-snapshot
Formal Requirement Debugging for Testing and Verification of Cyber-Physical Systems
inferred← citeshttps://doi.org/10.1145/3551349.3561163openalex-snapshot
Checking LTL Satisfiability via End-to-end Learning
inferred← citeshttps://doi.org/10.1145/3597503.3639087openalex-snapshot
SpecBCFuzz: Fuzzing LTL Solvers with Boundary Conditions
inferred← citeshttps://doi.org/10.1145/3650212.3680337openalex-snapshot
Learning to Check LTL Satisfiability and to Generate Traces via Differentiable Trace Checking
inferred← citeshttps://doi.org/10.1145/3704888openalex-snapshot
Translation of Temporal Logic for Efficient Infinite-State Reactive Synthesis
inferred← citeshttps://doi.org/10.48550/arxiv.1401.5677openalex-snapshot
Fast LTL Satisfiability Checking by SAT Solvers
inferred← citeshttps://doi.org/10.48550/arxiv.1902.06123openalex-snapshot
Timeline-based planning: Expressiveness and Complexity
inferred← citeshttps://doi.org/10.48550/arxiv.2003.04218openalex-snapshot
Teaching Temporal Logics to Neural Networks
inferred← citeshttps://doi.org/10.48550/arxiv.2110.10054openalex-snapshot
Generating Symbolic Reasoning Problems with Transformer GANs
inferred← citeshttps://doi.org/10.5555/2818754.2818841openalex-snapshot
Efficient scalable verification of LTL specifications
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.