Sciweavers

4761 search results - page 726 / 953
» Generalizing Boundary Points
Sort
View
SAS
2001
Springer
117views Formal Methods» more  SAS 2001»
15 years 9 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
SAS
2001
Springer
15 years 9 months ago
Solving Regular Tree Grammar Based Constraints
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
Yanhong A. Liu, Ning Li, Scott D. Stoller
GLVLSI
2000
IEEE
145views VLSI» more  GLVLSI 2000»
15 years 9 months ago
Manhattan or non-Manhattan?: a study of alternative VLSI routing architectures
Circuit interconnect has become a substantial obstacle in the design of high performance systems. In this paper we explore a new routing paradigm that strikes at the root of the i...
Cheng-Kok Koh, Patrick H. Madden
102
Voted
ICCAD
2000
IEEE
99views Hardware» more  ICCAD 2000»
15 years 9 months ago
On Mismatches between Incremental Optimizers and Instance Perturbations in Physical Design Tools
The incremental, “construct by correction” design methodology has become widespread in constraint-dominated DSM design. We study the problem of ECO for physical design domains...
Andrew B. Kahng, Stefanus Mantik
135
Voted
TOOLS
2000
IEEE
15 years 9 months ago
Generic Components to Foster Reuse
Software reuse and especially the paradigm of software components are promising approaches to increase the efficiency of software development. One of the basic problems of softwar...
Lothar Baum, Martin Becker