Sciweavers

338 search results - page 32 / 68
» A Formal Approach to Heuristically Test Restorable Systems
Sort
View
FM
2006
Springer
133views Formal Methods» more  FM 2006»
14 years 9 days ago
Enforcer - Efficient Failure Injection
Non-determinism of the thread schedule is a well-known problem in concurrent programming. However, other sources of non-determinism exist which cannot be controlled by an applicati...
Cyrille Artho, Armin Biere, Shinichi Honiden
OOPSLA
2010
Springer
13 years 7 months ago
Random testing for higher-order, stateful programs
Testing is among the most effective tools available for finding bugs. Still, we know of no automatic technique for generating test cases that expose bugs involving a combination ...
Casey Klein, Matthew Flatt, Robert Bruce Findler
COCO
2003
Springer
102views Algorithms» more  COCO 2003»
14 years 1 months ago
Memoization and DPLL: Formula Caching Proof Systems
A fruitful connection between algorithm design and proof complexity is the formalization of the ¤¦¥¨§©§ approach to satisfiability testing in terms of tree-like resolution...
Paul Beame, Russell Impagliazzo, Toniann Pitassi, ...
INFOCOM
2003
IEEE
14 years 1 months ago
Topology Inference in the Presence of Anonymous Routers
— Many topology discovery systems rely on traceroute to discover path information in public networks. However, for some routers, traceroute detects their existence but not their ...
Bin Yao, Ramesh Viswanathan, Fangzhe Chang, Dan G....
CC
2010
Springer
117views System Software» more  CC 2010»
14 years 3 months ago
Punctual Coalescing
Compilers use register coalescing to avoid generating code for copy instructions. For architectures with register aliasing such as x86, Smith, Ramsey, and Holloway (2004) presented...
Fernando Magno Quintão Pereira, Jens Palsbe...