238 search results - page 39 / 48 » Compositional Proof Methods for Concurrency: A Semantic Appr... |
ICTAC
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. Many software applications are based on collaborating, yet competing, agents or virtual organisations exchanging services. Contracts, expressing obligations, permissions ...
IFM
2007
Springer
15 years 3 months ago
2007
Springer
We present an approach to modelling Abadi–Cardelli-style object calculi as Unifying Theories of Programming (UTP) designs. Here we provide a core object calculus with an operatio...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We discuss the problem of building a compiler which can lift in a provably correct way pieces of information on the execution cost of the object code to cost annotations on the so...
129
click to vote
TLDI
2010
ACM
15 years 6 months ago
2010
ACM
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
166
Voted
POPL
2005
ACM
15 years 10 months ago
2005
ACM
A lightweight logical approach to race-free sharing of heap storage between concurrent threads is described, based on the notion of permission to access. Transfer of permission be...