Sciweavers

2766 search results - page 520 / 554
» Hybridizing a Logical Framework
Sort
View
CSFW
2012
IEEE
12 years 10 days ago
Generic Indifferentiability Proofs of Hash Designs
—In this paper, we propose a formal analysis of domain extenders for hash functions in the indifferentiability framework. We define a general model for domain extenders and prov...
Marion Daubignard, Pierre-Alain Fouque, Yassine La...
AAAI
2012
12 years 8 days ago
Learning from Demonstration for Goal-Driven Autonomy
Goal-driven autonomy (GDA) is a conceptual model for creating an autonomous agent that monitors a set of expectations during plan execution, detects when discrepancies occur, buil...
Ben George Weber, Michael Mateas, Arnav Jhala
WWW
2004
ACM
14 years 10 months ago
Edgecomputing: extending enterprise applications to the edge of the internet
Content delivery networks have evolved beyond traditional distributed caching. With services such as Akamai's EdgeComputing it is now possible to deploy and run enterprise bu...
Andy Davis, Jay Parikh, William E. Weihl
CADE
2007
Springer
14 years 10 months ago
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...
Yeting Ge, Clark Barrett, Cesare Tinelli
SIGMOD
2001
ACM
158views Database» more  SIGMOD 2001»
14 years 10 months ago
Generating Efficient Plans for Queries Using Views
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
Foto N. Afrati, Chen Li, Jeffrey D. Ullman