Runtime Verification of Concurrent Haskell Programs

Runtime Verification of Concurrent Haskell (work in progress)

In this article we use model checking techniques to debug Concurrent Haskell programs. LTL formulas specifying assertions or other properties are verified at runtime. If a formula cannot be satisfied, the debugger emits a warning and prints the path leading to the violation. It is possible to dynamically add formulas at runtime, giving a degree of flexibility which is not available in static ve...

Runtime verification of programs using rule-based active system

Functional and (Constraint) Logic Programming, Proc. of the 12th International Workshop, WFLP 2003

Correction of Functional Programs . . . . . . . . . . . . . . . . . . . . . . . . . . 7M. Alpuente (U.P. Valencia), D. Ballis (U. Udine), S. Escobar (U.P.Valencia), M. Falaschi (U. Udine), and S. Lucas (U.P. Valencia) Runtime Verification of Concurrent Haskell (work in progress) . . . . . . . . . . 21V. Stolz (RWTH Aachen) and F. Huch (CAU Kiel) Functional Logic Programming I A Mona...

Composable scheduler activations for Haskell

The runtime for a modern, concurrent, garbage collected language like Haskell is like an operating system: sophisticated, complex, performant, but alas very hard to change. If more of the runtime system were in Haskell it would become far more modular and malleable. In this paper we describe a new concurrency design that allows the scheduler for concurrent and parallel programs to be written in...

A Haskell-Implementation of STM Haskell with Early Conflict Detection

Software transactional memory treats operations on the shared memory in concurrent programs like data base transactions. STM Haskell integrates this approach in Haskell and provides combinators to build software transactions in a composable way. In previous work we introduced the process calculus CSHF as a formal model for a concurrent implementation of software transactional memory in Concurre...