Download now Free registration required
Many software as well digital hardware automatic synthesis methods define the set of implementations meeting the given system specifications with a Boolean relation K. In such a context a fundamental step in the software (hardware) synthesis process is finding effective solutions to the functional equation defined by K. This entails finding a (set of) Boolean function(s) F (typically represented using OBDDs, Ordered Binary Decision Diagrams) such that: for all x for which K is satisfiable, K(x, F(x)) = 1 holds; the implementation of F is efficient with respect to given implementation parameters such as code size or execution time. While this problem has been widely studied in digital hardware synthesis, little has been done in a software synthesis context.
- Format: PDF
- Size: 137.29 KB