Sciweavers

106 search results - page 3 / 22
» Verification of Hybrid Systems via Mathematical Programming
Sort
View
IJFCS
2008
81views more  IJFCS 2008»
13 years 5 months ago
Reachability Analysis in Verification via Supercompilation
Abstract. We present an approach to verification of parameterized systems, which is based on program transformation technique known as supercompilation. In this approach the statem...
Alexei Lisitsa, Andrei P. Nemytykh
ENTCS
2006
109views more  ENTCS 2006»
13 years 5 months ago
Specifications via Realizability
We present a system, called RZ, for automatic generation of program specifications from mathematical theories. We translate mathematical theories to specifications by computing th...
Andrej Bauer, Christopher A. Stone
FOSSACS
2008
Springer
13 years 7 months ago
Robust Analysis of Timed Automata via Channel Machines
Whereas formal verification of timed systems has become a very active field of research, the idealised mathematical semantics of timed automata cannot be faithfully implemented. Se...
Patricia Bouyer, Nicolas Markey, Pierre-Alain Reyn...
ENTCS
2008
139views more  ENTCS 2008»
13 years 5 months ago
Pervasive Compiler Verification - From Verified Programs to Verified Systems
We report in this paper on the formal verification of a simple compiler for the C-like programming language C0. The compiler correctness proof meets the special requirements of pe...
Dirk Leinenbach, Elena Petrova
HYBRID
2000
Springer
13 years 9 months ago
Optimization-Based Verification and Stability Characterization of Piecewise Affine and Hybrid Systems
In this paper, we formulate the problem of characterizing the stability of a piecewise affine (PWA) system as a verification problem. The basic idea is to take the whole Rn as the ...
Alberto Bemporad, Fabio Danilo Torrisi, Manfred Mo...