Sciweavers

26354 search results - page 5046 / 5271
» How we refactor, and how we know it
Sort
View
CADE
2007
Springer
16 years 2 months ago
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...
Yeting Ge, Clark Barrett, Cesare Tinelli
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 2 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
OSDI
2006
ACM
16 years 2 months ago
Flight Data Recorder: Monitoring Persistent-State Interactions to Improve Systems Management
Mismanagement of the persistent state of a system--all the executable files, configuration settings and other data that govern how a system functions--causes reliability problems,...
Chad Verbowski, Emre Kiciman, Arunvijay Kumar, Bra...
OSDI
2006
ACM
16 years 2 months ago
EXPLODE: A Lightweight, General System for Finding Serious Storage System Errors
Storage systems such as file systems, databases, and RAID systems have a simple, basic contract: you give them data, they do not lose or corrupt it. Often they store the only copy...
Junfeng Yang, Can Sar, Dawson R. Engler
VLDB
2004
ACM
125views Database» more  VLDB 2004»
16 years 2 months ago
Automatic integration of Web search interfaces with WISE-Integrator
An increasing number of databases are becoming Web accessible through form-based search interfaces, and many of these sources are database-driven E-commerce sites. It is a daunting...
Hai He, Weiyi Meng, Clement T. Yu, Zonghuan Wu
« Prev « First page 5046 / 5271 Last » Next »