Sciweavers

3544 search results - page 569 / 709
» Software Testing
Sort
View
SIGSOFT
2007
ACM
16 years 6 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
2002
ACM
16 years 6 months ago
Invariant inference for static checking
Static checking can verify the absence of errors in a program, but often requires written annotations or specifications. As a result, static checking can be difficult to use effec...
Jeremy W. Nimmer, Michael D. Ernst
EUROSYS
2010
ACM
16 years 3 months ago
The Next 700 BFT Protocols
Modern Byzantine fault-tolerant state machine replication (BFT) protocols involve about 20.000 lines of challenging C++ code encompassing synchronization, networking and cryptogra...
Rachid Guerraoui, Nikola Knezevic, Vivien Quéma, ...
EUROSYS
2006
ACM
16 years 3 months ago
Using queries for distributed monitoring and forensics
Distributed systems are hard to build, profile, debug, and test. Monitoring a distributed system – to detect and analyze bugs, test for regressions, identify fault-tolerance pr...
Atul Singh, Petros Maniatis, Timothy Roscoe, Peter...
DASFAA
2009
IEEE
195views Database» more  DASFAA 2009»
16 years 29 days ago
The XMLBench Project: Comparison of Fast, Multi-platform XML libraries
The XML technologies have brought a lot of new ideas and abilities in the field of information management systems. Nowadays, XML is used almost everywhere: from small configurati...
Suren Chilingaryan