The question of what constraints must hold for a predicate to behave as a (partial) function, is key to understanding the behaviour of a logic program. It has been shown how this question can be answered by combining backward analysis, a form of analysis that propagates determinacy requirements against the control flow, with a component for deriving so-called mutual exclusion conditions. The la...

A new method of enforcing mutual exclusion among concurrent processes on uniprocessors running UNIX is presented in this paper. When a process attempts to obtain a lock, no race condition will occur unless the process is preempted. The central idea is that a process can avoid a race condition if preemption is made visible to the process when it is rescheduled. Two possible implementations of th...

Mutual exclusion scheduling is the problem of scheduling unit-time tasks non-preemptively on m processors subject to constraints represented by a graph G, such that tasks represented by adjacent vertices in G must run in disjoint time intervals. This problem arises in load-balancing the parallel solution of partial differential equations by domain decomposition. Minimizing the completion time i...

We propose a new concurrent programming model, Automatic Mutual Exclusion (AME). In contrast to lock-based programming, and to other programming models built over software transactional memory (STM), we arrange that all shared state is implicitly protected unless the programmer explicitly specifies otherwise. An AME program is composed from serializable atomic fragments. We include features all...

Abstract Recent advances in non-volatile main memory (NVM) technology have spurred research on algorithms that are resilient to intermittent failures cause processes crash and subsequently restart. In this paper we present a Recoverable Mutual Exclusion (RME) algorithm supports abortability. Our guarantees FCFS strong liveness property: do not starve even runs consisting of infinitely many cras...

In this paper, an algebra of timed processes with real{valued clocks is presented, which serves as a formal description language for real{time communicating systems. We show that requirements such as \a process will never reach an undesired state" can be veriied by solving a simple class of constraint systems on the clock{variables. A complete method for reachability analysis associated with th...

In this paper, an algebra of timed processes with real{valued clocks is presented, which serves as a formal description language for real{time communicating systems. We show that requirements such as \a process will never reach an undesired state" can be veri ed by solving a simple class of constraint systems on the clock{variables. A complete method for reachability analysis associated with th...

‎in this paper, using the idea of convexificators, we study boundedness and nonemptiness of lagrange multipliers satisfying the first order necessary conditions. we consider a class of nons- mooth fractional programming problems with equality, inequality constraints and an arbitrary set constraint. within this context, define generalized mangasarian-fromovitz constraint qualification and show t...