Sciweavers

70 search results - page 5 / 14
» Logic Meets Algebra: the Case of Regular Languages
Sort
View
CIDR
2009
181views Algorithms» more  CIDR 2009»
13 years 8 months ago
The Case for RodentStore: An Adaptive, Declarative Storage System
Recent excitement in the database community surrounding new applications--analytic, scientific, graph, geospatial, etc.--has led to an explosion in research on database storage sy...
Philippe Cudré-Mauroux, Eugene Wu, Samuel M...
POPL
2006
ACM
14 years 7 months ago
Stratified type inference for generalized algebraic data types
We offer a solution to the type inference problem for an extension of Hindley and Milner's type system with generalized algebraic data types. Our approach is in two strata. T...
François Pottier, Yann Régis-Gianas
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
13 years 11 months ago
The 2-SAT Problem of Regular Signed CNF Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
ICDE
2005
IEEE
107views Database» more  ICDE 2005»
14 years 28 days ago
Search Experiment of Business-Rule by Dynamic Constraint Algebra
Abstract Although e-commerce is becoming popular, product rules, which describe various conditions such as prices, applicability, and discount conditions are still expressed in nat...
Rui Kimura, Takayuki Shiga, Mizuho Iwaihara
CALCO
2007
Springer
135views Mathematics» more  CALCO 2007»
13 years 11 months ago
Specification-Based Testing for CoCasl's Modal Specifications
Specification-based testing is a particular case of black-box testing, which consists in deriving test cases from an analysis of a formal specification. We present in this paper an...
Delphine Longuet, Marc Aiguier