Sciweavers

351 search results - page 25 / 71
» Algebra and Geometry of Rewriting
Sort
View
FM
1997
Springer
159views Formal Methods» more  FM 1997»
14 years 2 months ago
Term Rewrite Systems to Derive Set Boolean Operations on 2D Objects
Abstract Set boolean operations between 2-dlmensional geometric objects are crucial in computational geometry and deserve rigorous treatments. We build up a simple and convergent s...
David Cazier, Jean-François Dufourd
RTA
2009
Springer
14 years 4 months ago
A Heterogeneous Pushout Approach to Term-Graph Transformation
We address the problem of cyclic termgraph rewriting. We propose a new framework where rewrite rules are tuples of the form (L, R, τ, σ) such that L and R are termgraphs represen...
Dominique Duval, Rachid Echahed, Fréd&eacut...
WADT
1998
Springer
14 years 2 months 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...
CADE
2004
Springer
14 years 10 months ago
Dr.Doodle: A Diagrammatic Theorem Prover
This paper presents the Dr.Doodle system, an interactive theorem prover that uses diagrammatic representations. The assumption underlying this project is that, for some domains (pr...
Daniel Winterstein, Alan Bundy, Corin A. Gurr
WOLLIC
2010
Springer
14 years 3 months ago
Reduction of the Intruder Deduction Problem into Equational Elementary Deduction for Electronic Purse Protocols with Blind Signa
Abstract. The intruder deduction problem for an electronic purse protocol with blind signatures is considered. The algebraic properties of the protocol are modeled by an equational...
Daniele Nantes Sobrinho, Mauricio Ayala-Rinc&oacut...