Sciweavers

923 search results - page 105 / 185
» Proving the value of formal methods
Sort
View
INFOCOM
2009
IEEE
16 years 28 days ago
Optimal Fast Hashing
Abstract—This paper is about designing optimal highthroughput hashing schemes that minimize the total number of memory accesses needed to build and access an hash table. Recent s...
Josef Kanizo, David Hay, Isaac Keslassy
PPDP
2009
Springer
16 years 25 days ago
Set functions for functional logic programming
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
Sergio Antoy, Michael Hanus
EDOC
2004
IEEE
15 years 10 months ago
Notations for the Specification and Verification of Composite Web Services
Availability of a wide variety of Web services over the Internet offers opportunities of providing new value added services built by composing them out of existing ones. Service c...
Simon J. Woodman, Doug J. Palmer, Santosh K. Shriv...
IJAR
2007
86views more  IJAR 2007»
15 years 6 months ago
Non-deterministic semantics for logics with a consistency operator
In order to handle inconsistent knowledge bases in a reasonable way, one needs a logic which allows nontrivial inconsistent theories. Logics of this sort are called paraconsistent...
Arnon Avron
ICDE
2009
IEEE
160views Database» more  ICDE 2009»
15 years 4 months ago
Perm: Processing Provenance and Data on the Same Data Model through Query Rewriting
Data provenance is information that describes how a given data item was produced. The provenance includes source and intermediate data as well as the transformations involved in pr...
Boris Glavic, Gustavo Alonso