MONA
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Graph operations characterizing rank-width
- Don't care words with an application to the automata-based approach for real addition
- AUTOMATE
- DDDLIB
- D-Finder
- FMona
- Forest FIRE
- Grail
- ZaligVinder
- Decision procedures for inductive Boolean functions based on alternating automata
- Autowrite
- Tiburon
- TREX
- PNML
- DiVinE
- CUDD
- SLMC
- UCLID
- An automata-theoretic approach to the verification of distributed algorithms
- Generalizing input-driven languages: theoretical and practical benefits
- Nested antichains for WS1S
- BuDDy
- Timbuk
- Theorem proving in technology transfer: The user's point of view
- wMSO theories as grammar formalisms
- On iterating linear transformations over recognizable sets of integers
- Model checking and abstraction to the aid of parameterized systems (a survey)
- Filter-embedding semiring fusion for programming with MapReduce
- Automata for the verification of monadic second-order graph properties
- YakYak
- Cadence SMV
- CESAR
- CPGraph
- Automata on finite trees
- Computing parameterized invariants of parameterized Petri nets
- Treewidthlib
- A symbolic decision procedure for symbolic alternating finite automata
- SPOT
- Linear temporal logic -- from infinite to finite horizon
- STeLP
- HIP
- Backward type inference for XML queries
- TVLA
- VATA
- LETHAL
- FSA
- Qex
- Amphion
- First-order temporal logic monitoring with BDDs
- UniForM
- FAdo
- GUItar
- NMRDPP
- Verification and enforcement of access control policies
- Automata-based symbolic string analysis for vulnerability detection
- Querying linguistic trees
- Bounded treewidth as a key to tractability of knowledge representation and reasoning
- LTL2BA
- Array theory of bounded elements and its applications
- A second-order formulation of non-termination
- Rex
- dk.brics.automaton
- MTBDD
- ABC
- Symbolic automata
- Juggrnaut
- Java-MOP
- MOP
- Program verification with interacting analysis plugins
- Generalised multi-pattern-based verification of programs with linear linked structures
- A logic of reachable patterns in linked data-structures
- Verification of component-based systems with recursive architectures
- YakYak: Parsing with logical side constraints
- scientific article; zbMATH DE number 1629942 (Why is no real title available?)
- Encoding two-valued nonclassical logics in classical logic
- scientific article; zbMATH DE number 1670771 (Why is no real title available?)
- scientific article; zbMATH DE number 1670780 (Why is no real title available?)
- Analyzing real-time systems: Theory and tools
- Logics and automata for verification: Expressiveness and decidability issues
- scientific article; zbMATH DE number 1705164 (Why is no real title available?)
- Monitoring metric first-order temporal properties
- Deciding monadic second order logic over -words by specialized finite automata
- VeriCon
- Complexity hierarchies beyond elementary
- Interval duration logic: expressiveness and decidability
- Finding extremal models of discrete duration calculus formulae using symbolic search
- Declarative dynamic programming as an alternative realization of Courcelle's theorem
- Decidability of a hybrid duration calculus
- Expansions of MSO by cardinality relations
- Automated formal analysis and verification: an overview
- VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata
- Efficient symbolic implementation of graph automata with applications to invariant checking
- Property Directed Reachability for Proving Absence of Concurrent Modification Errors
- A decision procedure for regular membership and length constraints over unbounded strings
- STeP
- From sequential extended regular expressions to NFA with symbolic labels
- Simulations of weighted tree automata
- An Evaluation of Automata Algorithms for String Analysis
- Graph structure and monadic second-order logic. A language-theoretic approach
- Combining logic programs and monadic second order logics by program transformation
This page was built for software: MONA
