A Faster Counterexample Minimization Algorithm Based on Refutation Analysis

It is a hot research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. The BFL algorithm is the most effective counterexample minimization algorithm compared to all other approaches. But its time overhead is very large due to one call to SAT solver for...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Design, Automation and Test in Europe S. 672 - 677
Hauptverfasser:	Shen, ShengYu, Qin, Ying, Li, SiKun
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	Washington, DC, USA IEEE Computer Society 07.03.2005 IEEE
Schriftenreihe:	ACM Conferences
Schlagworte:	Algorithm design and analysis Computer science Computing methodologies > Modeling and simulation > Model development and analysis Computing methodologies > Modeling and simulation > Model development and analysis > Model verification and validation Computing methodologies > Symbolic and algebraic manipulation > Symbolic and algebraic algorithms Computing methodologies > Symbolic and algebraic manipulation > Symbolic and algebraic algorithms > Algebraic algorithms Data mining Design automation Hardware Minimization methods Performance analysis Production systems Software systems Sufficient conditions Theory of computation > Design and analysis of algorithms Theory of computation > Logic
ISBN:	9780769522883, 0769522882
ISSN:	1530-1591
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!