Sciweavers

1579 search results - page 197 / 316
» On the Constructions of Constant-Weight Codes
Sort
View
PARLE
1992
15 years 10 months ago
Characterizing the Paralation Model using Dynamic Assignment
Collection-oriented languages provide high-level constructs for describing computations over collections. These languages are becoming increasingly popular with the advent of massi...
Eric T. Freeman, Daniel P. Friedman
ACSC
2004
IEEE
15 years 10 months ago
Automatic Derivation of Loop Termination Conditions to Support Verification
This paper introduces a repeatable and constructive approach to the analysis of loop progress and termination conditions in imperative programs. It is applicable to all loops for ...
Daniel Powell
ECOOP
2006
Springer
15 years 10 months ago
SuperGlue: Component Programming with Object-Oriented Signals
The assembly of components that can handle continuously changing data results in programs that are more interactive. Unfortunately, the code that glues together such components is ...
Sean McDirmid, Wilson C. Hsieh
ICFP
2000
ACM
15 years 10 months ago
Fully reflexive intensional type analysis
Compilers for polymorphic languages can use runtime type inspection to support advanced implementation techniques such as tagless garbage collection, polymorphic marshalling, and ...
Valery Trifonov, Bratin Saha, Zhong Shao
FSE
2010
Springer
146views Cryptology» more  FSE 2010»
15 years 9 months ago
A Unified Method for Improving PRF Bounds for a Class of Blockcipher Based MACs
This paper provides a unified framework for improving PRF (pseudorandom function) advantages of several popular MACs (message authentication codes) based on a blockcipher modeled a...
Mridul Nandi