192 search results - page 22 / 39 » Using Call Exit Analysis for Logic Program Transformation |
135
Voted
POPL
2010
ACM
15 years 11 months ago
2010
ACM
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
119
click to vote
JFLP
2002
15 years 1 months ago
2002
We present a practical partial evaluation scheme for multi-paradigm declarative languages combining features from functional, logic, and concurrent programming. In contrast to pre...
196
Voted
SIGSOFT
2010
ACM
15 years 3 days ago
2010
ACM
We present an effective dynamic analysis for finding a broad class of deadlocks, including the well-studied lock-only deadlocks as well as the less-studied, but no less widespread...
143
click to vote
FMCAD
2008
Springer
15 years 3 months ago
2008
Springer
We present a method for verifying information flow properties of software programs using inductive assertions and theorem proving. Given a program annotated with information flow a...
136
click to vote
PLDI
2003
ACM
15 years 7 months ago
2003
ACM
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...