4 search results - page 1 / 1 » Compositional Termination Proofs for Multi-threaded Programs |
TACAS
2012
Springer
12 years 23 days ago
2012
Springer
Abstract. Automated verification of multi-threaded programs is difficult. Direct treatment of all possible thread interleavings by reasoning about the program globally is a prohib...
LOGCOM
2007
13 years 5 months ago
2007
Various forms of rely/guarantee conditions have been used to record and reason about interference in ways that provide compositional development methods for concurrent programs. Th...
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
HASKELL
2009
ACM
13 years 11 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...