Sciweavers

861 search results - page 68 / 173
» Symbolic Program Analysis Using Term Rewriting and Generaliz...
Sort
View
POPL
2003
ACM
16 years 3 months ago
New results on the computability and complexity of points - to analysis
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
Venkatesan T. Chakaravarthy
PLDI
2006
ACM
15 years 9 months ago
Combining type-based analysis and model checking for finding counterexamples against non-interference
Type systems for secure information flow are useful for efficiently checking that programs have secure information flow. They are, however, conservative, so that they often rej...
Hiroshi Unno, Naoki Kobayashi, Akinori Yonezawa
SIGMETRICS
2003
ACM
199views Hardware» more  SIGMETRICS 2003»
15 years 8 months ago
Data cache locking for higher program predictability
Caches have become increasingly important with the widening gap between main memory and processor speeds. However, they are a source of unpredictability due to their characteristi...
Xavier Vera, Björn Lisper, Jingling Xue
TSE
2010
110views more  TSE 2010»
15 years 1 months ago
Proofs from Tests
We present an algorithm Dash to check if a program P satisfies a safety property ϕ. The unique feature of the algorithm is that it uses only test generation operations, and nes ...
Nels E. Beckman, Aditya V. Nori, Sriram K. Rajaman...
ICSE
2008
IEEE-ACM
16 years 3 months ago
Impact analysis of database schema changes
We propose static program analysis techniques for identifying the impact of relational database schema changes upon object-oriented applications. We use dataflow analysis to extra...
Andy Maule, Wolfgang Emmerich, David S. Rosenblum