Sciweavers

382 search results - page 7 / 77
» Checking Interval Based Properties for Reactive Systems
Sort
View
ICALP
2009
Springer
14 years 8 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
JLP
2007
86views more  JLP 2007»
13 years 8 months ago
Typing noninterference for reactive programs
We propose a type system to enforce the security property of noninterference in a core reactive language, obtained by extending the imperative language of Volpano, Smith and Irvin...
Ana Almeida Matos, Gérard Boudol, Ilaria Ca...
ATVA
2007
Springer
136views Hardware» more  ATVA 2007»
14 years 2 months ago
Symbolic Fault Tree Analysis for Reactive Systems
Fault tree analysis is a traditional and well-established technique for analyzing system design and robustness. Its purpose is to identify sets of basic events, called cut sets, wh...
Marco Bozzano, Alessandro Cimatti, Francesco Tappa...
ICST
2010
IEEE
13 years 7 months ago
Towards a Testing Methodology for Reactive Systems: A Case Study of a Landing Gear Controller
—In this case study we test a landing gear control system of a military aircraft with the new version of LUTESS, a tool for testing automatically synchronous software. LUTESS req...
Laya Madani, Virginia Papailiopoulou, Ioannis Pari...
RISE
2004
Springer
14 years 1 months ago
A Symbolic Model Checker for tccp Programs
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...
María Alpuente, Moreno Falaschi, Alicia Vil...