Sciweavers

3255 search results - page 128 / 651
» Combination of Abstractions in the ASTR
Sort
View
ESOP
2007
Springer
14 years 4 months ago
Static Analysis by Policy Iteration on Relational Domains
We give a new practical algorithm to compute, in finite time, a fixpoint (and often the least fixpoint) of a system of equations in the abstract numerical domains of zones and t...
Stephane Gaubert, Eric Goubault, Ankur Taly, Sarah...
MDM
2007
Springer
137views Communications» more  MDM 2007»
14 years 4 months ago
Infrastructure for Data Processing in Large-Scale Interconnected Sensor Networks
Abstract—With the price of wireless sensor technologies diminishing rapidly we can expect large numbers of autonomous sensor networks being deployed in the near future. These sen...
Karl Aberer, Manfred Hauswirth, Ali Salehi
CEFP
2005
Springer
14 years 3 months ago
Exploiting Purely Functional Programming to Obtain Bounded Resource Behaviour: The Hume Approach
This chapter describes Hume: a functionally-based language for programming with bounded resource usage, including time and space properties. The purpose of the Hume language design...
Kevin Hammond
IFL
2004
Springer
138views Formal Methods» more  IFL 2004»
14 years 3 months ago
A Rational Deconstruction of Landin's SECD Machine
Landin’s SECD machine was the first abstract machine for the λ-calculus viewed as a programming language. Both theoretically as a model of computation and practically as an ide...
Olivier Danvy
AGP
1999
IEEE
14 years 2 months ago
Widening Sharing
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. After recognizing that neither aring nor its non-redundant (but equivalent) abstra...
Enea Zaffanella, Roberto Bagnara, Patricia M. Hill