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 publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages72-91
Number of pages20
Volume2196
ISBN (Print)3540425586, 9783540425588
Publication statusPublished - 2001
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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

Software engineering

Keywords

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

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Sasano, I., Hu, Z., & Takeichi, M. (2001). Generation of efficient programs for solving maximum multi-marking problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2196, pp. 72-91). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2196). Springer Verlag.

Generation of efficient programs for solving maximum multi-marking problems. / Sasano, Isao; Hu, Zhenjiang; Takeichi, Masato.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2196 Springer Verlag, 2001. p. 72-91 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2196).

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

Sasano, I, Hu, Z & Takeichi, M 2001, Generation of efficient programs for solving maximum multi-marking problems. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 2196, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2196, Springer Verlag, pp. 72-91, 2nd International Workshop on Semantics, Applications, and Implementation of Program Generation, SAIG 2001, Florence, Italy, 01/9/6.
Sasano I, Hu Z, Takeichi M. Generation of efficient programs for solving maximum multi-marking problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2196. Springer Verlag. 2001. p. 72-91. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Sasano, Isao ; Hu, Zhenjiang ; Takeichi, Masato. / Generation of efficient programs for solving maximum multi-marking problems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2196 Springer Verlag, 2001. pp. 72-91 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{d4c544f8ebad40048b33b0ac7b134121,
title = "Generation of efficient programs for solving maximum multi-marking problems",
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.",
keywords = "Algorithm synthesis, Functional programming, Maximum marking problem, Optimization problem, Program generation rule",
author = "Isao Sasano and Zhenjiang Hu and Masato Takeichi",
year = "2001",
language = "English",
isbn = "3540425586",
volume = "2196",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "72--91",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Generation of efficient programs for solving maximum multi-marking problems

AU - Sasano, Isao

AU - Hu, Zhenjiang

AU - Takeichi, Masato

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

KW - Algorithm synthesis

KW - Functional programming

KW - Maximum marking problem

KW - Optimization problem

KW - Program generation rule

UR - http://www.scopus.com/inward/record.url?scp=84937420167&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84937420167&partnerID=8YFLogxK

M3 - Conference contribution

SN - 3540425586

SN - 9783540425588

VL - 2196

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 72

EP - 91

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -