Sciweavers

197 search results - page 19 / 40
» Using Static Program Analysis to Aid Intrusion Detection
Sort
View
CAV
2006
Springer
146views Hardware» more  CAV 2006»
13 years 11 months ago
Termination Analysis with Calling Context Graphs
We introduce calling context graphs and various static and theorem proving based analyses that together provide a powerful method for proving termination of programs written in fea...
Panagiotis Manolios, Daron Vroon
CJ
2010
150views more  CJ 2010»
13 years 5 months ago
Program Analysis Probably Counts
Abstract. Semantics-based program analysis uses an abstract semantics of programs/systems to statically determine run-time properties. Classic examples from compiler technology inc...
Alessandra Di Pierro, Chris Hankin, Herbert Wiklic...
PLDI
2009
ACM
14 years 2 months ago
LiteRace: effective sampling for lightweight data-race detection
Data races are one of the most common and subtle causes of pernicious concurrency bugs. Static techniques for preventing data races are overly conservative and do not scale well t...
Daniel Marino, Madanlal Musuvathi, Satish Narayana...
WCET
2007
13 years 8 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
SIGSOFT
2007
ACM
14 years 8 months ago
Efficient checkpointing of java software using context-sensitive capture and replay
Checkpointing and replaying is an attractive technique that has been used widely at the operating/runtime system level to provide fault tolerance. Applying such a technique at the...
Guoqing Xu, Atanas Rountev, Yan Tang, Feng Qin