Sciweavers

3645 search results - page 392 / 729
» Implementing mapping composition
Sort
View
ICFP
2002
ACM
16 years 6 months ago
Composing monads using coproducts
Monads are a useful abstraction of computation, as they model diverse computational effects such as stateful computations, exceptions and I/O in a uniform manner. Their potential ...
Christoph Lüth, Neil Ghani
ESORICS
2002
Springer
16 years 6 months ago
Computational Probabilistic Non-interference
In recent times information flow and non-interference have become very popular concepts for expressing both integrity and privacy properties. We present the first general definitio...
Michael Backes, Birgit Pfitzmann
EWSN
2008
Springer
16 years 6 months ago
A Component Framework for Content-Based Publish/Subscribe in Sensor Networks
Component-based architectures are the traditional approach cile application specific optimization with reusable abstractions in sensor networks. However, they frequently overwhelm ...
Adam Wolisz, Andreas Köpke, Andreas Willig, J...
ESOP
2010
Springer
16 years 4 months ago
Precise and Automated Contract-based Reasoning for Verification and Certification of Information Flow Properties of Programs wit
Abstract. Embedded information assurance applications that are critical to national and international infrastructures, must often adhere to certification regimes that require infor...
Torben Amtoft, John Hatcliff and Edwin Rodríguez
ICCAD
2008
IEEE
127views Hardware» more  ICCAD 2008»
16 years 3 months ago
Verification of arithmetic datapaths using polynomial function models and congruence solving
Abstract— This paper addresses the problem of solving finite word-length (bit-vector) arithmetic with applications to equivalence verification of arithmetic datapaths. Arithmet...
Neal Tew, Priyank Kalla, Namrata Shekhar, Sivaram ...