On the public citation graph
Memory efficient algorithms for the verification of temporal properties
0 signed · 75 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.1002/spe.4380180203openalex-snapshot
An improved protocol reachability analysis technique
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-51803-7_23openalex-snapshot
On the relation of programs and computations to models of temporal logic
inferredcites →https://doi.org/10.1007/3-540-52148-8_16openalex-snapshot
On-line model-checking for finite linear temporal logic specifications
inferredcites →https://doi.org/10.1007/978-3-642-82453-1_3openalex-snapshot
Tools for Verifying Network Protocols
inferredcites →https://doi.org/10.1109/sfcs.1983.51openalex-snapshot
Reasoning about infinite computation paths
inferredcites →https://doi.org/10.1109/tc.1982.1676060openalex-snapshot
A Validation Technique for Tightly Coupled Protocols
inferredcites →https://doi.org/10.1145/318593.318622openalex-snapshot
Checking that finite state concurrent programs satisfy their linear specification
inferredcites →https://doi.org/10.1145/41840.41865openalex-snapshot
Avoiding the state explosion problem in temporal logic model checking
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.1145/78942.78948openalex-snapshot
Adding liveness properties to coupled finite-state machines
inferredcites →https://doi.org/10.1146/annurev.cs.02.060187.001451openalex-snapshot
Network Protocols and Tools to Help Produce Them
inferredcites →https://doi.org/10.1147/rd.221.0060openalex-snapshot
Automated Validation of a Communications Protocol: the CCITT X.21 Recommendation
inferredcites →https://doi.org/10.1147/rd.224.0393openalex-snapshot
General Technique for Communications Protocol Validation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11537328_15openalex-snapshot
On-the-Fly Emptiness Checks for Generalized Büchi Automata
inferred← citeshttps://doi.org/10.1007/11691617_4openalex-snapshot
Larger Automata and Less Work for LTL Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_8openalex-snapshot
The Inverse Method Implements the Automata Approach for Modal Satisfiability
inferred← citeshttps://doi.org/10.1007/3-540-46002-0_28openalex-snapshot
Applicability of Fair Simulation
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_23openalex-snapshot
Improved Automata Generation for Linear Temporal Logic
inferred← citeshttps://doi.org/10.1007/3-540-49519-3_35openalex-snapshot
PV: An Explicit Enumeration Model-Checker
inferred← citeshttps://doi.org/10.1007/3-540-56496-9_15openalex-snapshot
State space caching revisited
inferred← citeshttps://doi.org/10.1007/3-540-60973-3_102openalex-snapshot
Model checking in practice: An analysis of the ACCESS.bus™ protocol using SPIN
inferred← citeshttps://doi.org/10.1007/3-540-63166-6_27openalex-snapshot
A new heuristic for bad cycle detection using BDDs
inferred← citeshttps://doi.org/10.1007/978-3-030-00359-3_9openalex-snapshot
Improving Parallel State-Space Exploration Using Genetic Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-98850-0_3openalex-snapshot
Hybrid Parallel Model Checking of Hybrid LTL on Hybrid State Space Representation
inferred← citeshttps://doi.org/10.1007/978-3-031-57249-4_2openalex-snapshot
Hitching a Ride to a Lasso: Massively Parallel On-The-Fly LTL Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-13338-6_20openalex-snapshot
Partial-Order Reduction for Multi-core LTL Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-23467-0_6openalex-snapshot
Depth-First Heuristic Search for Software Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-41540-6_26openalex-snapshot
BFS-Based Model Checking of Linear-Time Properties with an Application on GPUs
inferred← citeshttps://doi.org/10.1007/978-3-319-63387-9_28openalex-snapshot
Compositional Model Checking with Incremental Counter-Example Construction
inferred← citeshttps://doi.org/10.1007/978-3-540-24730-2_18openalex-snapshot
Tarjan’s Algorithm Makes On-the-Fly LTL Verification More Efficient
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_49openalex-snapshot
Correcting a Space-Efficient Simulation Algorithm
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-85361-9_22openalex-snapshot
A Space-Efficient Probabilistic Simulation Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-88479-8_43openalex-snapshot
Squeeze All the Power Out of Your Hardware to Verify Your Software!
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-02979-0_20openalex-snapshot
Automata-Based Termination Proofs
inferred← citeshttps://doi.org/10.1007/978-3-642-10373-5_21openalex-snapshot
A Time-Optimal On-the-Fly Parallel Algorithm for Model Checking of Weak LTL Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-21437-0_31openalex-snapshot
A Multi-encoding Approach for LTL Symbolic Satisfiability Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-22306-8_5openalex-snapshot
Depth Bounded Explicit-State Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-24372-1_24openalex-snapshot
Self-Loop Aggregation Product — A New Hybrid Approach to On-the-Fly LTL Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-24372-1_27openalex-snapshot
Parallel Nested Depth-First Searches for LTL Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-31131-4_14openalex-snapshot
Hybrid On-the-Fly LTL Model Checking with the Sweep-Line Method
inferred← citeshttps://doi.org/10.1007/978-3-642-33386-6_22openalex-snapshot
Improved Multi-Core Nested Depth-First Search
inferred← citeshttps://doi.org/10.1007/978-3-642-39176-7_15openalex-snapshot
Guard-Based Partial-Order Reduction
inferred← citeshttps://doi.org/10.1007/978-3-642-39799-8_69openalex-snapshot
Multi-core Emptiness Checking of Timed Büchi Automata Using Inclusion Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-642-45221-5_44openalex-snapshot
Three SCC-Based Emptiness Checks for Generalized Büchi Automata
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/978-3-662-46681-0_58openalex-snapshot
Saturation-Based Incremental LTL Model Checking with Inductive Proofs
inferred← citeshttps://doi.org/10.1007/bf01383879openalex-snapshot
Using partial orders for the efficient verification of deadlock freedom and safety properties
inferred← citeshttps://doi.org/10.1007/s10009-010-0137-yopenalex-snapshot
Solving the ignoring problem for partial order reduction
inferred← citeshttps://doi.org/10.1007/s10009-014-0363-9openalex-snapshot
Guard-based partial-order reduction
inferred← citeshttps://doi.org/10.1007/s10009-015-0382-1openalex-snapshot
Concurrent depth-first search algorithms based on Tarjan’s Algorithm
inferred← citeshttps://doi.org/10.1007/s10009-016-0422-5openalex-snapshot
Variations on parallel explicit emptiness checks for generalized Büchi automata
inferred← citeshttps://doi.org/10.1007/s11334-020-00362-7openalex-snapshot
Improving swarming using genetic algorithms
inferred← citeshttps://doi.org/10.1016/j.ic.2004.02.005openalex-snapshot
Applicability of fair simulation
inferred← citeshttps://doi.org/10.1016/j.procs.2025.07.103openalex-snapshot
Timely Diagnosis of Discrete-Event Systems
inferred← citeshttps://doi.org/10.1016/j.scico.2025.103386openalex-snapshot
An overview of research with Slco on seamless integration of formal verification into model-driven software engineering
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.07.004openalex-snapshot
More efficient on-the-fly LTL verification with Tarjan's algorithm
inferred← citeshttps://doi.org/10.1023/a:1008727508722openalex-snapshot
A New Heuristic for Bad Cycle Detection Using BDDs
inferred← citeshttps://doi.org/10.1023/a:1014728912264openalex-snapshot
An Efficient Partial Order Reduction Algorithm with an Alternative Proviso Implementation
inferred← citeshttps://doi.org/10.1109/acsd.2015.15openalex-snapshot
Combining Explicit and Symbolic LTL Model Checking Using Generalized Testing Automata
inferred← citeshttps://doi.org/10.1109/codit62066.2024.10708172openalex-snapshot
Local Model Checking on a Modular System
inferred← citeshttps://doi.org/10.1109/edocw.2011.12openalex-snapshot
Querying Process Models Based on the Temporal Relations between Tasks
inferred← citeshttps://doi.org/10.1109/icst49551.2021.00058openalex-snapshot
Prut4j: Protocol Unit Testing fo(u)r Java
inferred← citeshttps://doi.org/10.1109/ipdps.2007.370410openalex-snapshot
Multi-Core Model Checking with SPIN
inferred← citeshttps://doi.org/10.1109/ipdps.2009.5161000openalex-snapshot
Efficient large-scale model checking
inferred← citeshttps://doi.org/10.1109/real.1997.641266openalex-snapshot
On-the-fly symbolic model checking for real-time systems
inferred← citeshttps://doi.org/10.31577/cai_2021_1_195openalex-snapshot
More Efficient On-the-Fly Verification Methods of Colored Petri Nets
inferred← citeshttps://doi.org/10.70675/40e21541za82dz4933z9d60zf6d91f0b5801openalex-snapshot
Abstraction techniques for verification of concurrent systems
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.