On the public citation graph
A linear-time model-checking algorithm for the alternation-free modal mu-calculus
0 signed · 228 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-50939-9_144openalex-snapshot
Local model checking in the modal mu-calculus
inferredcites →https://doi.org/10.1007/3-540-52148-8_2openalex-snapshot
Testing equivalence as a bisimulation equivalence
inferredcites →https://doi.org/10.1007/3-540-54233-7_129openalex-snapshot
Computing behavioural relations, logically
inferredcites →https://doi.org/10.1007/3-540-55253-7_1openalex-snapshot
Model checking and boolean graphs
inferredcites →https://doi.org/10.1007/3-540-56496-9_32openalex-snapshot
Faster model checking for the modal Mu-Calculus
inferredcites →https://doi.org/10.1007/3-540-56496-9_4openalex-snapshot
Efficient local correctness checking
inferredcites →https://doi.org/10.1007/978-1-4471-3534-0_7openalex-snapshot
Winston: A Tool for Hierarchical Design and Simulation of Concurrent Systems
inferredcites →https://doi.org/10.1007/bf00264284openalex-snapshot
Tableau-based model checking in the propositional mu-calculus
inferredcites →https://doi.org/10.1007/bf01211314openalex-snapshot
Testing equivalence as a bisimulation equivalence
inferredcites →https://doi.org/10.1007/bfb0012782openalex-snapshot
Results on the propositional μ-calculus
inferredcites →https://doi.org/10.1007/bfb0026106openalex-snapshot
Proof systems for Hennessy-Milner Logic with recursion
inferredcites →https://doi.org/10.1007/bfb0035797openalex-snapshot
A note on model checking the modal v-calculus
inferredcites →https://doi.org/10.1016/0020-0190(88)90029-4openalex-snapshot
A linear algorithm to solve fixed-point equations on transition systems
inferredcites →https://doi.org/10.1016/0022-0000(79)90046-1openalex-snapshot
Propositional dynamic logic of regular programs
inferredcites →https://doi.org/10.1016/0304-3975(82)90125-6openalex-snapshot
Results on the propositional μ-calculus
inferredcites →https://doi.org/10.1016/0304-3975(90)90110-4openalex-snapshot
Local model checking in the modal mu-calculus
inferredcites →https://doi.org/10.1090/dimacs/003/06openalex-snapshot
Compositional minimization of finite state systems
inferredcites →https://doi.org/10.1109/lics.1990.113768openalex-snapshot
When is 'partial' adequate? A logic-based proof technique using partial specifications
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.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.1002/9780470611012.ch3openalex-snapshot
An Introduction to Model Checking
inferred← citeshttps://doi.org/10.1007/11562436_8openalex-snapshot
Fast Generic Model-Checking for Data-Based Systems
inferred← citeshttps://doi.org/10.1007/11691617_8openalex-snapshot
Distributed On-the-Fly Model Checking and Test Case Generation
inferred← citeshttps://doi.org/10.1007/11817963_12openalex-snapshot
Bounded Model Checking for Weak Alternating Büchi Automata
inferred← citeshttps://doi.org/10.1007/11901914_17openalex-snapshot
Selective Approaches for Solving Weak Games
inferred← citeshttps://doi.org/10.1007/11965893_25openalex-snapshot
Combining Temporal Logics for Querying XML Documents
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-36577-x_7openalex-snapshot
A Generic On-the-Fly Solver for Alternation-Free Boolean Equation Systems
inferred← citeshttps://doi.org/10.1007/3-540-44577-3_10openalex-snapshot
Abstract Interpretation Based Formal Methods and Future Challenges
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-44585-4_7openalex-snapshot
A Practical Approach to Coverage in Model Checking
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-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-45657-0_37openalex-snapshot
Evidence-Based Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-45719-4_12openalex-snapshot
On Solving Temporal Logic Queries
inferred← citeshttps://doi.org/10.1007/3-540-46002-0_20openalex-snapshot
Local Model-Checking of Modal Mu-Calculus on Acyclic Labeled Transition Systems
inferred← citeshttps://doi.org/10.1007/3-540-46002-0_29openalex-snapshot
Simulation as Coarsest Partition Problem
inferred← citeshttps://doi.org/10.1007/3-540-46017-9_11openalex-snapshot
Local Parallel Model Checking for the Alternation-Free μ-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-46419-0_18openalex-snapshot
Efficient Diagnostic Generation for Boolean Equation Systems
inferred← citeshttps://doi.org/10.1007/3-540-48242-3_6openalex-snapshot
Model Checking Games for the Alternation-Free μ-Calculus and Alternating Automata
inferred← citeshttps://doi.org/10.1007/3-540-48340-3_12openalex-snapshot
Is Your Model Checker on Time?
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-49116-3_43openalex-snapshot
The Weakness of Self-Complementation
inferred← citeshttps://doi.org/10.1007/3-540-49213-5_2openalex-snapshot
Alternating-time Temporal Logic
inferred← citeshttps://doi.org/10.1007/3-540-54415-1_54openalex-snapshot
Data flow analysis as model checking
inferred← citeshttps://doi.org/10.1007/3-540-55253-7_1openalex-snapshot
Model checking and boolean graphs
inferred← citeshttps://doi.org/10.1007/3-540-56496-9_16openalex-snapshot
Verification in process algebra of the distributed control of track vehicles—A case study
inferred← citeshttps://doi.org/10.1007/3-540-56496-9_32openalex-snapshot
Faster model checking for the modal Mu-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-56496-9_4openalex-snapshot
Efficient local correctness checking
inferred← citeshttps://doi.org/10.1007/3-540-56883-2_8openalex-snapshot
Analyzing concurrent systems using the Concurrency Workbench
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_105openalex-snapshot
Local model checking for context-free processes
inferred← citeshttps://doi.org/10.1007/3-540-58179-0_48openalex-snapshot
Verification of context-free timed systems using linear hybrid observers
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_52openalex-snapshot
Model checking of macro processes
inferred← citeshttps://doi.org/10.1007/3-540-58179-0_66openalex-snapshot
An improved algorithm for the evaluation of fixpoint expressions
inferred← citeshttps://doi.org/10.1007/3-540-58179-0_67openalex-snapshot
Incremental model checking in the modal mu-calculus
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_77openalex-snapshot
Efficient local correctness checking for single and alternating boolean equation systems
inferred← citeshttps://doi.org/10.1007/3-540-58485-4_49openalex-snapshot
Efficient fixpoint computation
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-60218-6_1openalex-snapshot
Local model checking games (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-60218-6_6openalex-snapshot
The fixpoint-analysis machine
inferred← citeshttps://doi.org/10.1007/3-540-60630-0_4openalex-snapshot
Modal μ-calculus, model checking and Gauß elimination
inferred← citeshttps://doi.org/10.1007/3-540-60915-6_3openalex-snapshot
Automated temporal reasoning about reactive systems
inferred← citeshttps://doi.org/10.1007/3-540-61042-1_41openalex-snapshot
Efficient local model-checking for fragments of the modal Μ-calculus
inferred← citeshttps://doi.org/10.1007/3-540-61042-1_56openalex-snapshot
The Concurrency Factory software development environment
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_87openalex-snapshot
The NCSU Concurrency Workbench
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_88openalex-snapshot
The Concurrency Factory: A development environment for concurrent systems
inferred← citeshttps://doi.org/10.1007/3-540-61739-6_42openalex-snapshot
An even faster solver for general systems of equations
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/978-1-4615-2203-4_13openalex-snapshot
An Exercise in Protocol Verification
inferred← citeshttps://doi.org/10.1007/978-3-030-00244-2_15openalex-snapshot
M3C: Modal Meta Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-030-22348-9_8openalex-snapshot
States and Events in KandISTI
inferred← citeshttps://doi.org/10.1007/978-3-030-30985-5_19openalex-snapshot
Product Line Verification via Modal Meta Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-031-66149-5_5openalex-snapshot
Two Decades of Industrializing Formal Verification: The Reactis Story
inferred← citeshttps://doi.org/10.1007/978-3-031-68416-6_10openalex-snapshot
An Expressive Timed Modal Mu-Calculus for Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-10512-3_9openalex-snapshot
The Power of Proofs: New Algorithms for Timed Automata Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_26openalex-snapshot
The mu-calculus and Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-10882-7_27openalex-snapshot
A Decidable Recursive Logic for Weighted Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-27060-9_14openalex-snapshot
On the Model Checking of the Graded $$\mu $$ -calculus on Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-32582-8_13openalex-snapshot
On-the-Fly Model Checking for Extended Action-Based Probabilistic Operators
inferred← citeshttps://doi.org/10.1007/978-3-540-24732-6_11openalex-snapshot
SEQ.OPEN: A Tool for Efficient Trace-Based Verification
inferred← citeshttps://doi.org/10.1007/978-3-540-30482-1_30openalex-snapshot
An Approach to Preserve Protocol Consistency and Executability Across Updates
inferred← citeshttps://doi.org/10.1007/978-3-540-30494-4_14openalex-snapshot
Simple Bounded LTL Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_10openalex-snapshot
Local Model Checking for Parallel Compositions of Context-Free Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_31openalex-snapshot
Testing-Based Abstractions for Value-Passing Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_9openalex-snapshot
Pushdown Processes: Parallel Composition and Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-68237-0_12openalex-snapshot
A Model Checking Language for Concurrent Value-Passing Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_23openalex-snapshot
Ranking Automata and Games for Prioritized Requirements
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_76openalex-snapshot
Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization
inferred← citeshttps://doi.org/10.1007/978-3-540-85114-1_15openalex-snapshot
Improved On-the-Fly Equivalence Checking Using Boolean Equation Systems
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-642-00431-5_2openalex-snapshot
Solving μ-Calculus Parity Games by Symbolic Planning
inferred← citeshttps://doi.org/10.1007/978-3-642-03754-2_3openalex-snapshot
Logical Foundations of XML and XQuery
inferred← citeshttps://doi.org/10.1007/978-3-642-22306-8_2openalex-snapshot
Property-Dependent Reductions for the Modal Mu-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-24372-1_15openalex-snapshot
A Hierarchical Approach for the Synthesis of Stabilizing Controllers for Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-28756-5_11openalex-snapshot
Partial Model Checking Using Networks of Labelled Transition Systems and Boolean Equation Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-30729-4_8openalex-snapshot
Model Checking as Static Analysis: Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-45221-5_4openalex-snapshot
A Semantic Basis for Proof Queries and Transformations
inferred← citeshttps://doi.org/10.1007/978-3-662-46078-8_19openalex-snapshot
Maximally Permissive Controlled System Synthesis for Modal Logic
inferred← citeshttps://doi.org/10.1007/978-3-662-46823-4_18openalex-snapshot
Decidability and Expressiveness of Recursive Weighted Logic
inferred← citeshttps://doi.org/10.1007/978-3-662-54458-7_24openalex-snapshot
Local Model Checking in a Logic for True Concurrency
inferred← citeshttps://doi.org/10.1007/bf01384080openalex-snapshot
Verification in process algebra of the distributed control of track vehicles?A case study
inferred← citeshttps://doi.org/10.1007/bf01384084openalex-snapshot
Model checking for action-based logics
inferred← citeshttps://doi.org/10.1007/bf02944747openalex-snapshot
Model checking real-time value-passing systems
inferred← citeshttps://doi.org/10.1007/bfb0013987openalex-snapshot
Efficient computation of nested fix-points, with applications to model checking
inferred← citeshttps://doi.org/10.1007/bfb0015261openalex-snapshot
Alternating automata and program verification
inferred← citeshttps://doi.org/10.1007/bfb0031992openalex-snapshot
Real-time and the Mu-Calculus (preliminary report)
inferred← citeshttps://doi.org/10.1007/bfb0054163openalex-snapshot
Verification based on local states
inferred← citeshttps://doi.org/10.1007/bfb0055040openalex-snapshot
Simple linear-time algorithms for minimal fixed points
inferred← citeshttps://doi.org/10.1007/bfb0055612openalex-snapshot
Sometimes and not never re-revisited: on branching versus linear time
inferred← citeshttps://doi.org/10.1007/bfb0084787openalex-snapshot
Model checking for context-free processes
inferred← citeshttps://doi.org/10.1007/s00224-010-9292-5openalex-snapshot
Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization
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/s004460050010openalex-snapshot
Generating diagnostic information for behavioral preorders
inferred← citeshttps://doi.org/10.1007/s00500-016-2193-zopenalex-snapshot
On decidability of recursive weighted logics
inferred← citeshttps://doi.org/10.1007/s10009-005-0194-9openalex-snapshot
CAESAR_SOLVE: A generic library for on-the-fly resolution of alternation-free Boolean equation systems
inferred← citeshttps://doi.org/10.1007/s10009-018-0499-0openalex-snapshot
On-the-fly model checking for extended action-based probabilistic operators
inferred← citeshttps://doi.org/10.1007/s100090050030openalex-snapshot
Pragmatics of model checking: an STTT special section
inferred← citeshttps://doi.org/10.1007/s100090050031openalex-snapshot
Local model checking and protocol analysis
inferred← citeshttps://doi.org/10.1007/s100090050032openalex-snapshot
Partial model checking of modal equations: A survey
inferred← citeshttps://doi.org/10.1007/s10515-012-0113-8openalex-snapshot
Verification of complex dynamic data tree with mu-calculus
inferred← citeshttps://doi.org/10.1007/s10626-016-0231-8openalex-snapshot
Maximally permissive controlled system synthesis for non-determinism and modal logic
inferred← citeshttps://doi.org/10.1007/s10849-009-9088-7openalex-snapshot
Model Checking for Hybrid Logic
inferred← citeshttps://doi.org/10.1016/0020-0190(96)00130-5openalex-snapshot
Fast and simple nested fixpoints
inferred← citeshttps://doi.org/10.1016/0167-6423(93)90003-8openalex-snapshot
Generating data flow analysis algorithms from modal specifications
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90266-6openalex-snapshot
Model checking and boolean graphs
inferred← citeshttps://doi.org/10.1016/j.csi.2004.08.004openalex-snapshot
Performance evaluation and verification of communication protocol for railway signaling systems
inferred← citeshttps://doi.org/10.1016/j.csi.2006.03.001openalex-snapshot
Verification and conformance test generation of communication protocol for railway signaling systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.11.011openalex-snapshot
A Multi-Core Solver for Parity Games
inferred← citeshttps://doi.org/10.1016/j.entcs.2015.12.018openalex-snapshot
Alternation-Free Weighted Mu-Calculus: Decidability and Completeness
inferred← citeshttps://doi.org/10.1016/j.ic.2011.10.008openalex-snapshot
Improved model checking of hierarchical systems
inferred← citeshttps://doi.org/10.1016/j.is.2019.101478openalex-snapshot
JSON: Data model and query languages
inferred← citeshttps://doi.org/10.1016/j.jal.2005.06.010openalex-snapshot
Model checking hybrid logics (with an application to semistructured data)
inferred← citeshttps://doi.org/10.1016/j.scico.2014.04.004openalex-snapshot
Property-dependent reductions adequate with divergence-sensitive branching bisimilarity
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.03.048openalex-snapshot
Probabilistic temporal logics via the modal mu-calculus
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.11.015openalex-snapshot
On the universal and existential fragments of the μ -calculus
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.11.016openalex-snapshot
Compositional analysis for verification of parameterized systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.07.008openalex-snapshot
Concurrent reachability games
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/j.tcs.2014.03.007openalex-snapshot
Complete proof systems for weighted modal logic
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.03.027openalex-snapshot
The μ-calculus alternation hierarchy collapses over structures with restricted connectivity
inferred← citeshttps://doi.org/10.1016/s0167-6423(01)00033-8openalex-snapshot
Generic tools for verifying concurrent systems
inferred← citeshttps://doi.org/10.1016/s0167-6423(02)00094-1openalex-snapshot
Efficient on-the-fly model-checking for regular alternation-free mu-calculus
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00612-6openalex-snapshot
Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00228-9openalex-snapshot
An improved algorithm for the evaluation of fixpoint expressions
inferred← citeshttps://doi.org/10.1016/s1567-8326(02)00022-xopenalex-snapshot
Is your model checker on time? On the complexity of model checking for timed modal logics
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80020-6openalex-snapshot
17 Automata-theoretic techniques for temporal reasoning
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80791-6openalex-snapshot
Simulation Reduction as Constraint
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80876-4openalex-snapshot
Almost-Certain Eventualities and Abstract Probabilities in Quantitative Temporal Logic
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80892-2openalex-snapshot
Can American Checkers be Solved by Means of Symbolic Model Checking?
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80256-7openalex-snapshot
Strict Lower Bounds for Model Checking BPA
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:1010076027707openalex-snapshot
On the Relationship Between BDI Logics and Standard Logics of Concurrency
inferred← citeshttps://doi.org/10.1023/a:1027328830731openalex-snapshot
From Bisimulation to Simulation: Coarsest Partition Problems
inferred← citeshttps://doi.org/10.1051/ita/2012029openalex-snapshot
On characteristic formulae for Event-Recording Automata
inferred← citeshttps://doi.org/10.1051/ita:2000131openalex-snapshot
Characteristic Formulae for Timed Automata
inferred← citeshttps://doi.org/10.1051/ita:2007043openalex-snapshot
Inf-datalog, Modal Logic and Complexities
inferred← citeshttps://doi.org/10.1090/dimacs/031openalex-snapshot
Descriptive Complexity and Finite Models
inferred← citeshttps://doi.org/10.1093/comjnl/bxaa031openalex-snapshot
From Relation Algebra to Semi-join Algebra: An Approach to Graph Query Optimization
inferred← citeshttps://doi.org/10.1093/jigpal/jzu030openalex-snapshot
On guarded transformation in the modal -calculus
inferred← citeshttps://doi.org/10.1093/logcom/13.6.939openalex-snapshot
A Modal Perspective on Path Constraints
inferred← citeshttps://doi.org/10.1109/acsd.2010.22openalex-snapshot
The Model Checking View to Clock Gating and Operand Isolation
inferred← citeshttps://doi.org/10.1109/empdp.2005.19openalex-snapshot
Distributed Local Resolution of Boolean Equation Systems
inferred← citeshttps://doi.org/10.1109/iceccs.2005.67openalex-snapshot
Preserving Consistency of Runtime Monitors across Protocol Changes
inferred← citeshttps://doi.org/10.1109/iceccs.2007.34openalex-snapshot
Parallel Model Checking and the FMICS-jETI Platform
inferred← citeshttps://doi.org/10.1109/icoin.1998.648443openalex-snapshot
A study on implementation of model checking tool for verifying LTS specifications
inferred← citeshttps://doi.org/10.1109/icse.2003.1201203openalex-snapshot
Data flow testing as model checking
inferred← citeshttps://doi.org/10.1109/lics.1994.316075openalex-snapshot
On the parallel complexity of model checking in the modal mu-calculus
inferred← citeshttps://doi.org/10.1109/lics.1994.316076openalex-snapshot
A compositional proof system for the modal μ-calculus
inferred← citeshttps://doi.org/10.1109/lics.1995.523273openalex-snapshot
Efficient on-the-fly model checking for CTL
inferred← citeshttps://doi.org/10.1109/lics.1996.561358openalex-snapshot
Efficient model checking via the equational μ-calculus
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492576openalex-snapshot
Computing simulations on finite and infinite graphs
inferred← citeshttps://doi.org/10.1109/tse.2011.62openalex-snapshot
Adaptation of Service Protocols Using Process Algebra and On-the-Fly Reduction Techniques
inferred← citeshttps://doi.org/10.1109/words.1997.609957openalex-snapshot
Incremental verification of architecture specification language for real-time systems
inferred← citeshttps://doi.org/10.1137/1.9781611974782.144openalex-snapshot
The Complexity of Simulation and Matrix Multiplication
inferred← citeshttps://doi.org/10.1142/s0218843016500088openalex-snapshot
Decidability and Complexity of Web Service Business Protocol Synthesis
inferred← citeshttps://doi.org/10.1145/1055686.1055689openalex-snapshot
From linear time to branching time
inferred← citeshttps://doi.org/10.1145/1516507.1516509openalex-snapshot
Program transformations using temporal logic side conditions
inferred← citeshttps://doi.org/10.1145/212433.212474openalex-snapshot
On the complexity of bounded-variable queries (extended abstract)
inferred← citeshttps://doi.org/10.1145/242223.242252openalex-snapshot
Strategic directions in concurrency research
inferred← citeshttps://doi.org/10.1145/2448496.2448513openalex-snapshot
Querying graph databases with XPath
inferred← citeshttps://doi.org/10.1145/2494529openalex-snapshot
The complexity of regular expressions and property paths in SPARQL
inferred← citeshttps://doi.org/10.1145/2680540openalex-snapshot
Maximal Synthesis for Hennessy-Milner Logic
inferred← citeshttps://doi.org/10.1145/2837614.2837673openalex-snapshot
Lattice-theoretic progress measures and coalgebraic model checking
inferred← citeshttps://doi.org/10.1145/2914770.2837673openalex-snapshot
Lattice-theoretic progress measures and coalgebraic model checking
inferred← citeshttps://doi.org/10.1145/3122831.3122833openalex-snapshot
From relation algebra to semi-join algebra
inferred← citeshttps://doi.org/10.1145/333979.333987openalex-snapshot
An automata-theoretic approach to branching-time model checking
inferred← citeshttps://doi.org/10.1145/340855.340876openalex-snapshot
Specification formalisms for component-based concurrent systems
inferred← citeshttps://doi.org/10.1145/3622786openalex-snapshot
Extensible Proof Systems for Infinite-State Systems
inferred← citeshttps://doi.org/10.1145/585265.585270openalex-snapshot
Alternating-time temporal logic
inferred← citeshttps://doi.org/10.21236/ada417480openalex-snapshot
Dependence Graphs for Information Assurance of Systems
inferred← citeshttps://doi.org/10.2168/lmcs-9(4:1)2013openalex-snapshot
Partial Model Checking using Networks of Labelled Transition Systems and Boole an Equation Systems
inferred← citeshttps://doi.org/10.4204/eptcs.364.8openalex-snapshot
Jumping Evaluation of Nested Regular Path Queries
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2016.25openalex-snapshot
Probabilistic Mu-Calculus: Decidability and Complete Axiomatization
inferred← citeshttps://doi.org/10.4304/jcp.9.4.802-811openalex-snapshot
Collective Self-adaptive Software Architecture Specification: Understanding Uncertainty in Cyber-Physical Convergence
inferred← citeshttps://doi.org/10.48550/arxiv.1411.2351openalex-snapshot
SCULPT: A Schema Language for Tabular Data on the Web
inferred← citeshttps://doi.org/10.48550/arxiv.1511.00346openalex-snapshot
Lattice-Theoretic Progress Measures and Coalgebraic Model Checking (with Appendices)
inferred← citeshttps://doi.org/10.48550/arxiv.1701.02221openalex-snapshot
JSON: data model, query languages and schema specification
inferred← citeshttps://doi.org/10.5282/edoc.11677openalex-snapshot
Verification of Non-Regular Program Properties
inferred← citeshttps://doi.org/10.5370/jeet.2006.1.4.513openalex-snapshot
Development of Communication Protocol Verification Tool for Vital Railway Signaling Systems
inferred← citeshttps://doi.org/10.5555/1715759.1715780openalex-snapshot
Static data-flow analysis of synchronous programs
inferred← citeshttps://doi.org/10.5555/776816.776844openalex-snapshot
Data flow testing as model checking
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/f3064779zc9e6z4a34zb41czfb795c178132openalex-snapshot
BSP algorithms for LTL & CTL model checking of security protocols
inferred← citeshttps://doi.org/10.7146/brics.v1i34.21609openalex-snapshot
A Compositional Proof System for the Modal mu-Calculus
inferred← citeshttps://doi.org/10.7146/brics.v6i32.20101openalex-snapshot
Is your Model Checker on Time? On the Complexity of Model Checking for Timed Modal Logics
inferred← citeshttps://doi.org/10.7146/dpb.v22i445.6762openalex-snapshot
Verification of Temporal Properties of Concurrent Systems
showing the first 200 of 202 · page through all 202
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.