2000 search results - page 295 / 400 » Program Transformation and Proof Transformation |
224
Voted
POPL
2009
ACM
16 years 4 months ago
2009
ACM
Optimizations in a traditional compiler are applied sequentially, with each optimization destructively modifying the program to produce a transformed program that is then passed t...
250
click to vote
POPL
2005
ACM
16 years 3 months ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
138
Voted
ICFP
2005
ACM
16 years 3 months ago
2005
ACM
Implementing first-class continuations can pose a challenge if the target machine makes no provisions for accessing and re-installing the run-time stack. In this paper, we present...
119
Voted
CCA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
99
Voted
DATE
2004
IEEE
15 years 7 months ago
2004
IEEE
Bounded model checking (BMC) has gained widespread industrial use due to its relative scalability. Its exhaustiveness over all valid input vectors allows it to expose arbitrarily ...