Functional Test Generation Using Constraint Logic Programming - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Book Sections Year : 2002

Functional Test Generation Using Constraint Logic Programming


Semi-formal verification based on symbolic simulation offers a good compromise between formal model checking and numerical simulation. The generation of functional test vectors, guided by miscellaneous coverage metrics to satisfy the simulation target, can be posed as a satisfiability problem (SAT). This paper presents a novel approach to solving SAT based on Constraint Logic Programming technique. The proposed SAT solver allows efficiently handling the designs with mixed word-level arithmetic operators and Boolean logic. It is applicable for designs specified at different levels, including HDL, RTL, and Boolean. The experimental results are quite encouraging compared with classical CNF-based, BDD-based, and LP-based SAT solvers.
Fichier principal
Vignette du fichier
Zeng2002_Chapter_FunctionalTestGenerationUsingC.pdf (1.81 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

lirmm-00268536 , version 1 (04-10-2022)



Zhihong Zeng, Maciej Ciesielski, Bruno Rouzeyre. Functional Test Generation Using Constraint Logic Programming. SOC Design Methodologies, 90, Kluwer Academic Publishers, pp.375-386, 2002, IFIP — The International Federation for Information Processing, 978-1-4757-6530-4. ⟨10.1007/978-0-387-35597-9_32⟩. ⟨lirmm-00268536⟩
56 View
23 Download



Gmail Facebook X LinkedIn More