Results 1 - 10 of 58

MONA Implementation Secrets

by Nils Klarlund, Anders Møller, Michael Schwatzbach , 2000
"... The MONA tool provides an implementation of the decision procedures for the logics WS1S and WS2S. It has been used for numerous applications, and it is remarkably efficient in practice, even though it faces a theoretically non-elementary worst-case complexity. The implementation has matured over a p ..."
Abstract - Cited by 84 (6 self) - Add to MetaCart
The MONA tool provides an implementation of the decision procedures for the logics WS1S and WS2S. It has been used for numerous applications, and it is remarkably efficient in practice, even though it faces a theoretically non-elementary worst-case complexity. The implementation has matured over a

MONA: Monadic Second-Order Logic in Practice

by Jesper G. Henriksen, Ole J.L. Jensen, Michael E. Jørgensen, Nils Klarlund, Robert Paige, Theis Rauhe, Anders B. Sandholm - IN PRACTICE, IN TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, FIRST INTERNATIONAL WORKSHOP, TACAS '95, LNCS 1019 , 1995
"... The purpose of this article is to introduce Monadic Second-order Logic as a practical means of specifying regularity. The logic is a highly succinct alternative to the use of regular expressions. We have built a tool MONA, which acts as a decision procedure and as a translator to finite-state au ..."
Abstract - Cited by 149 (20 self) - Add to MetaCart
The purpose of this article is to introduce Monadic Second-order Logic as a practical means of specifying regularity. The logic is a highly succinct alternative to the use of regular expressions. We have built a tool MONA, which acts as a decision procedure and as a translator to finite

Mona: Decidable Arithmetic in Practice

by Morten Biehl, Nils Klarlund, Theis Rauhe , 1996
"... In this note, we describe how a fragment of arithmetic can be decided in practice. We follow essentially the ideas of [8], which we have embedded in the Mona tool. Mona is an implementation of Monadic Second-order Logic on finite strings (and trees). The previous semantics used in Mona is the one pr ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
In this note, we describe how a fragment of arithmetic can be decided in practice. We follow essentially the ideas of [8], which we have embedded in the Mona tool. Mona is an implementation of Monadic Second-order Logic on finite strings (and trees). The previous semantics used in Mona is the one

MonaSearch – A Tool for Querying Linguistic

by Hendrik Maryns, Stephan Kepser
"... MonaSearch is a new powerful query tool for linguistic treebanks. The query language of MonaSearch is monadic second-order logic, an extension of first-order logic capable of expressing probably all linguistically interest-ing queries. In order to process queries efficiently, they are compiled into ..."
Abstract - Add to MetaCart
MonaSearch is a new powerful query tool for linguistic treebanks. The query language of MonaSearch is monadic second-order logic, an extension of first-order logic capable of expressing probably all linguistically interest-ing queries. In order to process queries efficiently, they are compiled

Mona Fido: The Logic-Automaton Connection in Practice

by Nils Klarlund , 1998
"... We discuss in this paper how connections, discovered almost forty years ago, between logics and automata can be used in practice. For such logics expressing regular sets, we have developed tools that allow efficient symbolic reasoning not attainable by theorem proving or symbolic model checking. ..."
Abstract - Cited by 57 (10 self) - Add to MetaCart
We discuss in this paper how connections, discovered almost forty years ago, between logics and automata can be used in practice. For such logics expressing regular sets, we have developed tools that allow efficient symbolic reasoning not attainable by theorem proving or symbolic model checking

MONA 1.x: New Techniques for WS1S and WS2S

by Jacob Elgaard, Nils Klarlund, Anders Møller
"... In this note, we present the first version of the Mona tool to be released in its entirety. The tool now offers decision procedures for both WS1S and WS2S and a completely rewritten front-end. Here, we present some of our techniques, which make calculations couched in WS1S run up to five times faste ..."
Abstract - Cited by 34 (5 self) - Add to MetaCart
In this note, we present the first version of the Mona tool to be released in its entirety. The tool now offers decision procedures for both WS1S and WS2S and a completely rewritten front-end. Here, we present some of our techniques, which make calculations couched in WS1S run up to five times

Using MONA for Querying Linguistic Treebanks

by unknown authors
"... MONA is an automata toolkit providing a compiler for compiling formulae of monadic second order logic on strings or trees into string automata or tree automata. In this paper, we evaluate the option of using MONA as a treebank query tool. Unfortunately, we find that MONA is not an option. There are ..."
Abstract - Add to MetaCart
MONA is an automata toolkit providing a compiler for compiling formulae of monadic second order logic on strings or trees into string automata or tree automata. In this paper, we evaluate the option of using MONA as a treebank query tool. Unfortunately, we find that MONA is not an option

The Pointer Assertion Logic Engine

by Anders Møller, Michael I. Schwartzbach - Proc. ACM PLDI , 2001
"... We present a new framework for verifying partial specifications of programs in order to catch type and memory errors and check data structure invariants. Our technique can verify a large class of data structures, namely all those that can be expressed as graph types. Earlier versions were restricted ..."
Abstract - Cited by 156 (3 self) - Add to MetaCart
in the logical tradition by encoding the programs and partial specifications as formulas in monadic second-order logic. Validity of these formulas is checked by the MONA tool, which also can provide explicit counterexamples to invalid formulas. To make verification decidable, the technique requires explicit loop

RESEARCH ARTICLE Open Access MONA – Interactive manipulation of molecule

by Matthias Hilbig, Sascha Urbaczek, Inken Groth, Stefan Heuser, Matthias Rarey
"... Working with small-molecule datasets is a routine task for cheminformaticians and chemists. The analysis and comparison of vendor catalogues and the compilation of promising candidates as starting points for screening campaigns are but a few very common applications. The workflows applied for this p ..."
Abstract - Add to MetaCart
contexts, however, the best suited workflow is not known in advance, thus making it necessary to take the results of the previous steps into consideration before proceeding. To support intuition-driven processing of compound collections, we developed MONA, an interactive tool that has been designed

A MONA-based Decision Procedure for Propositional Interval Temporal Logic

by Rodolfo Gomez, Howard Bowman , 2003
"... Interval Temporal Logic (ITL) is a finite-time linear temporal logic with applications in hardware verification, temporal logic programming and specification of multimedia documents. Due to the inherently nonelementary complexity of its decision problem, e#cient ITL-based verification tools have b ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Interval Temporal Logic (ITL) is a finite-time linear temporal logic with applications in hardware verification, temporal logic programming and specification of multimedia documents. Due to the inherently nonelementary complexity of its decision problem, e#cient ITL-based verification tools have
Results 1 - 10 of 58