Generation of efficient programs for solving maximum multi-marking problems

DOI10.1007/3-540-44806-3_5MaRDI QIDQ4445768zbMATH OpenFDO

Authors Isao Sasano, Zhenjiang Hu, Masato Takeichi

Publication date 2 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2196/21960072.htm

zbMATH Keywords

Algorithm SynthesisFunctional ProgrammingMaximum Marking ProblemOptimization ProblemProgram Generation Rule

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Formal Methods for Components and Objects
• Model based program specification and program generation - in a case of vehicle-engine control system design
• Program generation, termination, and binding-time analysis
• Two graph algorithms derived
• Pragmatic aspects of reusable program generators

Cited in

(2)

• scientific article; zbMATH DE number 5726469 (Why is no real title available?)
• Longest segment of balanced parentheses: an exercise in program inversion in a segment problem

This page was built for publication: Generation of efficient programs for solving maximum multi-marking problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4445768)