Sciweavers

1020 search results - page 155 / 204
» Tight Semantics for Logic Programs
Sort
View
TLCA
2007
Springer
15 years 6 months ago
A Substructural Type System for Delimited Continuations
We propose type systems that abstractly interpret small-step rather than big-step operational semantics. We treat an expression or evaluation context as a structure in a linear log...
Oleg Kiselyov, Chung-chieh Shan
ASIAN
2009
Springer
308views Algorithms» more  ASIAN 2009»
15 years 28 days ago
Automated Security Proof for Symmetric Encryption Modes
Abstract. We presents a compositional Hoare logic for proving semantic security of modes of operation for symmetric key block ciphers. We propose a simple programming language to s...
Martin Gagné, Pascal Lafourcade, Yassine La...
PPDP
2005
Springer
15 years 5 months ago
ReactiveML: a reactive extension to ML
We present ReactiveML, a programming language dedicated to the implementation of complex reactive systems as found in graphical user interfaces, video games or simulation problems...
Louis Mandel, Marc Pouzet
CORR
2010
Springer
152views Education» more  CORR 2010»
14 years 12 months ago
A Non-Null Annotation Inferencer for Java Bytecode
We present a non-null annotations inferencer for the Java bytecode language. We previously proposed an analysis to infer non-null annotations and proved it soundness and completen...
Laurent Hubert
ASPLOS
2004
ACM
15 years 5 months ago
Fingerprinting: bounding soft-error detection latency and bandwidth
Recent studies have suggested that the soft-error rate in microprocessor logic will become a reliability concern by 2010. This paper proposes an efficient error detection techniqu...
Jared C. Smolens, Brian T. Gold, Jangwoo Kim, Baba...