
Tsubasa Matsushita,
Isao Sasano,
Detecting code clones with gaps by function applications,
ACM SIGPLAN 2017 Workshop on Partial Evaluation and Program Manipulation
(PEPM 2017),
Paris, France, January 1617, 2017. (presented on January 16, 2017)
Code clone detection tool based on the algorithms presented in the paper

Isao Sasano,
A tool for visualizing buffer overflow with
detecting return address overwriting,
BICT 2015 Special Track on Modularization for Practical Software Engineering
(MPSE2015),
New York City, New York, United States, December 35, 2015.
(presented on December 5, 2015)
This paper is also available here.

Isao Sasano,
Toward modular implementation of
practical identifier completion on incomplete program text,
BICT 2014 Special Track on Modularization for Practical Software Engineering
(MPSE2014),
Boston, Massachusetts, United States, December 13, 2014.
(presented on December 2, 2014)
An Emacsmode based on the approach presented in the paper
Author's version:
Copyright ©ICST, 2014. This is the author's version of the work.
It is posted here by permission of ICST for your personal use.
Not for redistribution. The definitive version was published
in the ACM digital library.

Isao Sasano,
Takumi Goto,
An approach to completing variable names for implicitly typed functional languages,
HigherOrder and Symbolic Computation,
Volume 25, Issue 1, pp. 127163, August 2013.
Springer.
(This is a journal version of the paper in PEPM 2012 below.)

Takumi Goto,
Isao Sasano,
An approach to completing variable names for implicitly typed functional languages,
ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation
(PEPM 2012),
pp. 131140, Philadelphia, Pennsylvania, USA, January 2324, 2012.
An Emacsmode based on the algorithm presented in the paper
Author's version:
Copyright ©ACM, 2012. This is the author's version of the work.
It is posted here by permission of ACM for your personal use. Not for redistribution.
The definitive version was published in
ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation (PEPM'12),
January 2324, 2012, Philadelphia, Pennsylvania, USA,
http://doi.acm.org/10.1145/2103746.2103771.

Yota Kogure,
Isao Sasano,
Masaomi Kimura,
A Topic Maps Query Language supporting Composite and Recursive Queries,
12th International Symposium on Advanced Intelligent Systems
(ISIS 2011),
SA13,
LA VIE D'OR Resort, Suwon, Korea,
September 28October 1, 2011.

Soichiro Hidaka,
Zhenjiang Hu,
Kazuhiro Inaba,
Hiroyuki Kato,
Kazutaka Matsuda,
Keisuke Nakano,
Isao Sasano,
Markerdirected optimization of UnCAL graph transformations,
21st International Symposium on LogicBased Program Synthesis and Transformation
(LOPSTR 2011),
Odense, Denmark, July 1820, 2011.
Lecture Notes in Computer Science, Vol. 7225,
pp. 123138, Springer Verlag.

Isao Sasano,
Zhenjiang Hu,
Soichiro Hidaka,
Kazuhiro Inaba,
Hiroyuki Kato,
Keisuke Nakano,
Toward bidirectionalization of ATL with GRoundTram,
International Conference on Model Transformation
(ICMT 2011),
Zurich, Switzerland, June 2728, 2011.
Lecture Notes in Computer Science, Vol. 6707,
pp. 138151, Springer Verlag.

Atsushi Ohori,
Isao Sasano,
Lightweight Fusion by Fixed Point Promotion,
The 34th ACM SIGPLANSIGACT Symposium on Principles of Programming Languages
(POPL 2007),
pp. 143154, Nice, France, January 1719, 2007. ACM Press.

Isao Sasano,
Mizuhito Ogawa,
Zhenjiang Hu,
Maximum Marking Problems with Accumulative Weight Functions,
International Colloquium on Theoretical Aspects of Computing
(ICTAC2005),
Hanoi, Vietnam, October 1721, 2005.
Lecture Notes in Computer Science, Vol. 3722,
pp. 562578, Springer Verlag.

Mizuhito Ogawa,
Zhenjiang Hu,
Isao Sasano,
IterativeFree Program Analysis,
Proceedings of the 8th ACM SIGPLAN International Conference on
Functional Programming
(
ICFP2003),
pp. 111123, Uppsala, Sweden, August 2529, 2003. ACM Press.
Abstract
Program analysis is the heart of modern compilers. Most control flow
analyses are reduced to the problem of finding a fixed point in a
certain transition system, and such fixed point is commonly computed
through an iterative procedure that repeats tracing until
convergence. This paper proposes a new method to analyze programs
through recursive graph traversals instead of iterative procedures,
based on the fact that most programs (without spaghetti goto) have
wellstructured control flow graphs, graphs with bounded tree width.
Our main techniques are; an algebraic construction of a control flow
graph, called SP Term, which enables control flow analysis to be
defined in a natural recursive form, and the Optimization Theorem,
which enables us to compute optimal solution by dynamic programming.
We illustrate our method with two examples; dead code detection and
register allocation. Different from the traditional standard
iterative solution, our dead code detection is described as a simple
combination of bottomup and topdown traversals on SP
Term. Register allocation is more interesting, as it further
requires optimality of the result. We show how the Optimization
Theorem on SP Terms works to find an optimal register allocation as
a certain dynamic programming.

Isao Sasano,
Generation of Efficient Algorithms for Maximum Marking Problems,
Ph. D. thesis, University of Tokyo, 2002.
Abstract
In existing work on graph algorithms, it is known that a linear time
algorithm can be derived mechanically from a logical formula for a
class of optimization problems. But this has a serious problem that the
derived algorithm has huge constant factor. In this work, we redefine
this problem on recursive data structures as a maximum marking problem
and propose method for deriving a linear time algorithm for that. In
this method, specification is given using recursive functions instead
of logical formula, which results in a practical linear time
algorithm. This method is mechanical and in fact, based on this
deriving method, we make a system which automatically generates a
practical linear time algorithm from specification for a maximum
marking problem.

Tetsuo Yokoyama,
Isao Sasano,
Zhenjiang Hu,
Masato Takeichi,
Automatic Generation of Programs Based on High Level Strategy
Description, IPSJ Transactions on Programming, Vol. 43,
No. SIG 3(PRO 14), pp. 6277, March 2002. (in Japanese)

Isao Sasano,
Zhenjiang Hu,
Masato Takeichi,
Mizuhito Ogawa,
Derivation of Linear Algorithm for Mining Optimized Gain Association Rules,
JSSST Computer Software,
Vol. 19, No. 4, pp. 3944, 2002. Iwanami Shoten.
Abstract
Data mining, which is a technology for obtaining useful knowledge from
large database, has been gradually recognized as an important subject.
Algorithms for data mining have to be efficient since target database
is often huge, and various kinds of efficient algorithms for data
mining are individually investigated. This paper shows that an
efficient linear time algorithm for mining optimized gain association
rules can be systematically derived from a simple specification by
reducing it to an instance of the {\it maximum marking problem}. Our
approach not only automatically guarantees the correctness of the
derived algorithm, but also is easy to derive new algorithms for
modification of the problem.

Isao Sasano,
Zhenjiang Hu,
Masato Takeichi,
Generation of Efficient Programs for Solving Maximum MultiMarking
Problems,
Workshop on the Semantics, Applications, and Implementation of
Program Generation
( SAIG2001 ),
Firenze, Italy, September 6, 2001. Lecture Notes in
Computer Science, Vol. 2196, pp. 7291, Springer Verlag.
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 {\em 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.

Isao Sasano,
Zhenjiang Hu,
Masato Takeichi,
Mizuhito Ogawa,
Solving a Class of Knapsack Problems on Recursive Data Structures,
JSSST Computer Software,
Vol. 18, No. 2, pp. 5963, 2001. Iwanami Shoten. (in Japanese)

Isao Sasano,
Zhenjiang Hu,
Masato Takeichi,
Mizuhito Ogawa,
Calculating Linear Time Algorithms for Solving Maximum Weightsum
Problems,
JSSST Computer Software, Vol. 18, No. 5,
pp. 116, 2001. Iwanami Shoten. (in Japanese)
 International conference version:
Isao Sasano,
Zhenjiang Hu,
Masato Takeichi,
Mizuhito Ogawa,
Make it Practical: A Generic LinearTime Algorithm for Solving
MaximumWeightsum Problems,
Proceedings of the Fifth ACM SIGPLAN International
Conference on Functional Programming
( ICFP2000 ),
pp.137149, Montreal, Canada, September 1820, 2000. ACM Press.
Abstract
In this paper we propose a new method for deriving a practical
lineartime algorithm from the specification of a
maximumweightsum problem: From the elements of a data structure $x$,
find a subset which
satisfies a certain property $p$ and whose weightsum is maximum.
Previously proposed methods for automatically generating
lineartime algorithms are theoretically appealing,
but the algorithms generated are hardly useful in practice
due to a huge constant factor for space and time.
The key points of our approach are to express the property $p$ by a
{\em recursive\/} boolean function over the structure $x$ rather than
a usual logical predicate and to apply program transformation
techniques to reduce the constant factor.
We present an {\em optimization theorem}, give a calculational
strategy for applying the theorem, and demonstrate the
effectiveness of our approach through several nontrivial examples
which would be difficult to deal with when using the methods
previously available.
 Preliminary version appeared in the informal proceedings of the
Second JSSST Workshop on Programming and Programming Languages
(PPL'00), pp. 1425, Hamanako, Shizuoka, Japan, March 2022, 2000.
 Summary was presented at an informal workshop:
The Third Program Transformation Workshop
(PTW'00), Hakone, Japan, March 1517, 2000.

Isao Sasano,
Zhenjiang Hu,
Masato Takeichi,
A General Recursive Form for Graph Traversals and its Transformations,
JSSST Computer Software, Vol. 17, No.3, pp.219, 2000. Iwanami Shoten. (in Japanese)

Isao Sasano,
Zhenjiang Hu,
Masato Takeichi,
Constructive Approach to Deriving Graph Algorithms,
15th Conference Proceedings Japan Society for Software Science and Technology,
pp. 269272, The University of ElectroCommunications, September 811, 1998. (in Japanese)