从布尔函数方程到控制软件
From Boolean Functional Equations to Control Software
AI总结:
针对软件合成中布尔关系K定义的函数方程,提出一种从OBDD表示生成C代码的算法,实现代码大小与OBDD相同且最坏情况执行时间为O(nr)。
摘要:
许多软件以及数字硬件自动综合方法用布尔关系K定义满足给定系统规格的实现集合。在这样的背景下,软件(硬件)综合过程中的一个基本步骤是找到由K定义的函数方程的有效解。这需要找到一个(一组)布尔函数F(通常用OBDD,有序二叉决策图表示),使得:1)对于所有使K可满足的x,K(x, F(x)) = 1成立;2)F的实现相对于给定的实现参数(如代码大小或执行时间)是高效的。虽然这个问题在数字硬件综合中已被广泛研究,但在软件综合背景下却很少涉及。不幸的是,为硬件综合开发的方法不能直接用于软件环境。这促使我们研究在F必须用软件实现时解决上述问题的有效方法。在本文中,我们提出了一种算法,从K的OBDD表示出发,为F生成C代码实现,该代码具有与F的OBDD相同的大小,并且最坏情况执行时间(WCET)为O(nr),其中n = |x|是F中函数的参数个数,r是F中函数的个数。
英文摘要:
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: 1) for all x for which K is satisfiable, K(x, F(x)) = 1 holds; 2) 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. Unfortunately the approaches developed for hardware synthesis cannot be directly used in a software context. This motivates investigation of effective methods to solve the above problem when F has to be implemented with software. In this paper we present an algorithm that, from an OBDD representation for K, generates a C code implementation for F that has the same size as the OBDD for F and a WCET (Worst Case Execution Time) at most O(nr), being n = |x| the number of arguments of functions in F and r the number of functions in F.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。