Tabled evaluation with delaying for general logic programs.

by Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, Scott A. Smolka, Terrance Swift, David S. Warren - Computer Aided Verification (CAV '97) , 1997

"... We demonstrate the feasibility of using the XSB tabled logic programming system as a programmable fixed-point engine for implementing efficient local model checkers. In particular, we present XMC, an XSBbased local model checker for a CCS-like value-passing language and the alternation-free fragmen ..."

Abstract - Cited by 131 (36 self) - Add to MetaCart

We demonstrate the feasibility of using the XSB tabled logic programming system as a programmable fixed-point engine for implementing efficient local model checkers. In particular, we present XMC, an XSBbased local model checker for a CCS-like value-passing language and the alternation-free fragment of the modal mu-calculus. XMC is written in under 200 lines of XSB code, which constitute a declarative specification of CCS and the modal mu-calculus at the level of semantic equations. In order to gauge the performance of XMC as an algorithmic model checker, we conducted a series of benchmarking experiments designed to compare the performance of XMC with the local model checkers implemented in C/C++ in the Concurrency Factory and SPIN specification and verification environments. After applying certain newly developed logic-programmingbased optimizations (along with some standard ones), XMC's performance became extremely competitive with that of the Factory and shows promise in its comparison with SPIN.

(Show Context)

An abstract machine for tabled execution of fixed-order stratified logic programs

by Terrance Swift - ACM Transactions on Programming Languages and Systems , 1998

"... SLG resolution uses tabling to evaluate nonfloundering normal logic programs according to the well-founded semantics. The SLG-WAM, which forms the engine of the XSB system, can compute in-memory recursive queries an order of magnitude faster than current deductive databases. At the same time, the SL ..."

Abstract - Cited by 87 (28 self) - Add to MetaCart

SLG resolution uses tabling to evaluate nonfloundering normal logic programs according to the well-founded semantics. The SLG-WAM, which forms the engine of the XSB system, can compute in-memory recursive queries an order of magnitude faster than current deductive databases. At the same time, the SLG-WAM tightly integrates Prolog code with tabled SLG code, and executes Prolog code with minimal overhead compared to the WAM. As a result, the SLG-WAM brings to logic programming important termination and complexity properties of deductive databases. This article describes the architecture of the SLG-WAM for a powerful class of programs, the class of fixed-order dynamically stratified programs. We offer a detailed description of the algorithms, data structures, and instructions that the SLG-WAM adds to the WAM, and a performance analysis of engine overhead due to the extensions.

(Show Context)

Design and semantics of a decentralized authorization language

by Moritz Y. Becker, Cédric Fournet, Andrew D. Gordon - 20TH IEEE COMPUTER SECURITY FOUNDATIONS SYMPOSIUM , 2007

"... We present a declarative authorization language that strikes a careful balance between syntactic and semantic simplicity, policy expressiveness, and execution efficiency. The syntax is close to natural language, and the semantics consists of just three deduction rules. The language can express many ..."

Abstract - Cited by 82 (13 self) - Add to MetaCart

We present a declarative authorization language that strikes a careful balance between syntactic and semantic simplicity, policy expressiveness, and execution efficiency. The syntax is close to natural language, and the semantics consists of just three deduction rules. The language can express many common policy idioms using constraints, controlled delegation, recursive predicates, and negated queries. We describe an execution strategy based on translation to Datalog with Constraints, and table-based resolution. We show that this execution strategy is sound, complete, and always terminates, despite recursion and negation, as long as simple syntactic conditions are met.

(Show Context)

Verifiable agent interaction in Abductive Logic Programming: the SCIFF framework

by Marco Alberti, Federico Chesani, Marco Gavanelli, Evelina Lamma, Paola Mello, Paolo Torroni - ACM TRANSACTIONS ON COMPUTATIONAL LOGIC , 2008

"... SCIFF is a new abductive logic programming proof-procedure for reasoning with expectations in dynamic environments. SCIFF is also the main component of a framework thought to specify and verify interaction in open agent societies. In this paper we present the declarative and operational semantics of ..."

Abstract - Cited by 76 (53 self) - Add to MetaCart

SCIFF is a new abductive logic programming proof-procedure for reasoning with expectations in dynamic environments. SCIFF is also the main component of a framework thought to specify and verify interaction in open agent societies. In this paper we present the declarative and operational semantics of SCIFF, its termination, soundness and completeness results, and some sample applications to demonstrate its use in the multi-agent domain.

Context-Sensitive Program Analysis as Database Queries

by Monica S. Lam , John Whaley, V. Benjamin Livshits, Michael C. Martin, Dzintars Avots, Michael Carbin, Christopher Unkel , 2005

"... Program analysis has been increasingly used in software engineering tasks such as auditing programs for security vulnerabilities and finding errors in general. Such tools often require analyses much more sophisticated than those traditionally used in compiler optimizations. In particular, context-se ..."

Abstract - Cited by 75 (7 self) - Add to MetaCart

Program analysis has been increasingly used in software engineering tasks such as auditing programs for security vulnerabilities and finding errors in general. Such tools often require analyses much more sophisticated than those traditionally used in compiler optimizations. In particular, context-sensitive pointer alias information is a prerequisite for any sound and precise analysis that reasons about uses of heap objects in a program. Context-sensitive analysis is challenging because there are over 10^14 contexts in a typical large program, even after recursive cycles are collapsed. Moreover, pointers cannot be resolved in general without analyzing the entire program. This paper

(Show Context)

Improving the efficiency of inductive logic programming through the use of query packs

by Hendrik Blockeel, Luc Dehaspe, Bart Demoen, Gerda Janssens, Henk Vandecasteele - JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH , 2002

"... Inductive logic programming, or relational learning, is a powerful paradigm for machine learning or data mining. However, in order for ILP to become practically useful, the efficiency of ILP systems must improve substantially. To this end, the notion of a query pack is introduced: it structures sets ..."

Abstract - Cited by 69 (21 self) - Add to MetaCart

Inductive logic programming, or relational learning, is a powerful paradigm for machine learning or data mining. However, in order for ILP to become practically useful, the efficiency of ILP systems must improve substantially. To this end, the notion of a query pack is introduced: it structures sets of similar queries. Furthermore, a mechanism is described for executing such query packs. A complexity analysis shows that considerable efficiency improvements can be achieved through the use of this query pack execution mechanism. This claim is supported by empirical results obtained by incorporating support for query pack execution in two existing learning systems.

SecPAL: Design and Semantics of a Decentralized Authorization Language

by Moritz Y. Becker, Cédric Fournet, Andrew D. Gordon - In Proceedings of the 20th IEEE Computer Security Foundations Symposium (CSF , 2006

"... By using or providing feedback on the SecPAL Specification (comprised of the SecPAL formal model, SecPAL Schema Specification, and SecPAL Schema) (“Specification”), you agree to the following terms and conditions: • Microsoft hereby grants you permission to copy and review the Specification (a) as a ..."

Abstract - Cited by 65 (5 self) - Add to MetaCart

By using or providing feedback on the SecPAL Specification (comprised of the SecPAL formal model, SecPAL Schema Specification, and SecPAL Schema) (“Specification”), you agree to the following terms and conditions: • Microsoft hereby grants you permission to copy and review the Specification (a) as a reference to assist you in planning and designing your implementation of the Specification and (b) to provide feedback on the Specification to Microsoft. You may not modify, create derivative works from, subset, or extend the Specification. • Provided that you comply with all the terms of use for the Specification, Microsoft agrees to grant you a royalty-free license under reasonable and non-discriminatory terms and conditions to Microsoft patents that Microsoft deems necessary to implement the Specification. You must comply with and implement all normative portions of the Specification in its entirety; you may not elect to implement only portions of the Specification. Unless otherwise specifically mentioned all sections of the Specification should be considered normative. • You have no obligation to give Microsoft any suggestions, comments or other feedback (“Feedback”) relating to the Specification. If you do give Microsoft Feedback on the Specification, You agree: (a) Microsoft may freely use, reproduce, license, distribute, and otherwise commercialize Your Feedback in any Microsoft product or service offering; (b) you also grant third parties, without charge, only those patent rights necessary to implement those portions of the Specification that incorporate your Feedback; and (c) you will not give Microsoft any Feedback (i) that you have reason to believe is subject to any patent, copyright or other intellectual property claim or right of any third party; or (ii) subject to license terms which seek to require any Microsoft product offering incorporating or derived from such Feedback, or other Microsoft intellectual property, to be licensed to or otherwise shared with any third party.

(Show Context)

Logic program specialisation through partial deduction: Control issues

by Michael Leuschel, Maurice Bruynooghe - UNDER CONSIDERATION FOR PUBLICATION IN THEORY AND PRACTICE OF LOGIC PROGRAMMING

"... Program specialisation aims at improving the overall performance of programs by performing source to source transformations. A common approach within functional and logic programming, known respectively as partial evaluation and partial deduction, is to exploit partial knowledge about the input. It ..."

Abstract - Cited by 63 (12 self) - Add to MetaCart

Program specialisation aims at improving the overall performance of programs by performing source to source transformations. A common approach within functional and logic programming, known respectively as partial evaluation and partial deduction, is to exploit partial knowledge about the input. It is achieved through a well-automated application of parts of the Burstall-Darlington unfold/fold transformation framework. The main challenge in developing systems is to design automatic control that ensures correctness, efficiency, and termination. This survey and tutorial presents the main developments in controlling partial deduction over the past 10 years and analyses their respective merits and shortcomings. It ends with an assessment of current achievements and sketches some remaining research challenges.

(Show Context)

Tabled evaluation with delaying for general logic programs. (1996)

Tools