Sciweavers

2111 search results - page 223 / 423
» How to Program Pervasive Systems
Sort
View
142
Voted
LICS
2008
IEEE
15 years 10 months ago
Nonlocal Flow of Control and Kleene Algebra with Tests
Kleene algebra with tests (KAT) is an equational system for program verification that combines Kleene algebra (KA), or the algebra of regular expressions, with Boolean algebra. I...
Dexter Kozen
103
Voted
IWMM
2004
Springer
92views Hardware» more  IWMM 2004»
15 years 9 months ago
Memory accounting without partitions
Operating systems account for memory consumption and allow for termination at the level of individual processes. As a result, if one process consumes too much memory, it can be te...
Adam Wick, Matthew Flatt
114
Voted
ESOP
1999
Springer
15 years 8 months ago
An Idealized MetaML: Simpler, and More Expressive
MetaML is a multi-stage functional programming language featuring three constructs that can be viewed as statically-typed refinements of the back-quote, comma, and eval of Scheme....
Eugenio Moggi, Walid Taha, Zine-El-Abidine Benaiss...
154
Voted
PEPM
1993
ACM
15 years 7 months ago
Binding-Time Analysis and the Taming of C Pointers
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...
Lars Ole Andersen
131
Voted
ASAP
2008
IEEE
120views Hardware» more  ASAP 2008»
15 years 5 months ago
Lightweight DMA management mechanisms for multiprocessors on FPGA
This paper presents a multiprocessor system on FPGA that adopts Direct Memory Access (DMA) mechanisms to move data between the external memory and the local memory of each process...
Antonino Tumeo, Matteo Monchiero, Gianluca Palermo...