On the public citation graph

Design and synthesis of synchronization skeletons using branching time temporal logic

https://doi.org/10.1007/bfb0025774
0 signed · 2008 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-10003-2_69openalex-snapshot
Characterizing correctness properties of parallel programs using fixpoints
inferredcites →https://doi.org/10.1007/3-540-10843-2_21openalex-snapshot
Finite models for deterministic propositional dynamic logic
inferredcites →https://doi.org/10.1007/978-3-642-86718-7openalex-snapshot
First-Order Logic
inferredcites →https://doi.org/10.1109/sfcs.1977.25openalex-snapshot
Program invariants as fixed points
inferredcites →https://doi.org/10.1111/j.1468-0149.1969.tb00005.xopenalex-snapshot
AN INTRODUCTION TO MODAL LOGIC
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/0210016openalex-snapshot
The Total Correctness of Parallel Programs
inferredcites →https://doi.org/10.1145/3472456openalex-snapshot
50th International Conference on Parallel Processing
inferredcites →https://doi.org/10.1145/567446.567462openalex-snapshot
On the temporal analysis of fairness
inferredcites →https://doi.org/10.1145/567446.567463openalex-snapshot
"Sometime" is sometimes "not never"
inferredcites →https://doi.org/10.1145/567532.567551openalex-snapshot
The temporal logic of branching time
inferredcites →https://doi.org/10.1145/800070.802190openalex-snapshot
Decision procedures and expressiveness in the temporal logic of branching time
inferredcites →https://doi.org/10.1145/800133.804362openalex-snapshot
A practical decision method for propositional dynamic logic (Preliminary Report)
inferredcites →https://doi.org/10.2140/pjm.1955.5.285openalex-snapshot
A lattice-theoretical fixpoint theorem and its applications

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.4853448openalex-extracted
A Quantitative Extension of Interval Temporal Logic Over Infinite Words
inferred← citeshttps://doi.org/10.1002/9780470611012.ch4openalex-snapshot
Model Checking Timed Automata
inferred← citeshttps://doi.org/10.1002/9781119005223.ch5openalex-snapshot
ASP for Construction and Validation of Regulatory Biological Networks
inferred← citeshttps://doi.org/10.1002/9781119005223.ch7openalex-snapshot
Formal Methods Applied to Gene Network Modeling
inferred← citeshttps://doi.org/10.1002/9781119420712.ch10openalex-snapshot
Model Checking
inferred← citeshttps://doi.org/10.1002/cpe.1661openalex-snapshot
Analyzing behavioral properties of semantic business processes with parametric data
inferred← citeshttps://doi.org/10.1002/cpe.3652openalex-snapshot
Distributed CTL model checking using MapReduce: theory and practice
inferred← citeshttps://doi.org/10.1002/int.20486openalex-snapshot
Conceptual modeling in full computation-tree logic with sequence modal operator
inferred← citeshttps://doi.org/10.1002/spe.1152openalex-snapshot
Validating quality attribute requirements via execution‐based model checking
inferred← citeshttps://doi.org/10.1002/spe.2242openalex-snapshot
Model checking aircraft controller software: a case study
inferred← citeshttps://doi.org/10.1002/spe.2256openalex-snapshot
Analyzing performance traces using temporal formulas
inferred← citeshttps://doi.org/10.1002/stvr.1611openalex-snapshot
Past‐Free[ze] reachability analysis: reaching further with DAG‐directed exhaustive state‐space analysis
inferred← citeshttps://doi.org/10.1002/stvr.402openalex-snapshot
Testing with model checkers: a survey
inferred← citeshttps://doi.org/10.1006/inco.1996.0086openalex-snapshot
Parametric Timing Analysis for Real-Time Systems
inferred← citeshttps://doi.org/10.1006/inco.1997.2624openalex-snapshot
Determinization and Memoryless Winning Strategies
inferred← citeshttps://doi.org/10.1006/inco.2000.2893openalex-snapshot
Module Checking
inferred← citeshttps://doi.org/10.1006/inco.2001.2970openalex-snapshot
An Infinite Hierarchy of Temporal Logics over Branching Time
inferred← citeshttps://doi.org/10.1007/0-306-48088-3_5openalex-snapshot
A Tutorial Introduction to Symbolic Model Checking
inferred← citeshttps://doi.org/10.1007/0-8176-4404-0_23openalex-snapshot
Temporal Logic Model Checking
inferred← citeshttps://doi.org/10.1007/1-4020-2530-0_5openalex-snapshot
Assertion-Based Verification
inferred← citeshttps://doi.org/10.1007/1-4020-2530-0_6openalex-snapshot
Formal Verification for Nonlinear Analog Systems: Approaches to Model and Equivalence Checking
inferred← citeshttps://doi.org/10.1007/1-4020-3532-2_5openalex-snapshot
Formalizing Counterexample-Driven Refinement with Weakest Preconditions
inferred← citeshttps://doi.org/10.1007/10719619_18openalex-snapshot
Agent-Oriented Software Engineering
inferred← citeshttps://doi.org/10.1007/10719839_37openalex-snapshot
Undecidable Problems in Unreliable Computations
inferred← citeshttps://doi.org/10.1007/10720084_11openalex-snapshot
Combinations of Model Checking and Theorem Proving
inferred← citeshttps://doi.org/10.1007/10720327_3openalex-snapshot
Constraint Logic Programming Applied to Model Checking
inferred← citeshttps://doi.org/10.1007/10720327_5openalex-snapshot
Infinite State Model Checking by Abstract Interpretation and Program Specialisation
inferred← citeshttps://doi.org/10.1007/10721959_19openalex-snapshot
Reducing Model Checking of the Many to the Few
inferred← citeshttps://doi.org/10.1007/10722167_14openalex-snapshot
On the Completeness of Compositional Reasoning
inferred← citeshttps://doi.org/10.1007/10722167_23openalex-snapshot
Efficient Reachability Analysis of Hierarchical Reactive Machines
inferred← citeshttps://doi.org/10.1007/10722167_5openalex-snapshot
An Abstraction Algorithm for the Verification of Generalized C-Slow Designs
inferred← citeshttps://doi.org/10.1007/10722468_10openalex-snapshot
Correctness by Construction: Towards Verification in Hierarchical System Development
inferred← citeshttps://doi.org/10.1007/11493402_1openalex-snapshot
Dynamics of Declarative Goals in Agent Programming
inferred← citeshttps://doi.org/10.1007/11506881_11openalex-snapshot
Detecting Malicious Code by Model Checking
inferred← citeshttps://doi.org/10.1007/11513988_12openalex-snapshot
Symmetry Reduction in SAT-Based Model Checking
inferred← citeshttps://doi.org/10.1007/11513988_8openalex-snapshot
Abstraction for Falsification
inferred← citeshttps://doi.org/10.1007/11526841_33openalex-snapshot
On Partitioning and Symbolic Model Checking
inferred← citeshttps://doi.org/10.1007/11526841_35openalex-snapshot
Floating-Point Verification
inferred← citeshttps://doi.org/10.1007/11526841_36openalex-snapshot
Preliminary Results of a Case Study: Model Checking for Advanced Automotive Applications
inferred← citeshttps://doi.org/10.1007/11541868_6openalex-snapshot
Formal Modeling of a Slicing Algorithm for Java Event Spaces in PVS
inferred← citeshttps://doi.org/10.1007/11560548_20openalex-snapshot
An Analysis of SAT-Based Model Checking Techniques in an Industrial Environment
inferred← citeshttps://doi.org/10.1007/11560548_22openalex-snapshot
Identification and Counter Abstraction for Full Virtual Symmetry
inferred← citeshttps://doi.org/10.1007/11560647_36openalex-snapshot
Using Fairness Constraints in Process-Algebraic Verification
inferred← citeshttps://doi.org/10.1007/11562436_20openalex-snapshot
Model Checking for Timed Statecharts
inferred← citeshttps://doi.org/10.1007/11562436_22openalex-snapshot
Modeling and Verification of Safety-Critical Systems Using Safecharts
inferred← citeshttps://doi.org/10.1007/11562436_23openalex-snapshot
Structure Preserving Data Abstractions for Statecharts
inferred← citeshttps://doi.org/10.1007/11562436_8openalex-snapshot
Fast Generic Model-Checking for Data-Based Systems
inferred← citeshttps://doi.org/10.1007/11562931_23openalex-snapshot
Deductive Multi-valued Model Checking
inferred← citeshttps://doi.org/10.1007/11562948_13openalex-snapshot
Automatic Test Case Generation with Region-Related Coverage Annotations for Real-Time Systems
inferred← citeshttps://doi.org/10.1007/11562948_21openalex-snapshot
Semi-automatic Distributed Synthesis
inferred← citeshttps://doi.org/10.1007/11562948_28openalex-snapshot
Model Checking Prioritized Timed Automata
inferred← citeshttps://doi.org/10.1007/11562948_5openalex-snapshot
A New Reachability Algorithm for Symmetric Multi-processor Architecture
inferred← citeshttps://doi.org/10.1007/11590156_31openalex-snapshot
Towards a CTL* Tableau
inferred← citeshttps://doi.org/10.1007/11590156_5openalex-snapshot
From Logic to Games
inferred← citeshttps://doi.org/10.1007/11591191_35openalex-snapshot
Pushdown Module Checking
inferred← citeshttps://doi.org/10.1007/11595014_51openalex-snapshot
Intentions and Strategies in Game-Like Scenarios
inferred← citeshttps://doi.org/10.1007/11596042_17openalex-snapshot
TS-U: Temporal-Spatial Methodology for Application Checking of the Systems in the Ubiquitous Environment
inferred← citeshttps://doi.org/10.1007/11599555_33openalex-snapshot
Deductive Probabilistic Verification Methods of Safety, Liveness and Nonzenoness for Distributed Real-Time Systems
inferred← citeshttps://doi.org/10.1007/11600930_39openalex-snapshot
Formal Analysis and Improvement of the State Transition Model for Intrusion Tolerant System
inferred← citeshttps://doi.org/10.1007/11609773_10openalex-snapshot
Error Control for Probabilistic Model Checking
inferred← citeshttps://doi.org/10.1007/11609773_13openalex-snapshot
Improved Algorithm Complexities for Linear Temporal Logic Model Checking of Pushdown Systems
inferred← citeshttps://doi.org/10.1007/11609773_24openalex-snapshot
Synthesis of Reactive(1) Designs
inferred← citeshttps://doi.org/10.1007/11609773_5openalex-snapshot
Complexity Results on Branching-Time Pushdown Model Checking
inferred← citeshttps://doi.org/10.1007/11687061_4openalex-snapshot
Aspect Categories and Classes of Temporal Properties
inferred← citeshttps://doi.org/10.1007/11691372_10openalex-snapshot
SAT-Based Software Certification
inferred← citeshttps://doi.org/10.1007/11691372_16openalex-snapshot
Approximating Predicate Images for Bit-Vector Logic
inferred← citeshttps://doi.org/10.1007/11691617_19openalex-snapshot
Model Checking Dynamic States in GROOVE
inferred← citeshttps://doi.org/10.1007/11691792_12openalex-snapshot
A Combination of Explicit and Deductive Knowledge with Branching Time: Completeness and Decidability Results
inferred← citeshttps://doi.org/10.1007/11750321_64openalex-snapshot
Maximal Models of Assertion Graph in GSTE
inferred← citeshttps://doi.org/10.1007/11757283_4openalex-snapshot
BDD-Based Hardware Verification
inferred← citeshttps://doi.org/10.1007/11757283_8openalex-snapshot
Floating-Point Verification Using Theorem Proving
inferred← citeshttps://doi.org/10.1007/11786849_20openalex-snapshot
A Complete and Decidable Axiomatisation for Deontic Interpreted Systems
inferred← citeshttps://doi.org/10.1007/11786849_9openalex-snapshot
A State/Event Temporal Deontic Logic
inferred← citeshttps://doi.org/10.1007/11804192_11openalex-snapshot
Abstraction and Refinement in Model Checking
inferred← citeshttps://doi.org/10.1007/11817949_33openalex-snapshot
Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words
inferred← citeshttps://doi.org/10.1007/11817949_8openalex-snapshot
Model Checking Quantified Computation Tree Logic
inferred← citeshttps://doi.org/10.1007/11817949_9openalex-snapshot
Liveness, Fairness and Impossible Futures
inferred← citeshttps://doi.org/10.1007/11817963_27openalex-snapshot
EverLost: A Flexible Platform for Industrial-Strength Abstraction-Guided Simulation
inferred← citeshttps://doi.org/10.1007/11867340_18openalex-snapshot
Model-Checking Timed ATL for Durational Concurrent Game Structures
inferred← citeshttps://doi.org/10.1007/11901433_6openalex-snapshot
Reducing Model Checking of the Few to the One
inferred← citeshttps://doi.org/10.1007/11901914_14openalex-snapshot
Compositional Reasoning for Hardware/Software Co-verification
inferred← citeshttps://doi.org/10.1007/11901914_17openalex-snapshot
Selective Approaches for Solving Weak Games
inferred← citeshttps://doi.org/10.1007/11901914_20openalex-snapshot
Synthesis for Probabilistic Environments
inferred← citeshttps://doi.org/10.1007/11901914_25openalex-snapshot
Ranked Predicate Abstraction for Branching Time: Complete, Incremental, and Precise
inferred← citeshttps://doi.org/10.1007/11901914_8openalex-snapshot
Model Checking Timed Systems with Urgencies
inferred← citeshttps://doi.org/10.1007/11901914_9openalex-snapshot
Whodunit? Causal Analysis for Counterexamples
inferred← citeshttps://doi.org/10.1007/11944836_30openalex-snapshot
Distributed Synthesis for Well-Connected Architectures
inferred← citeshttps://doi.org/10.1007/3-540-12896-4_363openalex-snapshot
Deciding branching time logic: A triple exponential decision procedure for CTL
inferred← citeshttps://doi.org/10.1007/3-540-12920-0_26openalex-snapshot
Algebre de machines et logique temporelle
inferred← citeshttps://doi.org/10.1007/3-540-15648-8_7openalex-snapshot
Automata, tableaux, and temporal logics
inferred← citeshttps://doi.org/10.1007/3-540-16066-3_10openalex-snapshot
Model theory of propositional logics of programs, some open problems
inferred← citeshttps://doi.org/10.1007/3-540-17660-8_60openalex-snapshot
Characterizing Kripke structures in temporal logic
inferred← citeshttps://doi.org/10.1007/3-540-19426-6_4openalex-snapshot
Mendels: Concurrent program synthesis system using temporal logic
inferred← citeshttps://doi.org/10.1007/3-540-34874-3_5openalex-snapshot
Verification of Open Systems
inferred← citeshttps://doi.org/10.1007/3-540-36384-x_4openalex-snapshot
Automatic Verification by Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/3-540-36481-1_5openalex-snapshot
Contribution of Computational Tree Logic to Biological Regulatory Networks: Example from Pseudomonas Aeruginosa
inferred← citeshttps://doi.org/10.1007/3-540-36481-1_6openalex-snapshot
Modeling Cellular Behavior with Hybrid Automata: Bisimulation and Collapsing
inferred← citeshttps://doi.org/10.1007/3-540-36540-0_3openalex-snapshot
Validation of Multiagent Systems by Symbolic Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-36575-3_13openalex-snapshot
Using Controller-Synthesis Techniques to Build Property-Enforcing Layers
inferred← citeshttps://doi.org/10.1007/3-540-36577-x_5openalex-snapshot
On the Universal and Existential Fragments of the μ-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-44450-5_1openalex-snapshot
Model Checking: Theory into Practice
inferred← citeshttps://doi.org/10.1007/3-540-44450-5_10openalex-snapshot
Model Checking CTL Properties of Pushdown Systems
inferred← citeshttps://doi.org/10.1007/3-540-44450-5_11openalex-snapshot
A Decidable Dense Branching-Time Temporal Logic
inferred← citeshttps://doi.org/10.1007/3-540-44577-3_12openalex-snapshot
Progress on the State Explosion Problem in Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_2openalex-snapshot
Certifying Model Checkers
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_31openalex-snapshot
Model Checking the World Wide Web?
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_33openalex-snapshot
The Temporal Logic Sugar
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_4openalex-snapshot
And/Or Hierarchies and Round Abstraction
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_58openalex-snapshot
Why so Many Temporal Logics Climb up the Trees?
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_14openalex-snapshot
Generalized Model Checking: Reasoning about Partial State Spaces
inferred← citeshttps://doi.org/10.1007/3-540-44631-1_1openalex-snapshot
Optimistic and Disjunctive Agent Design Problems
inferred← citeshttps://doi.org/10.1007/3-540-44685-0_14openalex-snapshot
Liveness and Fairness in Process-Algebraic Verification
inferred← citeshttps://doi.org/10.1007/3-540-44685-0_19openalex-snapshot
On the Power of Labels in Transition Systems
inferred← citeshttps://doi.org/10.1007/3-540-44798-9_27openalex-snapshot
A Specification Methodology by a Collection of Compact Properties as Applied to the Intel® Itanium™ Processor Bus Protocol
inferred← citeshttps://doi.org/10.1007/3-540-44798-9_5openalex-snapshot
Heuristics for Hierarchical Partitioning with Application to Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-44829-2_14openalex-snapshot
Thread-Modular Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-44914-0_1openalex-snapshot
Partial Completeness of Abstract Fixpoint Checking
inferred← citeshttps://doi.org/10.1007/3-540-44919-1_5openalex-snapshot
Compositional Theories of Qualitative and Quantitative Behaviour
inferred← citeshttps://doi.org/10.1007/3-540-44929-9_24openalex-snapshot
Hierarchical State Machines
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-45061-0_61openalex-snapshot
Hierarchical and Recursive State Machines with Context-Dependent Properties
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_67openalex-snapshot
The Definition of a Temporal Clock Operator
inferred← citeshttps://doi.org/10.1007/3-540-45241-9_23openalex-snapshot
State Generation in the PARMC Model Checker
inferred← citeshttps://doi.org/10.1007/3-540-45294-x_25openalex-snapshot
From Falsification to Verification
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_19openalex-snapshot
Boolean and Cartesian Abstraction for Model Checking C Programs
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_36openalex-snapshot
Coverage Metrics for Temporal Logic Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_38openalex-snapshot
Model Checking CTL*[DC]
inferred← citeshttps://doi.org/10.1007/3-540-45448-9_8openalex-snapshot
Agents and Roles: Refinement in Alternating-Time Temporal Logic
inferred← citeshttps://doi.org/10.1007/3-540-45449-7_8openalex-snapshot
Verification of Embedded Software: Problems and Perspectives
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-45510-8_6openalex-snapshot
Industrial Applications of Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-45610-4_15openalex-snapshot
Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae
inferred← citeshttps://doi.org/10.1007/3-540-45614-7_30openalex-snapshot
Closing Open SDL-Systems for Model Checking with DTSpin
inferred← citeshttps://doi.org/10.1007/3-540-45620-1_9openalex-snapshot
DDDLIB: A Library for Solving Quantified Difference Inequalities
inferred← citeshttps://doi.org/10.1007/3-540-45622-8_1openalex-snapshot
Model Checking and Abstraction
inferred← citeshttps://doi.org/10.1007/3-540-45627-9_10openalex-snapshot
Formal Verification Methods for Industrial Hardware Design
inferred← citeshttps://doi.org/10.1007/3-540-45635-x_23openalex-snapshot
Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Models
inferred← citeshttps://doi.org/10.1007/3-540-45653-8_3openalex-snapshot
Improving Automata Generation for Linear Temporal Logic by Considering the Automaton Hierarchy
inferred← citeshttps://doi.org/10.1007/3-540-45656-2_15openalex-snapshot
Decidability of Quantifed Propositional Branching Time Logics
inferred← citeshttps://doi.org/10.1007/3-540-45657-0_11openalex-snapshot
Automatic Abstraction Using Generalized Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-45657-0_19openalex-snapshot
Applying SAT Methods in Unbounded Symbolic Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-45657-0_21openalex-snapshot
Semi-formal Bounded Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-45657-0_3openalex-snapshot
On Abstraction in Software Verification
inferred← citeshttps://doi.org/10.1007/3-540-45657-0_39openalex-snapshot
Vacuum Cleaning CTL Formulae
inferred← citeshttps://doi.org/10.1007/3-540-45694-5_4openalex-snapshot
Expressive Power of Temporal Logics
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-45757-7_11openalex-snapshot
Complexity of Multi-agent Systems Behavior
inferred← citeshttps://doi.org/10.1007/3-540-45828-x_1openalex-snapshot
Embedded Systems: Challenges in Specification and Verification
inferred← citeshttps://doi.org/10.1007/3-540-45988-x_5openalex-snapshot
Integrating BDD-Based and SAT-Based Symbolic Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-46002-0_17openalex-snapshot
Resource-Constrained Model Checking of Recursive Programs
inferred← citeshttps://doi.org/10.1007/3-540-46002-0_18openalex-snapshot
Model Checking Large-Scale and Parameterized Resource Allocation Systems
inferred← citeshttps://doi.org/10.1007/3-540-46002-0_30openalex-snapshot
Temporal Debugging for Concurrent Systems
inferred← citeshttps://doi.org/10.1007/3-540-46002-0_31openalex-snapshot
Fate and FreeWill in Error Traces
inferred← citeshttps://doi.org/10.1007/3-540-46419-0_36openalex-snapshot
A Formal Specification and Validation of a Critical System in Presence of Byzantine Errors
inferred← citeshttps://doi.org/10.1007/3-540-46674-6_18openalex-snapshot
Demand-Driven Model Checking for Context-Free Processes
inferred← citeshttps://doi.org/10.1007/3-540-46674-6_20openalex-snapshot
Faster Model Checking for Open Systems
inferred← citeshttps://doi.org/10.1007/3-540-46691-6_30openalex-snapshot
A Unifying Framework for Model Checking Labeled Kripke Structures, Modal Transition Systems, and Interval Transition Systems
inferred← citeshttps://doi.org/10.1007/3-540-47813-2_17openalex-snapshot
Weak Muller Acceptance Conditions for Tree Automata
inferred← citeshttps://doi.org/10.1007/3-540-47813-2_19openalex-snapshot
A Simulation Preorder for Abstraction of Reactive Systems
inferred← citeshttps://doi.org/10.1007/3-540-48119-2_17openalex-snapshot
Symbolic Model Checking with Fewer Fixpoint Computations
inferred← citeshttps://doi.org/10.1007/3-540-48119-2_20openalex-snapshot
Automatic Verification of Pointer Data-Structure Systems for All Numbers of Processes
inferred← citeshttps://doi.org/10.1007/3-540-48153-2_12openalex-snapshot
From Asymmetry to Full Symmetry: New Techniques for Symmetry Reduction in Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-48153-2_8openalex-snapshot
Vacuity Detection in Temporal Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_9openalex-snapshot
Difference Decision Diagrams
inferred← citeshttps://doi.org/10.1007/3-540-48234-2_5openalex-snapshot
Divide, Abstract, and Model-Check
inferred← citeshttps://doi.org/10.1007/3-540-48256-3_17openalex-snapshot
A HOL Conversion for Translating Linear Time Temporal Logic to ω-Automata
inferred← citeshttps://doi.org/10.1007/3-540-48320-9_10openalex-snapshot
Model Checking of Message Sequence Charts
inferred← citeshttps://doi.org/10.1007/3-540-48320-9_27openalex-snapshot
Robust Satisfaction
inferred← citeshttps://doi.org/10.1007/3-540-48320-9_9openalex-snapshot
“Next” Heuristic for On-the-Fly Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-48340-3_13openalex-snapshot
Clausal Resolution for CTL
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_13openalex-snapshot
Parametric Temporal Logic for “Model Measuring”
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_14openalex-snapshot
Communicating Hierarchical State Machines
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_21openalex-snapshot
Efficient Decision Procedures for Model Checking of Linear Time Logic Properties
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_25openalex-snapshot
Model Checking Partial State Spaces with 3-Valued Temporal Logics
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_27openalex-snapshot
Verifying Sequential Consistency on Shared-Memory Multiprocessor Systems
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_3openalex-snapshot
Timed Automata
inferred← citeshttps://doi.org/10.1007/3-540-48778-6_6openalex-snapshot
ProbVerus: Probabilistic Symbolic Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-48983-5_5openalex-snapshot
Polyhedral Flows in Hybrid Automata
inferred← citeshttps://doi.org/10.1007/3-540-49057-4_4openalex-snapshot
On the Relationship between BDI Logics and Standard Logics of Concurrency
inferred← citeshttps://doi.org/10.1007/3-540-49213-5_2openalex-snapshot
Alternating-time Temporal Logic
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-50403-6_28openalex-snapshot
A framework for the synthesis of reactive modules
inferred← citeshttps://doi.org/10.1007/3-540-51803-7_20openalex-snapshot
Interleaving set temporal logic
inferred← citeshttps://doi.org/10.1007/3-540-51803-7_23openalex-snapshot
On the relation of programs and computations to models of temporal logic
inferred← citeshttps://doi.org/10.1007/3-540-52753-2_46openalex-snapshot
New ways for developing proof theories for first-order multi modal logics
inferred← citeshttps://doi.org/10.1007/3-540-55092-5_1openalex-snapshot
ISL: An interval logic for the specification of real-time programs
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_21openalex-snapshot
Vectorized symbolic model checking of computation tree logic for sequential machine verification
inferred← citeshttps://doi.org/10.1007/3-540-55251-0_8openalex-snapshot
CTL* and ECTL* as fragments of the modal μ-calculus
inferred← citeshttps://doi.org/10.1007/3-540-56287-7_117openalex-snapshot
Reasoning about safety and liveness properties for probabilistic processes
inferred← citeshttps://doi.org/10.1007/3-540-56496-9_25openalex-snapshot
A proof assistant for symbolic model-checking
inferred← citeshttps://doi.org/10.1007/3-540-56883-2_6openalex-snapshot
Propositional temporal logics and their use in model checking
inferred← citeshttps://doi.org/10.1007/3-540-56922-7_38openalex-snapshot
Symmetry and model checking
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_19openalex-snapshot
Branching time temporal logic and amorphous tree automata
inferred← citeshttps://doi.org/10.1007/3-540-58179-0_53openalex-snapshot
Methodology and system for practical formal verification of reactive hardware
inferred← citeshttps://doi.org/10.1007/3-540-59175-3_113openalex-snapshot
A temporal logic for real-time partial-ordering with named transactions
inferred← citeshttps://doi.org/10.1007/3-540-60045-0_52openalex-snapshot
Local model checking for real-time systems
inferred← citeshttps://doi.org/10.1007/3-540-60045-0_59openalex-snapshot
Utilizing symmetry when model checking under fairness assumptions: An automata-theoretic approach
inferred← citeshttps://doi.org/10.1007/3-540-60045-0_62openalex-snapshot
On the model checking problem for branching time logics and basic parallel processes
inferred← citeshttps://doi.org/10.1007/3-540-60218-6_21openalex-snapshot
Reachability analysis at procedure level through timing coincidence
showing the first 200 of 1994 · page through all 1994
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.