691 search results - page 90 / 139 » Automatically Proving Linearizability |
POPL
2006
ACM
14 years 10 months ago
2006
ACM
In the spirit of Landin, we present a calculus of dependent types to serve as the semantic foundation for a family of languages called data description languages. Such languages, ...
POPL
2006
ACM
14 years 10 months ago
2006
ACM
Concurrency-related bugs may happen when multiple threads access shared data and interleave in ways that do not correspond to any sequential execution. Their absence is not guaran...
CADE
2008
Springer
14 years 10 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
ICSE
2007
IEEE-ACM
14 years 10 months ago
2007
IEEE-ACM
The Verifying Compiler (VC) project is a core component of the Dependable Systems Evolution Grand Challenge. The VC offers the promise of automatically proving that a program or c...
MOBISYS
2007
ACM
14 years 9 months ago
2007
ACM
Wireless sensor networks have become increasingly common in everyday applications due to decreasing technology costs and improved product reliability. An ideal application for wire...