39 search results - page 8 / 8 » Generalizing Cook's Transformation to Imperative Stack Progr... |
PEPM
2009
ACM
14 years 3 months ago
2009
ACM
We show that a wide class of bidirectional data-flow analyses and program optimizations based on them admit declarative descriptions in the form of type systems. The salient feat...
POPL
2010
ACM
14 years 3 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...
OOPSLA
2010
Springer
13 years 4 months ago
2010
Springer
Continuation-based Web servers provide advantages over traditional Web application development through the increase of expressive power they allow. This leads to fewer errors and ...
SIGSOFT
2003
ACM
14 years 7 months ago
2003
ACM
This paper presents a novel approach for automated test data generation of imperative programs containing integer, boolean and/or float variables. It extends our previous work to ...