Finding heap-bounds for hardware synthesis

9th International Conference Formal Methods in Computer Aided Design, FMCAD 2009

Volumn , Issue , 2009, Pages 205-212

  Cook, B ^a   Gupta, A ^b   Magill, S ^a   Rybalchenko, A ^b   Simsa, J ^a   Singh, S ^a   Vafeiadis, V ^a  

^a MSR ^*

^b MAX PLANCK INSTITUTE FOR SOFTWARE SYSTEMS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT BASED METHOD; GENERIC PARAMETERS; HARDWARE SYNTHESIS; MEMORY USAGE; NON-TRIVIAL; SYNTHESIS TIME; UPPER BOUND;

COMPUTER AIDED DESIGN; COMPUTER HARDWARE; DATA STRUCTURES;

FORMAL METHODS;

EID: 76549126778     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FMCAD.2009.5351120     Document Type: Conference Paper

References (34)

1. E. Albert, S. Genaim, and M. Gomez-Zamalloa. Heap space analysis for Java bytecode. In ISMM, 2007.
2. D. Beyer, T. A. Henzinger, R. Majumdar, and A. Rybalchenko. Path invariants. In Proc. PLDI, pages 300-309. ACM Press, 2007.
3. P. Bjesse, K. Claessen, M. Sheeran, and S. Singh. Lava: Hardware design in Haskell. In ICFP, 1998.
4. V. Braberman, D. Garbervetsky, and S. Yovine. A static analysis for synthesizing parametric specifications of dynamic memory consumption. Journal of Object Technology, 2006.
5. B. C. Brock, W. A. Hunt, and M. Kaufmann. The FM9001 microprocessor proof. Technical Report 86, http://www.cli.com, 1994.
6. F. Bruschi and F. Ferrandi. Synthesis of complex control structures from behavioral SystemC models. DATE, 2003.
7. B. A. Buyukkurt, Z. Guo, and W. Najjar. Impact of loop unrolling on throughput, area and clock frequency in ROCCC: C to VHDL compiler for FPGAs. Int. Workshop On Applied Reconfigurable Computing, 2006.
8. B. E. Chang and X. Rival. Relational inductive shape analysis. In POPL, 2008.
9. M. A. Colon, S. Sankaranarayanan, and H. B. Sipma. Linear invariant generation using non-linear constraint solving. In C AV, 2003.
10. D. Distefano, P. O'Hearn, and H. Yang. A local shape analysis based on separation logic. TACAS, 2006.
11. M. D. Ernst, J. H. Perkins, P. J. Guo, S. McCamant, C. Pacheco, M. S. Tschantz, and C. Xiao. The Daikon system for dynamic detection of likely invariants. Science of Computer Programming, 69:35-45, 2007.
12. J. Farkas. Uber die theorie der einfachen ungleichungen. Journal fur die Reine und Angewandte Mathematik, 124:1-27, 1902.
13. M. Gokhale, J. M. Stone, J. Arnold, and M. Kalinowski. Stream-oriented FPGA computing in the Streams-C high level language. FCCM, 2000.
14. S. Gulwani, K. Mehra, and T. Chilimbi. SPEED: Precise and efficient static estimation of program computational complexity. In POPL, 2009.
15. A. Gupta, R. Majumdar, and A. Rybalchenko. From tests to proofs. TACAS, 2009.
16. A. Gupta and A. Rybalchenko. InvGen: An efficient invariant generator. In CAV, 2009.
17. R. K. Gupta and S. Y. Liao. Using a programming language for digital system design. IEEE Design and Test of Computers, 14, Apr. 1997.
18. S. Gupta, N. D. Dutt, R. K. Gupta, and A. Nicolau. SPARK: A high-level synthesis framework for applying parallelizing compiler transformations. VLSI Conference, 2003.
19. M. Hofmann and S. Jost. Static prediction of heap space usage for first-order functional programs. In POPL, 2003.
20. M. Hofmann and S. Jost. Type-based amortised heap-space analysis. In ESOP, 2006.
21. IMEC. CleanC analysis tools. http://www.imec.be/CleanC/, 2008.
22. R. Iosif, M. Bozga, A. Bouajjani, P. Habermehl, P. Moro, and T. Vojnar. Programs with lists are counter automata. In CAV, 2006.
23. T. Lev-Ami and M. Sagiv. TVLA: A system for implementing static analyses. SAS, 2000.
24. S. Magill, J. Berdine, E. Clarke, and B. Cook. Arithmetic strengthening for shape analysis. SAS, 2006.
25. S. Magill, M. Tsai, P. Lee, and Y. Tsay. THOR: A tool for reasoning about shape and arithmetic. CAV, 2008.
26. W. A. Najjar, A. P. W. Bohm, B. A. Draper, J. Hammes, R. Rinker, J. R. Beveridge, M. Chawathe, and C. Ross. High-level language abstraction for reconfigurable computing. IEEE Computer, 36(8), 2003.
27. A. Podelski and A. Rybalchenko. A complete method for the synthesis of linear ranking functions. In VMCAI, 2004.
28. A. Podelski and A. Rybalchenko. ARMC: the logical choice for software model checking with abstraction refinement. In PADL, 2007.
29. M. Raza, C. Calcagno, and P. Gardner. Automatic parallelization with separation logic. In ESOP, 2009.
30. X. Saint-Mleux, M. Feeley, and J.-P. David. SHard: a Scheme to hardware compiler. In Workshop on Scheme and Functional Programming, 2006.
31. S. Sankaranarayanan, H. Sipma, and Z. Manna. Constraint-based linear-relations analysis. SAS, 2004.
32. L. Semeria and G. D. Micheli. SpC: synthesis of pointers in C. ICCAD, 1998.
33. A. Takach, B. Bower, and T. Bollaert. C based hardware design for wireless applications. DATE, 2005.
34. Y. D. Yankova, G. Kuzmanov, K. Bertels, G. N. Gaydadjiev, Y. Lu, and S. Vassiliadis. DWARV: Delftworkbench automated reconfigurable VHDL generator. FPL, 2007.