Sciweavers

351 search results - page 54 / 71
» Logic Programs with Compiled Preferences
Sort
View
COMMA
2010
13 years 2 months ago
A characterization of collective conflict for defeasible argumentation
In this paper we define a recursive semantics for warrant in a general defeasible argumentation framework by formalizing a notion of collective (non-binary) conflict among argumen...
Teresa Alsinet, Ramón Béjar, Lluis G...
ENTCS
2007
134views more  ENTCS 2007»
13 years 7 months ago
Improving the Decompilation of Java Bytecode to Prolog by Partial Evaluation
The interpretative approach to compilation allows compiling programs by partially evaluating an interpreter w.r.t. a source program. This approach, though very attractive in princ...
Miguel Gómez-Zamalloa, Elvira Albert, Germ&...
DAGSTUHL
1996
13 years 8 months ago
Efficiently Generating Efficient Generating Extensions in Prolog
The so called "cogen approach" to program specialisation, writing a compiler generator instead of a specialiser, has been used with considerable success in partial evalua...
Jesper Jørgensen, Michael Leuschel
CCS
2004
ACM
14 years 28 days ago
Verifying policy-based security for web services
WS-SecurityPolicy is a declarative configuration language for driving web services security mechanisms. We describe a formal sefor WS-SecurityPolicy, and propose a more abstract ...
Karthikeyan Bhargavan, Cédric Fournet, Andr...
POPL
2010
ACM
14 years 4 months ago
Dynamically Checking Ownership Policies in Concurrent C/C++ Programs
Concurrent programming errors arise when threads share data incorrectly. Programmers often avoid these errors by using synchronization to enforce a simple ownership policy: data i...
Jean-Phillipe Martin, Michael Hicks, Manuel Costa,...