861 search results - page 71 / 173 » Symbolic Program Analysis Using Term Rewriting and Generaliz... |
162
click to vote
SIGSOFT
2010
ACM
15 years 1 months ago
2010
ACM
It is widely believed that program analysis can be more closely targeted to the needs of programmers if the program is accompanied by further redundant documentation. This may inc...
138
click to vote
SIGSOFT
2007
ACM
16 years 3 months ago
2007
ACM
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...
119
click to vote
CCS
2010
ACM
15 years 1 months ago
2010
ACM
Given a single program (i.e., bit string), one may assume that the program's behaviors can be determined by first identifying the native runtime architecture and then executi...
152
click to vote
POPL
1998
ACM
15 years 7 months ago
1998
ACM
constraint solver. The other infers annotations on bound variables in function abstractions by propagating type constraints downward from enclosing application nodes. We motivate o...
246
click to vote
POPL
2004
ACM
16 years 3 months ago
2004
ACM
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...