Sciweavers

144 search results - page 15 / 29
» Nondeterminism Analysis of Functional Logic Programs
Sort
View
ICFP
2003
ACM
14 years 9 months ago
Software is discrete mathematics
A three-year study collected information bearing on the question of whether studying mathematics improves programming skills. An analysis of the data revealed significant differen...
Rex L. Page
SAS
2009
Springer
171views Formal Methods» more  SAS 2009»
14 years 10 months ago
Bottom-Up Shape Analysis
In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algorithm is that it is completely compositional, bottom-up and non-iterative. We pres...
Bhargav S. Gulavani, Supratik Chakraborty, Ganesan...
POPL
2010
ACM
14 years 7 months ago
Static Determination of Quantitative Resource Usage for Higher-Order Programs
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...
Steffen Jost, Hans-Wolfgang Loidl, Kevin Hammond, ...
VMCAI
2010
Springer
14 years 7 months ago
Shape Analysis with Reference Set Relations
Tracking subset relations between the contents containers on the heap is fundamental to modeling the semantics of many common programing idioms such as applying a function to a sub...
Mark Marron, Rupak Majumdar, Darko Stefanovic, Dee...
PEPM
1993
ACM
14 years 1 months ago
The Correctness of an Optimized Code Generation
For a functional programming language with a lazy standard semantics, we define a strictness analysis by means of abstract interpretation. Using the information from the strictne...
Torben Poort Lange