Sciweavers

3384 search results - page 172 / 677
» More Testable Properties
Sort
View
JUCS
2008
147views more  JUCS 2008»
13 years 9 months ago
On BCK Algebras - Part I.b: An Attempt to Treat Unitarily the Algebras of Logic. New Algebras
: Since all the algebras connected to logic have, more or less explicitely, an associated order relation, it follows that they have two presentations, dual to each other. We classi...
Afrodita Iorgulescu
LOGCOM
2008
94views more  LOGCOM 2008»
13 years 9 months ago
Preservation of Interpolation Features by Fibring
Fibring is a metalogical constructor that permits to combine different logics by operating on their deductive systems under certain natural restrictions, as for example that the t...
Walter Alexandre Carnielli, João Rasga, Cri...
JACM
2007
84views more  JACM 2007»
13 years 9 months ago
Polymorphic higher-order recursive path orderings
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
Jean-Pierre Jouannaud, Albert Rubio
JUCS
2007
100views more  JUCS 2007»
13 years 9 months ago
On BCK Algebras - Part I.a: An Attempt to Treat Unitarily the Algebras of Logic. New Algebras
: Since all the algebras connected to logic have, more or less explicitely, an associated order relation, it follows that they have two presentations, dual to each other. We classi...
Afrodita Iorgulescu
SAS
2010
Springer
121views Formal Methods» more  SAS 2010»
13 years 7 months ago
Alternation for Termination
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
William R. Harris, Akash Lal, Aditya V. Nori, Srir...