Sciweavers

511 search results - page 89 / 103
» Synchronous Structures
Sort
View
TPHOL
2008
IEEE
14 years 4 months ago
The Isabelle Framework
g to the well-known “LCF approach” of secure inferences as abstract datatype constructors in ML [16]; explicit proof terms are also available [8]. Isabelle/Isar provides sophis...
Makarius Wenzel, Lawrence C. Paulson, Tobias Nipko...
BIRTHDAY
2003
Springer
14 years 3 months ago
Digital Algebra and Circuits
Abstract. Digital numbers D are the world’s most popular data representation: nearly all texts, sounds and images are coded somewhere in time and space by binary sequences. The m...
Jean Vuillemin
ACMMSP
2006
ACM
226views Hardware» more  ACMMSP 2006»
14 years 1 months ago
Smarter garbage collection with simplifiers
We introduce a method for providing lightweight daemons, called simplifiers, that attach themselves to program data. If a data item has a simplifier, the simplifier may be run aut...
Melissa E. O'Neill, F. Warren Burton
PODC
2000
ACM
14 years 2 months ago
Garbage collection of timestamped data in Stampede
Stampede is a parallel programming system to facilitate the programming of interactive multimedia applications on clusters of SMPs. In a Stampede application, a variable number of...
Rishiyur S. Nikhil, Umakishore Ramachandran
SPDP
1993
IEEE
14 years 1 months ago
How to Share an Object: A Fast Timing-Based Solution
We consider the problem of transforming a given sequential implementation of a data structure into a wait-free concurrent implementation. Given the code for different operations ...
Rajeev Alur, Gadi Taubenfeld