Institution
Cadence Design Systems
Company•San Jose, California, United States•
About: Cadence Design Systems is a company organization based out in San Jose, California, United States. It is known for research contribution in the topics: Circuit design & Routing (electronic design automation). The organization has 3139 authors who have published 3745 publications receiving 66410 citations. The organization is also known as: Cadence Design Systems, Inc.
Topics: Circuit design, Routing (electronic design automation), Integrated circuit, Integrated circuit design, Physical design
Papers published on a yearly basis
Papers
More filters
••
TL;DR: The results show that although the i-protocol is inherently complex – the size of its state space grows exponentially in the window size and it deploys several sophisticated optimizations aimed at minimizing control-message and retransmission overhead – it is nonetheless amenable to a number of general-purpose abstraction techniques whose application can significantly reduce the size the protocol’s state space.
Abstract: The i-protocol, an optimized sliding-window protocol for GNU uucp, first came to our attention in 1995 when we used the Concurrency Factory’s local model checker to detect, locate, and correct a non-trivial livelock in version 1.04 of the protocol. Since then, we have conducted a systematic case study on the protocol using four verification tools, viz. Cospan, Murϕ, Spin, and XMC, each of which supports some form of explicit-state model checking. Our results show that although the i-protocol is inherently complex – the size of its state space grows exponentially in the window size and it deploys several sophisticated optimizations aimed at minimizing control-message and retransmission overhead – it is nonetheless amenable to a number of general-purpose abstraction techniques whose application can significantly reduce the size of the protocol’s state space.
30 citations
•
14 Apr 1997TL;DR: In this paper, an automated design system comprises a computer configured to use second order signatures in generating candidate permutations of each permutation group in a canonical form of the candidate function.
Abstract: Provided are a method, article of manufacture, and apparatus for matching candidate clusters to cells in a technology library. An automated design system comprises a computer configured to use second order signatures in generating candidate permutations of each permutation group in a canonical form of the candidate function. The system selects first and second symmetric subgroups, determines a second order signature for the candidate function and the first and second symmetric subgroups, and compares the second order signature to a corresponding second order signature for a library cell function. If the signatures match, the permutation is continued with the first and second symmetric subgroups being included in an intermediate permutation. If not, the system produces no more intermediate permutations beginning with the first and second symmetric subgroups. Further symmetric subgroups are added to the intermediate permutation. For each new symmetric subgroup, the system produces pairings of that symmetric subgroup with each of the symmetric subgroups in the intermediate permutation, and compares the second order signatures of the pairings to corresponding second order signatures in the library function. If at any time any of the second order signatures do not match their corresponding library function signatures, the system produces no more intermediate permutations beginning with the current sequence of the intermediate permutation, and instead removes the new symmetric subgroup and attempts to continue building the previous intermediate permutation. When all symmetric subgroups in the permutation group have been added to the intermediate permutation, the intermediate permutation becomes a candidate permutation.
30 citations
•
24 May 2004TL;DR: In this paper, a method and system for managing test generation and examination of test coverage so as to most efficiently obtain maximum coverage during test generation is presented, in addition to achieving coverage maximization, the present invention also preferably manages test generation in order to increase the efficiency of testing to obtain such coverage maximisation.
Abstract: A method and system for managing test generation and examination of test coverage so as to most efficiently obtain maximum coverage during test generation. Therefore, in addition to achieving coverage maximization, the present invention also preferably manages test generation in order to increase the efficiency of testing to obtain such coverage maximization. The present invention also preferably provides tactics and/or strategies for generation as part of such management. Thus, coverage providing by test generation and execution is not only measured, but is also preferably obtained in a more efficient manner by enabling the coverage maximization functions to provide feedback and management to the test generation process.
30 citations
••
TL;DR: The design and implementation of a parser combinator library in Newspeak, a new language in the Smalltalk family, which allows the grammar to be specified as a separate class or mixin, independent of tools that rely upon it such as parsers, syntax colorizers etc.
30 citations
•
29 Dec 2010TL;DR: In this paper, a three-phase routing scheme is employed, comprising a global router, a C-router, and a detail router for double patterning lithography using colored space tiles.
Abstract: Disclosed are a method, apparatus, and computer program product to implement routing for double patterning lithography using colored space tiles. A three-phase routing scheme is employed, comprising a global router, a C-router, and a detail router. The C-router provides double patterning color seeding for routing tracks in the electronic design. The detail router employs space-tiles to perform double-patterning based routing for wires in the electronic design. Colored space tiles may be utilized to perform the detail routing.
30 citations
Authors
Showing all 3142 results
Name | H-index | Papers | Citations |
---|---|---|---|
Alberto Sangiovanni-Vincentelli | 99 | 934 | 45201 |
Derong Liu | 77 | 608 | 19399 |
Andrew B. Kahng | 76 | 618 | 24097 |
Jason Cong | 76 | 594 | 24773 |
Kenneth L. McMillan | 60 | 150 | 20835 |
Edoardo Charbon | 60 | 526 | 12293 |
Richard B. Fair | 59 | 205 | 14653 |
John P. Hayes | 58 | 302 | 11206 |
Sachin S. Sapatnekar | 56 | 424 | 12543 |
Wayne G. Paprosky | 56 | 196 | 10571 |
Robert G. Meyer | 49 | 116 | 13011 |
Scott M. Sporer | 49 | 150 | 8085 |
Charles J. Alpert | 49 | 224 | 8287 |
Joao Marques-Silva | 48 | 289 | 9374 |
Paulo Flores | 48 | 321 | 7617 |