Skip to content
Research Article Open access CC BY 4.0

Information Flow in Concurrent Logic Programming

Antoun Yaacoub, Ali Awada, Habib Kobeissi

Journal of Advances in Mathematics and Computer Science · pp. 367–382 · Published 11 Nov 2014

10.9734/BJMCS/2015/14398

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.

Information flow Concurrent logic programming Transition systems Observation Deadlock detection

Cited by 5

Bottom-Up Bisimilar Datalog Goals

Antoun Yaacoub, Z. Assaghir · 2017

On the decidability of the information flow in Datalog using Magic Sets

Antoun Yaacoub, Hassan Safwan, P. student · 2017

Article metrics

Real usage data collected on this platform.

4

Page views

0

PDF downloads

0

Outbound clicks

5

Citations

Views over time

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

Traffic sources

Referring site, by host.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.