Presentation	2012-07-02 On efficiently computing of indirect implications Yusuke MATSUNAGA,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	This paper describes an efficient algorithm for computing indirect implications on logic circuit, which are not directly derived from circuit structure. The proposed algorithm utilizes "The cause list" having value assignments which make the target signal to get fixed. The cause list can be derived transitively through the circuit structure, and does not need any functional manipulations. So, this algorithm efficiently computes many indirect implications. As for the comparison, the exact algorithm computing all the indirect implications using SAT solver is also introduced. The experimental results show that the proposed algorithm's efficiency and effectiveness.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	logic circuits / ATPG / logic verification / indirect implication
Paper #	CAS2012-12,VLD2012-22,SIP2012-44,MSS2012-12
Date of Issue

Conference Information
Committee	MSS
Conference Date	2012/6/25(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Mathematical Systems Science and its applications(MSS)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	On efficiently computing of indirect implications
Sub Title (in English)
Keyword(1)	logic circuits
Keyword(2)	ATPG
Keyword(3)	logic verification
Keyword(4)	indirect implication
1st Author's Name	Yusuke MATSUNAGA
1st Author's Affiliation	Faculty of Information Science and Electorical Engineering, Kyushu University()
Date	2012-07-02
Paper #	CAS2012-12,VLD2012-22,SIP2012-44,MSS2012-12
Volume (vol)	vol.112
Number (no)	116
Page	pp.pp.-
#Pages	6
Date of Issue