552 search results - page 3 / 111 » Languages Modulo Normalization |
112
click to vote
ENTCS
2010
14 years 9 months ago
2010
Testing and verification of asynchronously communicating objects in open environments are challenging due to non-determinism. We explore a formal approach for black-box testing by...
106
click to vote
CORR
2006
Springer
14 years 11 months ago
2006
Springer
Abstract : The main novelty of this paper is to consider an extension of the Calculus of Constructions where predicates can be defined with a general form of rewrite rules. We prov...
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We present a finite ω-complete axiomatization for the process algebra BCCSP modulo failure semantics, in case of a finite alphabet. This solves an open question by Gro...
110
click to vote
FQAS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Controlled languages (CLs) are ambiguity-free subsets of natural languages such as English offering a good trade-off between the formal rigor of ontology and query langua...
79
Voted
ENTCS
2002
14 years 11 months ago
2002
We study the partial algebra of typed terms with an associative commutative and idempotent operator (typed AC-terms). The originality lies in the representation of the typing poli...