Sciweavers

1204 search results - page 169 / 241
» Termination of Polynomial Programs
Sort
View
ISSTA
2004
ACM
15 years 3 months ago
Exploiting purity for atomicity
The notion that certain procedures are atomic is a fundamental correctness property of many multithreaded software systems. A procedure is atomic if for every execution there is a...
Cormac Flanagan, Stephen N. Freund, Shaz Qadeer
ENTCS
2002
134views more  ENTCS 2002»
14 years 9 months ago
Implementing Compositional Analysis Using Intersection Types With Expansion Variables
A program analysis is compositional when the analysis result for a particular program fragment is obtained solely from the results for its immediate subfragments via some composit...
Assaf J. Kfoury, Geoffrey Washburn, Joe Wells
GECCO
2005
Springer
163views Optimization» more  GECCO 2005»
15 years 3 months ago
Benefits of software measures for evolutionary white-box testing
White-box testing is an important method for the early detection of errors during software development. In this process test case generation plays a crucial role, defining appropr...
Frank Lammermann, Stefan Wappler
TLCA
2005
Springer
15 years 3 months ago
Recursive Functions with Higher Order Domains
In a series of articles, we developed a method to translate general recursive functions written in a functional programming style into constructive type theory. Three problems rema...
Ana Bove, Venanzio Capretta
IWMM
2009
Springer
164views Hardware» more  IWMM 2009»
15 years 4 months ago
Live heap space analysis for languages with garbage collection
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run t...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...