Results 21 - 30 of 58

FAST Extended Release

by Sébastien Bardin, Jérôme Leroux, Gérald Point
"... Fast is a tool designed for the analysis of counter systems, i.e. automata extended with unbounded integer variables. Despite the reachability set is not recursive in general, Fast implements several innovative techniques such as acceleration and circuit selection to solve this problem in practice ..."
Abstract - Cited by 15 (2 self) - Add to MetaCart
in practice. In its latest version, the tool is built upon an open architecture: the Presburger library is manipulated through a clear and convenient interface, thus any Presburger arithmetics package can be plugged to the tool. We provide four implementations of the interface using Lash, Mona, Omega and a

Compile-Time Debugging of C Programs Working on Trees

by Jacob Elgaard, Anders Møller, Michael I. Schwartzbach - In Proc. 9th ESOP , 2000
"... . We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but only attempt to verify that they respect the shape and integrity of the store. A verified program is guaranteed t ..."
Abstract - Cited by 26 (5 self) - Add to MetaCart
that is decided by the MONA tool. This technique is complete for loop-free code, but for loops and recursive functions we rely on Hoare-style invariants. A default well-formedness invariant is supplied and can be strengthened as needed by programmer annotations. If a program fails to verify, a counterexample

A Case Study on using Automata in Control Synthesis

by Thomas Hune, Anders Sandholm - FASE 2000 , 2000
"... We study a method for synthesizing control programs. The method merges an existing control program with a control automaton. We have used monadic second order logic over strings to specify the control automata. Specifications are translated into automata by the Mona tool. This yields a new contr ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
We study a method for synthesizing control programs. The method merges an existing control program with a control automaton. We have used monadic second order logic over strings to specify the control automata. Specifications are translated into automata by the Mona tool. This yields a new

Finding malfunctions in HVAC installations

by Siem Opschoor
"... We describe the MonaVisa software tool. This tool automatically analyzes climate control installation performance using data mining techniques. The results of this analysis are presented by means of red & green indicators which indicate whether a component in the system is functioning properly o ..."
Abstract - Add to MetaCart
We describe the MonaVisa software tool. This tool automatically analyzes climate control installation performance using data mining techniques. The results of this analysis are presented by means of red & green indicators which indicate whether a component in the system is functioning properly

Cognitive Task Analysis

by Shore House
"... This document presents a Cognitive Task Analysis (CTA) for First Air Traffic Control Support Tools Implementation (FASTI). This CTA describes how ATC tasks will change following the implementation of FASTI tools (i.e., MTCD, MONA, and SYSCO) and identifies the mental demands associated with these ta ..."
Abstract - Add to MetaCart
This document presents a Cognitive Task Analysis (CTA) for First Air Traffic Control Support Tools Implementation (FASTI). This CTA describes how ATC tasks will change following the implementation of FASTI tools (i.e., MTCD, MONA, and SYSCO) and identifies the mental demands associated

Decidable logics combining heap structures and data

by P. Madhusudan, Gennaro Parlato, Xiaokang Qiu - IN: POPL’11 , 2011
"... We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data ” logic) formulas express constraints involving heap structures and the data they contain; they are defined over a class of pointer-stru ..."
Abstract - Cited by 26 (9 self) - Add to MetaCart
trees and the quantifier-free theory of the underlying data-logic. We demonstrate the effectiveness and practicality of the logic by checking verification conditions generated in proving properties of several heap-manipulating programs, using a tool that combines an MSO decision procedure over trees

Translating PLTL into WS1S: Application Description

by unknown authors
"... Abstract This paper introduces a technique for translating propositional linear time logic PLTL into the weak second-order logic of one successor WS1S. Using the Mona tool, a decision procedure for WS1S, we obtain a decision procedure for PLTL. We demonstrate the viability of this approach by an emp ..."
Abstract - Add to MetaCart
Abstract This paper introduces a technique for translating propositional linear time logic PLTL into the weak second-order logic of one successor WS1S. Using the Mona tool, a decision procedure for WS1S, we obtain a decision procedure for PLTL. We demonstrate the viability of this approach

AVoCS 2006 Automatic Verification of Bossa Scheduler Properties

by Jean-paul Bodeveix A, Mamoun Filali A, Julia L. Lawall B, Gilles Muller C
"... Bossa is a development environment for operating-system process schedulers that provides numerous safety guarantees. In this paper, we show how to automate the checking of safety properties of a scheduling policy developed in this environment. We find that most of the relevant properties can be cons ..."
Abstract - Add to MetaCart
be considered as invariant or refinement properties. In order to automate the related proof obligations, we use the WS1S logic for which a decision procedure is implemented by Mona. The proof techniques are implemented using the FMona tool.

Automatic Verification of Bossa Scheduler Properties

by Jean-Paul Bodeveix , Mamoun Filali , Julia L. Lawall , Gilles Muller - AVOCS 2006 , 2006
"... Bossa is a development environment for operating-system process schedulers that provides numerous safety guarantees. In this paper, we show how to automate the checking of safety properties of a scheduling policy developed in this environment. We find that most of the relevant properties can be cons ..."
Abstract - Add to MetaCart
be considered as invariant or refinement properties. In order to automate the related proof obligations, we use the WS1S logic for which a decision procedure is implemented by Mona. The proof techniques are implemented using the FMona tool.

Groupware design: principles, prototypes, and systems

by Andrew Jeremy, Gavin Cockburn , 1993
"... Computers are valuable tools for a wide range of work tasks. A substantial limitation on their value, however, is the predominant focus on enhancing the work of individuals. This fails to account for the issues of collaboration that affect almost all work. Research into computer supported cooperativ ..."
Abstract - Add to MetaCart
Computers are valuable tools for a wide range of work tasks. A substantial limitation on their value, however, is the predominant focus on enhancing the work of individuals. This fails to account for the issues of collaboration that affect almost all work. Research into computer supported
Results 21 - 30 of 58