Features of the concurrent programming language Aldwych
Proceedings of the 2003 ACM symposium on Applied computing
Concurrent and distributed programming using constraint logic programs
Proceedings of the 2004 ACM symposium on Applied computing
Brief Announcement: constraint-based synchronization and verification of concurrent programs
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Role-Based declarative synchronization for reconfigurable systems
PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages
Hi-index | 0.00 |
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.