28,423 Hits in 8.9 sec

Reconciling Systems and Deductive Capabilities in Knowledge Based Systems Using Logic Programming [chapter]

Hamish Taylor
1992 Logic Programming New Frontiers  
A comprehensive approach to programming concurrent knowledge based systems in logic must cater for both knowledge processing and systems handling capabilities.  ...  This paper reviews requirements for supporting both capabilities in a resolution based framework, and considers logic programming schemes which sustain each kind of capability.  ...  using choice points in an efficient Prolog-based manner.  ... 
doi:10.1007/978-94-011-2562-8_12 fatcat:yryf3yb4f5g3xfdyfezrbtzmhe

Parallel execution of prolog programs: a survey

Gopal Gupta, Enrico Pontelli, Khayri A.M. Ali, Mats Carlsson, Manuel V. Hermenegildo
2001 ACM Transactions on Programming Languages and Systems  
The objective of this article is to provide a comprehensive survey of the issues arising in parallel execution of logic programming languages along with the most relevant approaches explored to date in  ...  Since the early days of logic programming, researchers in the field realized the potential for exploitation of parallelism present in the execution of logic programs.  ...  The &-Prolog system has been extended to support full concurrency in the language Carro and Hermenegildo 1999] , other types of parallelism (such as nonstrict [Cabeza and Hermenegildo 1994] and dependent  ... 
doi:10.1145/504083.504085 fatcat:7dms2hz5mzdsjezpgu2jnf4dsa

Formal verification of concurrent scheduling strategies using TLA

Gudmund Grov, Greg Michaelson, Andrew Ireland
2007 2007 International Conference on Parallel and Distributed Systems  
This paper will show how the TLA logic can be used to verify schedulers of concurrent components.  ...  This approach is illustrated with the Hume programming language, which is based on concurrent rich automata.  ...  In Hume, a program is a set of concurrent finite state automata, making it well suited to implement concurrent systems. We motivate and define a more efficient scheduling strategy for Hume.  ... 
doi:10.1109/icpads.2007.4447839 dblp:conf/icpads/GrovMI07 fatcat:p5zggcqt7fcgfppluchz7wer5e

Language constructs and runtime systems for compositional parallel programming [chapter]

Ian Foster, Carl Kesselman
1994 Lecture Notes in Computer Science  
In this paper, we discuss alternative approaches to the realization of this principle. We first provide a review and critical analysis of Strand, an early compositional programming language.  ...  In task-parallel programs, diverse activities can take place concurrently, and communication and synchronization patterns are complex and not easily predictable.  ...  These goals were met using a interpreter-and heap-based runtime system. (Similar techniques have been used in abstract machines for Id and other functional languages [18] .)  ... 
doi:10.1007/3-540-58430-7_2 fatcat:bfy4bjrjzbbudm3qkngbwlsfwe

Clean-Slate Development of Certified OS Kernels

Zhong Shao
2015 Proceedings of the 2015 Conference on Certified Programs and Proofs - CPP '15  
Typed VeriML programs serve as excellent proof witnesses, since they are much smaller than proof objects (in the meta logic).  ...  In place of the rigid safety conditions used in traditional extension mechanisms (e.g., that kernel extensions must be type-safe), our approach will assure both the safety and semantic correctness of extensions  ...  In recent years many languages with rich dependent type systems [11, 33, 73, 79] have been proposed.  ... 
doi:10.1145/2676724.2693180 dblp:conf/cpp/Shao15 fatcat:ffiwrhqsdnbcflselj27eevbre

Introduction to high-level synthesis

D.D. Gajski, L. Ramachandran
1994 IEEE Design & Test of Computers  
Bluespec's BSV is language targeted for specifying concurrency with rule-based atomic transactions.  ...  For instance, if there is parallelism in an HLS specification, it is extracted using dataflow analysis in accordance with the target technology's capabilities and performance goals (on a slow technology  ... 
doi:10.1109/54.329454 fatcat:xob6dmmhjngvfh7d6f7jpv35ly

An Introduction to High-Level Synthesis

P. Coussy, D.D. Gajski, M. Meredith, A. Takach
2009 IEEE Design & Test of Computers  
Bluespec's BSV is language targeted for specifying concurrency with rule-based atomic transactions.  ...  For instance, if there is parallelism in an HLS specification, it is extracted using dataflow analysis in accordance with the target technology's capabilities and performance goals (on a slow technology  ... 
doi:10.1109/mdt.2009.69 fatcat:5wa4gs37krgzziwtiftffzszqe

Ten Years of Analyzing Actors: Rebeca Experience [chapter]

Marjan Sirjani, Mohammad Mahdi Jaghoori
2011 Lecture Notes in Computer Science  
Rebeca is designed as an imperative actor-based language with the goal of providing an easy to use language for modeling concurrent and distributed systems, with formal verification support.  ...  For example, we present the modular schedulability analysis of timed actor-based models and formal techniques to check correctness of self-adaptive systems using Rebeca.  ...  In particular, we thank Hamideh Sabouri and Narges Khakpour for their help in writing the sections on slicing and self-adaptive models (respectively).  ... 
doi:10.1007/978-3-642-24933-4_3 fatcat:oxdrmkg735evzkmjg7wodytbea

A portable modula-2 operating system

Larry D. Wittie, Ariel J. Frank
1984 Proceedings of the July 9-12, 1984, national computer conference and exposition on - AFIPS '84  
The two SAM2S implementations differ mainly in their peripheral drivers and in the large amount of memory available on the 68000 systems.  ...  It is based on a highly modular kernel task running on single process-multiplexed microcomputers. SAM2S offers extensive network communication facilities.  ...  This research has been supported in part by National Aeronautics and Space Administration Grant NAG-1-249, Army Research Office Contract DAAG-29-82-K-0103, an external research grant from Digital Equipment  ... 
doi:10.1145/1499310.1499347 dblp:conf/afips/WittieF84 fatcat:gs7gnw3245dfjf3wqnxfkpdfde

Building an Efficient Hadoop Workflow Engine Using BPEL [chapter]

Jie Liu, Qiyuan Li, Feng Zhu, Jun Wei, Dan Ye
2013 Lecture Notes in Computer Science  
Pony uses a matured and stable BPEL engine to orchestrate Hadoop services. Pony implements a Hadoop job scheduler to collaborate with a BPEL engine to online schedule multiple workflows at runtime.  ...  Big data processing and analysis techniques can guide enterprises to make correct decisions, and will play an important role in the enterprise business process.  ...  Existing workflow systems use their own specification languages.  ... 
doi:10.1007/978-3-319-04244-2_25 fatcat:uttmwbrovnhjbgtmx2bs5hsg5q

Predictable multithreading of embedded applications using PRET-C

Sidharta Andalam, Partha Roop, Alain Girault
2010 Eighth ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE 2010)  
In contrast to existing synchronous languages, PRET-C offers C-based shared memory communications between concurrent threads that is guaranteed to be thread safe.  ...  The PRET-C software approach is also significantly more efficient in comparison to two other light-weight concurrent C variants (namely SC and Protothreads), as well as the well-known Esterel synchronous  ...  However, unlike the usual of other synchronous languages like Esterel, where threads are scheduled in each instant based on their signal dependencies, threads in PRET-C are always scheduled based on a  ... 
doi:10.1109/memcod.2010.5558636 dblp:conf/memocode/AndalamRG10 fatcat:by23vi5lz5bble73zchks4rmtq

A Survey of Active Object Languages

Frank De Boer, Kiko Fernandez-Reyes, Albert Mingkun Yang, Vlad Serbanescu, Reiner Hähnle, Ludovic Henrio, Justine Rochas, Crystal Chang Din, Einar Broch Johnsen, Marjan Sirjani, Ehsan Khamespanah
2017 ACM Computing Surveys  
The main design goal of ABS was to create a language that permits the complex behavior of concurrent objects to be specified in a concise, natural manner, while keeping automated analysis of that behavior  ...  In ProActive, multi-active object features can be used through a meta language, based on Java annotations.  ... 
doi:10.1145/3122848 fatcat:ovdeu5o3mbanlectgc6r7kv5he


Stephen A. Edwards
2003 ACM Transactions on Design Automation of Electronic Systems  
concurrent specification languages.  ...  The techniques address compiling a wide variety of languages, ranging from dataflow to Petri nets. Each uses a different method, to some degree chosen to match the semantics of concurrent language.  ...  The inner loop chooses a scheduled event, runs it, and schedules its successors in the event graph depending on the type of arc.  ... 
doi:10.1145/762488.762489 fatcat:pbzmvehdsje25fnzvk6bho2pyq

Page 1252 of Mathematical Reviews Vol. , Issue 99b [page]

1991 Mathematical Reviews  
language with read/write type modes (254-267); Kazuhiko Ohno, Masahiko Ikawa, Masahiro Goshima, Shin-ichiro Mori, Hiroshi Nakashima and Shinji Tomita, Efficient goal scheduling in a concurrent logic language  ...  using type-based dependency analysis (268-282); Ryu Hasegawa, An analysis of divisibility orderings and recursive path orderings (283-296); T.  ... 

Parallel Logic Programming: A Sequel [article]

Agostino Dovier, Andrea Formisano, Gopal Gupta, Manuel V. Hermenegildo, Enrico Pontelli, Ricardo Rocha
2022 arXiv   pre-print
The goal of the survey is to serve not only as a reference for researchers and developers of logic programming systems, but also as engaging reading for anyone interested in logic and as a useful source  ...  Multi-core and highly-connected architectures have become ubiquitous, and this has brought renewed interest in language-based approaches to the exploitation of parallelism.  ...  For example, a goal of the type ?  ... 
arXiv:2111.11218v2 fatcat:hek4fidju5fblprut2squ6o3rm
« Previous Showing results 1 — 15 out of 28,423 results