Sciweavers

92 search results - page 12 / 19
» Description Logics with Concrete Domains and Functional Depe...
Sort
View
ISMVL
2007
IEEE
104views Hardware» more  ISMVL 2007»
14 years 1 months ago
Evaluation of Toggle Coverage for MVL Circuits Specified in the SystemVerilog HDL
Designing modern circuits comprised of millions of gates is a very challenging task. Therefore new directions are investigated for efficient modeling and verification of such syst...
Mahsan Amoui, Daniel Große, Mitchell A. Thor...
TOPLAS
2002
98views more  TOPLAS 2002»
13 years 7 months ago
Data abstraction and information hiding
traction and information hiding K. RUSTAN M. LEINO and GREG NELSON Compaq Systems Research Center er describes an approach for verifying programs in the presence of data abstractio...
K. Rustan M. Leino, Greg Nelson
FCT
2003
Springer
14 years 24 days ago
On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems
Abstract. In the paper we present a purely logical approach to estimating computational complexity of potentially intractable problems. The approach is based on descriptive complex...
Andrzej Szalas
DEXAW
2005
IEEE
128views Database» more  DEXAW 2005»
14 years 1 months ago
An Ontology-Based Architecture for Service Discovery and Advice System
In this paper we present a novel, ontology-based approach to service discovery, which exploits domain knowledge and semantic service descriptions to guide the service discovery pr...
Devis Bianchini, Valeria De Antonellis, Michele Me...
DAC
2007
ACM
14 years 8 months ago
Progressive Decomposition: A Heuristic to Structure Arithmetic Circuits
Despite the impressive progress of logic synthesis in the past decade, finding the best architecture for a given circuit still remains an open problem and largely unsolved. In mos...
Ajay K. Verma, Philip Brisk, Paolo Ienne