141 search results - page 11 / 29 » Automatically Proving Concurrent Programs Correct |
120
click to vote
MICRO
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract--Parallel programming is hard, because it is impractical to test all possible thread interleavings. One promising approach to improve a multi-threaded program's relia...
122
click to vote
APSEC
2005
IEEE
15 years 7 months ago
2005
IEEE
— Invariant based programming is an approach to program construction where we provide the program pre- and postconditions as well as loop invariants before we construct the code ...
129
click to vote
VMCAI
2009
Springer
15 years 8 months ago
2009
Springer
There has been a lot of recent research on transaction-based concurrent programming, aimed at offering an easier concurrent programming paradigm that enables programmers to better...
POPL
2010
ACM
15 years 11 months ago
2010
ACM
Serializability is a commonly used correctness condition in concurrent programming. When a concurrent module is serializable, certain other properties of the module can be verifie...
100
click to vote
CADE
2007
Springer
16 years 2 months ago
2007
Springer
Abstract. Hoare logic is widely used for software specification and verification. Frequently we need to prove the total correctness of a program: to prove that the program not only...