Correctness of dataflow and systolic algorithms using algebras of streams

Acta Informatica

Volumn 38, Issue 1, 2001, Pages 45-88

  Meinke, K ^a   Steggles, L J ^b  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035438184     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00013322     Document Type: Article

References (49)

1. 1. E. Astesiano, M. Cerioli: Partial Higher-Order Specifications. In: A. Tarlecki (ed), Mathematical Foundations of Computer Science, LNCS 520, pp. 74-83. Berlin: Springer 1991
2. 2. J. A. Bergstra, J.V. Tucker: Initial and final algebra semantics for data type specifications: Two characterization theorems. SIAM J. Comput. 12(2): 366-387 (1983)
3. 3. J. A. Bergstra, J. V. Tucker: Algebraic specifications of computable and semicomputable data types. Theor. Comput. Sci. 50: 137-181 (1987)
4. 4. P. Borovanský, C. Kirchner, H. Kirchner, P.-E. Moreau, C. Ringeissen: An overview of ELAN. In: C. Kirchner, H. Kirchner (eds) Proceedings of WRLA '98. Electronic Notes in Theoretical Computer Science, Vol. 15, 1998
5. 5. M. Broy: Equational specification of partial higher-order algebras. In: M. Broy (ed) Logic of programming and calculi of discrete design. Berlin: Springer 1987
6. 6. M. Broy, F. Dederichs, C. Dendorfer, M. Fuchs, T. F. Gritzner, R. Weber: The Design of Distributed Systems - An Introduction to FOCUS. Technical Report No. 342/2/92, Technische Universität Munich, 1993
7. 7. P. M. Cohn: Algebra . Vol. 1. Chichester: Wiley (second edition) 1982
8. 8. E. W. Dijkstra: A discipline of programming. Englewood Cliffs: Prentice-Hall 1976
9. 9. J. Dugundji: Topology. Boston: Allyn and Bacon Inc. 1966
10. 10. H. Ehrig, B. Mahr: Fundamentals of Algebraic Specification 1 - Equations and Initial Semantics. EATCS Monographs on Theoretical Computer Science 6. Berlin: Springer 1985
11. 11. J. A. Goguen, J. Meseguer: Completeness of many-sorted equational logic. ACM SIG-PLAN Notices 17: 9-17 (1982)
12. 12. M. Gordon, T. Melham: Introduction to HOL: a theorem proving environment for higher-order logic. Cambridge University Press 1993
13. 13. F. K. Hanna, N. Daeche: Specification and Verification using Higher-Order Logic. In: C. J. Koomen, T. Moto-oka (eds) Proc. of 7th Int. Conf. on Computer Hardware Description Languages and their Applications. Amsterdam: North-Holland 1985
14. 14. J. Heering: Partial evaluation and ω-incompleteness of algebraic specifications. Theor. Comput. Sci. 43: 149-167 (1986)
15. 15. G. Jones, M. Sheeran: Circuit Design in Ruby. In: J. Staunstrup (ed) Formal Methods for VLSI Design, pages 13-70. Amsterdam: North-Holland 1990
16. 16. J. W. Klop: Term rewriting systems. In: S. Abramsky, D. Gabbay, T.S.E. Maibaum (eds) Handbook of Logic in Computer Science, Vol II, pp. 1-111. Oxford University Press 1993
17. 17. P. Kosiuczenko, K. Meinke: On the power of higher-order algebraic specifications. Inform. Comput. 124(1): 85-101 (1995)
18. 18. H. T. Kung: Why systolic architectures? Computer, 15(1): 37-46 (1982)
19. 19. J. Loeckx, H-D. Ehrich, M. Wolf: Specification of Abstract Data Types. New York: Wiley 1996
20. 20. T. S. E. Maibaum, C. J. Lucena: Higher-order data types. Int. J. Comput. Inform. Sci. 9: 31-53 (1980)
21. 21. K. McEvoy, J. V. Tucker (eds): Theoretical Foundations of VLSI Design. Cambridge Tracts in Theoretical Computer Science 10, Cambridge University Press 1990
22. 22. K. Meinke: A graph theoretic model of synchronous concurrent algorithms. Ph. D. Thesis, School of Computer Studies, University of Leeds, 1988
23. 23. K. Meinke: Universal algebra in higher types. Theor. Comput. Sci. 100: 385-417 (1992)
24. 24. K. Meinke: Subdirect representation of higher type algebras. In: K. Meinke, J. V. Tucker (eds) Many-sorted Logic and its Applications, pp. 135-146. New York: Wiley 1992
25. 25. K. Meinke: A recursive second order initial algebra specification of primitive recursion. Acta Inf. 31: 329-340 (1994)
26. 26. K. Meinke: Higher-order equational logic for specification, simulation and testing. In: G. Dowek et al. (eds) Proc. Second International Workshop on Higher-order Algebra, Logic and Term Rewriting. HOA '95, LNCS 1072, pp. 124-143. Berlin Heidelberg New York: Springer 1996
27. 27. K. Meinke: Topological methods for algebraic specification. Theor. Comput. Sci. 166: 263-290 (1996)
28. 28. K. Meinke: A completeness theorem for the expressive power of higher-order algebraic specifications. J. Comput. Syst. Sci. 54(3): 502-519 (1997)
29. 29. K. Meinke: Proof Theory of Higher-Order Equations: Conservativity, Normal Forms and Term Rewriting. Internal Report, Dept. of Numerical Analysis and Computer Science, KTH Stockholm, 1998
30. 30. K. Meinke, J. V. Tucker: Specification and representation of synchronous concurrent algorithms. In: F. H. Vogt (ed) Concurrency '88, LNCS 335, pp. 163-181. Berlin: Springer 1988
31. 31. K. Meinke, J.V. Tucker: Universal algebra. In: S. Abramsky, D. Gabbay, T.S.E. Maibaum (eds) Handbook of Logic in Computer Science, Vol. I, pp. 189-412. Oxford: Oxford University Press 1993
32. 32. K. Meinke, L. J. Steggles: Specification and Verification in Higher Order Algebra: A Case Study of Convolution. In: J. Heering, K. Meinke, B. Möller, T. Nipkow (eds) Proceedings of HOA '93: An International Workshop on Higher Order Algebra, Logic and Term Rewriting, LNCS 816, pp. 189-222. Berlin Heidelberg New York: Springer 1994
33. 33. K. Meinke, L. J. Steggles: Correctness of Dataflow and Systolic Algorithms: Case Studies in Higher-Order Algebra. Technical Report No. 559. Department of Computing Science, University of Newcastle, 1996
34. 34. B. Möller: Algebraic specifications with higher-order operators. In: L.G.L.T. Meertens (ed) Program specification and transformation. Amsterdam: North-Holland 1987
35. 35. B. Möller: Higher-order algebraic specifications. Fakultät für Mathematik und Informatik, Technische Universität München, Habilitationsschrift, 1987
36. 36. B. Möller: Ordered and Continuous Models of Higher-Order Specifications. In: J. Heering, K. Meinke, B. Möller, T. Nipkow (eds) Proceedings of HOA '93: An International Workshop on Higher Order Algebra, Logic and Term Rewriting, LNCS 816, pp. 223-255. Berlin Heidelberg New York: Springer 1994
37. 37. B. Möller, A. Tarlecki, M. Wirsing: Algebraic specifications of reachable higher-order algebras. In: D. Sannella, A. Tarlecki (eds) Recent Trends in Data Type Specification, LNCS 332, pp. 154-169. Berlin Heidelberg New York: Springer 1988
38. 38. T. Nipkow: Term rewriting and beyond - Theorem proving with Isabelle. Formal Asp. Comput. Sci. 1: 320-338 (1989)
39. 39. A. Poigné: Higher-order data structures - Cartesian closure versus λ-calculus. In: Proceedings of Symposium on Theoretical Aspects of Computer Science 1984, LNCS 166, pp. 174-185. Berlin Heidelberg New York: Springer 1984
40. 40. A. Poigné: On specifications, theories and models with higher types. Inform. Control 68: 1-46 (1986)
41. 41. Z. Qian: An Algebraic Semantics of Higher-Order Types with Subtypes. Acta Inf. 30: 569-607 (1993)
42. 42. V. Stavridou: Formal Methods in Digital Design. Cambridge Tracts in Theoretical Computer Science 37, Cambridge University Press 1993
43. 43. L. J. Steggles: Extensions of Higher-Order Algebra: Fundamental Theory and Case Studies. Ph.D. Thesis, Dept. of Computer Science, University of Wales, Swansea 1995
44. 44. L. J. Steggles: Parameterised Higher-Order Algebraic Specifications. In: M. Hanus, J. Heering, K. Meinke (eds) Proc. of ALP '97 - HOA '97: 6th Int. Joint Conf. on Algebraic and Logic Programming, LNCS 1298, pp. 76-98. Berlin Heidelberg New York: Springer 1997
45. 45. L. J. Steggles, M. Wirsing: Formal Software and Hardware Development: A Case Study in the use of CSDM, SPECTRUM and HOLCF. Technical Report No. 9515, Ludwig-Maximilians-Universität München, Institut für Informatik, 1995
46. 46. R. Stephens: A Survey of Stream Processing. Acta Inf. 34(7): 491-541 (1997)
47. 47. B. C. Thompson, J. V. Tucker: Equational specification of synchronous concurrent algorithms and architectures (Second Edition). Report CSR 15-94, Department of Computer Science, University College of Swansea, 1994
48. 48. W. W. Wadge, E. A. Ashcroft: Lucid, the Dataflow Programming Language. Academic Press 1985
49. 49. M. Wirsing: Algebraic specification. In: J. van Leeuwen (ed) Handbook of Theoretical Computer Science, Vol. B, pp. 675-788. Amsterdam: North Holland 1990