Sciweavers

309 search results - page 43 / 62
» Termination proofs for systems code
Sort
View
PDPTA
2003
13 years 10 months ago
Disconnection Metadata for Distributed Applications in Mobile Environments
The need to continue to work in a mobile environment raises the problem of data availability in the presence of disconnections. Our approach aiming at solving this problem is to m...
Nabil Kouici, Denis Conan, Guy Bernard
ENTCS
2008
102views more  ENTCS 2008»
13 years 9 months ago
Programming Languages For Interactive Computing
Traditional programming languages are algorithmic: they are best suited to writing programs that acquire all their inputs before executing and only produce a result on termination...
Roly Perera
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 6 months ago
XSB: Extending Prolog with Tabled Logic Programming
The paradigm of Tabled Logic Programming (TLP) is now supported by a number of Prolog systems, including XSB, YAP Prolog, B-Prolog, Mercury, ALS, and Ciao. The reasons for this ar...
Terrance Swift, David Scott Warren
CTRSA
2005
Springer
79views Cryptology» more  CTRSA 2005»
14 years 2 months ago
Malicious Cryptography: Kleptographic Aspects
Abstract. In the last few years we have concentrated our research efforts on new threats to the computing infrastructure that are the result of combining malicious software (malwar...
Adam Young, Moti Yung
POPL
2009
ACM
14 years 9 months ago
Verifying distributed systems: the operational approach
This work develops an integrated approach to the verification of behaviourally rich programs, founded directly on operational semantics. The power of the approach is demonstrated ...
Tom Ridge