Pages that link to "Item:Q801893"

The following pages link to Results on the propositional \(\mu\)-calculus (Q801893):

Displaying 50 items.

• Off-the-shelf automated analysis of liveness properties for just paths (Q2182670) (← links)
• Generalized abstraction-refinement for game-based CTL lifted model checking (Q2193289) (← links)
• Cartesian difference categories (Q2200813) (← links)
• Exponential automatic amortized resource analysis (Q2200835) (← links)
• Natural projection as partial model checking (Q2208303) (← links)
• Hierarchical cost-parity games (Q2210523) (← links)
• Program schemata technique for propositional program logics: a 30-year history (Q2216719) (← links)
• Intuitionistic fixed point logic (Q2220485) (← links)
• Team bisimilarity, and its associated modal logic, for BPP nets (Q2231652) (← links)
• Temporal refinements for guarded recursive types (Q2233479) (← links)
• Generative program analysis and beyond: the power of domain-specific languages (invited paper) (Q2234057) (← links)
• Strategies, model checking and branching-time properties in Maude (Q2239275) (← links)
• On first-order logic and CPDA graphs (Q2254514) (← links)
• Compositional verification and 3-valued abstractions join forces (Q2266991) (← links)
• Logical characterization of branching metrics for nondeterministic probabilistic transition systems (Q2272986) (← links)
• A novel approach to verifying context free properties of programs (Q2290651) (← links)
• Model checking for hybrid branching-time logics (Q2291813) (← links)
• Determinizing monitors for HML with recursion (Q2291832) (← links)
• Two AGM-style characterizations of model repair (Q2294584) (← links)
• Performance heuristics for GR(1) synthesis and related algorithms (Q2303873) (← links)
• Logical vs. behavioural specifications (Q2304534) (← links)
• Forgetting in multi-agent modal logics (Q2321251) (← links)
• A propositional dynamic logic for instantial neighborhood semantics (Q2323639) (← links)
• Iterated Boolean games (Q2346405) (← links)
• Compositional verification of asynchronous concurrent systems using CADP (Q2350492) (← links)
• A goal-directed decision procedure for hybrid PDL (Q2351150) (← links)
• A decision procedure for (co)datatypes in SMT solvers (Q2360873) (← links)
• On the universal and existential fragments of the \(\mu\)-calculus (Q2368950) (← links)
• Compositional analysis for verification of parameterized systems (Q2368952) (← links)
• Compositionality of Hennessy-Milner logic by structural operational semantics (Q2368979) (← links)
• Algebraic-coalgebraic specification in CoCASL (Q2369034) (← links)
• The power of first-order quantification over states in branching and linear time temporal logics (Q2390310) (← links)
• On the complexity of determinizing monitors (Q2399244) (← links)
• Equivalence of probabilistic \(\mu\)-calculus and p-automata (Q2399249) (← links)
• Monitorability for the Hennessy-Milner logic with recursion (Q2402551) (← links)
• Measure properties of regular sets of trees (Q2407093) (← links)
• Verification of finite-state machines: a distributed approach (Q2413026) (← links)
• Model checking open systems with alternating projection temporal logic (Q2424878) (← links)
• A note on the approximation of mean-payoff games (Q2446598) (← links)
• Characterization, definability and separation via saturated models (Q2453534) (← links)
• Modular construction of complete coalgebraic logics (Q2464936) (← links)
• Bridging the gap between fair simulation and trace inclusion (Q2486398) (← links)
• Incompleteness of states w.r.t. traces in model checking (Q2492186) (← links)
• A modular approach to defining and characterising notions of simulation (Q2495641) (← links)
• On complexity of verification of interacting agents' behavior (Q2498917) (← links)
• On modal \(\mu\)-calculus with explicit interpolants (Q2506827) (← links)
• Deduction chains for common knowledge (Q2506830) (← links)
• The alternation hierarchy in fixpoint logic with chop is strict too (Q2509356) (← links)
• Probabilistic temporal logics via the modal mu-calculus (Q2566296) (← links)
• Parameterised Boolean equation systems (Q2571204) (← links)