Results 1 - 10 of 3,231

Slicing Concurrent Logic Programs

by Jianjun Zhao, Jingde Cheng, Kazuo Ushijima - In Proc. 2nd Fuji Int. Workshop on Functional and Logic Programming, Shonan Village , 1997
"... Program slicing has been widely studied for imperative programs, but for logic programs it is just starting. In this paper we address the problem of slicing concurrent logic programs. To solve this problem, we propose three types of primary program dependences between arguments in concurrent logic p ..."
Abstract - Cited by 15 (5 self) - Add to MetaCart
Program slicing has been widely studied for imperative programs, but for logic programs it is just starting. In this paper we address the problem of slicing concurrent logic programs. To solve this problem, we propose three types of primary program dependences between arguments in concurrent logic

Slicing Concurrent Logic Programs

by Jianjun Zhao And, Jianjun Zhao, Jingde Cheng, Kazuo Ushijima - In Proc. 2nd Fuji Int. Workshop on Functional and Logic Programming, Shonan Village , 1997
"... Program slicing has been widely studied for imperative programs, but for logic programs it is just starting. In this paper we address the problem of slicing concurrent logic programs. To solve this problem, we propose three types of primary program dependences between arguments in concurrent logi ..."
Abstract - Add to MetaCart
Program slicing has been widely studied for imperative programs, but for logic programs it is just starting. In this paper we address the problem of slicing concurrent logic programs. To solve this problem, we propose three types of primary program dependences between arguments in concurrent

On Composing Concurrent Logic Processes

by Jean-marie Jacquet, Koen De Bosschere , 1995
"... This paper discusses two methodological approaches for combining concurrent programs written in a modular way. The first one is based on the composition of traces. It is intuitive and simple but evidences the need for a more abstract approach. The second one meets this need. It composes specificatio ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
specifications written in a UNITY-like temporal logic, and rests on Abadi and Lamport's composition principle ([1]). The two methodologies are explained using the concurrent logic programming language Log but can actually be applied to other concurrent logic languages such as Delta-Prolog ([3])), Shared

Search In Concurrent Logic Languages

by Matthew Huntbach , 1993
"... Starting from a simple declarative all-solutions program, we develop a variety of search programs in the concurrent logic language RGDC [Cohen et al 92], leading up to a full heuristics-guided parallel version of branch-and-bound search. Our programs are general enough to be useable in a variety of ..."
Abstract - Add to MetaCart
Starting from a simple declarative all-solutions program, we develop a variety of search programs in the concurrent logic language RGDC [Cohen et al 92], leading up to a full heuristics-guided parallel version of branch-and-bound search. Our programs are general enough to be useable in a variety

Abductive Behaviour Of Concurrent Logic Programs

by George Papadopoulos - Proc. Third Golden West Conference on Intelligent Systems, ACM SIGART, Las Vegas, Kluwer Academic Publishers , 1994
"... We present a possible way to model abduction within the framework of concurrent logic programming. In particular, we describe an extension to the concurrent logic programming language PARLOG and an associated computational model which allows a user to specify an abductive behaviour for a concurrent ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
We present a possible way to model abduction within the framework of concurrent logic programming. In particular, we describe an extension to the concurrent logic programming language PARLOG and an associated computational model which allows a user to specify an abductive behaviour for a concurrent

Concurrent Logic Programming in Linear Logic

by Jirí Zlatuska
"... . A proof-theoretic semantics based on linear logic is developed for committed-choice logic languages, represented here by Flat Concurrent Prolog. Several fragments of linear logic are used in order to provide for a suitable translation of guarded clauses clauses, with the committed-choiceconcur ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
. A proof-theoretic semantics based on linear logic is developed for committed-choice logic languages, represented here by Flat Concurrent Prolog. Several fragments of linear logic are used in order to provide for a suitable translation of guarded clauses clauses, with the committed

Mode checking in the Concurrent Logical Framework

by Jorge Luis, Sacchini Iliano Cervesato, Frank Pfenning , 2014
"... We define and prove correct a mode checker for a significant fragment of the concurrent logical framework CLF. ∗ This paper was made possible by grant 09-1107-1-168, Formal Reasoning about Languages for Distributed ..."
Abstract - Add to MetaCart
We define and prove correct a mode checker for a significant fragment of the concurrent logical framework CLF. ∗ This paper was made possible by grant 09-1107-1-168, Formal Reasoning about Languages for Distributed

A Concurrent Logical Relation

by Lars Birkedal, Filip Sieczkowski, Jacob Thamsborg
"... Abstract—We present a logical relation for showing the correctness of program transformations based on a new type-and-effect system for a concurrent extension of an ML-like language with higher-order functions, higher-order store and dynamic memory allocation. We show how to use our model to verify ..."
Abstract - Cited by 4 (1 self) - Add to MetaCart
Abstract—We present a logical relation for showing the correctness of program transformations based on a new type-and-effect system for a concurrent extension of an ML-like language with higher-order functions, higher-order store and dynamic memory allocation. We show how to use our model to verify

Programming in concurrent logic languages

by Matthew Huntbach, Matthew Huntbach - IEEE Software , 1995
"... Coordination using a Single-Writer Multiple-Reader ..."
Abstract - Cited by 5 (1 self) - Add to MetaCart
Coordination using a Single-Writer Multiple-Reader

Concurrent Logic and Automata Combined:

by J. K. F. Bowles, S. Moschoyiannis
"... In this paper, we describe a true-concurrent hierarchical logic interpreted over concurrent automata. Concurrent automata constitute a special kind of asynchronous transition system (ATS) used for modelling the behaviour of components as understood in component-based software development. Here, a co ..."
Abstract - Add to MetaCart
In this paper, we describe a true-concurrent hierarchical logic interpreted over concurrent automata. Concurrent automata constitute a special kind of asynchronous transition system (ATS) used for modelling the behaviour of components as understood in component-based software development. Here, a
Results 1 - 10 of 3,231