論文

査読有り
2010年

A Grammar-Based Approach to Invertible Programs

PROGRAMMING LANGUAGES AND SYSTEMS, PROCEEDINGS
  • Kazutaka Matsuda
  • ,
  • Shin-Cheng Mu
  • ,
  • Zhenjiang Hu
  • ,
  • Masato Takeichi

6012
開始ページ
448
終了ページ
+
記述言語
英語
掲載種別
研究論文(国際会議プロシーディングス)
DOI
10.1007/978-3-642-11957-6_24
出版者・発行元
SPRINGER-VERLAG BERLIN

Program inversion has many applications such as in the implementation of serialization/deserialization and in providing support for redo/undo, and has been studied by many researchers. However, little attention has been paid to two problems: how to characterize programs that are easy or hard to invert and whether, for each class of programs, efficient inverses can be obtained. In this paper, we propose an inversion framework that we call grammar-based inversion, where a program is associated with an unambiguous grammar describing the range of the program. The complexity of the grammar indicates how hard it is to invert the program, while the complexity is related to how efficient an inverse can be obtained.

Web of Science ® 被引用回数 : 8

リンク情報
DOI
https://doi.org/10.1007/978-3-642-11957-6_24
Web of Science
https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=JSTA_CEL&SrcApp=J_Gate_JST&DestLinkType=FullRecord&KeyUT=WOS:000279369000023&DestApp=WOS_CPL
URL
http://dblp.uni-trier.de/db/conf/esop/esop2010.html#conf/esop/MatsudaMHT10
ID情報
  • DOI : 10.1007/978-3-642-11957-6_24
  • ISSN : 0302-9743
  • DBLP ID : conf/esop/MatsudaMHT10
  • Web of Science ID : WOS:000279369000023

エクスポート
BibTeX RIS