Sciweavers

413 search results - page 35 / 83
» A formalism for functionality preserving system level transf...
Sort
View
ICCD
2004
IEEE
100views Hardware» more  ICCD 2004»
14 years 4 months ago
Layout Driven Optimization of Datapath Circuits using Arithmetic Reasoning
This paper proposes a new formalism for layout-driven optimization of datapaths. It is based on preserving an arithmetic bit level representation of the arithmetic circuit portion...
Ingmar Neumann, Dominik Stoffel, Kolja Sulimma, Mi...
DATESO
2009
121views Database» more  DATESO 2009»
13 years 5 months ago
Translation of Ontology Retrieval Problem into Relational Queries
Ontology as a knowledge base can provide different reasoning tasks, e.g. to check consistency of the ontology or to check whether a resource is instance of a concept or not. In thi...
Jaroslav Pokorný, Jana Pribolová, Pe...
POPL
1999
ACM
14 years 8 days ago
Constraint Systems for Useless Variable Elimination
Superfluous variables are often produced as the byproducts of program transformations, compilation, and poorly written code. These variables are irrelevant to the computational o...
Mitchell Wand, Igor Siveroni
ISSS
2002
IEEE
148views Hardware» more  ISSS 2002»
14 years 26 days ago
A Case Study of Hardware and Software Synthesis in ForSyDe
ForSyDe (FORmal SYstem DEsign) is a methodology which addresses the design of SoC applications which may contain control as well as data flow dominated parts. Starting with a for...
Ingo Sander, Axel Jantsch, Zhonghai Lu
ENTCS
2010
130views more  ENTCS 2010»
13 years 8 months ago
Compositional System Security with Interface-Confined Adversaries
This paper presents a formal framework for compositional reasoning about secure systems. A key insight is to view a trusted system in terms of the interfaces that the various comp...
Deepak Garg, Jason Franklin, Dilsun Kirli Kaynar, ...