Sciweavers

2736 search results - page 149 / 548
» Implementable allocation rules
Sort
View
ENTCS
2006
151views more  ENTCS 2006»
15 years 24 days ago
Extending C for Checking Shape Safety
The project Safe Pointers by Graph Transformation at the University of York has developed a method for specifying the shape of pointer-data structures by graph reduction, and a st...
Mike Dodds, Detlef Plump
120
Voted
TCS
2008
15 years 21 days ago
Loop detection in term rewriting using the eliminating unfoldings
In this paper, we present a fully automatizable approach to detecting loops in standard term rewriting. Our method is based on semi-unification and an unfolding operation which pr...
Étienne Payet
TCS
2002
15 years 13 days ago
ELAN from a rewriting logic point of view
ELAN implements computational systems, a concept that combines two first class entities: rewrite rules and rewriting strategies. ELAN can be used either as a logical framework or ...
Peter Borovanský, Claude Kirchner, Hé...
89
Voted
LICS
1992
IEEE
15 years 4 months ago
Equivalences on Observable Processes
The aim of this paper is to find the finest `observable' and `implementable' equivalence on concurrent processes. This is a part of a larger programme to develop a theor...
Irek Ulidowski
92
Voted
ISVLSI
2003
IEEE
118views VLSI» more  ISVLSI 2003»
15 years 6 months ago
Reconfigurable Fast Memory Management System Design for Application Specific Processors
This paper presents the design and implementation of the new Active Memory Manager Unit (AMMU) designed to be embedded into System-on-Chip CPUs. The unit is implemented using VHDL...
S. Kagan Agun, J. Morris Chang