Projekter pr. år
Abstract
We present a logical relation for showing the correctness of program transformations based on a new type-and-effect system for a concurrent extension of an ML-like language with higher-order functions, higher-order store and dynamic memory allocation.
We show how to use our model to verify a number of interesting program transformations that rely on effect annotations. In particular, we prove a Parallelization Theorem, which expresses when it is sound to run two expressions in parallel instead of sequentially. The conditions are expressed solely in terms of the types and effects of the expressions. To the best of our knowledge, this is the first such result for a concurrent higher-order language with higher-order store and
dynamic memory allocation.
We show how to use our model to verify a number of interesting program transformations that rely on effect annotations. In particular, we prove a Parallelization Theorem, which expresses when it is sound to run two expressions in parallel instead of sequentially. The conditions are expressed solely in terms of the types and effects of the expressions. To the best of our knowledge, this is the first such result for a concurrent higher-order language with higher-order store and
dynamic memory allocation.
| Originalsprog | Engelsk |
|---|---|
| Tidsskrift | Dagstuhl Seminar Proceedings |
| Vol/bind | 16 |
| Antal sider | 21 |
| ISSN | 1862-4405 |
| DOI | |
| Status | Udgivet - 2012 |
Emneord
- verification
- logical relation
- concurrency
- type and effect system
Fingeraftryk
Dyk ned i forskningsemnerne om 'A Concurrent Logical Relation'. Sammen danner de et unikt fingeraftryk.Projekter
- 1 Afsluttet
-
ToMeSo: Tools and Methods for Scalable Software Verifications
Sestoft, P. (CoI), Birkedal, L. (PI), Mehnert, H. (CoI), Jensen, J. B. (CoI), Bengtson, J. (CoI), Thamsborg, J. J. (CoI), Hartmann Jensen, M. (CoI), Sieczkowski, F. (CoI), Mehnert, H. (CoI) & Svendsen, K. (CoI)
01/03/2009 → 30/06/2013
Projekter: Projekt › Forskning