Sciweavers

78 search results - page 11 / 16
» A logical reconstruction of SPKI
Sort
View
ENTCS
2008
92views more  ENTCS 2008»
13 years 7 months ago
Redundancy Elimination for LF
We present a type system extending the dependent type theory LF, whose terms are more amenable to compact representation. This is achieved by carefully omitting certain subterms w...
Jason Reed
OTM
2007
Springer
14 years 1 months ago
Self-healing in Binomial Graph Networks
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. However, as the number of components increases...
Thara Angskun, George Bosilca, Jack Dongarra
FSE
2005
Springer
84views Cryptology» more  FSE 2005»
14 years 29 days ago
Some Attacks on the Bit-Search Generator
The bit-search generator (BSG) was proposed in 2004 and can be seen as a variant of the shrinking and self-shrinking generators. It has the advantage that it works at rate 1/3 usin...
Martin Hell, Thomas Johansson
APLAS
2007
ACM
13 years 11 months ago
The Semantics of "Semantic Patches" in Coccinelle: Program Transformation for the Working Programmer
We rationally reconstruct the core of the Coccinelle system, used for automating and documenting collateral evolutions in Linux device drivers. A denotational semantics of the syst...
Neil D. Jones, René Rydhof Hansen
ECIS
2000
13 years 8 months ago
Constructing New Media
: Media are explored to envision, to design, and to implement platforms for knowledge management within communities. They actively shape, support and develop the community being re...
Martina Klose, Ulrike Lechner