TY - JOUR
T1 - On the Feasibility of Synthesizing CAD Software from Specifications
T2 - Generating Maze Router Tools in ELF
AU - Setliff, Dorothy E.
AU - Rutenbar, Rob A.
N1 - Funding Information:
Manuscript received October 10, 1989; revised May 14, 1990. This work was supported by the CMU CAD Industrial Affiliates Program. This paper was recommended by Associate Editor M. Marek-Sadowska. D. E. Setliff was with the Department of Electrical and Computer Engineering, Camegie Mellon University, Pittsburgh, PA. She is now with the Department of Electrical Engineering, University of Pittsburgh, Pittsburgh, PA 15261. R. A. Rutenbar is with the Department of Electrical and Computer Engineering, Camegie Mellon University, Pittsburgh, PA 15213. IEEE Log Number 9042635.
PY - 1991/6
Y1 - 1991/6
N2 - This paper describes how program synthesis techniques can be applied to the generation of technology sensitive VLSI physical design tools. We describe ELF, a program syn-. thesis architecture targeted at the generation of maze routing software. ELF strives to meet the demands of the target technology by automatically generating maze router implementations to match the application requirements. ELF has three key features. First, a very high level language, lacking data structure implementation specifications, is used to describe algorithm design styles. Second, application specific expertise about routing and application independent code synthesis techniques are used to guide search among alternative design styles for algorithms and data structures. Third, code generation is used to transform the resulting abstract descriptions of selected algorithms and data structures into final, executable code. Code generation is an incremental, stepwise refinement process. Experimental results are presented covering several correct, fully functional routers synthesized by ELF from varying high level specifications. Results from synthetic and industrial benchmarks are examined to illustrate ELF’s capabilities.
AB - This paper describes how program synthesis techniques can be applied to the generation of technology sensitive VLSI physical design tools. We describe ELF, a program syn-. thesis architecture targeted at the generation of maze routing software. ELF strives to meet the demands of the target technology by automatically generating maze router implementations to match the application requirements. ELF has three key features. First, a very high level language, lacking data structure implementation specifications, is used to describe algorithm design styles. Second, application specific expertise about routing and application independent code synthesis techniques are used to guide search among alternative design styles for algorithms and data structures. Third, code generation is used to transform the resulting abstract descriptions of selected algorithms and data structures into final, executable code. Code generation is an incremental, stepwise refinement process. Experimental results are presented covering several correct, fully functional routers synthesized by ELF from varying high level specifications. Results from synthetic and industrial benchmarks are examined to illustrate ELF’s capabilities.
UR - http://www.scopus.com/inward/record.url?scp=0026173346&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0026173346&partnerID=8YFLogxK
U2 - 10.1109/43.137507
DO - 10.1109/43.137507
M3 - Article
AN - SCOPUS:0026173346
SN - 0278-0070
VL - 10
SP - 783
EP - 801
JO - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
JF - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
IS - 6
ER -