The following pages link to MONA (Q18304):
Displaying 50 items.
- Logic programming approach to automata-based decision procedures (Q347398) (← links)
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- Automated verification of shape, size and bag properties via user-defined predicates in separation logic (Q436400) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Symbolic tree automata (Q483051) (← links)
- Complexity of fixed-size bit-vector logics (Q504997) (← links)
- Synthesis from component libraries with costs (Q683714) (← links)
- Ehrenfeucht-Fraïssé goes automatic for real addition (Q710741) (← links)
- Juggrnaut: using graph grammars for abstracting unbounded heap structures (Q746781) (← links)
- Relativizations for the logic-automata connection (Q815004) (← links)
- Action language verifier: An infinite-state model checker for reactive software specifications (Q845244) (← links)
- Deciding Boolean algebra with Presburger arithmetic (Q861705) (← links)
- Axiomatisation and decidability of multi-dimensional Duration Calculus (Q868026) (← links)
- Global constraint catalogue: past, present and future (Q879974) (← links)
- Graph operations characterizing rank-width (Q1028455) (← links)
- Don't care words with an application to the automata-based approach for real addition (Q1028730) (← links)
- Decision procedures for inductive Boolean functions based on alternating automata (Q1399969) (← links)
- An automata-theoretic approach to the verification of distributed algorithms (Q1706162) (← links)
- Generalizing input-driven languages: theoretical and practical benefits (Q1706605) (← links)
- Nested antichains for WS1S (Q1733101) (← links)
- Theorem proving in technology transfer: The user's point of view (Q1856140) (← links)
- wMSO theories as grammar formalisms (Q1870569) (← links)
- On iterating linear transformations over recognizable sets of integers (Q1884908) (← links)
- Model checking and abstraction to the aid of parameterized systems (a survey) (Q1886449) (← links)
- Filter-embedding semiring fusion for programming with MapReduce (Q1941877) (← links)
- Automata for the verification of monadic second-order graph properties (Q1948277) (← links)
- Automata on finite trees (Q2074209) (← links)
- Computing parameterized invariants of parameterized Petri nets (Q2117165) (← links)
- A symbolic decision procedure for symbolic alternating finite automata (Q2130584) (← links)
- Linear temporal logic -- from infinite to finite horizon (Q2147173) (← links)
- Backward type inference for XML queries (Q2182320) (← links)
- First-order temporal logic monitoring with BDDs (Q2225472) (← links)
- Verification and enforcement of access control policies (Q2248087) (← links)
- Automata-based symbolic string analysis for vulnerability detection (Q2248096) (← links)
- Querying linguistic trees (Q2268350) (← links)
- Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) (← links)
- Array theory of bounded elements and its applications (Q2351149) (← links)
- A second-order formulation of non-termination (Q2353638) (← links)
- Program verification with interacting analysis plugins (Q2642983) (← links)
- Generalised multi-pattern-based verification of programs with linear linked structures (Q2642987) (← links)
- A logic of reachable patterns in linked data-structures (Q2643337) (← links)
- Specification and optimal reactive synthesis of run-time enforcement shields (Q2672248) (← links)
- Verification of component-based systems with recursive architectures (Q2699967) (← links)
- (Q2708973) (← links)
- (Q2729054) (← links)
- (Q2751373) (← links)
- (Q2754076) (← links)
- (Q2754086) (← links)
- (Q2763538) (← links)
- (Q2763541) (← links)
