Retargetable Compilation of Self-Test Programs Using Constraint Logic Programming

  • Ulrich Bieker
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 317)


This chapter presents a retargetable code generator specialized in the compilation of self-test programs and exploiting new techniques from Constraint Logic Programming (CLP). Firstly, we show how CLP can be exploited to improve the software production process especially for retargetable code generation and test generation. CLP combines the declarative paradigm of logic programming with the efficiency of constraint solving techniques. CLP systems come with built-in mechanisms for solving constraints over various domains. For example, satisfiability checkers support Boolean constraints and IP-solvers support integer domains. Furthermore, CLP makes it easier to solve problems concurrently, e.g. the phase coupling problem during code generation.

Secondly, we present a solution for testing embedded processors. Thus we exploit CLP techniques for retargetable code generation to generate self-test programs, given a set of test patterns for each of the register transfer processor components.


Transformation Rule Program Counter Register Transfer Level Instruction Memory Embed Processor 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2002

Authors and Affiliations

  • Ulrich Bieker
    • 1
  1. 1.Department of Computer ScienceUniversity of DortmundDortmundGermany

Personalised recommendations