Module checking
From MaRDI portal
Recommendations
Cites work
- A linear-time model-checking algorithm for the alternation-free modal mu- calculus
- A near-optimal method for reasoning about action
- An automata-theoretic approach to branching-time model checking
- An axiomatic basis for computer programming
- Automata-theoretic techniques for modal logics of programs
- Automatic verification methods for finite state systems. International workshop, Grenoble, France, June 12-14, 1989. Proceedings
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Buy one, get one free!!!
- Characterizing finite Kripke structures in propositional temporal logic
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Deciding full branching time logic
- scientific article; zbMATH DE number 3870578 (Why is no real title available?)
- scientific article; zbMATH DE number 3930354 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 4080970 (Why is no real title available?)
- scientific article; zbMATH DE number 3757688 (Why is no real title available?)
- scientific article; zbMATH DE number 52331 (Why is no real title available?)
- scientific article; zbMATH DE number 3555903 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 4124989 (Why is no real title available?)
- scientific article; zbMATH DE number 1142326 (Why is no real title available?)
- scientific article; zbMATH DE number 3302923 (Why is no real title available?)
- Interpolants and Symbolic Model Checking
- Propositional dynamic logic of regular programs
- Reasoning about infinite computations
- Results on the propositional \(\mu\)-calculus
- The complexity of propositional linear temporal logics
- “Sometimes” and “not never” revisited
Cited in
(39)- Graded modalities in strategy logic
- Reasoning about graded strategy quantifiers
- Model checking properties on reduced trace systems
- Cycle detection in computation tree logic
- Improving parity games in practice
- Hierarchical cost-parity games
- Uniform strategies, rational relations and jumping automata
- Modular strategies for recursive game graphs
- Schedulability of asynchronous real-time concurrent objects
- Solving parity games using an automata-based algorithm
- Reasoning about strategies: on the model-checking problem
- Reasoning About Substructures and Games
- Querying regular graph patterns
- Enriched μ–Calculus Pushdown Module Checking
- Open Implication
- Practical Efficient Modular Linear-Time Model-Checking
- ATL with Strategy Contexts and Bounded Memory
- State Space Representation for Verification of Open Systems
- Symbolic Execution Based Model Checking of Open Systems with Unbounded Variables
- Automata-theoretic decision of timed games
- Connectivity games over dynamic networks
- scientific article; zbMATH DE number 140003 (Why is no real title available?)
- scientific article; zbMATH DE number 1361134 (Why is no real title available?)
- scientific article; zbMATH DE number 2086508 (Why is no real title available?)
- Refinement modal logic
- scientific article; zbMATH DE number 1834574 (Why is no real title available?)
- scientific article; zbMATH DE number 7439738 (Why is no real title available?)
- Compositional schedulability analysis of real-time actor-based systems
- Game models for open systems
- Formal Methods for Components and Objects
- Pushdown Module Checking
- Program Complexity in Hierarchical Module Checking
- Robust alternating-time temporal logic
- Exploring the boundary of half-positionality
- Alternating-time temporal logic with default actions
- A formal approach to attack graphs
- Quantitatively fair scheduling
- Pushdown module checking
- Strategy logic
This page was built for publication: Module checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854407)
