On the public citation graph
Memory-efficient algorithms for the verification of temporal properties
0 signed · 466 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/3-540-55179-4_19openalex-snapshot
Bounded-memory algorithms for verification on-the-fly
inferredcites →https://doi.org/10.1007/3-540-56496-9_15openalex-snapshot
State space caching revisited
inferredcites →https://doi.org/10.1007/978-1-4842-9459-8_2openalex-snapshot
Data Structures and Algorithms
inferredcites →https://doi.org/10.1007/978-3-642-82453-1_3openalex-snapshot
Tools for Verifying Network Protocols
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
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.1002/9780470611012.ch3openalex-snapshot
An Introduction to Model Checking
inferred← citeshttps://doi.org/10.1002/9781118602638.ch6openalex-snapshot
Introduction to Verification
inferred← citeshttps://doi.org/10.1002/9781118602638.ch7openalex-snapshot
Verification of Finite‐State Systems
inferred← citeshttps://doi.org/10.1002/bltj.2206openalex-snapshot
Software verification at Bell Labs: One line of development
inferred← citeshttps://doi.org/10.1002/spe.2242openalex-snapshot
Model checking aircraft controller software: a case study
inferred← citeshttps://doi.org/10.1006/inco.1994.1035openalex-snapshot
A Partial Approach to Model Checking
inferred← citeshttps://doi.org/10.1007/1-84628-271-3_8openalex-snapshot
Assuring the Behavior of Adaptive Agents
inferred← citeshttps://doi.org/10.1007/10722468_4openalex-snapshot
Testing Spin’s LTL Formula Conversion into Büchi Automata with Randomly Generated Input
inferred← citeshttps://doi.org/10.1007/11513988_35openalex-snapshot
Symbolic Systems, Explicit Properties: On Hybrid Approaches for LTL Symbolic Model Checking
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/11562948_6openalex-snapshot
Comprehensive Verification Framework for Dependability of Self-optimizing Systems
inferred← citeshttps://doi.org/10.1007/11691617_4openalex-snapshot
Larger Automata and Less Work for LTL Model Checking
inferred← citeshttps://doi.org/10.1007/11691792_14openalex-snapshot
A Tableau Method for Verifying Dialogue Game Protocols for Agent Communication
inferred← citeshttps://doi.org/10.1007/11752578_125openalex-snapshot
Increasing Dependability by Means of Model-Based Acceptance Test inside RTOS
inferred← citeshttps://doi.org/10.1007/11804192_13openalex-snapshot
Cluster-Based LTL Model Checking of Large Systems
inferred← citeshttps://doi.org/10.1007/11817963_7openalex-snapshot
Minimizing Generalized Büchi Automata
inferred← citeshttps://doi.org/10.1007/11901914_11openalex-snapshot
On the Construction of Fine Automata for Safety Properties
inferred← citeshttps://doi.org/10.1007/3-540-36135-9_20openalex-snapshot
From States to Transitions: Improving Translation of LTL Formulae to Büchi Automata
inferred← citeshttps://doi.org/10.1007/3-540-36135-9_5openalex-snapshot
A Nested Depth First Search Algorithm for Model Checking with Symmetry Reduction
inferred← citeshttps://doi.org/10.1007/3-540-40911-4_23openalex-snapshot
Modular Verification for a Class of PLTL Properties
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-44585-4_5openalex-snapshot
Efficient Model Checking Via Büchi Tableau Automata?
inferred← citeshttps://doi.org/10.1007/3-540-44804-7_7openalex-snapshot
Randomization Helps in LTL Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-44829-2_6openalex-snapshot
A Light-Weight Algorithm for Model Checking with Symmetry Reduction and Weak Fairness
inferred← citeshttps://doi.org/10.1007/3-540-44988-4_9openalex-snapshot
Designing a LTL Model-Checker Based on Unfolding Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_5openalex-snapshot
Model Checking and Testing Combined
inferred← citeshttps://doi.org/10.1007/3-540-45089-0_18openalex-snapshot
Conversation Protocols: A Formalism for Specification and Verification of Reactive Electronic Services
inferred← citeshttps://doi.org/10.1007/3-540-45139-0_4openalex-snapshot
Implementing LTL model checking with net unfoldings
inferred← citeshttps://doi.org/10.1007/3-540-45251-6_30openalex-snapshot
A Heuristic for Symmetry Reductions with Scalarsets
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-45319-9_29openalex-snapshot
Is There a Best Symbolic Cycle-Detection Algorithm?
inferred← citeshttps://doi.org/10.1007/3-540-45426-8_6openalex-snapshot
An Environment for the Integrated Modelling of Systems with Complex Continuous and Discrete Dynamics
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_80openalex-snapshot
An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces
inferred← citeshttps://doi.org/10.1007/3-540-45484-5_22openalex-snapshot
APT Agents: Agents That Are Adaptive Predictable and Timely
inferred← citeshttps://doi.org/10.1007/3-540-45510-8_1openalex-snapshot
Model Checking: A Tutorial Overview
inferred← citeshttps://doi.org/10.1007/3-540-45740-2_15openalex-snapshot
Model Checking LTL Properties of High-Level Petri Nets with Fairness Constraints
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_50openalex-snapshot
On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables
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-46017-9_5openalex-snapshot
Symmetry Reduction Criteria for Software Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-47813-2_21openalex-snapshot
Model Checking Modal Transition Systems Using Kripke Structures
inferred← citeshttps://doi.org/10.1007/3-540-48119-2_16openalex-snapshot
On-the-fly Verification of Linear Temporal Logic
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_53openalex-snapshot
Effective Lossy Queue Languages
inferred← citeshttps://doi.org/10.1007/3-540-48234-2_4openalex-snapshot
Partial Order Reduction in Presence of Rendez-vous Communications with Unless Constructs and Weak Fairness
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_12openalex-snapshot
Test Generation Derived from Model-Checking
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_17openalex-snapshot
Model Checking of Safety Properties
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-48778-6_16openalex-snapshot
Probabilistic Linear-Time Model Checking: An Overview of the Automata-Theoretic Approach
inferred← citeshttps://doi.org/10.1007/3-540-49519-3_31openalex-snapshot
Model Checking on Product Structures
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-49519-3_9openalex-snapshot
Bisimulation Minimization in an Automata-Theoretic Verification Framework
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_78openalex-snapshot
A tool set for deciding behavioral equivalences
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_18openalex-snapshot
“On the fly” verification of behavioural equivalences and preorders
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_19openalex-snapshot
Bounded-memory algorithms for verification on-the-fly
inferred← citeshttps://doi.org/10.1007/3-540-56496-9_15openalex-snapshot
State space caching revisited
inferred← citeshttps://doi.org/10.1007/3-540-56922-7_18openalex-snapshot
An efficient algorithm for minimizing real-time transition systems
inferred← citeshttps://doi.org/10.1007/3-540-56922-7_33openalex-snapshot
On-the-fly verification with stubborn sets
inferred← citeshttps://doi.org/10.1007/3-540-56922-7_6openalex-snapshot
Reliable hashing without collision detection
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_17openalex-snapshot
Partial-order methods for temporal verification
inferred← citeshttps://doi.org/10.1007/3-540-57887-0_116openalex-snapshot
Nontraditional applications of automata theory
inferred← citeshttps://doi.org/10.1007/3-540-58179-0_43openalex-snapshot
Symbolic verification with periodic sets
inferred← citeshttps://doi.org/10.1007/3-540-58179-0_50openalex-snapshot
An automata-theoretic approach to branching-time model checking (Extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-58179-0_69openalex-snapshot
Combining partial order reductions with on-the-fly model-checking
inferred← citeshttps://doi.org/10.1007/3-540-60045-0_60openalex-snapshot
Augmenting branching temporal logics with existential quantification over atomic propositions
inferred← citeshttps://doi.org/10.1007/3-540-60218-6_34openalex-snapshot
Tutorial: Proving properties of concurrent systems with SPIN
inferred← citeshttps://doi.org/10.1007/3-540-60915-6_6openalex-snapshot
An automata-theoretic approach to linear temporal logic
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-61042-1_48openalex-snapshot
Formal verification of a partial-order reduction technique for model checking
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_61openalex-snapshot
HORNSAT, model checking, verification and games
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_82openalex-snapshot
Using on-the-fly verification techniques for the generation of test suites
inferred← citeshttps://doi.org/10.1007/3-540-61550-4_141openalex-snapshot
Partial order reduction: Model-checking using representatives
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_73openalex-snapshot
A space-efficient on-the-fly algorithm for real-time model checking
inferred← citeshttps://doi.org/10.1007/3-540-62503-8_17openalex-snapshot
A non-standard semantics for generating reduced transition systems
inferred← citeshttps://doi.org/10.1007/3-540-63104-6_19openalex-snapshot
Alternating automata: Unifying truth and validity checking for temporal logics
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/3-540-63166-6_33openalex-snapshot
Relaxed visibility enhances partial order reduction
inferred← citeshttps://doi.org/10.1007/3-540-63166-6_51openalex-snapshot
Prod 3.2 An advanced tool for efficient reachability analysis
inferred← citeshttps://doi.org/10.1007/3-540-69778-0_28openalex-snapshot
A New One-Pass Tableau Calculus for PLTL
inferred← citeshttps://doi.org/10.1007/978-0-387-34878-0_13openalex-snapshot
An Improvement in Formal Verification
inferred← citeshttps://doi.org/10.1007/978-0-387-34892-6_1openalex-snapshot
Simple On-the-fly Automatic Verification of Linear Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-0-387-34945-9_30openalex-snapshot
Sharing trees for “on-the-fly” verification
inferred← citeshttps://doi.org/10.1007/978-0-387-35190-2_9openalex-snapshot
Efficient CTL* Model Checking for Analysis of Rainbow Designs
inferred← citeshttps://doi.org/10.1007/978-0-387-35271-8_32openalex-snapshot
Selective mu-calculus: New Modal Operators for Proving Properties on Reduced Transition Systems
inferred← citeshttps://doi.org/10.1007/978-1-4419-6984-2_3openalex-snapshot
Model Checking Agent Communication
inferred← citeshttps://doi.org/10.1007/978-1-4471-0851-1_6openalex-snapshot
Modular Verification of Dynamic Properties for Reactive Systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-3078-9_22openalex-snapshot
Failure-based Equivalences Are Faster Than Many Believe
inferred← citeshttps://doi.org/10.1007/978-1-4615-3556-0_4openalex-snapshot
On-the-fly Verification of Finite Transition Systems
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-21571-2_18openalex-snapshot
Taking Some Burden Off an Explicit CTL Model Checker
inferred← citeshttps://doi.org/10.1007/978-3-030-22348-9_24openalex-snapshot
Synchronous or Alternating?
inferred← citeshttps://doi.org/10.1007/978-3-030-25543-5_27openalex-snapshot
What’s Wrong with On-the-Fly Partial Order Reduction
inferred← citeshttps://doi.org/10.1007/978-3-030-45190-5_14openalex-snapshot
Automated Verification of Parallel Nested DFS
inferred← citeshttps://doi.org/10.1007/978-3-030-53291-8_6openalex-snapshot
Action-Based Model Checking: Logic, Automata, and Reduction
inferred← citeshttps://doi.org/10.1007/978-3-030-72016-2_17openalex-snapshot
Iterative Bounded Synthesis for Efficient Cycle Detection in Parametric Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-73785-6_1openalex-snapshot
On Completeness of Liveness Synthesis for Parametric Timed Automata (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-030-81688-9_19openalex-snapshot
Model Checking $$\omega $$-Regular Properties with Decoupled Search
inferred← citeshttps://doi.org/10.1007/978-3-030-91384-7_2openalex-snapshot
From Linear Temporal Logics to Büchi Automata: The Early and Simple Principle
inferred← citeshttps://doi.org/10.1007/978-3-030-94583-1_8openalex-snapshot
Automata-Driven Partial Order Reduction and Guided Search for LTL Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-031-20447-0_12openalex-snapshot
Observer Design for LH-Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-30823-9_8openalex-snapshot
AutoHyper: Explicit-State Model Checking for HyperLTL
inferred← citeshttps://doi.org/10.1007/978-3-031-70890-9_6openalex-snapshot
Social Control and Interactivity in Anonymous Public Events
inferred← citeshttps://doi.org/10.1007/978-3-031-75783-9_17openalex-snapshot
Another Look at LTL Modulo Theory over Finite and Infinite Traces
inferred← citeshttps://doi.org/10.1007/978-3-031-99717-4_9openalex-snapshot
Scalable Verification of Local and Global Properties of Collective Systems
inferred← citeshttps://doi.org/10.1007/978-3-032-08707-2_3openalex-snapshot
TAPAAL HyperLTL: A Tool for Checking Hyperproperties of Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-05119-2_17openalex-snapshot
On-the-fly Fast Mean-Field Model-Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-08970-6_21openalex-snapshot
Verified Efficient Implementation of Gabow’s Strongly Connected Component Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-10398-3_10openalex-snapshot
A Logical Framework for Systems Biology
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_5openalex-snapshot
Explicit-State Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-12154-3_7openalex-snapshot
Using Promela in a Fully Verified Executable LTL Model Checker
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-19458-5_12openalex-snapshot
Automated Verification of Nested DFS
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-26287-1_13openalex-snapshot
SAT-Based Explicit LTL Reasoning
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-41591-8_12openalex-snapshot
LTL Parameter Synthesis of Parametric Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-49052-6_2openalex-snapshot
Multi-core SCC-Based LTL Model Checking
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-319-63516-3_12openalex-snapshot
Parallel Model Checking Algorithms for Linear-Time Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-68270-9_13openalex-snapshot
FlyFast: A Scalable Approach to Probabilistic Model-Checking Based on Mean-Field Approximation
inferred← citeshttps://doi.org/10.1007/978-3-319-77935-5_24openalex-snapshot
Sound Black-Box Checking in the LearnLib
inferred← citeshttps://doi.org/10.1007/978-3-319-94821-8_18openalex-snapshot
Verifying the LTL to Büchi Automata Translation via Very Weak Alternating Automata
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-24730-2_37openalex-snapshot
Guided Invariant Model Checking Based on Abstraction and Symbolic Pattern Databases
inferred← citeshttps://doi.org/10.1007/978-3-540-24732-6_15openalex-snapshot
Using Fairness to Make Abstractions Work
inferred← citeshttps://doi.org/10.1007/978-3-540-24732-6_7openalex-snapshot
Minimization of Counterexamples in SPIN
inferred← citeshttps://doi.org/10.1007/978-3-540-27793-4_17openalex-snapshot
LTL Model Checking for Modular Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-27813-9_18openalex-snapshot
GSTE Is Partitioned Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-27813-9_30openalex-snapshot
Global Model-Checking of Infinite-State Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-30494-4_25openalex-snapshot
Accepting Predecessors Are Better than Back Edges in Distributed LTL Model-Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-30570-5_1openalex-snapshot
Model Checking for Database Theoreticians
inferred← citeshttps://doi.org/10.1007/978-3-540-31980-1_12openalex-snapshot
A Note on On-the-Fly Verification Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-31980-1_13openalex-snapshot
Truly On-the-Fly LTL Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-31980-1_18openalex-snapshot
Monte Carlo Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-31980-1_32openalex-snapshot
Shortest Counterexamples for Symbolic Model Checking of LTL with Past
inferred← citeshttps://doi.org/10.1007/978-3-540-31980-1_5openalex-snapshot
On-the-Fly Reachability and Cycle Detection for Recursive State Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-39910-0_3openalex-snapshot
Formal Analysis of Hierarchical State Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-45138-9_26openalex-snapshot
Relating Hierarchy of Temporal Properties to Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-45138-9_37openalex-snapshot
Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces
inferred← citeshttps://doi.org/10.1007/978-3-540-69507-3_2openalex-snapshot
Model-Checking Large Finite-State Systems and Beyond
inferred← citeshttps://doi.org/10.1007/978-3-540-69738-1_10openalex-snapshot
Automata-Theoretic Model Checking Revisited
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-70545-1_50openalex-snapshot
Semi-external LTL Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-70952-7_2openalex-snapshot
Distributed Verification: Exploring the Power of Raw Computing Power
inferred← citeshttps://doi.org/10.1007/978-3-540-73370-6_11openalex-snapshot
LTL Satisfiability Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-73370-6_13openalex-snapshot
Scalable Multi-core LTL Model-Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-73370-6_4openalex-snapshot
Minimal Counterexample Generation for SPIN
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_5openalex-snapshot
Tightening the Exchange Rates Between Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-76336-9_2openalex-snapshot
Linear-Time Model Checking: Automata Theory in Practice
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-00431-5_5openalex-snapshot
Survey on Directed Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-00768-2_21openalex-snapshot
Hierarchical Adaptive State Space Caching Based on Level Sampling
inferred← citeshttps://doi.org/10.1007/978-3-642-00985-3_3openalex-snapshot
Security-By-Contract for the Future Internet
inferred← citeshttps://doi.org/10.1007/978-3-642-01862-6openalex-snapshot
Enterprise, Business-Process and Information Systems Modeling
inferred← citeshttps://doi.org/10.1007/978-3-642-01862-6_29openalex-snapshot
Declarative versus Imperative Process Modeling Languages: The Issue of Understandability
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-03240-0_14openalex-snapshot
Can Flash Memory Help in Model Checking?
inferred← citeshttps://doi.org/10.1007/978-3-642-04368-0_18openalex-snapshot
Checking Timed Büchi Automata Emptiness Using LU-Abstractions
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-10373-5_22openalex-snapshot
Scalable Multi-core Model Checking Fairness Enhanced Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-12186-9_45openalex-snapshot
Declarative versus Imperative Process Modeling Languages: The Issue of Maintainability
inferred← citeshttps://doi.org/10.1007/978-3-642-16612-9_33openalex-snapshot
Optimized Temporal Monitors for SystemC
inferred← citeshttps://doi.org/10.1007/978-3-642-19811-3_10openalex-snapshot
Uniform Monte-Carlo Model Checking
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_23openalex-snapshot
Multi-core Nested Depth-First Search
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-33826-7_4openalex-snapshot
Checking Sanity of Software Requirements
inferred← citeshttps://doi.org/10.1007/978-3-642-35861-6_15openalex-snapshot
Guided Search for Deadlocks in Actor-Based Models
inferred← citeshttps://doi.org/10.1007/978-3-642-36742-7_42openalex-snapshot
Strength-Based Decomposition of the Property Büchi Automaton for Faster Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-38088-4_3openalex-snapshot
Improved on-the-Fly Livelock Detection
inferred← citeshttps://doi.org/10.1007/978-3-642-38874-3_3openalex-snapshot
Model Checking of Biological Systems
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_31openalex-snapshot
A Fully Verified Executable LTL Model Checker
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-40624-9_17openalex-snapshot
Using Agent JPF to Build Models for Other Model Checkers
inferred← citeshttps://doi.org/10.1007/978-3-642-41202-8_21openalex-snapshot
Verification of Functional and Non-functional Requirements of Web Service Composition
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-642-59615-5_4openalex-snapshot
Model Checking Using Automata Theory
showing the first 200 of 444 · page through all 444
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.