A modular calculus for the average cost of data structuring

A Modular Calculus for the Average Cost of Data Structuring

Volumn , Issue , 2008, Pages 1-246

  Schellekens, Michel ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84885827885     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-0-387-73384-5     Document Type: Book

References (109)

1. S. Abramsky, R. Jagadeesan, and P. Malacaria, Full abstraction for PCF, Information and Computation 163, 409-470, 2000.
2. A. Aho, J. Hopcroft and J. Ullman, Data Structures and Algorithms, Addison-Wesley Series in Computer Science and Information Processing, Addison-Wesley, 1987.
3. J. de Bakker, J. Rutten (editors, CWI, Amsterdam), Ten Years of Concurrency Semantics, Selected Papers of the Amsterdam Concurrency Group, World Scientific, 1992.
4. H. P. Barendregt, The Lambda Calculus: Its Syntax and Semantics, North Holland, Amsterdam, 1984.
5. S.J. Bellantoni, K.-H Niggl, H. Schwichtenberg, Higher type recursion, ramification and polynomial time, Annals of Pure and Applied Logic, 104(1), 17-30, 2000.
6. M. Boubekeur, D. Hickey and M. Schellekens, Evaluation of MOQA Average-Case Timing Results on a Real Time Platform, Proc. of the conference Information-MFCSIT'06, Electronic Notes in Computer Science, Cork, August 2006, to appear.
7. M. Boubekeur, D. Hickey, J. McEnery and M. Schellekens, Anew Approach for ModularAverage-Case Timing of Real-Time Java Programs, in WSEAS Transactions on Computers, 3(5), 361-368, 2006.
8. M. Boubekeur, D. Hickey and J. McEnery, M. Schellekens, Towards Modular Average-Case Timing in Real-Time Languages: An Application to Real-Time Java, in Proceedings of the 6th WSEAS International Conference on Applied Computer Science (ACS'06), Tenerife, December, 2006.
9. G. Brightwell, H.-J. Promel and A. Steger, The average number of linear extensions of a partial order, J. Combinatorial Theory (A) 73, 193-206, 1996. (Pubitemid 126652126)
10. A. Burns, A. Wellings, Real-time systems and their programming languages, Addison Wesley, 1990.
11. A. Burns, P. Puschner, Writing Temporally Predictable Code, 7th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems WORDS02, 85-94, 2002.
12. J. Cohen, C. Zuckerman, Two Languages for Estimating Program Efficiency, Communications of the ACM, 17(6), 301-308, 1974.
13. S. Cook, Computability and complexity of higher type functions, in Logic from Computer Science (Y.N. Moschovakis, ed.), Springer-Verlag, 51-72, 1991.
14. T.H. Cormen, C. E. Leiserson, R. L. Rivest, Introduction to Algorithms, MIT Press, 1996.
15. B. A. Davey, H. A. Priestley, Introduction to Lattices and Order, Cambridge University Press, 1990.
16. M.R.C. van Dongen, Computing the Frequency of Partial Orders, in Proceedings CP'2004, LNCS 3258, Toronto, Canada, 772-776, 2004. (Pubitemid 39740350)
17. R.D. Dutton, Weak-Heapsort, BIT 33, 372-381, 1993.
18. S. Edelkamp, Weak-Heapsort, ein schnelles sortierverfahren, Diplomarbeit Universität Dortmund, 1996.
19. A. Ermedahl, A Modular Tool Architecture for Worst-Case Execution Time Analysis, PhD thesis, Uppsala University, 2003.
20. S. Finch, Mathematical Constants, Cambridge University Presss, 2003 (Or: Series-Parallel Networks, http://pauillac.inria.fr/algo/bsolve/).
21. P. Flajolet, B. Salvy and P. Zimmermann, Lambda-Upsilon-Omega the 1989 cookbook (RR 1073), 1989.
22. P. Flajolet, B. Salvy, P. Zimmerman, Automatic average-case analysis of algorithms, Theoretical Computer Science 79, 37-109, 1991. (Pubitemid 21671631)
23. P. Flajolet, R. Sedgewick, An Introduction to the Analysis of Algorithms, Addison Wesley, 1995.
24. P. Flajolet, R. Sedgewick, Analytic Combinatorics, to be published by Cambridge University Press, 2008.
25. P. Flajolet, J. S. Vitter, Average-Case Analysis of Algorithms and Data Structures, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, Elsevier, 431-524, 1990.
26. R.W. Floyd, Algorithm 245, treesort 3. Commun. ACM 701, 1964.
27. J.L. Gischer, The equational theory of pomsets, Theor. Comput. Sci. 61, 199-224, 1988.
28. J. Grabowski, On partial languages, Fundamenta Informaticae 4, 427-498, 1981.
29. J. Greiner, Semantics-based parallel cost models and their use in provably efficient implementations, CMU PhD thesis, 1997.
30. C.A. Gunter, Semantics of Programming Languages, MIT Press, Cambridge, MA, 1992.
31. D. Gurr, Semantic frameworks for complexity, Ph.D. thesis, University of Edinburgh, 1991.
32. R. L. Graham, D. E. Knuth, O. Patashnik, Concrete Mathematics: A Foundation for Computer Science, 2/E, Addison Wesley Professional, 1994.
33. A. G. Hamilton, Logic for Mathematicians, Cambridge University Press, 1988.
34. T. Hickey, J. Cohen, Automating Program Analysis, Journal of the ACM, 35(1), 185-220, 1988.
35. M. Heyer, Randomness Preserving Deletions on Special Binary Search Trees, MSc Thesis, 2005.
36. D. Hickey, Distritrack: Automated Average-Case Analysis, Proceedings of the Fourth International Conference on the Quantitative Evaluation of SysTems, QEST2007, Edinburgh, Scotland, UK, IEEE Computer Society Press, 213-214, 2007.
37. D. Hickey, Tracking Data Structures for Automated Average Time Analysis, PhD thesis, National University of Ireland, Cork, June 2008 (in preparation).
38. M. Hofmann, A mixed modal/linear lambda calculus with applications to Bellantoni-Cook safe recursion, in: Proc. CSL'97. LNCS 1414. Springer-Verlag, Berlin, 275-294, 1998. (Pubitemid 128089701)
39. M. Hofmann, Linear types and non-size-increasing polynomial time computation, Information and Computation 183(1), 57-85, 2003.
40. M. Hofmann, Type systems for polynomial-time computation, Habilitation thesis, Darmstadt, 1999. Appears as LFCS Technical Report ECS-LFCS-99-406.
41. K. Hrbacek, T. Jech, Introduction to Set Theory, Marcel Dekker, Inc., 1999.
42. C. A. Hoare, Commun. ACM, 4(7), 321-322, 1961.
43. E. Yu-Shing Hu, G. Bernat, A. Wellings, A Static Timing Analysis Environment Using Java Architecture for Safety Critical Real-Time Systems, Seventh IEEE International Workshop on Object-Oriented Real-Time Dependable Systems (WORDS'02), 77-84, 2002.
44. On Characterizations of the Basic Feasible Functionals, Part I, R. Irwin, B. Kapron and J. Royer, Journal of Functional Programming 11, 117-153, 2001.
45. The Apache Software Foundation, The Apache Commons Project, http://jakarta.apache.org/commons/math/
46. A. T. Jonassen, D. E. Knuth, A trivial algorithm whose analysis is not, J. Comput. System Sci. 16, 301-322, 1978.
47. J/Link, Wolfram Research Inc, www.wolfram.com/solutions/mathlink/jlink
48. C. Jones, G. Plotkin, A probabilistic powerdomain of evaluations, in LICS '89, IEEE Computer Society Press, 186-195, 1989.
49. N. Jones, Computability and Complexity from a Programming Perspective, MIT Press, 1997.
50. G. D. Knott, Deletions in Binary Storage Trees, PhD Thesis, Computer Science Department, Stanford University, 1975.
51. D. Kozen. Semantics of probabilistic programs, Journal of Computer and Systems Sciences, 22, 328-350, 1981.
52. B. Kapron, S. Cook, A new characterization of type 2 feasibility, SIAM Journal on Computing 25, 117-132, 1996.
53. D. Knuth, Mathematical Analysis of Algorithms, in Information Processing '71, Proc. of the 1971 IFIP Congress, North-Holland, Amsterdam, 19-27, 1971.
54. D. Knuth, The art of computer programming vol.3, Addison-Wesley, 1973.
55. D. Knuth, Deletions That Preserve Randomness, IEEE Transactions on Software Engineering, Vol SE-3, No. 5, 351-359, 1977.
56. H. Kopetz, G. Fohler, G. Grunsteidl et al., Real-Time Systems Development: The Programming Model of MARS, in Proceedings of the International Symposium on Autonomous Decentralized Systems, Kawasaki, Japan, March, 190-199, 1993.
57. C. M. Krishna, K.G. Shin, Real-time systems, McGraw-Hill International Series, Computer Science Series, 1997.
58. L. A. Levin, Randomness Conservation Inequalities, Information and Control 61(1), 15-37, 1984.
59. A. Levitin, Introduction to the Design & Analysis of Algorithms, Addison Wesley, 2003.
60. M. Li and P. Vitanyi. An introduction to Kolmogorov Complexity and its applications, Texts and Monographs in Computer Science, Springer Verlag, 1993.
61. T. Maibaum, Mathematical foundations of software engineering: a roadmap, International Conference on Software Engineering, Proceedings of the Conference on The Future of Software Engineering, Limerick, Ireland, 161-172, 2000.
62. C. Martínez, S. Roura, Randomized binary search trees, Journal of the Association for Computing Machinery, 45(2), 288-323, March 1998. (Pubitemid 128505782)
63. Mathematica, Wolfram Research Inc, Www.wolfram.com.
64. M. Mishna, Attribute grammars and automatic algorithm analysis, Advances in Applied Mathematics 30, 189-207, 2003. (Pubitemid 36530195)
65. E. Moggi, D. Archieri, Monadic approach and complexity, preprint.
66. D. Mittermair and P. Puschner, Which Sorting Algorithms to Choose for Hard Real-Time Applications, in Proc. Euromicro Workshop on Real-Time Systems, Toledo, Spain, 250-257, 1997.
67. R. Motwani, P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.
68. M. Naatz, The Graph of Linear Extensions Revisited, SIAM Journal on Discrete Mathematics 13 (3), 354-369, 2000.
69. H. Nielson, Hoare Logics for Run-time Analysis of Programs, Ph.D. thesis, CST-30-84, Edinburgh University, 1984.
70. I. Parberry. Problems on Algorithms, Prentice Hall, 1995.
71. G. Plotkin, LCF considered as a programming language, Theoretical Computer Science 5, 223-255, 1977.
72. V. Pratt, Modelling Concurrency with Partial Orders, International Journal of Parallel Programming 15(1), 33-71, 1986.
73. Purrs: The Parma University's Recurrence Relation Solver, Parma University, www.cs.unipr.it/purrs
74. P. Puschner and C. Koza. Calculating the Maximum Execution Time of Real-Time Programs, Reprint in IEEE tutorial: Advances in Real-Time Systems, IEEE Computer Society Press, 322-339, 1993.
75. P. Puschner, Hard Real-Time Programming is Different, 17th IEEE Int'l Parallel and Distributed Processing Symposium, 11th Int'l Workshop on Parallel and Distributed Real-Time Systems, 117-118, 2003.
76. G. Quan, L. Niu, P. Davis, Power Aware Scheduling for Real-Time Systems with (m, k)-Guarantee, CNDS, 18-21, 2004.
77. K. Ramamritham, Real-Time Databases, International Journal of Distributed and Parallel Databases, 28(2-3), 179-215, 1996.
78. L. Ramshaw, Formalizing the Analysis of Algorithms, Ph.D. Thesis, Stanford University, 1979. (Also available as Report SL-79-5, Xerox Palo Alto Research Center, Palo Alto, California, 1979).
79. Real-Time Specification for Java, http://www.rtsj.org/
80. S. Romaguera, M. P. Schellekens, On the structure of complexity spaces: the general case, Extracta Mathematicae 13, 249-253, 1998.
81. S. Romaguera, M. P. Schellekens, Quasi-metric properties of Complexity Spaces, Topology and its Applications 98, 311-322, 1999.
82. S. Romaguera, M. P. Schellekens, Norm-weightable Riesz spaces and the dual complexity space, ENTCS 74, Elsevier, Proceedings MFCSIT2002, 2003.
83. V. Sarkar, Determining average program execution times and their variance, SIGPLAN Not. 24(7), 298-312, 1989.
84. R. Schaffer and R. Sedgewick, The analysis of Heapsort, Journal of Algorithms 15(1), 76-100, 1993.
85. M. P. Schellekens, The Smyth-completion: a common topological foundation for Denotational Semantics and Complexity Analysis, PhD thesis, Carnegie Mellon University, 1995.
86. M. P. Schellekens, The Smyth-completion: a common foundation for Denotational Semantics and Complexity Analysis, Electronic Notes in Theoretical Computer Science I, Proc. 11th Conf. on the Mathematical Foundations of Programming Semantics, Elsevier, 211-232, 1995.
87. M. P. Schellekens, Complexity Spaces: Lifting and Directedness, Topology Proceedings 22, 403-425, 1999.
88. M. P. Schellekens, A characterization of partial metrizability, Domains are quantifiable, Theoretical Computer Science 305, 409-432, 2003.
89. M. P. Schellekens, The correspondence between partial metrics and semivaluations, Theoretical Computer Science 315, 135-149, 2004.
90. M.P. Schellekens, A randomness preserving product operation, Proc. of the conference Information-MFCSIT'06, Elsevier series Electronic Notes in Theoretical Computer Science, 2008, to appear.
91. M. Schellekens, MOQA; unlocking the potential of compositional static average-case analysis, Journal of Logic and Algebraic Programming, accepted for publication, to appear, 2009.
92. M. P. Schellekens, D. Hickey, G. Bollella, MOQA, a Linearly-Compositional Programming Language for (semi-)automated Average-Case Analysis, WIP Proceedings, 25th IEEE International Real-Time Systems Symposium (RTSS 2004), Lisbon, Portugal, 2004.
93. D. S. Scott and C. Strachey, Toward a mathematical semantics for computer languages, Proc. Symp. on Computers and Automata, 1971.
94. D. S. Scott, Continuous Lattices, Toposes, Algebraic Geometry and Logic, Lecture Notes in Mathematics 274, Springer Verlag, Berlin, 97-136, 1972.
95. R. Seidel, C. Aragon, Randomized search trees, Algorithmica 16, 464-497, 1996. (Pubitemid 126416938)
96. I. Shin and I. Lee, Compositional Real-Time Scheduling Framework, Proceedings 25th IEEE International Real-Time Systems Symposium (RTSS 2004), Lisbon, Portugal, 57-67, 2004. (Pubitemid 40929906)
97. M.B. Smyth, Quasi-uniformities: Reconciling domains with metric spaces, LNCS 298, Springer Verlag, 236-253, 1987.
98. M.B. Smyth, Totally bounded spaces and compact ordered spaces as domains of computation, in G. M. Reed, A. W. Roscoe and R. F. Wachter, editors, Topology and Category Theory in Computer Science, Oxford University Press, 207-229, 1991.
99. Soot, A Java Optimization Framework, Sable McGill university, www.sable.mcgill.ca/soot.
100. R.P. Stanley, Enumerative Combinatorics, v 2., Cambridge University Press, 1999.
101. J. Stoy, Denotational Semantics: the Scott-Strachey approach to Programming Language Theory, MIT Press, 1977.
102. J. Townley, J. Manning, M. Schellekens, Sorting Algorithms in MOQA, Proc. of the conference Information-MFCSIT'06, accepted for publication, Elsevier series, Electronic Notes in Theoretical Computer Science, 2008, to appear.
103. O. Unsal, I. Koren, System-Level Power-Aware Design Techniques in Real Time Systems, Proceedings of the IEEE 91(7), 1055-1069, 2003. (Pubitemid 40890840)
104. T. Vallee, J. Manning, Reconstruction of Partial Orders, preprint.
105. E.L. Lawler, R.E. Tarjan and J. Valdes, The recognition of series parallel digraphs, SIAM. Journ. Comput. 11, 298-313, 1982.
106. J. Vuillemin, A Unifying Look at Data Structures, Commun. ACM 23, 229-239, 1980.
107. B. Wegbreit, Mechanical Program Analysis, Commun. ACM, 18(9), 528-538, 1975.
108. I. Wegener, BOTTOM-UP-HEAPSORT, a new variant of HEAP SORT, beating on an average QUICKSORT (if n is not very small), Theoretical Computer Science 118, 81-98, 1993. (Pubitemid 23713366)
109. J.W.J. Williams. Algorithm 232. Commun. ACM 7(6), 347-348, 1964.