Please use this identifier to cite or link to this item:
|Title:||Concurrent programming made easy||Authors:||Ramirez, Rafael
Santosa, Andrew E.
Yap, Roland H.C.
|Issue Date:||2000||Citation:||Ramirez, Rafael,Santosa, Andrew E.,Yap, Roland H.C. (2000). Concurrent programming made easy. Proceedings of the IEEE International Conference on Engineering of Complex Computer Systems, ICECCS : 151-160. ScholarBank@NUS Repository.||Abstract:||The task of programming concurrent systems is substantially more difficult than the task of programming sequential systems with respect to both correctness and efficiency. In this paper we describe a constraint-based methodology for writing concurrent applications. A system is modeled as: (a) a set of processes containing a sequence of `markers' denoting the processes points of interest; and (b) a constraint store. Process synchronization is specified by incrementally adding constraints on the markers' execution order into the constraint store. The constraint store contains a declarative specification based on a temporal constraint logic program. The store, thus, acts as a coordination entity which on the one hand encapsulates the system synchronization requirements, and on the other hand, provides a declarative specification of the system concurrency issues. This provide great advantages in writing concurrent programs and manipulating them while preserving correctness.||Source Title:||Proceedings of the IEEE International Conference on Engineering of Complex Computer Systems, ICECCS||URI:||http://scholarbank.nus.edu.sg/handle/10635/39004|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Apr 20, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.