691 search results - page 71 / 139 » Automatically Proving Linearizability |
149
click to vote
LOPSTR
2004
Springer
15 years 11 months ago
2004
Springer
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
170
click to vote
ESTIMEDIA
2003
Springer
15 years 11 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...
153
click to vote
GCC
2003
Springer
15 years 11 months ago
2003
Springer
This paper introduces a method for automatic composition of semantic web services using linear logic theorem proving. The method uses semantic web service language (DAML-S) for ext...
169
click to vote
ICLP
2003
Springer
15 years 11 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...
164
click to vote
ICALP
2001
Springer
15 years 10 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 ...