Sciweavers

3653 search results - page 467 / 731
» On Recognizable Timed Languages
Sort
View
ASPLOS
2011
ACM
14 years 10 months ago
Mementos: system support for long-running computation on RFID-scale devices
Transiently powered computing devices such as RFID tags, kinetic energy harvesters, and smart cards typically rely on programs that complete a task under tight time constraints be...
Benjamin Ransford, Jacob Sorber, Kevin Fu
ICALP
2011
Springer
14 years 10 months ago
New Algorithms for Learning in Presence of Errors
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
Sanjeev Arora, Rong Ge
VEE
2012
ACM
226views Virtualization» more  VEE 2012»
14 years 2 months ago
Protecting applications against TOCTTOU races by user-space caching of file metadata
Time Of Check To Time Of Use (TOCTTOU) race conditions for file accesses in user-space applications are a common problem in Unix-like systems. The mapping between filename and i...
Mathias Payer, Thomas R. Gross
CASES
2009
ACM
16 years 1 months ago
Tight WCRT analysis of synchronous C programs
Accurate estimation of the tick length of a synchronous program is essential for efficient and predictable implementations that are devoid of timing faults. The techniques to dete...
Partha S. Roop, Sidharta Andalam, Reinhard von Han...
OOPSLA
2005
Springer
16 years 3 days ago
Demand-driven points-to analysis for Java
We present a points-to analysis technique suitable for environments with small time and memory budgets, such as just-in-time (JIT) compilers and interactive development environmen...
Manu Sridharan, Denis Gopan, Lexin Shan, Rastislav...