Sciweavers

3446 search results - page 642 / 690
» A Reasoning Algorithm for pD*
Sort
View
POPL
2010
ACM
15 years 10 months ago
Counterexample-Guided Focus
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
Andreas Podelski, Thomas Wies
POPL
2010
ACM
15 years 10 months ago
Automatically Generating Instruction Selectors Using Declarative Machine Descriptions
Despite years of work on retargetable compilers, creating a good, reliable back end for an optimizing compiler still entails a lot of hard work. Moreover, a critical component of ...
João Dias, Norman Ramsey
PPOPP
2010
ACM
15 years 10 months ago
GAMBIT: effective unit testing for concurrency libraries
As concurrent programming becomes prevalent, software providers are investing in concurrency libraries to improve programmer productivity. Concurrency libraries improve productivi...
Katherine E. Coons, Sebastian Burckhardt, Madanlal...
SOSP
2005
ACM
15 years 10 months ago
BAR fault tolerance for cooperative services
This paper describes a general approach to constructing cooperative services that span multiple administrative domains. In such environments, protocols must tolerate both Byzantin...
Amitanand S. Aiyer, Lorenzo Alvisi, Allen Clement,...
TLDI
2009
ACM
155views Formal Methods» more  TLDI 2009»
15 years 10 months ago
Opis: reliable distributed systems in OCaml
The importance of distributed systems is growing as computing devices become ubiquitous and bandwidth becomes plentiful. Concurrency and distribution pose algorithmic and implemen...
Pierre-Évariste Dagand, Dejan Kostic, Vikto...