Sciweavers

5 search results - page 1 / 1
» Well-definedness of Streams by Transformation and Terminatio...
Sort
View
CORR
2010
Springer
126views Education» more  CORR 2010»
13 years 7 months ago
Well-definedness of Streams by Transformation and Termination
Streams are infinite sequences over a given data type. A stream specification is a set of equations intended to define a stream. We propose a transformation from such a stream spec...
Hans Zantema
RTA
2010
Springer
13 years 11 months ago
Proving Productivity in Infinite Data Structures
For a general class of infinite data structures including streams, binary trees, and the combination of finite and infinite lists, we investigate a notion of productivity. This ...
Hans Zantema, Matthias Raffelsieper
WOWMOM
2009
ACM
158views Multimedia» more  WOWMOM 2009»
14 years 1 months ago
Admission control based on OFDMA channel transformations
It is well known that channel-dependent OFDMA resource assignment algorithms provide a significant performance improvement compared to static (i.e. channelunaware) approaches. Su...
James Gross
ACL2
2006
ACM
14 years 1 months ago
A verifying core for a cryptographic language compiler
A verifying compiler is one that emits both object code and a proof of correspondence between object and source code.1 We report the use of ACL2 in building a verifying compiler f...
Lee Pike, Mark Shields, John Matthews