Sciweavers

5216 search results - page 662 / 1044
» Planning as Model Checking
Sort
View
CAV
2006
Springer
133views Hardware» more  CAV 2006»
15 years 10 months ago
Programs with Lists Are Counter Automata
Abstract. We address the verification problem of programs manipulating oneselector linked data structures. We propose a new automated approach for checking safety and termination f...
Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Ra...
DATE
2004
IEEE
142views Hardware» more  DATE 2004»
15 years 10 months ago
Eliminating False Positives in Crosstalk Noise Analysis
Noise affects circuit operation by increasing gate delays and causing latches to capture incorrect values. Noise analysis techniques can detect some of such noise faults, but accu...
Yajun Ran, Alex Kondratyev, Yosinori Watanabe, Mal...
EDOC
2004
IEEE
15 years 10 months ago
Write Once, Deploy N: A Performance Oriented MDA Case Study
To focus the comparison of languages for model checking and transformation on criteria that matter in practical development, there is an urgent need for more, and more realistic, ...
Pieter Van Gorp, Dirk Janssens, Tracy Gardner
HYBRID
2010
Springer
15 years 8 months ago
Identifiability of discrete-time linear switched systems
In this paper we study the identifiability of linear switched systems (LSSs ) in discrete-time. The question of identifiability is central to system identification, as it sets the...
Mihály Petreczky, Laurent Bako, Jan H. van ...
DSRT
2008
IEEE
15 years 8 months ago
Two Complementary Tools for the Formal Testing of Distributed Systems with Time Constraints
The complexity and the variety of the deployed timedependent systems, as well as the high degree of reliability required for their global functioning, justify the care provided to...
Ana R. Cavalli, Edgardo Montes de Oca, Wissam Mall...