Sciweavers

691 search results - page 9 / 139
» Automatically Proving Linearizability
Sort
View
BIRTHDAY
2007
Springer
14 years 4 months ago
Orderings and Constraints: Theory and Practice of Proving Termination
In contrast to the current general way of developing tools for proving termination automatically, this paper intends to show an alternative program based on using on the one hand t...
Cristina Borralleras, Albert Rubio
CADE
1998
Springer
14 years 2 months ago
Automated Theorem Proving in a Simple Meta-Logic for LF
Abstract. Higher-order representation techniques allow elegant encodings of logics and programming languages in the logical framework LF, but unfortunately they are fundamentally i...
Carsten Schürmann, Frank Pfenning
FM
2009
Springer
95views Formal Methods» more  FM 2009»
14 years 4 months ago
It's Doomed; We Can Prove It
Abstract. Programming errors found early are the cheapest. Tools applying to the early stage of code development exist but either they suffer from false positives (“noise”) or...
Jochen Hoenicke, K. Rustan M. Leino, Andreas Podel...
EUROSYS
2011
ACM
13 years 1 months ago
Finding complex concurrency bugs in large multi-threaded applications
Parallel software is increasingly necessary to take advantage of multi-core architectures, but it is also prone to concurrency bugs which are particularly hard to avoid, find, an...
Pedro Fonseca, Cheng Li, Rodrigo Rodrigues
TACAS
2012
Springer
277views Algorithms» more  TACAS 2012»
12 years 5 months ago
Proving Reachability Using FShell - (Competition Contribution)
FShell is an automated white-box test-input generator for C programs, computing test data with respect to user-specified code coverage criteria. The pillars of FShell are the decl...
Andreas Holzer, Daniel Kroening, Christian Schallh...