37 search results - page 6 / 8 » Termination in Impure Concurrent Languages |
APLAS
2004
ACM
14 years 1 months ago
2004
ACM
Abstract. In component-based programming, the programmer assembles applications from prefabricated components. The assembly process has two main steps: adapting a component by twea...
PLDI
2004
ACM
14 years 1 months ago
2004
ACM
e Synchronization Abstractions “Well, it just so happens that your friend here is only mostly dead. There’s a big difference between mostly dead and all dead.” – Miracle Ma...
POPL
2008
ACM
14 years 8 months ago
2008
ACM
The search for proof and the search for counterexamples (bugs) are complementary activities that need to be pursued concurrently in order to maximize the practical success rate of...
HASKELL
2009
ACM
14 years 2 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...
VL
1996
IEEE
13 years 11 months ago
1996
IEEE
ToonTalkTM is a general-purpose concurrent programming system in which the source code is animated and the programming environment is like a me. Every abstract computational aspec...