A methodology for generating verified combinatorial circuits

High-level programming languages offer significant expressivity but provide little or no guarantees about resource use. Resourcebounded languages -- such as hardware-description languages -provide strong guarantees about the runtime behavior of computations but often lack mechanisms that allow programmers to write more structured, modular, and reusable programs. To overcome this basic tension in language design, recent work advocated the use of Resource-aware Programming (RAP) languages, which take into account the natural distinction between the development platform and the deployment platform for resource-constrained software. This paper investigates the use of RAP languages for the generation of combinatorial circuits. The key challenge that we encounter is that the RAP approach does not safely admit a mechanism to express a posteriori (post-generation) optimizations. The paper prod studies the use of abstract interpretation to overcome this problem. The approach is illustrated usi...

• Type: Conference
• Year: 2004
• Where: EMSOFT
• Authors: Oleg Kiselyov, Kedar N. Swadi, Walid Taha
• Keywords: EMSOFT 2004, Hardware-description Languages, RAP Languages, Software Engineering, Strong Guarantees