Sciweavers

PADL
2001
Springer
14 years 4 months ago
Specifying Authentication Protocols Using Rewriting and Strategies
Abstract. Programming with rewrite rules and strategies has been already used for describing several computational logics. This paper describes the way the Needham-Schroeder Public...
Horatiu Cirstea
VLDB
2004
ACM
97views Database» more  VLDB 2004»
14 years 5 months ago
CHICAGO: A Test and Evaluation Environment for Coarse-Grained Optimization
Relational OLAP tools and other database applications generate sequences of SQL statements that are sent to the database server as result of a single information request issued by...
Tobias Kraft, Holger Schwarz
UPP
2004
Springer
14 years 5 months ago
Higher-Order Chemical Programming Style
The chemical reaction metaphor describes computation in terms of a chemical solution in which molecules interact freely according to reaction rules. Chemical solutions are represen...
Jean-Pierre Banâtre, Pascal Fradet, Yann Rad...
RTA
2005
Springer
14 years 5 months ago
Arithmetic as a Theory Modulo
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
Gilles Dowek, Benjamin Werner
RTA
2005
Springer
14 years 5 months ago
Proving Positive Almost-Sure Termination
Abstract In order to extend the modeling capabilities of rewriting systems, it is rather natural to consider that the firing of rules can be subject to some probabilistic laws. Co...
Olivier Bournez, Florent Garnier
TPHOL
2008
IEEE
14 years 6 months ago
A Compiled Implementation of Normalization by Evaluation
We present a novel compiled approach to Normalization by Evaluation (NBE) for ML-like languages. It supports efficient normalization of open λ-terms w.r.t. β-reduction and rewrit...
Klaus Aehlig, Florian Haftmann, Tobias Nipkow
RTA
2009
Springer
14 years 6 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...
CADE
2009
Springer
15 years 28 days ago
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
Stephan Falke, Deepak Kapur