On the public citation graph
Tableau-based model checking in the propositional mu-calculus
0 signed · 195 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-10003-2_69openalex-snapshot
Characterizing correctness properties of parallel programs using fixpoints
inferredcites →https://doi.org/10.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-15198-2_16openalex-snapshot
A complete modal proof system for a subset of SCCS
inferredcites →https://doi.org/10.1007/bfb0015727openalex-snapshot
Linear and branching structures in the semantics and logics of reactive systems
inferredcites →https://doi.org/10.1007/bfb0026106openalex-snapshot
Proof systems for Hennessy-Milner Logic with recursion
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(87)90012-0openalex-snapshot
Modal logics for communicating systems
inferredcites →https://doi.org/10.1016/0304-3975(89)90128-xopenalex-snapshot
Submodule construction as equation solving in CCS
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.1016/0304-3975(91)90043-2openalex-snapshot
A note on model checking the modal ν-calculus
inferredcites →https://doi.org/10.1109/tc.1986.1676711openalex-snapshot
Automatic Verification of Sequential Circuits Using Temporal Logic
inferredcites →https://doi.org/10.1145/2455.2460openalex-snapshot
Algebraic laws for nondeterminism and concurrency
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/567067.567081openalex-snapshot
"Sometimes" and "not never" revisited
inferredcites →https://doi.org/10.1145/567446.567463openalex-snapshot
"Sometime" is sometimes "not never"
inferredcites →https://doi.org/10.1184/r1/6603317openalex-snapshot
An improved algorithm for the automatic verification of finite state systems using temporal logic
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/(sici)1097-024x(199910)29:12<1123::aid-spe275>3.0.co;2-6openalex-snapshot
LORETO: a tool for reducing state explosion in verification of LOTOS programs
inferred← citeshttps://doi.org/10.1002/stvr.252openalex-snapshot
Syntactic reductions for efficient deadlock analysis
inferred← citeshttps://doi.org/10.1006/inco.1994.1035openalex-snapshot
A Partial Approach to Model Checking
inferred← citeshttps://doi.org/10.1006/inco.1997.2680openalex-snapshot
Proving Properties of Dynamic Process Networks
inferred← citeshttps://doi.org/10.1006/jcss.1999.1660openalex-snapshot
Selective Mu-Calculus and Formula-Based Equivalence of Transition Systems
inferred← citeshttps://doi.org/10.1007/11533092_11openalex-snapshot
A Computational Model for Conversation Policies for Agent Communication
inferred← citeshttps://doi.org/10.1007/11562436_10openalex-snapshot
Proving ∀μ-Calculus Properties with SAT-Based Model Checking
inferred← citeshttps://doi.org/10.1007/11603023_4openalex-snapshot
Automatic Verification of a Model Checker by Reflection
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/3-540-44585-4_24openalex-snapshot
Truth/SLC — A Parallel Verification Platform for Concurrent Systems
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_32openalex-snapshot
Distributed Symbolic Model Checking for μ-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-45687-2_53openalex-snapshot
An Approximation Semantics for the Propositional Mu-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-48092-7_8openalex-snapshot
Multiple State and Single State Tableaux for Combining Local and Global Nodel Checking
inferred← citeshttps://doi.org/10.1007/3-540-48119-2_13openalex-snapshot
Error Detection with Directed Symbolic Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-49019-1_20openalex-snapshot
Probabilistic Temporal Logics via the Modal Mu-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-52148-8_14openalex-snapshot
CCS, liveness, and local model checking in the linear time mu-calculus
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_129openalex-snapshot
Computing behavioural relations, logically
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_93openalex-snapshot
Model checking and modular verification
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_4openalex-snapshot
Compositional checking of satisfaction
inferred← citeshttps://doi.org/10.1007/3-540-55251-0_14openalex-snapshot
Empty stack Pushdown ω-tree automata
inferred← citeshttps://doi.org/10.1007/3-540-55251-0_18openalex-snapshot
A linear algorithm for solving fixed-point equations on transition systems
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_2openalex-snapshot
Modular abstractions for verifying real-time distributed systems
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_7openalex-snapshot
The propositional μ-calculus and its use in model checking
inferred← citeshttps://doi.org/10.1007/3-540-56922-7_32openalex-snapshot
On model-checking for fragments of μ-calculus
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-57208-2_18openalex-snapshot
Model construction for implicit specifications in modal logic
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_31openalex-snapshot
A linear local model checking algorithm for CTL
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-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-58555-9_88openalex-snapshot
Specification and analysis of a security management system
inferred← citeshttps://doi.org/10.1007/3-540-60045-0_42openalex-snapshot
An integration of model checking with automated proof checking
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-60630-0_4openalex-snapshot
Modal μ-calculus, model checking and Gauß elimination
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-61474-5_61openalex-snapshot
HORNSAT, model checking, verification and games
inferred← citeshttps://doi.org/10.1007/3-540-69778-0_11openalex-snapshot
Implementation of Propositional Temporal Logics Using BDDs
inferred← citeshttps://doi.org/10.1007/978-0-387-35533-7_7openalex-snapshot
Compositionality for Improving Model Checking
inferred← citeshttps://doi.org/10.1007/978-1-4419-6984-2_3openalex-snapshot
Model Checking Agent Communication
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-319-10521-5_6openalex-snapshot
Verification of Function Blocks
inferred← citeshttps://doi.org/10.1007/978-3-319-32582-8_8openalex-snapshot
Certification for $$\mu $$ μ -Calculus with Winning Strategies
inferred← citeshttps://doi.org/10.1007/978-3-319-59041-7_6openalex-snapshot
Compliance Verification Algorithm for Computer Systems Security Policies
inferred← citeshttps://doi.org/10.1007/978-3-540-27813-9_7openalex-snapshot
Symbolic Model Checking of Non-regular Properties
inferred← citeshttps://doi.org/10.1007/978-3-540-30579-8_16openalex-snapshot
Don’t Know in the μ-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-32261-0_4openalex-snapshot
A Modal Semantics for an Argumentation-Based Pragmatics for Agent Communication
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-79707-4_11openalex-snapshot
An Action/State-Based Model-Checking Approach for the Analysis of Communication Protocols for Service-Oriented Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-02053-7_15openalex-snapshot
A Process Algebra Approach to Fuzzy Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-642-02716-1_8openalex-snapshot
On the Proof Theory of Regular Fixed Points
inferred← citeshttps://doi.org/10.1007/978-3-642-13089-2_5openalex-snapshot
Complexity of the Satisfiability Problem for a Class of Propositional Schemata
inferred← citeshttps://doi.org/10.1007/978-3-642-18090-3_16openalex-snapshot
Logiken auf unendlichen Bäumen
inferred← citeshttps://doi.org/10.1007/978-3-642-33353-8_27openalex-snapshot
Minimal Proof Search for Modal Logic K Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-7091-6355-9_11openalex-snapshot
Truth — A verification platform for concurrent systems
inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_11openalex-snapshot
A Bibliography on Analytic Tableaux Theorem Proving
inferred← citeshttps://doi.org/10.1007/bf00709155openalex-snapshot
Compositional checking of satisfaction
inferred← citeshttps://doi.org/10.1007/bf01383878openalex-snapshot
A linear-time model-checking algorithm for the alternation-free modal mu-calculus
inferred← citeshttps://doi.org/10.1007/bf01383942openalex-snapshot
Modular abstractions for verifying real-time distributed systems
inferred← citeshttps://doi.org/10.1007/bf02960756openalex-snapshot
A graphical μ-calculus and local model checking
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/bfb0014324openalex-snapshot
A study on the specification and verification of performance properties
inferred← citeshttps://doi.org/10.1007/bfb0023896openalex-snapshot
On the expressive power of modal logics on trees
inferred← citeshttps://doi.org/10.1007/bfb0039055openalex-snapshot
Verifying temporal properties of processes
inferred← citeshttps://doi.org/10.1007/bfb0054161openalex-snapshot
Fully local and efficient evaluation of alternating fixed points
inferred← citeshttps://doi.org/10.1007/bfb0054171openalex-snapshot
A verified model checker for the modal Μ-calculus in Coq
inferred← citeshttps://doi.org/10.1007/bfb0055040openalex-snapshot
Simple linear-time algorithms for minimal fixed points
inferred← citeshttps://doi.org/10.1007/bfb0084787openalex-snapshot
Model checking for context-free processes
inferred← citeshttps://doi.org/10.1007/s00165-009-0129-4openalex-snapshot
A game-theoretic framework for specification and verification of cryptographic protocols
inferred← citeshttps://doi.org/10.1007/s00236-002-0084-5openalex-snapshot
Automatic verification of concurrent systems using a formula-based compositional approach
inferred← citeshttps://doi.org/10.1007/s10009-024-00746-1openalex-snapshot
Rance Cleaveland: a life for formal methods
inferred← citeshttps://doi.org/10.1007/s10515-010-0075-7openalex-snapshot
Compositional model checking of software product lines using variation point obligations
inferred← citeshttps://doi.org/10.1007/s10703-005-1493-1openalex-snapshot
Distributed Symbolic Model Checking for μ-Calculus
inferred← citeshttps://doi.org/10.1007/s10703-005-1634-6openalex-snapshot
Reduced Models for Efficient CCS Verification
inferred← citeshttps://doi.org/10.1007/s10703-006-0019-9openalex-snapshot
Bounded model checking of infinite state systems
inferred← citeshttps://doi.org/10.1007/s10849-009-9088-7openalex-snapshot
Model Checking for Hybrid Logic
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90110-4openalex-snapshot
Local model checking in the modal mu-calculus
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90155-mopenalex-snapshot
The expressive power of implicit specifications
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90266-6openalex-snapshot
Model checking and boolean graphs
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90269-0openalex-snapshot
CTL∗ and ECTL∗ as fragments of the modal μ-calculus
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90017-aopenalex-snapshot
Symbolic model checking: 1020 States and beyond
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.2008.05.011openalex-snapshot
Development of verification and conformance testing tools for a railway signaling communication protocol
inferred← citeshttps://doi.org/10.1016/j.diin.2007.06.013openalex-snapshot
Analyzing multiple logs for forensic evidence
inferred← citeshttps://doi.org/10.1016/j.diin.2019.02.005openalex-snapshot
A survey on forensic investigation of operating system logs
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.06.025openalex-snapshot
μ-Calculus Model Checking in Maude
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.02.035openalex-snapshot
Local Module Checking for CTL Specifications
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.02.036openalex-snapshot
An On-the-fly Tableau-based Decision Procedure for PDL-satisfiability
inferred← citeshttps://doi.org/10.1016/j.ic.2006.05.001openalex-snapshot
The alternation hierarchy in fixpoint logic with chop is strict too
inferred← citeshttps://doi.org/10.1016/j.ic.2006.10.009openalex-snapshot
When not losing is better than winning: Abstraction and refinement for the full μ-calculus
inferred← citeshttps://doi.org/10.1016/j.jcss.2004.11.001openalex-snapshot
A local approach for temporal model checking of Java bytecode
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.05.004openalex-snapshot
Solving parity games by a reduction to SAT
inferred← citeshttps://doi.org/10.1016/j.knosys.2007.05.002openalex-snapshot
Forensic analysis of logs: Modeling and verification
inferred← citeshttps://doi.org/10.1016/j.knosys.2008.11.006openalex-snapshot
Model checking communicative agent-based systems
inferred← citeshttps://doi.org/10.1016/j.scico.2004.07.002openalex-snapshot
Compositionality and locality for improving model checking in the selective mu-calculus
inferred← citeshttps://doi.org/10.1016/j.scico.2012.07.015openalex-snapshot
Incremental construction of systems: An efficient characterization of the lacking sub-system
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/s0004-3702(98)00104-0openalex-snapshot
Reasoning about nondeterministic and concurrent actions: A process algebra approach
inferred← citeshttps://doi.org/10.1016/s0167-6423(96)00033-0openalex-snapshot
Safety-level communication in railway interlockings
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00034-7openalex-snapshot
On model checking for the μ-calculus and its fragments
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00364-xopenalex-snapshot
A new logic for electronic commerce protocols
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/s0304-3975(97)00245-4openalex-snapshot
A compositional μ-calculus proof system for statecharts processes
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80667-4openalex-snapshot
Combining Local and Global Model Checking
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80893-4openalex-snapshot
Puzzles for Learning Model Checking, Model Checking for Programming Puzzles, Puzzles for Testing Model Checkers
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80123-9openalex-snapshot
Rewriting Logic as a Framework for Generic Verification Tools
inferred← citeshttps://doi.org/10.1017/cbo9780511792588.004openalex-snapshot
The algorithmics of bisimilarity
inferred← citeshttps://doi.org/10.1051/ita:2007011openalex-snapshot
Three notes on the complexity of model checking fixpoint logic with chop
inferred← citeshttps://doi.org/10.1109/acsd.2009.25openalex-snapshot
Specification Enforcing Refinement for Convertibility Verification
inferred← citeshttps://doi.org/10.1109/apsec.2001.991453openalex-snapshot
Model checking value-passing processes
inferred← citeshttps://doi.org/10.1109/ecbs.2003.1194802openalex-snapshot
Model checking and evidence exploration
inferred← citeshttps://doi.org/10.1109/hicss.1993.284112openalex-snapshot
Model checking of control-finite CSP programs
inferred← citeshttps://doi.org/10.1109/icci.1992.227708openalex-snapshot
Linear local and global model checking algorithms for a kernal temporal logic language
inferred← citeshttps://doi.org/10.1109/icems12746.2007.4412091openalex-snapshot
Analysis of safety properties for vital system communication protocol
inferred← citeshttps://doi.org/10.1109/icicsp59554.2023.10390744openalex-snapshot
Global Model-Checking for Propositional $\mu$-Calculus
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/indin.2011.6034948openalex-snapshot
Observer based verification of IEC 61499 function blocks
inferred← citeshttps://doi.org/10.1109/isceic59030.2023.10271211openalex-snapshot
Improved Model Checking Algorithm for Mobile Ambients
inferred← citeshttps://doi.org/10.1109/itng.2008.93openalex-snapshot
An Improved Algorithm for the Evaluation of Alternating Fixpoint Expressions in the mu-Calculus
inferred← citeshttps://doi.org/10.1109/lics.1990.113767openalex-snapshot
Symbolic model checking: 10/sup 20/ states and beyond
inferred← citeshttps://doi.org/10.1109/lics.1990.113768openalex-snapshot
When is 'partial' adequate? A logic-based proof technique using partial specifications
inferred← citeshttps://doi.org/10.1109/lics.1991.151664openalex-snapshot
A partial approach to model checking
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.1996.561358openalex-snapshot
Efficient model checking via the equational μ-calculus
inferred← citeshttps://doi.org/10.1109/memcod.2005.1487912openalex-snapshot
Three-valued logic in bounded model checking
inferred← citeshttps://doi.org/10.1109/noms.1994.644142openalex-snapshot
Specification And Analysis Of A Security Management System
inferred← citeshttps://doi.org/10.1109/sefm.2004.23openalex-snapshot
Global vs. local model checking: a comparison of verification techniques for infinite state systems
inferred← citeshttps://doi.org/10.1109/sefm.2007.46openalex-snapshot
Verifying Security Properties of Cryptoprotocols: A Novel Approach
inferred← citeshttps://doi.org/10.1109/sose.2011.6139097openalex-snapshot
Unified management of control flow and data mismatches in web service composition
inferred← citeshttps://doi.org/10.1134/s036176881604006xopenalex-snapshot
Program schemata technique for propositional program logics: A 30-year history
inferred← citeshttps://doi.org/10.1145/1101908.1101915openalex-snapshot
Efficient temporal-logic query checking for presburger systems
inferred← citeshttps://doi.org/10.1145/177492.177725openalex-snapshot
Model checking and modular verification
inferred← citeshttps://doi.org/10.1145/212433.212474openalex-snapshot
On the complexity of bounded-variable queries (extended abstract)
inferred← citeshttps://doi.org/10.1145/226295.226321openalex-snapshot
Compositional verification by model checking for counter-examples
inferred← citeshttps://doi.org/10.1145/229000.226321openalex-snapshot
Compositional verification by model checking for counter-examples
inferred← citeshttps://doi.org/10.1145/268946.268950openalex-snapshot
Data flow analysis is model checking of abstract interpretations
inferred← citeshttps://doi.org/10.1145/3290339openalex-snapshot
Fixpoint games on continuous lattices
inferred← citeshttps://doi.org/10.1145/3412853openalex-snapshot
Model Checking a Logic for True Concurrency
inferred← citeshttps://doi.org/10.1145/3622786openalex-snapshot
Extensible Proof Systems for Infinite-State Systems
inferred← citeshttps://doi.org/10.1145/963927.963930openalex-snapshot
A modal logic for mobile agents
inferred← citeshttps://doi.org/10.1613/jair.334openalex-snapshot
A Uniform Framework for Concept Definitions in Description Logics
inferred← citeshttps://doi.org/10.1613/jair.3351openalex-snapshot
Decidability and Undecidability Results for Propositional Schemata
inferred← citeshttps://doi.org/10.2495/cr040631openalex-snapshot
FORMAL VERIFICATION OF PROTOCOL SPECIFIED IN LTS FOR RAILWAY SIGNALING SYSTEMS
inferred← citeshttps://doi.org/10.2495/ut050201openalex-snapshot
Formally verifying the correctness of a network-based protocol for railway signalling systems
inferred← citeshttps://doi.org/10.29007/df56openalex-snapshot
Tableau-Like Automata-Based Axiomatization for Propositional Linear Temporal Logic
inferred← citeshttps://doi.org/10.31274/etd-180810-2879openalex-snapshot
Development and evaluation of Formula Editor (a tool-based approach to enhance reusability in software product line model checking) on SAFER case study
inferred← citeshttps://doi.org/10.31274/etd-180810-3011openalex-snapshot
Safety analysis of software product lines using state-based modeling and compositional model checking
inferred← citeshttps://doi.org/10.3166/tsi.22.461-495openalex-snapshot
Logiques temporelles basées sur actions pour la vérification des systèmes asynchrones
inferred← citeshttps://doi.org/10.3233/fi-2020-1922openalex-snapshot
Causal Reasoning for Safety in Hennessy Milner Logic
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.263-266.2314openalex-snapshot
Improved Algorithm of Global Model-Checking for Propositional μ-Calculus
inferred← citeshttps://doi.org/10.48456/tr-601openalex-snapshot
Combining model checking and theorem proving
inferred← citeshttps://doi.org/10.48550/arxiv.0711.1016openalex-snapshot
An On-the-fly Tableau-based Decision Procedure for PDL-Satisfiability
inferred← citeshttps://doi.org/10.48550/arxiv.1001.4251openalex-snapshot
A Decidable Class of Nested Iterated Schemata (extended version)
inferred← citeshttps://doi.org/10.48550/arxiv.1207.1832openalex-snapshot
Minimal Proof Search for Modal Logic K Model Checking
inferred← citeshttps://doi.org/10.48550/arxiv.1401.1693openalex-snapshot
Certification for mu-calculus with winning strategies
inferred← citeshttps://doi.org/10.48550/arxiv.1810.11404openalex-snapshot
Fixpoint Games on Continuous Lattices
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.v5i40.19485openalex-snapshot
A Compositional Proof System for the Modal mu-Calculus
inferred← citeshttps://doi.org/10.7146/dpb.v22i445.6762openalex-snapshot
Verification of Temporal Properties 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.