Sciweavers

4835 search results - page 725 / 967
» Refactoring Functional Programs
Sort
View
CORR
2004
Springer
85views Education» more  CORR 2004»
13 years 10 months ago
A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree
It is well-known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of l...
Patricia M. Hill, Enea Zaffanella, Roberto Bagnara
CORR
2000
Springer
112views Education» more  CORR 2000»
13 years 10 months ago
Evolution of differentiated expression patterns in digital organisms
Abstract. We investigate the evolutionary processes behind the development and optimization of multiple threads of execution in digital organisms using the avida platform, a softwa...
Charles Ofria, Christoph Adami, Travis C. Collier,...
ENTCS
2000
80views more  ENTCS 2000»
13 years 10 months ago
Behavioral and Coinductive Rewriting
Behavioral rewriting di ers from standard rewriting in taking account of the weaker inference rules of behavioral logic, but it shares much with standard rewriting, including noti...
Joseph A. Goguen, Kai Lin, Grigore Rosu
FAC
2000
124views more  FAC 2000»
13 years 10 months ago
Algebraic Models of Correctness for Microprocessors
In this paper we present a method of describing microprocessors at different levels of temporal and data abstraction. We consider microprogrammed, pipelined and superscalar proces...
Anthony C. J. Fox, Neal A. Harman
ENTCS
2007
123views more  ENTCS 2007»
13 years 10 months ago
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. Proving termination of CSR is an interesting problem w...
Beatriz Alarcón, Raúl Gutiérr...