1) La descarga del recurso depende de la página de origen
2) Para poder descargar el recurso, es necesario ser usuario registrado en Universia


Opción 1: Descargar recurso

Detalles del recurso

Descripción

In this work we present our current investigation on use of rewriting-logic as a higher abstraction way to tackle digital design. Rewriting can be used to specify, simulate and even synthesize complex application specific digital systems, which provides a higher abstraction level than current system level languages. To illustrate the possibilities of rewriting-logic in the context of regular hardware structures we describe how to implement di#erent arithmetic operators.

Pertenece a

CiteSeer Computer and Information Science Publications collection  

Autor(es)

Mauricio Ayala -  rincon,Reiner W. Hartenstein,Ricardo P. Jacobi,Carlos H. Llanos,Wander J. Queroz - 

Id.: 42058359

Idioma: inglés  - 

Versión: 1.0

Estado: Final

Tipo:  ps - 

Palabras claveMauricio Ayala -  rincon,Reiner W. Hartenstein,Ricardo P. Jacobi,Carlos H. Llanos,Wander J. Queroz Designing Arithmetic Digital Circuits via Rewriting -  Logic - 

Tipo de Interactividad: Expositivo

Nivel de Interactividad: muy bajo

Audiencia: Estudiante  -  Profesor  -  Autor  - 

Estructura: Atomic

Coste: no

Copyright: sí

: unrestricted

Formatos:  ps - 

Requerimientos técnicos:  Browser: Any - 

Relación: [IsBasedOn] http://www.mat.unb.br/~ayala/acmversion.ps
[References] oai:CiteSeerPSU:369289
[References] oai:CiteSeerPSU:280313
[References] oai:CiteSeerPSU:249015
[References] oai:CiteSeerPSU:222699
[References] oai:CiteSeerPSU:245360
[References] oai:CiteSeerPSU:495487

Fecha de contribución: 31-mar-2009

Contacto:

Localización:

Otros recursos del mismo autor(es)

  1. EXPLICIT SUBSTITUTIONS AND ALL THAT* Abstract. Explicit substitution calculi are extensions of the A-calculus where the substitution mech...
  2. Second- and Third-Order Matching via Explicit Substitutions The past few years have established the benefits of using explicit substitutions in the treatment of...
  3. $rec.titulo A deductive calculus for conditional equational systems with built-in predicates as premises
  4. Comparing and Implementing Calculi of Explicit Substitutions with Eta Reduction The past decade has seen an explosion of work on calculi of explicit substitutions. Numerous work ha...
  5. Architectural Specification, Exploration and Simulation Through Rewriting-Logic ∗ In recent years Arvind’s Group at MIT has shown the usefulness of term rewriting theory for the spec...

Otros recursos de la mismacolección

  1. A Simple Logic for Authentication Protocol Design In this paper, we describe a simple logic. The logic uses the notion of channels that are generalisa...
  2. Adaptive Fault Tolerant Systems: Reflective Design and Validation Reflection has been used with some success, since quite a few years now, for dealing with separation...
  3. Euclidean Reconstruction Independent Standard bundle adjustment techniques for Euclidean reconstruction consider camera intrinsic paramet...
  4. Universal Padding Schemes for RSA A common practice to encrypt with RSA is to rst apply a padding scheme to the message and then to ex...
  5. Ontology Learning Part One - On Discovering Taxonomic Relations from the Web Contents 1. Ontology Learning Part One --- Alexander Maedche, Viktor Pekar, and Steffen Staab ######...

Aviso de cookies: Usamos cookies propias y de terceros para mejorar nuestros servicios, para análisis estadístico y para mostrarle publicidad. Si continua navegando consideramos que acepta su uso en los términos establecidos en la Política de cookies.