Sciweavers

68
Voted
FMSD
2008
64views more  FMSD 2008»
14 years 11 months ago
Robust safety of timed automata
Timed automata are governed by an idealized semantics that assumes a perfectly precise behavior of the clocks. The traditional semantics is not robust because the slightest perturb...
Martin De Wulf, Laurent Doyen, Nicolas Markey, Jea...
66
Voted
FMSD
2008
66views more  FMSD 2008»
14 years 11 months ago
Verification of evolving software via component substitutability analysis
Sagar Chaki, Edmund M. Clarke, Natasha Sharygina, ...
93
Voted
FMSD
2008
110views more  FMSD 2008»
14 years 11 months ago
Automatic symbolic compositional verification by learning assumptions
Abstract Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically base...
Wonhong Nam, P. Madhusudan, Rajeev Alur
55
Voted
FMSD
2008
65views more  FMSD 2008»
14 years 11 months ago
Three optimizations for Assume-Guarantee reasoning with L*
Sagar Chaki, Ofer Strichman
57
Voted
FMSD
2008
74views more  FMSD 2008»
14 years 11 months ago
Abstractions for hybrid systems
Ashish Tiwari
63
Voted
FMSD
2008
49views more  FMSD 2008»
14 years 11 months ago
Verification of parametric concurrent systems with prioritised FIFO resource management
Ahmed Bouajjani, Peter Habermehl, Tomás Voj...
FMSD
2008
94views more  FMSD 2008»
14 years 11 months ago
Optimal infinite scheduling for multi-priced timed automata
Abstract. This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal. To cover a wide class of optimality criteria we start...
Patricia Bouyer, Ed Brinksma, Kim Guldstrand Larse...