Sciweavers

5377 search results - page 693 / 1076
» Programming Languages For Interactive Computing
Sort
View
ICALP
1994
Springer
15 years 9 months ago
On the Cost of Recomputing: Tight Bounds on Pebbling with Faults
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
Yonatan Aumann, Judit Bar-Ilan, Uriel Feige
ESOP
2000
Springer
15 years 8 months ago
A Calculus for Link-Time Compilation
We present a module calculus for studying a simple model of link-time compilation. The calculus is stratified into a term calculus, a core module calculus, and a linking calculus. ...
Elena Machkasova, Franklyn A. Turbak
ASPLOS
2008
ACM
15 years 7 months ago
How low can you go?: recommendations for hardware-supported minimal TCB code execution
We explore the extent to which newly available CPU-based security technology can reduce the Trusted Computing Base (TCB) for security-sensitive applications. We find that although...
Jonathan M. McCune, Bryan Parno, Adrian Perrig, Mi...
IEEESCC
2006
IEEE
15 years 11 months ago
Linking contracts, processes and services: an event-driven approach
This paper addresses the problem of mapping business contract conditions onto the messages and rules that represent service interactions in a collaborative business process. We de...
Zoran Milosevic, Maria E. Orlowska, Shazia Wasim S...
CHI
2008
ACM
16 years 5 months ago
Invoking emotional support in a health crisis
This dissertation research explores the invocation of emotional support from friends and family for parents who have a baby in a Neonatal Intensive Care Unit, through the use of t...
Wendy Moncur