Information Flow in Concurrent Logic Programming
Antoun Yaacoub
Lebanese University, Faculty of Sciences, Hadath, Lebanon.
Ali Awada *
Lebanese University, Faculty of Sciences, Hadath, Lebanon.
Habib Kobeissi
Lebanese University, Faculty of Sciences, Hadath, Lebanon.
*Author to whom correspondence should be addressed.
Abstract
This paper presents a new formalization of information flow detection in concurrent logic programming and applies it to the problem of deadlock detection. This work is based on a recent study of the detection of information flow in Datalog programs. Firstly, we define the concept of information flow in concurrent logic programming. Then, we propose a set of definitions of flow based on observation and transition systems while solving goals. Finally, we formalize a mechanism for deadlock detection in concurrent logic programs.
Keywords: Information flow, Concurrent logic programming, Transition systems, Observation, Deadlock detection