Abstract
Program generation has seen an important role in a wide range of software development processes, where effective calculation rules are critical. In this paper, we propose a more general calculation rule for generation of efficient programs for solving maximum marking problems. Easy to use and implement, our new rule gives a significant extension of the rule proposed by Sasano et al., allowing multiple kinds of marks as well as more general description of the property of acceptable markings. We illustrate its effectiveness using several interesting problems.
Isao Sasano is supported by JSPS Research Fellowships for Young Scientists.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andrew Gill, John Launchbury, and Simon L. Peyton Jones. A short cut to deforestation. In Proceedings of the 6th International Conference on Functional Programming Languages and Computer Architecture (FPCA‘93), pages 223–232, Copenhagen, Denmark, June 1993. ACM Press.
Richard Bird. Maximum marking problems, 2000. Available from http://www.comlab.ox.ac.uk/oucl/work/richard.bird/publications/mmp.ps.
Isao Sasano, Zhenjiang Hu, Masato Takeichi, and Mizuhito Ogawa. Make it practical: A generic linear-time algorithm for solving maximum-weightsum problems. In Proceedings of the 5th ACM SIGPLAN International Conference on Functional Programming (ICFP‘00), pages 137–149, Montreal, Canada, September 2000. ACM Press.
Marshall W. Bern, Eugene L. Lawler, and A. L. Wong. Linear-time computation of optimal subgraphs of decomposable graphs. Journal of Algorithms, 8:216–235, 1987.
Richard B. Borie, R. Gary Parker, and Craig A. Tovey. Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica, 7:555–581, 1992.
Richard Bird. Algebraic identities for program calculation. The Computer Journal, 32(2):122–126, 1989.
Richard Bird and Oege de Moor. Algebra of Programming. Prentice Hall, 1996.
Oege de Moor and Ganesh Sittampalam. Generic program transformation. In Proceedings of the 3rd International Summer School on Advanced Functional Programming (AFP‘98), LNCS 1608, pages 116–149, Braga, Portugal, September 1998. Springer-Verlag.
Richard Bird. Introduction to Functional Programming using Haskell (second edition). Prentice Hall, 1998.
Richard Bird. An introduction to the theory of lists. In Manfred Broy, editor, Logic of Programming and Calculi of Discrete Design, NATO ASI Series 36, pages 5–42. Springer-Verlag, 1987.
Maarten M. Fokkinga. Law and Order in Algorithmics. PhD thesis, University of Twente, Dept INF, Enschede, The Netherlands, 1992.
Zhenjiang Hu, Hideya Iwasaki, Masato Takeichi, and Akihiko Takano. Tupling calculation eliminates multiple data traversals. In Proceedings of the 2nd ACM SIGPLAN International Conference on Functional Programming (ICFP‘97), pages 164–175, Amsterdam, The Netherlands, June 1997. ACM Press.
Silvano Martello and Paolo Toth. Knapsack Problems: Algorithms and Computer Implementations. Wiley-Interscience series in discrete mathematics and optimization. John Wiley & Sons Ltd., 1990.
Thomas Erlebach and Frits Spieksma. Simple algorithms for a weighted interval selection problem. In Proceedings of the 11th International Symposium on Algorithms and Computation (ISAAC‘00), LNCS 1969, pages 228–240, Taipei, Taiwan, December 2000. Springer-Verlag.
Johan Jeuring. Theories for Algorithm Calculation. Ph.D thesis, Faculty of Science, Utrecht University, 1993.
Oege de Moor. A generic program for sequential decision processes. In Proceedings of the 7th International Symposium on Programming Languages, Implementations, Logics, and Programs (PLILP‘95), LNCS 982, pages 1–23, Utrecht, the Netherlands, September 1995.
Wolfgang Thomas. Automata on infinite objects. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 4, pages 133–192. Elsevier Science Publishers, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sasano, I., Hu, Z., Takeichi, M. (2001). Generation of Efficient Programs for Solving Maximum Multi-marking Problems. In: Taha, W. (eds) Semantics, Applications, and Implementation of Program Generation. SAIG 2001. Lecture Notes in Computer Science, vol 2196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44806-3_5
Download citation
DOI: https://doi.org/10.1007/3-540-44806-3_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42558-8
Online ISBN: 978-3-540-44806-8
eBook Packages: Springer Book Archive