Sciweavers

250 search results - page 33 / 50
» Static Probabilistic Timing Analysis for Multi-path Programs
Sort
View
PLDI
2012
ACM
13 years 1 months ago
Automated error diagnosis using abductive inference
When program verification tools fail to verify a program, either the program is buggy or the report is a false alarm. In this situation, the burden is on the user to manually cla...
Isil Dillig, Thomas Dillig, Alex Aiken
APSEC
2005
IEEE
15 years 4 months ago
Model Checking Interrupt-Dependent Software
Embedded control programs are hard to analyse because their behaviour depends on how they interact with hardware devices. In particular, embedded code typically uses interrupts to...
Colin J. Fidge, Phil Cook
POPL
2010
ACM
15 years 5 months ago
Ypnos: declarative, parallel structured grid programming
A fully automatic, compiler-driven approach to parallelisation can result in unpredictable time and space costs for compiled code. On the other hand, a fully manual approach to pa...
Dominic A. Orchard, Max Bolingbroke, Alan Mycroft
POPL
2005
ACM
15 years 11 months ago
Precise interprocedural analysis using random interpretation
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
Sumit Gulwani, George C. Necula
WCET
2007
14 years 12 months ago
Data-Flow Based Detection of Loop Bounds
To calculate the WCET of a program, safe upper bounds on the number of loop iterations for all loops in the program are needed. As the manual annotation of all loops with such bou...
Christoph Cullmann, Florian Martin