On the public citation graph
On-the-fly model checking of RCTL formulas
0 signed · 89 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-60045-0_63openalex-snapshot
Using formal verification/analysis methods on the critical path in system design: A case study
inferredcites →https://doi.org/10.1007/bfb0025774openalex-snapshot
Design and synthesis of synchronization skeletons using branching time temporal logic
inferredcites →https://doi.org/10.1023/a:1008615614281openalex-snapshot
Another Look at LTL Model Checking
inferredcites →https://doi.org/10.1109/edtc.1994.326886openalex-snapshot
Bug identification of a real chip design by symbolic model checking
inferredcites →https://doi.org/10.1109/sfcs.1981.44openalex-snapshot
Temporal logic can be more expressive
inferredcites →https://doi.org/10.1145/177492.177725openalex-snapshot
Model checking and modular verification
inferredcites →https://doi.org/10.1145/318593.318622openalex-snapshot
Checking that finite state concurrent programs satisfy their linear specification
inferredcites →https://doi.org/10.5555/266388.266515openalex-snapshot
Forward model checking techniques oriented to buggy designs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/1-4020-8149-9_4openalex-snapshot
LTL’s Intuitive Representations and Its Automaton Translation
inferred← citeshttps://doi.org/10.1007/10722167_30openalex-snapshot
Prioritized Traversal: Efficient Reachability Analysis for Verification and Falsification
inferred← citeshttps://doi.org/10.1007/10722167_36openalex-snapshot
Tuning SAT Checkers for Bounded Model Checking
inferred← citeshttps://doi.org/10.1007/10722167_40openalex-snapshot
FoCs – Automatic Generation of Simulation Checkers from Formal Specifications
inferred← citeshttps://doi.org/10.1007/10722167_6openalex-snapshot
Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits
inferred← citeshttps://doi.org/10.1007/11513988_36openalex-snapshot
Efficient Monitoring of ω-Languages
inferred← citeshttps://doi.org/10.1007/11560548_12openalex-snapshot
Achieving Speedups in Distributed Symbolic Reachability Analysis Through Asynchronous Computation
inferred← citeshttps://doi.org/10.1007/3-540-40922-x_24openalex-snapshot
Scalable Distributed On-the-Fly Symbolic Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-44685-0_35openalex-snapshot
Extended Temporal Logic Revisited
inferred← citeshttps://doi.org/10.1007/3-540-44798-9_23openalex-snapshot
Efficient Debugging in a Formal Verification Environment
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_1openalex-snapshot
Branching vs. Linear Time: Final Showdown
inferred← citeshttps://doi.org/10.1007/3-540-45614-7_9openalex-snapshot
An Algorithmic Approach to Design Exploration
inferred← citeshttps://doi.org/10.1007/3-540-45657-0_6openalex-snapshot
Symbolic Localization Reduction with Reconstruction Layering and Backtracking
inferred← citeshttps://doi.org/10.1007/3-540-45657-0_8openalex-snapshot
Combining Symmetry Reduction and Under-Approximation for Symbolic Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-46002-0_21openalex-snapshot
The ForSpec Temporal Logic: A New Temporal Property-Specification Language
inferred← citeshttps://doi.org/10.1007/3-540-46017-9_18openalex-snapshot
Comparing Symbolic and Explicit Model Checking of a Software System
inferred← citeshttps://doi.org/10.1007/3-540-48153-2_19openalex-snapshot
Hints to Accelerate Symbolic Traversal
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_21openalex-snapshot
Efficient Decision Procedures for Model Checking of Linear Time Logic Properties
inferred← citeshttps://doi.org/10.1007/978-3-030-99527-0_8openalex-snapshot
On-The-Fly Solving for Symbolic Parity Games
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_24openalex-snapshot
Functional Specification of Hardware via Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-30206-3_18openalex-snapshot
Bounded Model Checking for Region Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-30476-0_7openalex-snapshot
Toward Unbounded Model Checking for Region Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-30494-4_20openalex-snapshot
Memory Efficient All-Solutions SAT Solver and Its Application for Reachability Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-39724-3_13openalex-snapshot
An Optimized Symbolic Bounded Model Checking Engine
inferred← citeshttps://doi.org/10.1007/978-3-540-45069-6_3openalex-snapshot
Reasoning with Temporal Logic on Truncated Paths
inferred← citeshttps://doi.org/10.1007/978-3-540-45069-6_5openalex-snapshot
A Work-Efficient Distributed Algorithm for Reachability Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-69850-0_10openalex-snapshot
From Church and Prior to PSL
inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_3openalex-snapshot
Assertion-Based Verification: Industry Myths to Realities (Invited Tutorial)
inferred← citeshttps://doi.org/10.1007/978-3-540-73099-6_7openalex-snapshot
Bounded Model Checking with Description Logic Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_33openalex-snapshot
Temporal Antecedent Failure: Refining Vacuity
inferred← citeshttps://doi.org/10.1007/978-3-540-74782-6_6openalex-snapshot
Model Checking and Preprocessing
inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_36openalex-snapshot
From Monadic Logic to PSL
inferred← citeshttps://doi.org/10.1007/978-3-540-88387-6_6openalex-snapshot
Computation Tree Regular Logic for Genetic Regulatory Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-92701-3_7openalex-snapshot
From Philosophical to Industrial Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-16242-8_6openalex-snapshot
Extended Computation Tree Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-45321-2_5openalex-snapshot
From Löwenheim to PSL and SVA
inferred← citeshttps://doi.org/10.1007/s00236-015-0226-1openalex-snapshot
Compositional verification of asynchronous concurrent systems using CADP
inferred← citeshttps://doi.org/10.1007/s10009-002-0093-2openalex-snapshot
Scalable distributed on-the-fly symbolic model checking
inferred← citeshttps://doi.org/10.1007/s10009-002-0097-yopenalex-snapshot
Efficient debugging in a formal verification environment
inferred← citeshttps://doi.org/10.1007/s10703-005-2246-xopenalex-snapshot
Combining Symmetry Reduction and Under-Approximation for Symbolic Model Checking
inferred← citeshttps://doi.org/10.1007/s10703-006-0011-4openalex-snapshot
A work-efficient distributed algorithm for reachability analysis
inferred← citeshttps://doi.org/10.1007/s10703-014-0221-0openalex-snapshot
Vacuity in practice: temporal antecedent failure
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.07.020openalex-snapshot
Supporting SAT based BMC on Finite Path Models
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.062openalex-snapshot
Reasoning About Connector Reconfiguration II: Basic Reconfiguration Logic
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.06.007openalex-snapshot
A Rewriting Semantics for ABEL with Applications to Hardware/Software Co-Design and Analysis
inferred← citeshttps://doi.org/10.1016/j.jcss.2013.05.005openalex-snapshot
Branching-time logics with path relativisation
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.03.011openalex-snapshot
Embedding finite automata within regular expressions
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.05.009openalex-snapshot
CTRL: Extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00258-0openalex-snapshot
Model Checking the Garbage Collection Mechanism of SMV
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80393-7openalex-snapshot
Local Distributed Model Checking of Reg CTL
inferred← citeshttps://doi.org/10.1023/a:1011219209077openalex-snapshot
On the Effective Deployment of Functional Formal Verification
inferred← citeshttps://doi.org/10.1023/a:1020373206491openalex-snapshot
A Scalable Parallel Algorithm for Reachability Analysis of Very Large Circuits
inferred← citeshttps://doi.org/10.1023/b:form.0000004785.67232.f8openalex-snapshot
Accelerating Bounded Model Checking of Safety Properties
inferred← citeshttps://doi.org/10.1093/logcom/exn062openalex-snapshot
Model Checking Using Description Logic
inferred← citeshttps://doi.org/10.1109/32.908961openalex-snapshot
Optimizing symbolic model checking for statecharts
inferred← citeshttps://doi.org/10.1109/aspdac.2009.4796553openalex-snapshot
Multi-clock SVA synthesis without re-writing
inferred← citeshttps://doi.org/10.1109/icse.2015.40openalex-snapshot
Symbolic Model Checking of Product-Line Requirements Using SAT-Based Methods
inferred← citeshttps://doi.org/10.1109/trustcom66490.2025.00271openalex-snapshot
Model Reduction of Colored Petri Nets Based on Unrelated Transitions
inferred← citeshttps://doi.org/10.1142/s0129054106004108openalex-snapshot
SAT-BASED MODEL CHECKING FOR REGION AUTOMATA
inferred← citeshttps://doi.org/10.1145/1278480.1278500openalex-snapshot
Synthesizing SVA local variables for formal verification
inferred← citeshttps://doi.org/10.1145/1982595.1982616openalex-snapshot
Model-driven design and validation of embedded software
inferred← citeshttps://doi.org/10.1145/3331076.3331105openalex-snapshot
Formal specification and verification of user-centric privacy policies for ubiquitous systems
inferred← citeshttps://doi.org/10.1145/337292.337757openalex-snapshot
A methodology for formal design of hardware control with application to cache coherence protocols
inferred← citeshttps://doi.org/10.11606/d.3.2011.tde-15032012-120402openalex-snapshot
Ferramenta CAD para extração de modelo de cobertura de saída por itens em verificação funcional.
inferred← citeshttps://doi.org/10.1201/9781420006674.ch15openalex-snapshot
Genetic Regulatory Networks
inferred← citeshttps://doi.org/10.1504/ijcat.2012.048205openalex-snapshot
Abstract property language for MDG model checking methodology
inferred← citeshttps://doi.org/10.1561/9781601982193openalex-snapshot
Applied Assertion-Based Verification: An Industry Perspective
inferred← citeshttps://doi.org/10.18122/td/1526/boisestateopenalex-snapshot
UNICORN Framework: A User-Centric Approach Toward Formal Verification of Privacy Norms
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.5555/2818754.2818780openalex-snapshot
Symbolic model checking of product-line requirements using SAT-based methods
inferred← citeshttps://doi.org/10.70675/cff887fez647dz4266zb0cbz9ad8d4c33b58openalex-snapshot
A design flow to automatically Generate on chip monitors during high-level synthesis of Hardware accelarators
inferred← citeshttps://doi.org/10.70675/d577d68cz444bz40a4z951fza32dbfafa076openalex-snapshot
Towards an integrative approach for the modeling and formal verification of biological regulatory networks
inferred← citeshttps://doi.org/10.70675/de2eb4baza613z487cz8b98zaed7975a6170openalex-snapshot
Conception, modélisation et vérification formelle d’un système temps-réel d’agents coopératifs : application aux véhicules autonomes communicants
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.