Sciweavers

4767 search results - page 41 / 954
» Structures for Abstract Rewriting
Sort
View
FMCO
2005
Springer
101views Formal Methods» more  FMCO 2005»
14 years 2 months ago
Synchronised Hyperedge Replacement as a Model for Service Oriented Computing
Abstract. This tutorial paper describes a framework for modelling several aspects of distributed computing based on Synchronised Hyperedge Replacement (SHR), a graph rewriting form...
Gian Luigi Ferrari, Dan Hirsch, Ivan Lanese, Ugo M...
WADT
1998
Springer
14 years 29 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...
PARLE
1993
14 years 25 days ago
A Parallel Programming Style and Its Algebra of Programs
Abstract. We present a set of primitive program schemes, which together with just two basic combining forms provide a suprisingly expressive parallel programming language. The prim...
Chris Hankin, Daniel Le Métayer, David Sand...
CSL
2010
Springer
13 years 9 months ago
Signature Extensions Preserve Termination - An Alternative Proof via Dependency Pairs
Abstract. We give the first mechanized proof of the fact that for showing termination of a term rewrite system, we may restrict to well-formed terms using just the function symbols...
Christian Sternagel, René Thiemann
IV
2002
IEEE
126views Visualization» more  IV 2002»
14 years 1 months ago
The Empathic Visualisation Algorithm (EVA) - An Automatic Mapping from Abstract Data to Naturalistic Visual Structure
from Abstract Data to Naturalistic Visual Structure A. Loizides and M.Slater Department of Computer Science, University College London (UCL), London, UK This paper demonstrates a ...
Andreas Loizides, Mel Slater