Sciweavers

4595 search results - page 917 / 919
» Reasoning about Plans
Sort
View
POPL
2012
ACM
12 years 3 months ago
Algebraic foundations for effect-dependent optimisations
We present a general theory of Gifford-style type and effect annotations, where effect annotations are sets of effects. Generality is achieved by recourse to the theory of algebra...
Ohad Kammar, Gordon D. Plotkin
TACAS
2012
Springer
277views Algorithms» more  TACAS 2012»
12 years 3 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...
PLDI
2012
ACM
11 years 10 months ago
Dynamic synthesis for relaxed memory models
Modern architectures implement relaxed memory models which may reorder memory operations or execute them non-atomically. Special instructions called memory fences are provided, al...
Feng Liu, Nayden Nedev, Nedyalko Prisadnikov, Mart...
PLDI
2012
ACM
11 years 10 months ago
Automated error diagnosis using abductive inference
When program verification tools fail to verify a program, either the program is buggy or the report is a false alarm. In this situation, the burden is on the user to manually cla...
Isil Dillig, Thomas Dillig, Alex Aiken
PLDI
2012
ACM
11 years 10 months ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa