Generation of efficient programs for solving maximum multi-marking problems

  • Authors:

  • Isao Sasano;Zhenjiang Hu;Masato Takeichi

  • Affiliations:

  • Department of Information Engineering, University of Tokyo, Tokyo, Japan;Department of Information Engineering, University of Tokyo, Tokyo, Japan;Department of Information Engineering, University of Tokyo, Tokyo, Japan

  • Venue:
  • SAIG'01 Proceedings of the 2nd international conference on Semantics, applications, and implementation of program generation
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

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.