1226 search results - page 88 / 246 » Proofs, Programs and Abstract Complexity |
98
Voted
ESOP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Rely-guarantee is a well-established approach to reasoning about concurrent programs that use parallel composition. However, parallel composition is not how concurrency i...
125
click to vote
TLCA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
165
click to vote
HASKELL
2009
ACM
15 years 9 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...
127
Voted
FASE
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Abstraction is essential in the formal specification of programs. A common way of writing abstract specifications is to specify implementations in terms of basic mathem...
130
click to vote
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...