Pages that link to "Item:Q1090675"
From MaRDI portal
The following pages link to Automata-theoretic techniques for modal logics of programs (Q1090675):
Displaying 50 items.
- Ordered multi-stack visibly pushdown automata (Q344793) (← links)
- Generalized satisfiability for the description logic \(\mathcal{ALC}\) (Q393137) (← links)
- Complexity of synthesis of composite service with correctness guarantee (Q439758) (← links)
- \textit{Once} and \textit{for all} (Q439961) (← links)
- A finite state intersection approach to propositional satisfiability (Q442157) (← links)
- Interval logics and their decision procedures. I: An interval logic (Q671639) (← links)
- On the equivalence of recursive and nonrecursive Datalog programs (Q676421) (← links)
- Automata-based axiom pinpointing (Q707741) (← links)
- Combining interval-based temporal reasoning with general TBoxes (Q814545) (← links)
- Verifying a signature architecture: a comparative case study (Q877156) (← links)
- Verification of well-formed communicating recursive state machines (Q944388) (← links)
- Automata can show PSpace results for description logics (Q948069) (← links)
- Verification of scope-dependent hierarchical state machines (Q948087) (← links)
- Pushdown module checking (Q968362) (← links)
- Reasoning about XML with temporal logics and automata (Q975873) (← links)
- Automatic inference of determinacy and mutual exclusion for logic programs using mode and type analyses (Q980470) (← links)
- The complementation problem for Büchi automata with applications to temporal logic (Q1088653) (← links)
- On automata on infinite trees (Q1186604) (← links)
- A model checker for linear time temporal logic (Q1192606) (← links)
- An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages (Q1276242) (← links)
- Fast and simple nested fixpoints (Q1350911) (← links)
- Somewhat finite approaches to infinite sentences. (Q1353892) (← links)
- Fixed point characterization of infinite behavior of finite-state systems (Q1389678) (← links)
- A polynomial space construction of tree-like models for logics with local chains of modal connectives (Q1399966) (← links)
- Inference of \(\omega\)-languages from prefixes. (Q1426153) (← links)
- EXPtime tableaux for ALC (Q1589576) (← links)
- Parameterized model checking of rendezvous systems (Q1635829) (← links)
- Reasoning in fuzzy description logics using automata (Q1677933) (← links)
- An approach to infinitary temporal proof theory (Q1762733) (← links)
- Combining deduction and model checking into tableaux and algorithms for converse-PDL. (Q1854371) (← links)
- Module checking (Q1854407) (← links)
- Employing symmetry reductions in model checking (Q1886448) (← links)
- Model checking LTL with regular valuations for pushdown systems (Q1887158) (← links)
- Back to the future: a fresh look at linear temporal logic (Q2117656) (← links)
- Propositional dynamic logic with quantification over regular computation sequences (Q2151417) (← links)
- On the relation between reactive synthesis and supervisory control of non-terminating processes (Q2177781) (← links)
- Program schemata technique for propositional program logics: a 30-year history (Q2216719) (← links)
- Finite-word hyperlanguages (Q2232276) (← links)
- Answering regular path queries in expressive description logics via alternating tree-automata (Q2252521) (← links)
- Modal Kleene algebra applied to program correctness (Q2281640) (← links)
- Specifying program properties using modal fixpoint logics: a survey of results (Q2284176) (← links)
- Model checking dynamic pushdown networks (Q2355386) (← links)
- The computational complexity of scenario-based agent verification and design (Q2372186) (← links)
- ACTL for modal interface automata (Q2404073) (← links)
- Distributed breadth-first search LTL model checking (Q2431772) (← links)
- The complexity of computing the behaviour of lattice automata on infinite trees (Q2447756) (← links)
- Program equivalence checking by two-tape automata (Q2452753) (← links)
- Model checking propositional dynamic logic with all extras (Q2494725) (← links)
- Tree regular model checking: a simulation-based approach (Q2500700) (← links)
- Relating word and tree automata (Q2576943) (← links)
