Abstract Masking is a widely-used effective countermeasure against power side-channel attacks for implementing cryptographic algorithms. Surprisingly, few formal verification techniques have addressed fundamental question, i.e., whether the masked program and original (unmasked) algorithm are functional equivalent. In this paper, we study problem arithmetic programs over Galois fields of charac...

We introduce an abstract general notion of system of equations and rewrites between terms, called Term Equational Rewrite System (TERS), and develop a sound logical deduction system, called Term Equational Rewrite Logic (TERL), to reason about equality and rewriting. Further, we give an analysis of algebraic free constructions which together with an internal completeness result may be used to s...

Rewriting is a formalism widely used in computer science and mathematical logic. When using rewriting as a programming or modeling paradigm, the rewrite rules describe the transformations one wants to operate and rewriting strategies are used to control their application. The operational semantics of these strategies are generally accepted and approaches for analyzing the termination of specifi...

For eeciency reasons, term rewriting is usually implemented by graph rewriting. It is known that graph rewriting is a sound and complete implementation of (almost) orthogonal term rewriting systems; see BEG + 87]. In this paper, we extend the result to properly oriented orthogonal conditional systems with strict equality. In these systems extra variables are allowed in conditions and right-hand...

Rewriting is a formalism widely used in computer science and mathematical logic. When using rewriting as a programming or modeling paradigm, the rewrite rules describe the transformations one wants to operate and declarative rewriting strategies are used to control their application. The operational semantics of these strategies are generally accepted and approaches for analyzing the terminatio...

An inductive theorem proving method for constrained term rewriting systems, which is based on rewriting induction, needs a decision procedure for reduction-completeness of constrained terms. In addition, the sufficient complete property of constrained term rewriting systems enables us to relax the side conditions of some inference rules in the proving method. These two properties can be reduced...

This paper gives a truly concurrent semantics with sharing of resources for the K semantic framework, an executable (term-)rewritingbased formalism for defining programming languages and calculi. Akin to graph rewriting rules, the K (rewrite) rules explicitly state what can be concurrently shared with other rules. The desired true concurrency is obtained by translating the K rules into a novel ...

Given an equational system, completion procedures compute an equivalent and complete (terminating and confluent) term rewrite system. We present a very simple and efficient completion procedure, which is based on MaxSAT solving. Experiments show that the procedure is comparable to recent powerful completion tools. 1998 ACM Subject Classification F.4.2 Grammars and Other Rewriting Systems

We propose a term rewriting approach to verify observational congruence between guarded recursive (finite-state) CCS expressions. Starting from the complete axiomatization of observational congruence for this subset of CCS, a non-terminating rewriting relation has been defined. This rewriting relation is co-canonical over a subclass of infinite derivations, structured fair derivations, which co...