Generation of efficient programs for solving maximum multi-marking problems

Isao Sasano, Zhenjiang Hu, Masato Takeichi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationSemantics, Applications, and Implementation of Program Generation - 2nd International Workshop, SAIG 2001, Proceedings
EditorsWalid Taha
PublisherSpringer Verlag
Pages72-91
Number of pages20
ISBN (Electronic)3540425586, 9783540425588
DOIs
Publication statusPublished - 2001 Jan 1
Externally publishedYes
Event2nd International Workshop on Semantics, Applications, and Implementation of Program Generation, SAIG 2001 - Florence, Italy
Duration: 2001 Sep 62001 Sep 6

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2196
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other2nd International Workshop on Semantics, Applications, and Implementation of Program Generation, SAIG 2001
CountryItaly
CityFlorence
Period01/9/601/9/6

Keywords

  • Algorithm synthesis
  • Functional programming
  • Maximum marking problem
  • Optimization problem
  • Program generation rule

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Generation of efficient programs for solving maximum multi-marking problems'. Together they form a unique fingerprint.

  • Cite this

    Sasano, I., Hu, Z., & Takeichi, M. (2001). Generation of efficient programs for solving maximum multi-marking problems. In W. Taha (Ed.), Semantics, Applications, and Implementation of Program Generation - 2nd International Workshop, SAIG 2001, Proceedings (pp. 72-91). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2196). Springer Verlag. https://doi.org/10.1007/3-540-44806-3_5