Efficient and flexible access control via Jones-optimal logic program specialisation

DOI10.1007/S10990-008-9030-8zbMath1189.68043OpenAlexW2003107385MaRDI QIDQ2271897

Mauricio Varea, Steve Barker, Michael Leuschel

Publication date: 4 August 2009

Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://eprints.soton.ac.uk/262650/1/pe-hosc.pdf

zbMATH Keywords

program transformationpartial evaluationaccess controldeductive databasesmeta-programmingJones optimality criterion

Mathematics Subject Classification ID

Database theory (68P15) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (4)

Fast offline partial evaluation of logic programs ⋮ Efficient and flexible access control via Jones-optimal logic program specialisation ⋮ An investigation of Jones optimality and BTI-universal specializers ⋮ Generating Specialized Rules and Programs for Demand-Driven Analysis

Uses Software

• Unnamed Item
• ECCE
• XSB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to control unfolding when specializing interpreters
• Mixtus: An automatic partial evaluator for full Prolog
• Partial evaluation of computation process -- an approach to a compiler-compiler
• Efficient and flexible access control via Jones-optimal logic program specialisation
• Flexible support for multiple access control policies
• Creating specialised integrity checks through partial evaluation of meta-interpreters
• Logic programming and knowledge representation
• Logic program specialisation through partial deduction: Control issues
• Offline specialisation in Prolog using a hand-written compiler generator
• Generating action compilers by partial evaluation
• Program Development in Computational Logic

This page was built for publication: Efficient and flexible access control via Jones-optimal logic program specialisation