Sciweavers

313 search results - page 7 / 63
» Lazy Abstraction with Interpolants
Sort
View
ESORICS
2006
Springer
13 years 11 months ago
Secure Key-Updating for Lazy Revocation
Abstract. We consider the problem of efficient key management and user revocation in cryptographic file systems that allow shared access to files. A performanceefficient solution t...
Michael Backes, Christian Cachin, Alina Oprea
LICS
1994
IEEE
13 years 11 months ago
A Fully Abstract Semantics for Concurrent Graph Reduction
abstract semantics for concurrent graph reduction ALAN JEFFREY This paper presents a fully abstract semantics for a variant of the untyped -calculus with recursive declarations. We...
Alan Jeffrey
APLAS
2007
ACM
13 years 11 months ago
Monadic, Prompt Lazy Assertions in Haskell
Abstract. Assertions test expected properties of run-time values without disrupting the normal computation of a program. We present a library for enriching Haskell programs with as...
Olaf Chitil, Frank Huch
IFL
2000
Springer
135views Formal Methods» more  IFL 2000»
13 years 11 months ago
Freja, Hat and Hood - A Comparative Evaluation of Three Systems for Tracing and Debugging Lazy Functional Programs
Abstract. In this paper we compare three systems for tracing and debugging Haskell programs: Freja, Hat and Hood. We evaluate their usefulness in practice by applying them to a num...
Olaf Chitil, Colin Runciman, Malcolm Wallace
CAV
2010
Springer
176views Hardware» more  CAV 2010»
13 years 10 months ago
Lazy Annotation for Program Testing and Verification
Abstract. We describe an interpolant-based approach to test generation and model checking for sequential programs. The method generates Floyd/Hoare style annotations of the program...
Kenneth L. McMillan