Sciweavers

266 search results - page 17 / 54
» Equational Logics
Sort
View
CADE
2004
Springer
14 years 7 months ago
Rewriting Logic Semantics: From Language Specifications to Formal Analysis Tools
Formal semantic definitions of concurrent languages, when specified in a well-suited semantic framework and supported by generic and efficient formal tools, can be the basis of pow...
José Meseguer, Grigore Rosu
CALCO
2005
Springer
105views Mathematics» more  CALCO 2005»
14 years 1 months ago
Bisimilarity Is Not Finitely Based over BPA with Interrupt
This paper shows that bisimulation equivalence does not afford a finite equational axiomatization over the language obtained by enriching Bergstra and Klop’s Basic Process Alge...
Luca Aceto, Wan Fokkink, Anna Ingólfsd&oacu...
JUCS
2006
131views more  JUCS 2006»
13 years 7 months ago
Verification of CRWL Programs with Rewriting Logic
Abstract: We present a novel approach to the verification of functional-logic programs. For our verification purposes, equational reasoning is not valid due to the presence of non-...
José Miguel Cleva, Isabel Pita
ICDT
2007
ACM
114views Database» more  ICDT 2007»
14 years 1 months ago
Axiomatizing the Logical Core of XPath 2.0
The first aim of this paper is to present the logical core of XPath 2.0: a logically clean, decidable fragment, which includes most navigational features of XPath 2.0 (complex co...
Balder ten Cate, Maarten Marx
ENTCS
2006
155views more  ENTCS 2006»
13 years 7 months ago
Mathematical Service Trading Based on Equational Matching
Mathematical software libraries provide many computational services. Mathematical operators properties can be used to combine several services in order to provide more complex one...
Aurélie Hurault, Marc Pantel