Pages that link to "Item:Q1090675"

The following pages link to Automata-theoretic techniques for modal logics of programs (Q1090675):

Displaying 50 items.

• A propositional logic of Boolean recursive programs in which predicate variables appear in conditions (Q2639846) (← links)
• Propositional dynamic logic with recursive programs (Q2643333) (← links)
• Logics and automata for verification: Expressiveness and decidability issues (Q2763541) (← links)
• Correctness and Worst-Case Optimality of Pratt-Style Decision Procedures for Modal and Hybrid Logics (Q3010369) (← links)
• Generalized Satisfiability for the Description Logic $\mathcal{ALC}$ (Q3010434) (← links)
• Advanced Ramsey-Based Büchi Automata Inclusion Testing (Q3090830) (← links)
• Automated Termination in Model Checking Modulo Theories (Q3172869) (← links)
• Automata Theory and Model Checking (Q3176362) (← links)
• One-Pass Tableaux for Computation Tree Logic (Q3498455) (← links)
• Automata-Based Axiom Pinpointing (Q3541704) (← links)
• The Quest for a Tight Translation of Büchi to co-Büchi Automata (Q3586001) (← links)
• Logics for Two Fragments beyond the Syllogistic Boundary (Q3586020) (← links)
• An Automata-Theoretic Approach to Infinite-State Systems (Q3587257) (← links)
• Survey on Directed Model Checking (Q3614878) (← links)
• PDL with intersection and converse: satisfiability and infinite-state model checking (Q3616354) (← links)
• Matching Trace Patterns with Regular Policies (Q3618572) (← links)
• Ontologies and Databases: The DL-Lite Approach (Q3639004) (← links)
• PDL for ordered trees (Q3647225) (← links)
• PDL with negation of atomic programs (Q3647227) (← links)
• On the Decision Problem for Two-Variable First-Order Logic (Q4338040) (← links)
• Decidability of a partial order based temporal logic (Q4630294) (← links)
• Deciding properties of integral relational automata (Q4632414) (← links)
• Tableaux and algorithms for Propositional Dynamic Logic with Converse (Q4647551) (← links)
• Reasoning and Query Answering in Description Logics (Q4647812) (← links)
• Automated Verification of Parallel Nested DFS (Q5039512) (← links)
• Automata on infinite trees with counting constraints (Q5044742) (← links)
• Type reconstruction with recursive types and atomic subtyping (Q5044773) (← links)
• Multi-Valued Reasoning about Reactive Systems (Q5060674) (← links)
• VLDL satisfiability and model checking via tree automata (Q5136340) (← links)
• A Refined Resolution Calculus for CTL (Q5191106) (← links)
• An Optimal On-the-Fly Tableau-Based Decision Procedure for PDL-Satisfiability (Q5191118) (← links)
• Variable and Clause Ordering in an FSA Approach to Propositional Satisfiability (Q5200054) (← links)
• Alternating automata: Unifying truth and validity checking for temporal logics (Q5234701) (← links)
• A resolution calculus for the branching-time temporal logic CTL (Q5410337) (← links)
• A continuous–discontinuous second‐order transition in the satisfiability of random Horn‐SAT formulas (Q5433256) (← links)
• (Q5447361) (← links)
• Optimal and Cut-Free Tableaux for Propositional Dynamic Logic with Converse (Q5747763) (← links)
• Modal I/O Automata for Interface and Product Line Theories (Q5756489) (← links)
• Good-for-Game QPTL: An Alternating Hodges Semantics (Q5875946) (← links)
• On Composing Finite Forests with Modal Logics (Q5886519) (← links)
• Power of Randomization in Automata on Infinite Strings (Q5895118) (← links)
• On monitoring linear temporal properties (Q6056640) (← links)
• Taming strategy logic: non-recurrent fragments (Q6077842) (← links)
• An algorithmic approach for checking closure properties of Ω-regular languages (Q6162107) (← links)
• Early detection of temporal constraint violations (Q6178450) (← links)
• Finite-word hyperlanguages (Q6186311) (← links)
• Dynamic logic as a uniform framework for theorem proving in intensional logic (Q6488557) (← links)
• Efficient loop conditions for bounded model checking hyperproperties (Q6535341) (← links)
• The complexity of LTL rational synthesis (Q6535558) (← links)
• First steps towards taming description logics with strings (Q6545544) (← links)