Sciweavers

60 search results - page 12 / 12
» Loop Formulas for Circumscription
Sort
View
LCTRTS
2007
Springer
13 years 11 months ago
Generalizing parametric timing analysis
In the design of real-time and embedded systems, it is important to establish a bound on the worst-case execution time (WCET) of programs to assure via schedulability analysis tha...
Joel Coffman, Christopher A. Healy, Frank Mueller,...
ESOP
2000
Springer
13 years 9 months ago
Compile-Time Debugging of C Programs Working on Trees
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...
Jacob Elgaard, Anders Møller, Michael I. Sc...
CONCUR
2000
Springer
13 years 9 months ago
The Control of Synchronous Systems
In the synchronous composition of processes, one process may prevent another process from proceeding unless compositions without a wellde ned productbehavior are ruled out. They ca...
Luca de Alfaro, Thomas A. Henzinger, Freddy Y. C. ...
CASC
2006
Springer
128views Mathematics» more  CASC 2006»
13 years 9 months ago
New Domains for Applied Quantifier Elimination
We address various aspects of our computer algebra-based computer logic system redlog. There are numerous examples in the literature for successful applications of redlog to practi...
Thomas Sturm
TACAS
2010
Springer
170views Algorithms» more  TACAS 2010»
13 years 3 months ago
SLAB: A Certifying Model Checker for Infinite-State Concurrent Systems
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
Klaus Dräger, Andrey Kupriyanov, Bernd Finkbe...