Sciweavers

1036 search results - page 183 / 208
» The case for a location metasystem
Sort
View
SIGSOFT
2007
ACM
14 years 8 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
SIGSOFT
2004
ACM
14 years 8 months ago
PSE: explaining program failures via postmortem static analysis
In this paper, we describe PSE (Postmortem Symbolic Evaluation), a static analysis algorithm that can be used by programmers to diagnose software failures. The algorithm requires ...
Roman Manevich, Manu Sridharan, Stephen Adams, Man...
WWW
2007
ACM
14 years 8 months ago
Web4CE: accessing web-based applications on consumer devices
In a world where all devices will be interconnected, the boundaries between the different devices will start to disappear. Devices will be able to access each other's applica...
Walter Dees, Paul Shrubsole
WWW
2006
ACM
14 years 8 months ago
Off the beaten tracks: exploring three aspects of web navigation
This paper presents results of a long-term client-side Web usage study, updating previous studies that range in age from five to ten years. We focus on three aspects of Web naviga...
Harald Weinreich, Hartmut Obendorf, Eelco Herder, ...
PPOPP
2009
ACM
14 years 8 months ago
Transactional memory with strong atomicity using off-the-shelf memory protection hardware
This paper introduces a new way to provide strong atomicity in an implementation of transactional memory. Strong atomicity lets us offer clear semantics to programs, even if they ...
Martín Abadi, Tim Harris, Mojtaba Mehrara