4719 search results - page 251 / 944 » Newtonian program analysis |
293
click to vote
POPL
2004
ACM
16 years 6 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...
319
click to vote
Lecture Notes
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
150
Voted
SIGSOFT
2005
ACM
16 years 6 months ago
2005
ACM
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
178
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
Modern database systems provide not only powerful data models but also complex query languages supporting powerful features such as the ability to create new database objects and ...
139
click to vote
IWPC
2009
IEEE
16 years 13 days ago
2009
IEEE
It is often claimed that inaccurate modularisation of crosscutting concerns hinders program comprehension and, as a consequence, leads to harmful software instabilities. However, ...