Sciweavers

4716 search results - page 449 / 944
» Iterative-free program analysis
Sort
View
COORDINATION
2009
Springer
16 years 7 months ago
Exceptionally Safe Futures
A future is a well-known programming construct used to introduce concurrency to sequential programs. Computations annotated as futures are executed asynchronously and run concurren...
Armand Navabi, Suresh Jagannathan
POPL
2007
ACM
16 years 7 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...
SECON
2007
IEEE
16 years 1 months ago
High-Level Application Development is Realistic for Wireless Sensor Networks
—Programming Wireless Sensor Network (WSN) applications is known to be a difficult task. Part of the problem is that the resource limitations of typical WSN nodes force programm...
Marcin Karpinski, Vinny Cahill
TAP
2007
Springer
113views Hardware» more  TAP 2007»
16 years 29 days ago
Combining Static and Dynamic Reasoning for Bug Detection
Many static and dynamic analyses have been developed to improve program quality. Several of them are well known and widely used in practice. It is not entirely clear, however, how ...
Yannis Smaragdakis, Christoph Csallner
SCAM
2006
IEEE
16 years 26 days ago
SMART C: A Semantic Macro Replacement Translator for C
Programmers often want to transform the source or binary representations of their programs (e.g., to optimize, add dynamic safety checks, or add profile gathering code). Unfortun...
Matthew Jacobs, E. Christopher Lewis