Sciweavers

532 search results - page 57 / 107
» The Logic of Quasi-MV Algebras
Sort
View
IANDC
2010
102views more  IANDC 2010»
14 years 10 months ago
Presenting functors on many-sorted varieties and applications
This paper studies several applications of the notion of a presentation of a functor by operations and equations. We show that the technically straightforward generalisation of th...
Alexander Kurz, Daniela Petrisan
SIGMOD
2009
ACM
201views Database» more  SIGMOD 2009»
16 years 2 days ago
Cost based plan selection for xpath
We present a complete XPath cost-based optimization and execution framework and demonstrate its effectiveness and efficiency for a variety of queries and datasets. The framework i...
Haris Georgiadis, Minas Charalambides, Vasilis Vas...
LPNMR
1990
Springer
15 years 3 months ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote
CALCO
2007
Springer
135views Mathematics» more  CALCO 2007»
15 years 3 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
CSR
2008
Springer
15 years 1 months ago
Invariant Generation for P-Solvable Loops with Assignments
We discuss interesting properties of a general technique for inferring polynomial invariants for a subfamily of imperative loops, called the P-solvable loops, with assignments only...
Laura Kovács