Sciweavers

3572 search results - page 168 / 715
» Nominal Logic Programming
Sort
View
LICS
2010
IEEE
14 years 11 months ago
Weak Equivalences in Psi-Calculi
Psi-calculi extend the pi-calculus with nominal datatypes to represent data, communication channels, and logics for facts and conditions. This general framework admits highly expr...
Magnus Johansson, Jesper Bengtson, Joachim Parrow,...
126
Voted
FCSC
2010
170views more  FCSC 2010»
14 years 10 months ago
Formal verification of concurrent programs with read-write locks
Abstract Read-write locking is an important mechanism to improve concurrent granularity, but it is difficult to reason about the safety of concurrent programs with read-write locks...
Ming Fu, Yu Zhang, Yong Li
106
Voted
AMW
2010
15 years 2 months ago
Logic Programs for Repairing Inconsistent Dimensions in Data Warehouses
A Data Warehouse (DW) is a data repository that integrates data from multiple sources and organizes the data according to a set of data structures called dimensions. Each dimension...
Loreto Bravo, Mónica Caniupán Marile...
102
Voted
LISP
2008
97views more  LISP 2008»
15 years 23 days ago
Efficient and flexible access control via Jones-optimal logic program specialisation
We describe the use of a flexible meta-interpreter for performing access control checks on deductive databases. The meta-program is implemented in Prolog and takes as input a datab...
Steve Barker, Michael Leuschel, Mauricio Varea
JELIA
2010
Springer
14 years 11 months ago
Retroactive Subsumption-Based Tabled Evaluation of Logic Programs
Abstract. Tabled evaluation is a recognized and powerful implementation technique that overcomes some limitations of traditional Prolog systems in dealing with recursion and redund...
Flávio Cruz, Ricardo Rocha