Sciweavers

503 search results - page 44 / 101
» Verifying Quantitative Properties Using Bound Functions
Sort
View
PODS
2005
ACM
131views Database» more  PODS 2005»
15 years 10 months ago
Buffering in query evaluation over XML streams
All known algorithms for evaluating advanced XPath queries (e.g., ones with predicates or with closure axes) on XML streams employ buffers to temporarily store fragments of the do...
Ziv Bar-Yossef, Marcus Fontoura, Vanja Josifovski
TACAS
2004
Springer
135views Algorithms» more  TACAS 2004»
15 years 3 months ago
Liveness with Incomprehensible Ranking
Abstract. The methods of Invisible Invariants and Invisible Ranking were developed originally in order to verify temporal properties of parameterized systems in a fully automatic m...
Yi Fang, Nir Piterman, Amir Pnueli, Lenore D. Zuck
PODC
2003
ACM
15 years 3 months ago
Performing work with asynchronous processors: message-delay-sensitive bounds
This paper considers the problem of performing tasks in asynchronous distributed settings. This problem, called DoAll, has been substantially studied in synchronous models, but th...
Dariusz R. Kowalski, Alexander A. Shvartsman
ISLPED
1996
ACM
110views Hardware» more  ISLPED 1996»
15 years 1 months ago
Statistical estimation of average power dissipation in CMOS VLSI circuits using nonparametric techniques
In this paper, we present a new statistical technique for estimation of average power dissipation in digital circuits. Present statistical techniques estimate the average power ba...
Li-Pen Yuan, Chin-Chi Teng, Sung-Mo Kang
SIGSOFT
2004
ACM
15 years 10 months ago
Testing static analysis tools using exploitable buffer overflows from open source code
Five modern static analysis tools (ARCHER, BOON, PolySpace C Verifier, Splint, and UNO) were evaluated using source code examples containing 14 exploitable buffer overflow vulnera...
Misha Zitser, Richard Lippmann, Tim Leek