Sciweavers

ENTCS
2007
126views more  ENTCS 2007»
13 years 5 months ago
Modelling Calculi with Name Mobility using Graphs with Equivalences
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...
Paolo Baldan, Fabio Gadducci, Ugo Montanari
ENTCS
2007
83views more  ENTCS 2007»
13 years 5 months ago
A Local Graph-rewriting System for Deciding Equality in Sum-product Theories
d Abstract) Jos´e Bacelar Almeida, Jorge Sousa Pinto, and Miguel Vila¸ca 1,2,3 Departamento de Inform´atica Universidade do Minho 4710-057 Braga, Portugal
José Bacelar Almeida, Jorge Sousa Pinto, Mi...
ENTCS
2007
104views more  ENTCS 2007»
13 years 5 months ago
Lazy Context Cloning for Non-Deterministic Graph Rewriting
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...
Sergio Antoy, Daniel W. Brown, Su-Hui Chiang
ENTCS
2007
93views more  ENTCS 2007»
13 years 5 months ago
Modeling Pointer Redirection as Cyclic Term-graph Rewriting
We tackle the problem of data-structure rewriting including global and local pointer redirections. Each basic rewrite step may perform three kinds of actions: (i) Local redirectio...
Dominique Duval, Rachid Echahed, Fréd&eacut...
ENTCS
2007
112views more  ENTCS 2007»
13 years 5 months ago
Structure and Properties of Traces for Functional Programs
The tracer Hat records in a detailed trace the computation of a program written in the lazy functional language Haskell. The trace can then be viewed in various ways to support pr...
Olaf Chitil, Yong Luo
ENTCS
2007
101views more  ENTCS 2007»
13 years 5 months ago
Parametric Performance Contracts: Non-Markovian Loop Modelling and an Experimental Evaluation
Even with todays hardware improvements, performance problems are still common in many software systems. An approach to tackle this problem for component-based software architectur...
Heiko Koziolek, Viktoria Firus
ENTCS
2007
116views more  ENTCS 2007»
13 years 5 months ago
DisCComp - A Formal Model for Distributed Concurrent Components
Most large-scaled software systems are structured in distributed components to manage complexity and have to cope with concurrent executed threads. System decomposition and concur...
Andreas Rausch
ENTCS
2007
72views more  ENTCS 2007»
13 years 5 months ago
Observational Equivalence for the Interaction Combinators and Internal Separation
We define an observational equivalence for Lafont’s interaction combinators, which we prove to be the least discriminating non-trivial congruence on total nets (nets admitting ...
Damiano Mazza
ENTCS
2007
97views more  ENTCS 2007»
13 years 5 months ago
A Head-to-Head Comparison of de Bruijn Indices and Names
Often debates about pros and cons of various techniques for formalising lambda-calculi rely on subjective arguments, such as de Bruijn indices are hard to read for humans or nomin...
Stefan Berghofer, Christian Urban
ENTCS
2007
91views more  ENTCS 2007»
13 years 5 months ago
A Logic for Reasoning about Generic Judgments
This paper presents an extension of a proof system for encoding generic judgments, the logic FOλ∆ of Miller and Tiu, with an induction principle. The logic FOλ∆ is itself an...
Alwen Tiu