Sciweavers

407 search results - page 70 / 82
» Automatic Correctness Proofs for Logic Program Transformatio...
Sort
View
FOSSACS
2008
Springer
13 years 9 months ago
Footprints in Local Reasoning
Local reasoning about programs exploits the natural local behaviour common in programs by focussing on the footprint - that part of the resource accessed by the program. We address...
Mohammad Raza, Philippa Gardner
POPL
2010
ACM
14 years 5 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, ...
CAP
2010
13 years 2 months ago
A quantitative study of reductions in algebraic libraries
How much of existing computer algebra libraries is amenable to automatic parallelization? This is a difficult topic, yet of practical importance in the era of commodity multicore ...
Yue Li, Gabriel Dos Reis
IFIP
2004
Springer
14 years 1 months ago
The Simply-typed Pure Pattern Type System Ensures Strong Normalization
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
Benjamin Wack
SIGSOFT
2003
ACM
14 years 8 months ago
Ontology support for web service processes
Web Services are software services that can be advertised by providers and deployed by customers using Web technologies. This concept is currently carried further to address Web s...
Claus Pahl, Michael Casey