1321 search results - page 209 / 265 » Subtyping in Logical Form |
157
click to vote
TCC
2007
Springer
16 years 11 days ago
2007
Springer
We prove a computational soundness theorem for symmetric-key encryption protocols that can be used to analyze security against adaptively corrupting adversaries (that is, adversar...
153
click to vote
IJCNN
2006
IEEE
16 years 9 days ago
2006
IEEE
Abstract— This paper presents the use of a newly created network structure known as a Self-Delaying Dynamic Network (SDN). The SDNs were created to process data which varies with...
189
click to vote
IPPS
2006
IEEE
16 years 9 days ago
2006
IEEE
Advanced wireless sensor network algorithms pose challenges to their formal modeling and analysis, such as modeling probabilistic and real-time behaviors and novel forms of commun...
173
click to vote
ACL2
2006
ACM
16 years 7 days ago
2006
ACM
We introduce the logical story behind file input in ACL2 and discuss the types of theorems that can be proven about filereading operations. We develop a low level library for re...
182
click to vote
HASKELL
2006
ACM
16 years 7 days ago
2006
ACM
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...