Sciweavers

506 search results - page 13 / 102
» Where Is the Value in a Program Verifier
Sort
View
LPAR
2001
Springer
13 years 12 months ago
Inferring Termination Conditions for Logic Programs Using Backwards Analysis
This paper focuses on the inference of modes for which a logic program is guaranteed to terminate. This generalizes traditional termination analysis where an analyzer tries to veri...
Samir Genaim, Michael Codish
JLP
2010
142views more  JLP 2010»
13 years 2 months ago
Relational bytecode correlations
We present a calculus for tracking equality relationships between values through pairs of bytecode programs. The calculus may serve as a certification mechanism for noninterferenc...
Lennart Beringer
WORDS
2005
IEEE
14 years 1 months ago
Towards a Flow Analysis for Embedded System C Programs
Reliable program Worst-Case Execution Time (WCET) estimates are a key component when designing and verifying real-time systems. One way to derive such estimates is by static WCET ...
Jan Gustafsson, Andreas Ermedahl, Björn Lispe...
POPL
2008
ACM
14 years 7 months ago
Relevance heuristics for program analysis
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
Kenneth L. McMillan
ICCD
2004
IEEE
97views Hardware» more  ICCD 2004»
14 years 4 months ago
Runtime Execution Monitoring (REM) to Detect and Prevent Malicious Code Execution
1 Many computer security threats involve execution of unauthorized foreign code on the victim computer. Viruses, network and email worms, Trojan horses, backdoor programs used in ...
A. Murat Fiskiran, Ruby B. Lee