1210 search results - page 138 / 242 » Formal Techniques for Java Programs |
106
click to vote
POPL
2010
ACM
15 years 11 months ago
2010
ACM
We present an automated technique for generating compiler optimizations from examples of concrete programs before and after improvements have been made to them. The key technical ...
141
click to vote
ASIACRYPT
2010
Springer
15 years 10 days ago
2010
Springer
This paper investigates the Random Oracle Model (ROM) feature known as programmability, which allows security reductions in the ROM to dynamically choose the range points of an ide...
221
click to vote
POPL
2007
ACM
16 years 2 months ago
2007
ACM
We present an internal language with equivalent expressive power to Standard ML, and discuss its formalization in LF and the machine-checked verification of its type safety in Twe...
100
click to vote
SAS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Pointer information is a prerequisite for most program analyses, and inclusion-based, i.e. Andersen-style, pointer analysis is widely used to compute such information. Ho...
168
Voted
CORR
2010
Springer
15 years 27 days ago
2010
Springer
Graphs and graph transformation systems are a frequently used modelling technique for a wide range of different domains, covering areas as diverse as refactorings, network topolog...