Towards Type-theoretic semantics for transactional concurrency

Proceedings of the 2009 ACM SIGPLAN Workshop on Types in Language Design and Implementation, TLDI'09

Volumn , Issue , 2009, Pages 79-90

  Nanevski, Aleksandar ^a   Govereau, Paul ^b   Morrisett, Greg ^b  

^a MICROSOFT RESEARCH   (United Kingdom)

^b HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENT PROGRAM; CRITICAL SECTIONS; DEPENDENT TYPE THEORY; DESCRIPTORS; DESIGN BUILD; HIGHER ORDER; LOCAL STATE; OPERATIONAL SEMANTICS; PROGRAMMING LANGUAGE; SEPARATION LOGIC; SPACE REQUIREMENTS; THEORETIC SEMANTICS; TRANSACTIONAL MEMORY; TYPE THEORY;

PARALLEL PROCESSING SYSTEMS; SEMANTICS; SPECIFICATIONS;

LINGUISTICS;

EID: 67650091442     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1481861.1481872     Document Type: Conference Paper

References (35)

1. L. Augustsson. Cayenne - a language with dependent types. In ICFP'98, pages 239-250.
2. M. Berger, K. Honda, and N. Yoshida. A logical analysis of aliasing in imperative higher-order functions. In ICFP'05, pages 280-293. (Pubitemid 43916323)
3. S. Brookes. A semantics for concurrent separation logic. In CONCUR'04, pages 16-34. (Pubitemid 39210748)
4. C. Chen and H. Xi. Combining programming with theorem proving. In ICFP'05, pages 66-77. (Pubitemid 43907034)
5. E. W. Dijkstra. Guarded commands, nondeterminacy and formal derivation of programs. Communications of the ACM, 18(8):453-457, 1975.
6. X. Feng, R. Ferreira, and Z. Shao. On the relationship between concurrent separation logic and assume-guarantee reasoning. In ESOP'07, pages 173-188. (Pubitemid 350259491)
7. C. Flanagan. Hybrid type checking. In POPL'06, pages 245-256. (Pubitemid 43906974)
8. A. Gotsman, J. Berdine, B. Cook, N. Rinetzky, and M. Sagiv. Local reasoning for storable locks and threads. In APLAS'07, pages 19-38.
9. T. Harris and K. Fraser. Language support for lightweight transactions. ACM SIGPLAN Notices, 38(11):388-402, Nov. 2003.
10. T. Harris, S. Marlow, S. L. P. Jones, and M. Herlihy. Composable memory transactions. In PPoPP'05, pages 48-60. (Pubitemid 43182832)
11. A. Hobor, A. W. Appel, and F. Z. Nardelli. Oracle Semantics for Concurrent Separation Logic. In ESOP'08, pages 353-367.
12. N. Krishnaswami. Separation logic for a higher-order typed language. In SPACE'06, pages 73-82.
13. Z. Luo. An Extended Calculus of Constructions. PhD thesis, University of Edinburgh, 1990.
14. Y. Mandelbaum, D. Walker, and R. Harper. An effective theory of type refinements. In ICFP'03, pages 213-226.
15. The Coq development team. The Coq proof assistant reference manual. LogiCal Project, 2004. Version 8.0.
16. C. McBride and J. McKinna. The view from the left. Journal of Functional Programming, 14(1):69-111, January 2005. (Pubitemid 38172187)
17. J. L. McCarthy. Towards a mathematical science of computation. In IFIP Congress, pages 21-28, 1962.
18. E. Moggi. Notions of computation and monads. Information and Computation, 93(1):55-92, 1991. (Pubitemid 21700565)
19. K. F. Moore and D. Grossman. High level small step operational semantics for transactions. In Workshop on Transactional Computing, August 2007.
20. A. Nanevski, A. Ahmed, G. Morrisett, and L. Birkedal. Abstract Predicates and Mutable ADTs in Hoare Type Theory. In ESOP'07, pages 189-204. (Pubitemid 350259492)
21. A. Nanevski, P. Govereau, and G. Morriset. Type-theoretic semantics for transactional concurrency. Technical Report TR-09-107, Harvard University, July 2007.
22. A. Nanevski, G. Morrisett, and L. Birkedal. Hoare Type Theory, Polymorphism and Separation. Journal of Functional Programming, 18(5&6):865-911, 2008.
23. A. Nanevski, G. Morrisett, A. Shinnar, P. Govereau, and L. Birkedal Ynot: dependent types for imperative programs In ICFP'08, pages 229-240.
24. P. O'Hearn, J. Reynolds, and H. Yang. Local reasoning about programs that alter data structures. In CSL'01, pages 1-19. (Pubitemid 33332625)
25. P. W. O'Hearn. Resources, concurrency and local reasoning. Theoretical Computer Science, 375(1-3):271-307, May 2007. (Pubitemid 46528653)
26. P. W. O'Hearn, H. Yang, and J. C. Reynolds. Separation and information hiding. In POPL'04, pages 268-280.
27. S. Owicki and D. Gries. Verifying properties of parallel programs: an axiomatic approach. Communications of the ACM, 19(5):279-285, 1976.
28. R. L. Petersen, L. Birkedal, A. Nanevski, and G. Morrisett. A realizability model for impredicative Hoare Type Theory. In ESOP'08, pages 337-352.
29. Z. Shao, V. Trifonov, B. Saha, and N. Papaspyrou. A type system for certified binaries. ACM Transactions on Programming Languages and Systems, 27(1):1-45, January 2005. (Pubitemid 40232357)
30. T. Sheard. Languages of the future. In OOPSLA'04, pages 116-119.
31. V. Vafeiadis and M. Parkinson. A marriage of rely/guarantee and separation logic. In CONCUR'07, pages 256-271.
32. K. Watkins, I. Cervesato, F. Pfenning, and D. Walker. A concurrent logical framework: The propositional fragment. In Types for Proofs and Programs, volume 3085 of Lecture Notes in Computer Science, pages 355-377. (Pubitemid 38883822)
33. H. Xi and F. Pfenning. Eliminating array bound checking through dependent types. In PLDI'98, pages 249-257. (Pubitemid 128454801)
34. H. Xi and F. Pfenning. Dependent types in practical programming. In POPL'99, pages 214-227.
35. D. Zhu and H. Xi. Safe programming with pointers through stateful views. In PADL'05, pages 83-97.