On the public citation graph

Incremental and Complete Bounded Model Checking for Full PLTL

0 signed · 96 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/11527695_4openalex-snapshot
Incremental Compilation-to-SAT Procedures
inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-36384-x_24openalex-snapshot
Efficient Computation of Recurrence Diameters
inferredcites →https://doi.org/10.1007/3-540-36577-x_3openalex-snapshot
Bounded Model Checking for Past LTL
inferredcites →https://doi.org/10.1007/3-540-40922-x_8openalex-snapshot
Checking Safety Properties Using Induction and a SAT-Solver
inferredcites →https://doi.org/10.1007/3-540-44798-9_4openalex-snapshot
Pruning Techniques for the SAT-Based Bounded Model Checking Problem
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-48153-2openalex-snapshot
Correct Hardware Design and Verification Methods
inferredcites →https://doi.org/10.1007/3-540-49059-0_14openalex-snapshot
Symbolic Model Checking without BDDs
inferredcites →https://doi.org/10.1007/978-3-540-24605-3_37openalex-snapshot
An Extensible SAT-solver
inferredcites →https://doi.org/10.1007/978-3-540-24622-0_23openalex-snapshot
Analysis of Recursive Game Graphs Using Data Flow Equations
inferredcites →https://doi.org/10.1007/978-3-540-24622-0_9openalex-snapshot
Completeness and Complexity of Bounded Model Checking
inferredcites →https://doi.org/10.1007/978-3-540-24730-2_35openalex-snapshot
A Temporal Logic of Nested Calls and Returns
inferredcites →https://doi.org/10.1007/978-3-540-27813-9_8openalex-snapshot
Proving More Properties with Bounded Model Checking
inferredcites →https://doi.org/10.1007/978-3-540-30494-4_13openalex-snapshot
Simple Yet Efficient Improvements of SAT Based Bounded Model Checking
inferredcites →https://doi.org/10.1007/978-3-540-30494-4_14openalex-snapshot
Simple Bounded LTL Model Checking
inferredcites →https://doi.org/10.1007/978-3-540-30579-8_25openalex-snapshot
Simple Is Better: Efficient Bounded Model Checking for Past LTL
inferredcites →https://doi.org/10.1007/978-3-540-31980-1_32openalex-snapshot
Shortest Counterexamples for Symbolic Model Checking of LTL with Past
inferredcites →https://doi.org/10.1007/978-3-540-45069-6_1openalex-snapshot
Interpolation and SAT-Based Model Checking
inferredcites →https://doi.org/10.1007/978-3-540-45069-6_2openalex-snapshot
Bounded Model Checking and Induction: From Refutation to Verification
inferredcites →https://doi.org/10.1007/bfb0055036openalex-snapshot
Algorithmic verification of linear temporal logic specifications
inferredcites →https://doi.org/10.1007/s10009-003-0121-xopenalex-snapshot
Efficient reduction of finite state model checking to reachability analysis
inferredcites →https://doi.org/10.1007/s100090200070openalex-snapshot
inferredcites →https://doi.org/10.1016/j.entcs.2004.06.062openalex-snapshot
An Incremental Algorithm to Check Satisfiability for Bounded Model Checking
inferredcites →https://doi.org/10.1016/j.entcs.2004.12.021openalex-snapshot
SAT-based Induction for Temporal Safety Properties
inferredcites →https://doi.org/10.1016/s1571-0661(05)82542-3openalex-snapshot
Temporal Induction by Incremental SAT Solving
inferredcites →https://doi.org/10.1023/a:1008615614281openalex-snapshot
Another Look at LTL Model Checking
inferredcites →https://doi.org/10.1023/a:1011254632723openalex-snapshot
Model Checking of Safety Properties
inferredcites →https://doi.org/10.1109/lics.2002.1029846openalex-snapshot
Temporal logic with forgettable past
inferredcites →https://doi.org/10.1115/1.3258558openalex-snapshot
The 1983 Design Automation Conference
inferredcites →https://doi.org/10.1145/378239.379017openalex-snapshot
Chaff
inferredcites →https://doi.org/10.1145/378239.379019openalex-snapshot
SATIRE

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11812128_20openalex-snapshot
Symbolic Implementation of Alternating Automata
inferred← citeshttps://doi.org/10.1007/11817963_12openalex-snapshot
Bounded Model Checking for Weak Alternating Büchi Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-29026-9_1openalex-snapshot
A SAT-Based Encoding of the One-Pass and Tree-Shaped Tableau System for LTL
inferred← citeshttps://doi.org/10.1007/978-3-030-29662-9_9openalex-snapshot
Bounded Model Checking of Max-Plus Linear Systems via Predicate Abstractions
inferred← citeshttps://doi.org/10.1007/978-3-030-87657-9_15openalex-snapshot
Static Checking Consistency of Temporal Requirements for Control Software
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_10openalex-snapshot
SAT-Based Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-17581-2_2openalex-snapshot
Safety, Dependability and Performance Analysis of Aerospace Systems
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-540-68863-1_7openalex-snapshot
Symbolic Step Encodings for Object Based Communicating State Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_39openalex-snapshot
Syntactic Optimizations for PSL Verification
inferred← citeshttps://doi.org/10.1007/978-3-540-73368-3_53openalex-snapshot
Boolean Abstraction for Temporal Logic Satisfiability
inferred← citeshttps://doi.org/10.1007/978-3-540-74128-2_1openalex-snapshot
A Symbolic Model Checking Framework for Safety Analysis, Diagnosis, and Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-540-75596-8_29openalex-snapshot
A New Approach to Bounded Model Checking for Branching Time Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-93900-9_23openalex-snapshot
An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-04468-7_15openalex-snapshot
The COMPASS Approach: Correctness, Modelling and Performability of Aerospace Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-10373-5_15openalex-snapshot
Bounded Semantics of CTL and SAT-Based Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-11623-0_7openalex-snapshot
Towards a Notion of Unsatisfiable Cores for LTL
inferred← citeshttps://doi.org/10.1007/978-3-642-24372-1_28openalex-snapshot
Evaluating LTL Satisfiability Solvers
inferred← citeshttps://doi.org/10.1007/978-981-10-4436-6_6openalex-snapshot
Formal Methods for Aerospace Systems
inferred← citeshttps://doi.org/10.1007/978-981-13-0896-3_56openalex-snapshot
Bounded Correctness Checking for Extended CTL Properties with Past Operators
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/s10817-023-09691-1openalex-snapshot
SAT Meets Tableaux for Linear Temporal Logic Satisfiability
inferred← citeshttps://doi.org/10.1007/s11390-013-1323-7openalex-snapshot
Nondeterministic Probabilistic Petri Net — A New Method to Study Qualitative and Quantitative Behaviors of System
inferred← citeshttps://doi.org/10.1016/j.artint.2006.08.002openalex-snapshot
Planning as satisfiability: parallel plans and algorithms for plan search
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.12.020openalex-snapshot
A Compact Linear Translation for Bounded Model Checking
inferred← citeshttps://doi.org/10.1016/j.ipl.2017.06.008openalex-snapshot
Linear templates of ACTL formulas with an application to SAT-based verification
inferred← citeshttps://doi.org/10.1016/j.jisa.2016.08.001openalex-snapshot
Garakabu2: an SMT-based bounded model checker for HSTM designs in ZIPC
inferred← citeshttps://doi.org/10.1016/j.ress.2014.07.003openalex-snapshot
Spacecraft early design validation using formal methods
inferred← citeshttps://doi.org/10.1016/j.scico.2010.11.004openalex-snapshot
Towards a notion of unsatisfiable and unrealizable cores for LTL
inferred← citeshttps://doi.org/10.1016/j.scico.2013.03.005openalex-snapshot
A symbolic model checking approach to verifying satellite onboard software
inferred← citeshttps://doi.org/10.1049/iet-cdt.2010.0154openalex-snapshot
Efficient model checking of PSL safety properties
inferred← citeshttps://doi.org/10.1093/logcom/exm006openalex-snapshot
Using Temporal Logic to Analyse Temporal Logic: A Hierarchical Approach Based on Intervals
inferred← citeshttps://doi.org/10.1109/acsd.2008.4574602openalex-snapshot
Symbolic model checking of hierarchical UML state machines
inferred← citeshttps://doi.org/10.1109/acsd.2010.27openalex-snapshot
Efficient Model Checking of PSL Safety Properties
inferred← citeshttps://doi.org/10.1109/dac.2006.229231openalex-snapshot
Formal analysis of hardware requirements
inferred← citeshttps://doi.org/10.1109/dsn.2011.5958249openalex-snapshot
Incremental quantitative verification for Markov decision processes
inferred← citeshttps://doi.org/10.1109/fmcad.2006.19openalex-snapshot
From PSL to NBA: a Modular Symbolic Encoding
inferred← citeshttps://doi.org/10.1109/hldvt.2008.4695874openalex-snapshot
Multi-level Bounded Model Checking to detect bugs beyond the bound
inferred← citeshttps://doi.org/10.1109/icrae.2017.8291433openalex-snapshot
Bounded semantics based correctness checking for extended ECTL* properties
inferred← citeshttps://doi.org/10.1109/icse.2015.275openalex-snapshot
Scalable Formal Verification of UML Models
inferred← citeshttps://doi.org/10.1109/icse.2015.84openalex-snapshot
Efficient Scalable Verification of LTL Specifications
inferred← citeshttps://doi.org/10.1109/icsess49938.2020.9237680openalex-snapshot
A Heuristics-Based Incremental Probabilistic Model Checking at Runtime
inferred← citeshttps://doi.org/10.1109/icsess62520.2024.10719390openalex-snapshot
An Incremental Runtime Stochastic Model Checking Framework for Verifying Communication Protocols of Industrial CPS
inferred← citeshttps://doi.org/10.1109/tac.2021.3058068openalex-snapshot
Automatic Trajectory Synthesis for Real-Time Temporal Logic
inferred← citeshttps://doi.org/10.1109/tase.2014.13openalex-snapshot
Combining Syntactic and Semantic Encoding for LTL Bounded Model Checking
inferred← citeshttps://doi.org/10.1109/tcad.2008.2003303openalex-snapshot
Symbolic Compilation of PSL
inferred← citeshttps://doi.org/10.1109/tcad.2013.2252055openalex-snapshot
Formal Guarantees for Localized Bug Fixes
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/1146909.1147119openalex-snapshot
Formal analysis of hardware requirements
inferred← citeshttps://doi.org/10.1145/2491509.2491514openalex-snapshot
Bounded satisfiability checking of metric temporal logic specifications
inferred← citeshttps://doi.org/10.1145/2632362.2632374openalex-snapshot
Incremental bounded software model checking
inferred← citeshttps://doi.org/10.1145/3589250openalex-snapshot
Proceedings of the 12th ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis
inferred← citeshttps://doi.org/10.1155/2013/462532openalex-snapshot
Bounded Model Checking of ETL Cooperating with Finite and Looping Automata Connectives
inferred← citeshttps://doi.org/10.2168/lmcs-2(5:5)2006openalex-snapshot
Linear Encodings of Bounded LTL Model Checking
inferred← citeshttps://doi.org/10.22028/d291-26627openalex-snapshot
Resolution-based methods for linear temporal reasoning
inferred← citeshttps://doi.org/10.29007/bmcfopenalex-snapshot
On Incremental Quantitative Verification for Probabilistic Systems
inferred← citeshttps://doi.org/10.2991/iccsee.2013.237openalex-snapshot
Incremental Semantic LTL Bounded Model Checking
inferred← citeshttps://doi.org/10.3233/sat190106openalex-snapshot
Hardware Model Checking Competition 2014: An Analysis and Comparison of Model Checkers and Benchmarks
inferred← citeshttps://doi.org/10.3929/ethz-a-005170555openalex-snapshot
Liveness checking as safety checking to find shortest counterexamples to linear time properties
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.380-384.1239openalex-snapshot
Efficient Bounded Model Checking for LTL
inferred← citeshttps://doi.org/10.4204/eptcs.14.5openalex-snapshot
Tarmo: A Framework for Parallelized Bounded Model Checking
inferred← citeshttps://doi.org/10.4204/eptcs.256.12openalex-snapshot
A Parallel Linear Temporal Logic Tableau
inferred← citeshttps://doi.org/10.4204/eptcs.68.5openalex-snapshot
Handling Conflicts in Depth-First Search for LTL Tableau to Debug Compliance Based Languages
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.