Sciweavers

780 search results - page 150 / 156
» Case Study: Model Transformations for Time-triggered Languag...
Sort
View
OOPSLA
2004
Springer
14 years 29 days ago
Finding and preventing run-time error handling mistakes
It is difficult to write programs that behave correctly in the presence of run-time errors. Existing programming language features often provide poor support for executing clean-u...
Westley Weimer, George C. Necula
TSE
2011
114views more  TSE 2011»
13 years 2 months ago
Loupe: Verifying Publish-Subscribe Architectures with a Magnifying Lens
Abstract— The Publish-Subscribe (P/S) communication paradigm fosters high decoupling among distributed components. This facilitates the design of dynamic applications, but also i...
Luciano Baresi, Carlo Ghezzi, Luca Mottola
FOSSACS
2011
Springer
12 years 11 months ago
Minimizing Deterministic Lattice Automata
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
Shulamit Halamish, Orna Kupferman
SIGSOFT
2007
ACM
14 years 8 months ago
The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
Matteo Pradella, Angelo Morzenti, Pierluigi San Pi...
HYBRID
2005
Springer
14 years 1 months ago
Mode-Automata Based Methodology for Scade
In this paper, we present a new design methodology for synchronous reactive systems, based on a clear separation between control and data flow parts. This methodology allows to fa...
Ouassila Labbani, Jean-Luc Dekeyser, Pierre Boulet