63 search results - page 5 / 13 » Rewriting modulo in Deduction modulo |
114
Voted
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...
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...
108
Voted
CADE
2010
Springer
15 years 26 days ago
2010
Springer
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...
WADT
1998
Springer
15 years 4 months ago
1998
Springer
We investigate the rewrite relation over graphs induced by constructor-based weakly orthogonal graph rewriting systems. It is well known that this relation is not confluent in gene...
CADE
2006
Springer
16 years 1 days ago
2006
Springer
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...