MONA

swMATH6170MaRDI QIDQ18304FDOQ18304

Author name not available (Why is that?)

Described by source

• MONA IMPLEMENTATION SECRETS
• Unnamed Publication

Cited In (only showing first 100 items - show all)

• Bounded treewidth as a key to tractability of knowledge representation and reasoning
• Projection for Büchi Tree Automata with Constraints between Siblings
• Practical algorithms for MSO model-checking on tree-decomposable graphs
• Title not available (Why is that?)
• Synthesis from component libraries with costs
• Decision procedures for inductive Boolean functions based on alternating automata
• Nested antichains for WS1S
• Formal Models of Communicating Systems
• YakYak: Parsing with logical side constraints
• Efficient Symbolic Representations for Arithmetic Constraints in Verification
• An Evaluation of Automata Algorithms for String Analysis
• Generalised multi-pattern-based verification of programs with linear linked structures
• Courcelle's theorem -- a game-theoretic approach
• Automata on finite trees
• Action language verifier: An infinite-state model checker for reactive software specifications
• Deciding Monadic Second Order Logic over $$\omega $$ ω -Words by Specialized Finite Automata
• Global constraint catalogue: past, present and future
• VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata
• Formalizing the Logic-Automaton Connection
• Title not available (Why is that?)
• Automated Deduction – CADE-20
• On iterating linear transformations over recognizable sets of integers
• Interval duration logic: expressiveness and decidability
• Automated verification of shape, size and bag properties via user-defined predicates in separation logic
• Title not available (Why is that?)
• Networks of Processes with Parameterized State Space
• Model checking and abstraction to the aid of parameterized systems (a survey)
• Title not available (Why is that?)
• Axiomatisation and decidability of multi-dimensional Duration Calculus
• Symbolic model checking with rich assertional languages
• Ehrenfeucht-Fraïssé goes automatic for real addition
• Don't care words with an application to the automata-based approach for real addition
• Analyzing real-time systems: Theory and tools
• Monitoring metric first-order temporal properties
• Transforming graph states using single-qubit operations
• A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings
• Title not available (Why is that?)
• Automata for the verification of monadic second-order graph properties
• A Practical Approach to Courcelle's Theorem
• Linear temporal logic -- from infinite to finite horizon
• Combining Logic Programs and Monadic Second Order Logics by Program Transformation
• Unifying models
• Graph operations characterizing rank-width
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Evaluation of an MSO-Solver
• Title not available (Why is that?)
• wMSO theories as grammar formalisms
• Bounded Quantifier Instantiation for Checking Inductive Invariants
• Verified decision procedures for MSO on words based on derivatives of regular expressions
• Deciding Boolean algebra with Presburger arithmetic
• Verification, Model Checking, and Abstract Interpretation
• Tiburon: A Weighted Tree Automata Toolkit
• Title not available (Why is that?)
• Title not available (Why is that?)
• Symbolic tree automata
• Juggrnaut: using graph grammars for abstracting unbounded heap structures
• Specification and optimal reactive synthesis of run-time enforcement shields
• Logic programming approach to automata-based decision procedures
• Title not available (Why is that?)
• Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
• Tools and Algorithms for the Construction and Analysis of Systems
• Mechanizing the Powerset Construction for Restricted Classes of ω-Automata
• Simulations of Weighted Tree Automata
• Complexity of fixed-size bit-vector logics
• Title not available (Why is that?)
• Title not available (Why is that?)
• An automata-theoretic approach to the verification of distributed algorithms
• Complexity hierarchies beyond elementary
• Title not available (Why is that?)
• Title not available (Why is that?)
• Encoding two-valued nonclassical logics in classical logic
• Generalizing input-driven languages: theoretical and practical benefits
• Verification, Model Checking, and Abstract Interpretation
• Relativizations for the logic-automata connection
• Regular Model Checking using Widening Techniques
• Verification, Model Checking, and Abstract Interpretation
• Implementation and Application of Automata
• Model Checking Parameterized Systems
• Combining Theories with Shared Set Operations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Theorem proving in technology transfer: The user's point of view
• Spatio-temporal Model Checking for Mobile Real-Time Systems
• Efficient Symbolic Implementation of Graph Automata with Applications to Invariant Checking
• Title not available (Why is that?)
• From Sequential Extended Regular Expressions to NFA with Symbolic Labels
• Array theory of bounded elements and its applications
• A symbolic decision procedure for symbolic alternating finite automata
• Lazy Automata Techniques for WS1S
• Minimization of Visibly Pushdown Automata Using Partial Max-SAT
• A Generic Program for Minimal Subsets with Applications
• A second-order formulation of non-termination
• Verification and enforcement of access control policies
• Automated formal analysis and verification: an overview
• Computing parameterized invariants of parameterized Petri nets
• Program verification with interacting analysis plugins
• Property Directed Reachability for Proving Absence of Concurrent Modification Errors
• Querying linguistic trees
• Verification of component-based systems with recursive architectures

This page was built for software: MONA