Sciweavers

1981 search results - page 210 / 397
» The State of Change: A Survey
Sort
View
PODC
1993
ACM
15 years 10 months ago
A Lower Bound on Wait-Free Counting
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
Shlomo Moran, Gadi Taubenfeld
ICLP
2010
Springer
15 years 10 months ago
HEX Programs with Action Atoms
hex programs were originally introduced as a general framework for extending declarative logic programming, under the stable model semantics, with the possibility of bidirectional...
Selen Basol, Ozan Erdem, Michael Fink, Giovambatti...
RTA
2010
Springer
15 years 10 months ago
Declarative Debugging of Missing Answers for Maude
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
Adrián Riesco, Alberto Verdejo, Narciso Mar...
ECOOP
2004
Springer
15 years 10 months ago
Early Identification of Incompatibilities in Multi-component Upgrades
Previous work proposed a technique for predicting problems resulting from replacing one version of a software component by another. The technique reports, before performing the rep...
Stephen McCamant, Michael D. Ernst
OODBS
2000
111views Database» more  OODBS 2000»
15 years 10 months ago
Pointwise Temporal Object Database Browsing
Visual object database browsers are essentially based on two kinds of interactions: navigation within a collection of objects, and navigation between objects via their relationshi...
Marlon Dumas, Chaouki Daassi, Marie-Christine Fauv...