Sciweavers

13383 search results - page 392 / 2677
» Abstractions from proofs
Sort
View
CRYPTO
1999
Springer
103views Cryptology» more  CRYPTO 1999»
15 years 11 months ago
Information Theoretically Secure Communication in the Limited Storage Space Model
Abstract. We provide a simple secret-key two-party secure communication scheme, which is provably information-theoretically secure in the limited-storage-space model. The limited-s...
Yonatan Aumann, Michael O. Rabin
EKAW
1999
Springer
15 years 11 months ago
Formally Verifying Dynamic Properties of Knowledge Based Systems
Abstract. In this paper we study dynamic properties of knowledge-based systems. We argue the importance of such dynamic properties for the construction and analysis of knowledge-ba...
Perry Groot, Annette ten Teije, Frank van Harmelen
LPAR
1999
Springer
15 years 11 months ago
Extensions to the Estimation Calculus
Abstract. Walther’s estimation calculus was designed to prove the termination of functional programs, and can also be used to solve the similar problem of proving the well-founde...
Jeremy Gow, Alan Bundy, Ian Green
194
Voted
DBPL
1997
Springer
133views Database» more  DBPL 1997»
15 years 11 months ago
Automatic Verification of Transactions on an Object-Oriented Database
Abstract. In the context of the object-oriented data model, a compiletime approach is given that provides for a significant reduction of the amount of run-time transaction overhead...
David Spelt, Herman Balsters
192
Voted
TAPSOFT
1997
Springer
15 years 11 months ago
Traces of I/O-Automata in Isabelle/HOLCF
Abstract. This paper presents a formalization of nite and in nite sequences in domain theory carried out in the theorem prover Isabelle. The results are used to model the metatheor...
Olaf Müller, Tobias Nipkow