Sciweavers

804 search results - page 157 / 161
» On the Termination of the Chase Algorithm
Sort
View
WLP
1997
Springer
15 years 10 months ago
Constrained Partial Deduction
eduction strategies for logic programs often use an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are . Findingan abstraction ope...
Michael Leuschel, Danny De Schreye
FSTTCS
1993
Springer
15 years 10 months ago
Induce-Statements and Induce-Expressions: Constructs for Inductive Programming
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...
Theodore S. Norvell
POPL
1989
ACM
15 years 10 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott
CAV
2010
Springer
225views Hardware» more  CAV 2010»
15 years 9 months ago
Merit: An Interpolating Model-Checker
Abstract. We present the tool MERIT, a CEGAR model-checker for safety propf counter-systems, which sits in the Lazy Abstraction with Interpolants (LAWI) framework. LAWI is parametr...
Nicolas Caniart
CSFW
2004
IEEE
15 years 9 months ago
Cassandra: Flexible Trust Management, Applied to Electronic Health Records
We study the specification of access control policy in large-scale distributed systems. We present Cassandra, a language and system for expressing policy, and the results of a sub...
Moritz Y. Becker, Peter Sewell