Sciweavers

314 search results - page 61 / 63
» Compactness Properties for Stable Semantics of Logic Program...
Sort
View
SIGSOFT
1996
ACM
15 years 1 months ago
Abstracting Dependencies between Software Configuration Items
ing Dependencies between Software Configuration Items CARL A. GUNTER University of Pennsylvania icle studies an abstract model of dependencies between software configuration items ...
Carl A. Gunter
ICFP
2005
ACM
15 years 9 months ago
Modular verification of concurrent assembly code with dynamic thread creation and termination
Proof-carrying code (PCC) is a general framework that can, in principle, verify safety properties of arbitrary machine-language programs. Existing PCC systems and typed assembly l...
Xinyu Feng, Zhong Shao
CJ
2004
105views more  CJ 2004»
14 years 9 months ago
Generalized Template Splay: A Basic Theory and Calculus
act interpretation. R. Barbuti, C. Bernardeschi and N. De Francesco With mobile technology more and more prominent, the problem of security leakages becomes more and more important...
George F. Georgakopoulos, David J. McClurkin
IEEEARES
2006
IEEE
15 years 3 months ago
Sandboxing in myKlaim
The µKlaim calculus is a process algebra designed to study the programming of distributed systems consisting of a number of locations each having their own tuple space and collec...
René Rydhof Hansen, Christian W. Probst, Fl...
ECOOP
2009
Springer
15 years 10 months ago
Failboxes: Provably Safe Exception Handling
The primary goal of exception mechanisms is to help ensure that when an operation fails, code that depends on the operation's successful completion is not executed (a property...
Bart Jacobs 0002, Frank Piessens