Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission....

Synchronization is one of the hardest tasks in parallel programming. Traditional lock mechanisms are hard to use and error prone. Software Transactional Memory(STM) provides an easy–to–use and scalable solution to this problem. However, STM does not work well in the case that there are large shared data access in the critical section. This project introduces the design and implementation of a n...

We introduce a declarative approach to kernel design based on background knowledge expressed in the form of logic programs. The theoretical foundation of declarative kernels is mereotopology, a general theory for studying parts and wholes and for defining topological relations among parts. Declarative kernels can be used to specify a broad class of kernels over relational data and represent a s...

We propose the demonstration of the RapidNet toolkit for rapid network protocol simulation, implementation and experimentation. RapidNet utilizes declarative networking, a declarative, database-inspired extensible infrastructure that uses query languages to specify behavior. RapidNet integrates a declarative networking engine with the emerging ns-3 network simulator. Our proposed demonstration ...

One of the attractive features of the Constraint Handling Rules (CHR) programming language is its declarative semantics where rules are read as formulae in first-order predicate logic. However, the more CHR is used as a general-purpose programming language, the more the limitations of that kind of declarative semantics in modelling change become apparent. We propose an alternative declarative s...

Declarative networking [2, 4, 3, 1] is an application of database query-language and processing techniques to the domain of networking. Declarative networking is based on the observation that network protocols deal at their core with computing and maintaining distributed state (e.g., routes, sessions, performance statistics) according to basic information locally available at each node (e.g., n...

We present a method for calculating and analyzing stakeholder utilities of processes that arise in, but are not limited to, social sciences. These areas include business process analysis, healthcare workflow policy analysis. This is quite general applicable to any situation in which declarative-type constraints modal and/or temporal nature play part. A declarative activities may freely happen w...

Declarative networking is a programming methodology that enables developers to concisely specify network protocols and services, and directly compile these specifications into a dataflow framework for execution. This paper describes recent advances in declarative networking, tracing its evolution from a rapid prototyping framework towards a platform that serves as an important bridge connecting...

There are two different approaches to formalizing proofs in a computer: the procedural approach (which is the one of the HOL system) and the declarative approach (which is the one of the Mizar system). Most provers are procedural. However declarative proofs are much closer in style to informal mathematical reasoning than procedural ones. There have been attempts to put declarative interfaces on...