Sciweavers

367 search results - page 30 / 74
» A Rewriting Logic Sampler
Sort
View
ENTCS
2010
103views more  ENTCS 2010»
13 years 5 months ago
Model Testing Asynchronously Communicating Objects using Modulo AC Rewriting
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...
Olaf Owe, Martin Steffen, Arild B. Torjusen
WADT
1998
Springer
14 years 5 days ago
Non-deterministic Computations in ELAN
Abstract. The ELAN system is an environment for specifying and prototyping constraint solvers, theorem provers and deduction systems in general. It also provides a framework for ex...
Hélène Kirchner, Pierre-Etienne More...
CORR
2008
Springer
148views Education» more  CORR 2008»
13 years 6 months ago
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems--such as for ...
Guillaume Burel
CADE
2006
Springer
14 years 8 months ago
Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures
Abstract. In the context of combinations of theories with disjoint signatures, we classify the component theories according to the decidability of constraint satisability problems ...
Maria Paola Bonacina, Silvio Ghilardi, Enrica Nico...
MICS
2010
92views more  MICS 2010»
13 years 6 months ago
Specifying Rewrite Strategies for Interactive Exercises
Strategies specify how a wide range of exercises can be solved incrementally, such as bringing a logic proposition to disjunctive normal form, reducing a matrix, or calculating wit...
Bastiaan Heeren, Johan Jeuring, Alex Gerdes