Sciweavers

5506 search results - page 265 / 1102
» Minimal Logic Programs
Sort
View
POPL
2004
ACM
16 years 4 months ago
Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums
We present a notion of -long ? -normal term for the typed lambda calculus with sums and prove, using Grothendieck logical relations, that every term is equivalent to one in norm...
Vincent Balat, Roberto Di Cosmo, Marcelo P. Fiore
LFCS
2007
Springer
15 years 10 months ago
Reasoning About Sequences of Memory States
Abstract. In order to verify programs with pointer variables, we introduce a temporal logic LTLmem whose underlying assertion language is the quantifier-free fragment of separatio...
Rémi Brochenin, Stéphane Demri, &Eac...
GCC
2003
Springer
15 years 9 months ago
Toward the Composition of Semantic Web Services
This paper introduces a method for automatic composition of semantic web services using linear logic theorem proving. The method uses semantic web service language (DAML-S) for ext...
Jinghai Rao, Xiaomeng Su
CC
2008
Springer
193views System Software» more  CC 2008»
15 years 6 months ago
Automatic Transformations for Communication-Minimized Parallelization and Locality Optimization in the Polyhedral Model
The polyhedral model provides powerful abstractions to optimize loop nests with regular accesses. Affine transformations in this model capture a complex sequence of execution-reord...
Uday Bondhugula, Muthu Manikandan Baskaran, Sriram...
AINA
2010
IEEE
15 years 9 months ago
Minimizing Execution Costs when Using Globally Distributed Cloud Services
Cloud computing is an emerging technology that allows users to utilize on-demand computation, storage, data and services from around the world. However, Cloud service providers ch...
Suraj Pandey, Adam Barker, Kapil Kumar Gupta, Rajk...