141 search results - page 14 / 29 » Automatically Proving Concurrent Programs Correct |
126
Voted
PLDI
2012
ACM
13 years 2 months ago
2012
ACM
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...
ESTIMEDIA
2003
Springer
15 years 4 months ago
2003
Springer
In order to extensively explore design space one has to specify a n a very abstract level. Transforming a specification into a correct implementation is usually an error prone tas...
115
click to vote
SIGMOD
2010
ACM
15 years 4 months ago
2010
ACM
To take full advantage of the parallelism offered by a multicore machine, one must write parallel code. Writing parallel code is difficult. Even when one writes correct code, the...
101
click to vote
ICLP
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
ICALP
2001
Springer
15 years 4 months ago
2001
Springer
A cryptographic protocol can be described as a system of concurrent processes, and analysis of the traces generated by this system can be used to verify authentication and secrecy ...