Sciweavers

4036 search results - page 257 / 808
» Formal Methods
Sort
View
ASE
2002
160views more  ASE 2002»
15 years 6 months ago
Proving Invariants of I/O Automata with TAME
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
Myla Archer, Constance L. Heitmeyer, Elvinia Ricco...
TSE
2011
107views more  TSE 2011»
15 years 1 months ago
Deriving a Slicing Algorithm via FermaT Transformations
In this paper we present a case study in deriving an algorithm from a formal specification via FermaT transformations. The general method (which is presented in a separate paper)...
Martin P. Ward, Hussein Zedan
TAP
2009
Springer
125views Hardware» more  TAP 2009»
16 years 1 months ago
Development of a Generic Voter under FoCal
Safety and security are claimed major concerns by the formal FoCaL development environment. In [7] we introduced a safety development cycle customised to FoCaL. In this paper, we e...
Philippe Ayrault, Thérèse Hardin, Fr...
ICFCA
2010
Springer
16 years 1 months ago
Lattice Drawings and Morphisms
Let L → H be a lattice homomorphism and let a “readable” drawing of H be given. It is natural to make use of it to try getting a clear(er) drawing of L. Hence, the following ...
Vincent Duquenne
FORMATS
2007
Springer
16 years 23 days ago
AMT: A Property-Based Monitoring Tool for Analog Systems
Abstract. In this paper we describe AMT, a tool for monitoring temporal properties of continuous signals. We first introduce STL/PSL, a specification formalism based on the indus...
Dejan Nickovic, Oded Maler