Sciweavers

2225 search results - page 304 / 445
» Logical Structures in the Lexicon
Sort
View
SAS
2007
Springer
103views Formal Methods» more  SAS 2007»
16 years 17 days ago
Footprint Analysis: A Shape Analysis That Discovers Preconditions
Existing shape analysis algorithms infer descriptions of data structures at program points, starting from a given precondition. We describe an analysis that does not require any pr...
Cristiano Calcagno, Dino Distefano, Peter W. O'Hea...
DATE
2006
IEEE
108views Hardware» more  DATE 2006»
16 years 16 days ago
Scheduling under resource constraints using dis-equations
Scheduling is an important step in high-level synthesis (HLS). In our tool, we perform scheduling in two steps: coarse-grain scheduling, in which we take into account the whole co...
Hadda Cherroun, Alain Darte, Paul Feautrier
IMSCCS
2006
IEEE
16 years 15 days ago
An Adaptive Agent-Based Network for Distributed Component Repositories
The application of component repository has become more and more popular in the practice of component-based software development. Most of the repositories are physically isolated ...
Yunjiao Xue, Leqiu Qian, Ruzhi Xu, Bin Tang, Xin P...
IPPS
2006
IEEE
16 years 15 days ago
Decentralized runtime analysis of multithreaded applications
Violations of a number of common safety properties of multithreaded programs–such as atomicity and absence of dataraces–cannot be observed by looking at the linear execution t...
Koushik Sen, Abhay Vardhan, Gul Agha, Grigore Rosu
ISCAS
2006
IEEE
94views Hardware» more  ISCAS 2006»
16 years 14 days ago
On the sensitivity of BDDs with respect to path-related objective functions
— Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synt...
Rüdiger Ebendt, Rolf Drechsler