Elementary microarchitecture algebra

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1633, Issue , 1999, Pages 288-300

  Matthews, John ^a   Launchbury, John ^a  

^a OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; PIPELINES;

ALGEBRAIC LAWS; HAZARD DETECTION; MICRO ARCHITECTURES; PIPELINE STAGES; REFERENCE ARCHITECTURE;

COMPUTER AIDED ANALYSIS;

EID: 84957100595     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48683-6_26     Document Type: Conference Paper

References (26)

1. ÀAGAARD, M., AND Leeser, M. Reasoning about pipelines with structural hazards. In Second International Conference on Theorem Provers in Circuit Design (Bad Herrenalb, Germany, Sept. 1994).
2. Bird, R., AND Wadler, P. Introduction to Functional Programming. Prentice Hall International Series in Computer Science. Prentice Hall, 1988.
3. Bird, R. s., AND Moor, O. D. Algebra of Programming. Prentice Hall, 1996.
4. Cook, B., LaunohbüRY, j., and Matthews, J. Specifying superscalar microprocessors in Hawk. In FTH'98, Workshop on Formal Techniques for Hardware and Hardware-like Systems (Marstrand, Sweden, June 1998).
5. Gill, A., Launchbury, J., AND Peyton Jones, S. L. A Short Cut to Deforestation. In FPCA'93, Conference on Functional Programming Languages and Computer Architecture (Copenhagen, Denmark, June 1993), ACM Press, pp. 223-232.
6. Halbwachs, N. Synchronous programming of reactive systems. Kluwer Academic Pub., 1993.
7. Halbwachs, N., Lagnier, F., AND Ratel, C. Programming and verifying realtime systems by means of the synchronous data-flow programming language Lustre. IEEE Transactions on Software Engineering, Special Issue on the Specification and Analysis of Real-Time Systems (September 1992).
8. Hudak, P., Peterson, j., AND Fasel, J. A gentle introduction to Haskell. Available at www.haskell.org, Dec. 1997.
9. Johnson, S. D. Synthesis of Digital Systems from Recursive Equations. ACM Distinguished Dissertation Series. MIT Press, 1984.
10. Jones, G., AND Sheeran, M. Collecting butterflies. Tech. rep., Oxford University Computing Laboratory, 1991.
11. Jones, G., AND Sheeran, M. Designing arithmetic circuits by refinement in ruby. In Mathematics of Program Construction (1993), vol. 669 of LNCS, Springer Verlag.
12. Jones, S. L. P., AND Santos, A. L. M. A transformation-based optimiser for Haskell. Science of Computer Programming 32, 1-3 (Sept. 1998), 3-47.
13. Launchbury, J. Graph algorithms with a functional flavour. Lecture Notes in Computer Science 925 (1995).
14. Leiserson, C. E., AND Saxe, J. B. Retiming synchronous circuitry. Algorithmica 6 (1991), 5-35.
15. Levitt, j., AND Olukotun, K. A scalable formal verification methodology for pipelined microprocessors. In 33rd Design Automation Conference (DAC'96) (New York, June 1996), Association for Computing Machinery, pp. 558-563.
16. Matthews, j., AND Launchbury, J. Elementary microarchitecture algebra: Top-level proof of pipelined microarchitecture. Tech. Rep. CSE-99-002, Oregon Graduate Institute, Computer Science Department, Portland, Oregon, Mar. 1999.
17. Matthews, J., Launchbury, J., and Cook, B. Specifying microprocessors in Hawk. In IEEE International Conference on Computer Languages (Chicago, Illinois, May 1998), pp. 90-101.
18. O'Donnell, J. From transistors to computer architecture: Teaching functional circuit specification in Hydra. In Symposium on Functional Programming Languages in Education (July 1995).
19. Onder, S., AND Gupta, R. Automatic generation of microarchitecture simulators. In IEEE International Conference on Computer Languages (Chicago, Illinois, May 1998), pp. 80-89.
20. Paulson, L. Isabelle: A Generic Theorem Prover. Springer-Verlag, 1994.
21. Peterson, j., et al. Report on the programming language Haskell: A non-strict, purely functional language, version 1.4. Available at www.haskell.org, Apr. 1997.
22. Sawada, J., AND Hunt, W. A. Processor verification with precise exceptions and speculative execution. Lecture Notes in Computer Science 1427 (1998), 135-146.
23. Saxe, J., AND Garland, S. Using Transformations and Verifications in Circuit Design. Formal Methods in System Design 4, 1 (1994), 181-210.
24. Sharp, R., AND Rasmussen, O. An introduction to Ruby. Teaching Notes ID-U: 1995-80, Dept. of Computer Science, Technical University of Denmark, October 1995.
25. Sheeran, M. μFP, an Algebraic VLSI Design Language. PhD thesis, Programming Research Group, University of Oxford, 1983.
26. Sheeran, M. Retiming and slowdown in Ruby. In The Fusion of Hardware Design and Verification (Glasgow, Scotland, July 1988), G.J. Milne, Ed., IFIP WG 10.2, North-Holland, pp. 289-308.