Sciweavers

3572 search results - page 531 / 715
» Nominal Logic Programming
Sort
View
165
Voted
PPOPP
2006
ACM
16 years 1 months ago
Proving correctness of highly-concurrent linearisable objects
We study a family of implementations for linked lists using finegrain synchronisation. This approach enables greater concurrency, but correctness is a greater challenge than for ...
Viktor Vafeiadis, Maurice Herlihy, Tony Hoare, Mar...
202
Voted
ASP
2005
Springer
16 years 18 days ago
Intelligence Analysis Using Quantitative Preferences
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
163
Voted
ECOOP
2004
Springer
16 years 13 days ago
Sequential Object Monitors
Abstract. Programming with Java monitors is recognized to be difficult, and potentially inefficient due to many useless context switches induced by the notifyAll primitive. This pa...
Denis Caromel, Luis Mateu, Éric Tanter
193
Voted
LPAR
2004
Springer
16 years 12 days ago
Weighted Answer Sets and Applications in Intelligence Analysis
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
203
Voted
PEPM
2004
ACM
16 years 12 days ago
Dynamic slicing based on redex trails
Tracing computations is a widely used methodology for program debugging. Lazy languages, in particular, pose new demands on tracing techniques since following the actual trace of ...
Claudio Ochoa, Josep Silva, Germán Vidal