Sciweavers

128 search results - page 7 / 26
» Ensuring Termination by Typability
Sort
View
ENTCS
2002
134views more  ENTCS 2002»
13 years 7 months ago
Implementing Compositional Analysis Using Intersection Types With Expansion Variables
A program analysis is compositional when the analysis result for a particular program fragment is obtained solely from the results for its immediate subfragments via some composit...
Assaf J. Kfoury, Geoffrey Washburn, Joe Wells
LICS
2010
IEEE
13 years 5 months ago
Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications
Abstract--This paper summarizes results on a recently introduced family of Datalog-based languages, called Datalog+/-, which is a new framework for tractable ontology querying, and...
Andrea Calì, Georg Gottlob, Thomas Lukasiew...
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 4 months ago
XSB: Extending Prolog with Tabled Logic Programming
The paradigm of Tabled Logic Programming (TLP) is now supported by a number of Prolog systems, including XSB, YAP Prolog, B-Prolog, Mercury, ALS, and Ciao. The reasons for this ar...
Terrance Swift, David Scott Warren
LOPSTR
2004
Springer
14 years 25 days ago
Fully Automatic Binding-Time Analysis for Prolog
Offline partial evaluation techniques rely on an annotated version of the source program to control the specialisation process. These annotations guide the specialisation and have ...
Stephen-John Craig, John P. Gallagher, Michael Leu...
FC
2005
Springer
80views Cryptology» more  FC 2005»
14 years 1 months ago
A User-Friendly Approach to Human Authentication of Messages
Abstract. Users are often forced to trust potentially malicious terminals when trying to interact with a remote secure system. This paper presents an approach for ensuring the inte...
Jeff King, André L. M. dos Santos