Sciweavers

1562 search results - page 284 / 313
» Convenience Over Correctness
Sort
View
PLDI
1997
ACM
15 years 1 months ago
Componential Set-Based Analysis
Set-based analysis is a constraint-based whole program analysis that is applicable to functional and objectoriented programming languages. Unfortunately, the analysis is useless f...
Cormac Flanagan, Matthias Felleisen
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
15 years 1 months ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or
SPDP
1993
IEEE
15 years 1 months ago
How to Share an Object: A Fast Timing-Based Solution
We consider the problem of transforming a given sequential implementation of a data structure into a wait-free concurrent implementation. Given the code for different operations ...
Rajeev Alur, Gadi Taubenfeld
POPL
1992
ACM
15 years 1 months ago
A Compilation Method for ML-Style Polymorphic Record Calculi
Polymorphic record calculi have recently attracted much attention as a typed foundation for objectoriented programming. This is based on the fact that a function that selects a fi...
Atsushi Ohori
84
Voted
CHI
2007
ACM
15 years 1 months ago
Social responses to virtual humans: implications for future interface design
Do human-human social interactions carry over to humanvirtual human social interactions? How does this affect future interface designers? We replicated classical tests of social i...
Catherine A. Zanbaka, Amy Catherine Ulinski, Paula...