Sciweavers

272 search results - page 15 / 55
» Programming languages capturing complexity classes
Sort
View
IWMM
2009
Springer
164views Hardware» more  IWMM 2009»
14 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...
ATAL
2009
Springer
14 years 4 months ago
Constraint-based dynamic programming for decentralized POMDPs with structured interactions
Decentralized partially observable MDPs (DEC-POMDPs) provide a rich framework for modeling decision making by a team of agents. Despite rapid progress in this area, the limited sc...
Akshat Kumar, Shlomo Zilberstein
HOPL
2007
14 years 1 months ago
Statecharts in the making: a personal account
This paper is a highly personal and subjective account of how the language of statecharts came into being. The main novelty of the language is in being a fully executable visual f...
David Harel
APLAS
2010
ACM
13 years 8 months ago
Type Inference for Sublinear Space Functional Programming
We consider programming language aspects of algorithms that operate on data too large to fit into memory. In previous work we have introduced IntML, a functional programming langu...
Ugo Dal Lago, Ulrich Schöpp
IWMM
2010
Springer
140views Hardware» more  IWMM 2010»
13 years 11 months ago
Parametric inference of memory requirements for garbage collected languages
The accurate prediction of program's memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into ac...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...