Sciweavers

3481 search results - page 525 / 697
» Higher-Order Logic Programming as Constraint Logic Programmi...
Sort
View
133
Voted
CCS
2007
ACM
15 years 9 months ago
A simple and expressive semantic framework for policy composition in access control
In defining large, complex access control policies, one would like to compose sub-policies, perhaps authored by different organizations, into a single global policy. Existing po...
Glenn Bruns, Daniel S. Dantas, Michael Huth
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
15 years 9 months ago
An open and shut typecase
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...
CCS
2005
ACM
15 years 9 months ago
A rewriting-based inference system for the NRL protocol analyzer: grammar generation
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...
Santiago Escobar, Catherine Meadows, José M...
146
Voted
FMCO
2003
Springer
162views Formal Methods» more  FMCO 2003»
15 years 8 months ago
An MDA Approach to Tame Component Based Software Development
Abstract. The aim of this paper is to show how the Model Driven Architecture (MDA) can be used in relation with component based software engineering. A software component only exhi...
Jean-Marc Jézéquel, Olivier Defour, ...
ICLP
2009
Springer
16 years 4 months ago
Incremental Answer Completion in the SLG-WAM
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...
Alexandre Miguel Pinto, Luís Moniz Pereira,...