Sciweavers

429 search results - page 62 / 86
» Theorem Proving Languages for Verification
Sort
View
SIGSOFT
2008
ACM
14 years 9 months ago
Finding programming errors earlier by evaluating runtime monitors ahead-of-time
Runtime monitoring allows programmers to validate, for instance, the proper use of application interfaces. Given a property specification, a runtime monitor tracks appropriate run...
Eric Bodden, Patrick Lam, Laurie J. Hendren
POPL
2009
ACM
14 years 9 months ago
The semantics of x86-CC multiprocessor machine code
Multiprocessors are now dominant, but real multiprocessors do not provide the sequentially consistent memory that is assumed by most work on semantics and verification. Instead, t...
Susmit Sarkar, Peter Sewell, Francesco Zappa Narde...
SIGSOFT
1996
ACM
14 years 26 days ago
Abstracting Dependencies between Software Configuration Items
ing Dependencies between Software Configuration Items CARL A. GUNTER University of Pennsylvania icle studies an abstract model of dependencies between software configuration items ...
Carl A. Gunter
MICS
2010
81views more  MICS 2010»
13 years 7 months ago
Tactics for Hierarchical Proof
Abstract. There is something of a discontinuity at the heart of popular tactical theorem provers. Low-level, fully-checked mechanical proofs are large trees consisting of primitive...
David Aspinall, Ewen Denney, Christoph Lüth
PLDI
2012
ACM
11 years 11 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