141 search results - page 16 / 29 » Automatically Proving Concurrent Programs Correct |
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...
SIGMOD
2006
ACM
14 years 7 months ago
2006
ACM
Current application development tools provide completely different programming models for the application server (e.g., Java and J2EE) and the client web browser (e.g., JavaScript...
ENTCS
2010
13 years 7 months ago
2010
This paper presents a formal framework for compositional reasoning about secure systems. A key insight is to view a trusted system in terms of the interfaces that the various comp...
LPAR
1999
Springer
13 years 12 months ago
1999
Springer
In this work, we develop a partial evaluation technique for residuating functional logic programs, which generalize the concurrent computation models for logic programs with delays...
ET
2010
13 years 6 months ago
2010
—Designers often apply manual or semi-automatic loop and data transformations on array and loop intensive programs to improve performance. For the class of static affine program...