Sciweavers

108 search results - page 14 / 22
» Hybrid Transitive Closure Algorithms
Sort
View
ITP
2010
172views Mathematics» more  ITP 2010»
14 years 8 months ago
Automated Machine-Checked Hybrid System Safety Proofs
mentation of the Abstraction Method In Coq Eelis van der Weegen Institute for Computing and Information Sciences Raboud University Nijmegen This technical report documents our deve...
Herman Geuvers, Adam Koprowski, Dan Synek, Eelis v...
ISPD
2006
ACM
90views Hardware» more  ISPD 2006»
15 years 3 months ago
Fast buffer insertion considering process variations
Advanced process technologies call for a proactive consideration of process variations in design to ensure high parametric timing yield. Despite of its popular use in almost any h...
Jinjun Xiong, Lei He
KI
2010
Springer
14 years 4 months ago
Differential Dynamic Logics
Hybrid systems are models for complex physical systems and are defined as dynamical systems with interacting discrete transitions and continuous evolutions along differential equa...
André Platzer
CSL
2004
Springer
15 years 1 months ago
Pfaffian Hybrid Systems
It is well known that in an o-minimal hybrid system the continuous and discrete components can be separated, and therefore the problem of finite bisimulation reduces to the same pr...
Margarita V. Korovina, Nicolai Vorobjov
CONCUR
2006
Springer
15 years 1 months ago
Proving Liveness by Backwards Reachability
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, ...