Article

Free access

Multi-node static logic implications for redundancy identification

Authors:

Kabir Gulrajani,

Michael S. HsiaoAuthors Info & Claims

DATE '00: Proceedings of the conference on Design, automation and test in Europe

Pages 729 - 735

https://doi.org/10.1145/343647.344102

Published: 01 January 2000 Publication History

PDF eReader Publisher Site

References

[1]

S. T. Chakradhar and V. D. Agrawal. A Transitive Closure Based Algorithm for Test Generation. In Proc. of the Design Automation Conf. ACM/IEEE, June 1991.

Digital Library

Google Scholar

[2]

S. T. Chakradhar and V. D. Agrawal. A Transitive Closure Algorithm for Test Generation. In Trans. Computer-Aided Design. IEEE, June 1993.

Google Scholar

[3]

M. A. Iyer and M. Abramovici. Low Cost Redundancy Identification for Combinational Circuits. Proc. Int. Conference VLSI Design, June 1994.

Crossref

Google Scholar

[4]

M. A. Iyer and M. Abramovici. FIRE: A Fault independent Combinational Redundancy Identification Algorithm. Trans. VLSI systems, June 1996.

Digital Library

Google Scholar

[5]

W. Kunz and D. K. Pradhan. Recursive learning: An Attractive Alternative to the Decision Tree for Test Generation in Digital Circuits. Trans. on CAD, May 1993.

Google Scholar

[6]

J. Rajski and H. Cox. A Method to Calculate Necessary Assignments in ATPG. In Proc. of the Int'l. Test Conf. IEEE, September 1990.

Google Scholar

[7]

Zhao, M. Rudnick, and Janak Patel. Static Logic Implication with Application to Fast Redundancy Identification. VLSI Test Syrnposi~trn, April 1997.

Digital Library

Google Scholar

Cited By

View all

Alves NBuben ANepal KDworak JBahar R(2010)A cost effective approach for online error detection using invariant relationshipsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2010.204359029:5(788-801)Online publication date: 1-May-2010
https://dl.acm.org/doi/10.1109/TCAD.2010.2043590
Alves NNepal KDworak JBahar RBenini LDe Micheli GAl-Hashimi BMueller W(2009)Detecting errors using multi-cycle invariance informationProceedings of the Conference on Design, Automation and Test in Europe10.5555/1874620.1874815(791-796)Online publication date: 20-Apr-2009
https://dl.acm.org/doi/10.5555/1874620.1874815
Alves NNepal KDworak JBahar R(2009)Detecting errors using multi-cycle invariance information2009 Design, Automation & Test in Europe Conference & Exhibition10.1109/DATE.2009.5090771(791-796)Online publication date: Apr-2009
https://doi.org/10.1109/DATE.2009.5090771
Show More Cited By

Index Terms

Multi-node static logic implications for redundancy identification
1. Hardware

Recommendations

Static logic implication with application to redundancy identification
VTS '97: Proceedings of the 15th IEEE VLSI Test Symposium

This paper presents a new static logic implication algorithm. An improved implication procedure that fully takes advantage of the special context of static implication, the iterative method, and set algebra is described. The algorithm discovers at low ...
Redundancy in logic III: Non-monotonic reasoning

Results about the redundancy of certain versions of circumscription and default logic are presented. In particular, propositional circumscription where all variables are minimized and skeptical default logics are considered. This restricted version of ...
A Strong Logic Programming View for Static Embedded Implications
FoSSaCS '99: Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99

A strong (L) logic programming language ([14, 15]) is given by two subclasses of formulas (programs and goals) of the underlying logic L, provided that: firstly, any program P (viewed as a L-theory) has a canonical model MP which is initial in the ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

DATE '00: Proceedings of the conference on Design, automation and test in Europe

January 2000

707 pages

ISBN:1581132441

DOI:10.1145/343647

Chairman:
Ivo Bolsens
IMEC, Leuven, Belgium

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 2000

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

DATE00

Sponsor:

EDAA
EDAC
SIGDA
IEEE-CS
IFIP
The Russian Academy of Sciences

DATE00: Design Automation and Test in Europe

March 27 - 30, 2000

Paris, France

Acceptance Rates

Overall Acceptance Rate 518 of 1,794 submissions, 29%

Upcoming Conference

DATE '25

Sponsor:
sigda

Design, Automation and Test in Europe

March 31 - April 2, 2025

Lyon , France

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
103
Total Downloads

Downloads (Last 12 months)7
Downloads (Last 6 weeks)0

Reflects downloads up to 17 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Alves NBuben ANepal KDworak JBahar R(2010)A cost effective approach for online error detection using invariant relationshipsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2010.204359029:5(788-801)Online publication date: 1-May-2010
https://dl.acm.org/doi/10.1109/TCAD.2010.2043590
Alves NNepal KDworak JBahar RBenini LDe Micheli GAl-Hashimi BMueller W(2009)Detecting errors using multi-cycle invariance informationProceedings of the Conference on Design, Automation and Test in Europe10.5555/1874620.1874815(791-796)Online publication date: 20-Apr-2009
https://dl.acm.org/doi/10.5555/1874620.1874815
Alves NNepal KDworak JBahar R(2009)Detecting errors using multi-cycle invariance information2009 Design, Automation & Test in Europe Conference & Exhibition10.1109/DATE.2009.5090771(791-796)Online publication date: Apr-2009
https://doi.org/10.1109/DATE.2009.5090771
Wu WHsiao MSentovich E(2006)Mining global constraints for improving bounded sequential equivalence checkingProceedings of the 43rd annual Design Automation Conference10.1145/1146909.1147098(743-748)Online publication date: 24-Jul-2006
https://dl.acm.org/doi/10.1145/1146909.1147098
Weixin Wu Hsiao M(2006)Mining global constraints for improving bounded sequential equivalence checking2006 43rd ACM/IEEE Design Automation Conference10.1109/DAC.2006.229319(743-748)Online publication date: 2006
https://doi.org/10.1109/DAC.2006.229319
Vimjam VSyal MHsiao MLach JQu GIsmail Y(2005)Untestable fault identification through enhanced necessary value assignmentsProceedings of the 15th ACM Great Lakes symposium on VLSI10.1145/1057661.1057705(176-181)Online publication date: 17-Apr-2005
https://dl.acm.org/doi/10.1145/1057661.1057705

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Static logic implication with application to redundancy identification

Redundancy in logic III: Non-monotonic reasoning

A Strong Logic Programming View for Static Embedded Implications