Verification of the Temporal Properties of Dynamic Clean Processes Zoltán Horváth (1) Peter Achten (2) Tamás Kozsik (1) Rinus Plasmeijer (2) (1) Department of General Computer Science University Eötvös Loránd, Budapest, Hungary email: hz@ludens.elte.hu, tamas.kozsik@elte.hu (2) Faculty of Mathematics and Computer Science University Nijmegen, The Netherlands email: peter88@cs.kun.nl, rinus@cs.kun.nl Abstract The behavior of concurrent and parallel programs can be specified in a functional style. We introduced a relational model for synthesizing abstract parallel imperative programs this way earlier. In this paper we investigate the applicability of the specification and verification tools of the model for proving temporal properties of concrete programs written in a pure functional language, in Concurrent Clean. Destructive updates preserving referential transparency are possible in this language by using the so called unique types. For example Clean programs perform I/O by accessing their unique environment. Furthermore, dynamic types of Clean make it possible to load some pieces of the program during run-time. We present a methodology for proving safety and liveness properties of concurrent, interleaved Clean Object I/O processes that also use dynamic types and show simple examples for verification of correctness of such Clean programs.