Discovery and Deduction

1. Dana Angluin. Finding patterns common to a set of strings. Proceedings of the 11th Annual Symposium on Theory of Computing, pp.130–141, 1979.

   Google Scholar 

2. Dana Angluin. Inductive inference of formal languages from positive data. Information and Control, Vol.45, pp.117–135, 1980.

   Article  MATH  MathSciNet  Google Scholar 

3. Hiroki Arimura, Takeshi Shinohara and Setsuko Otsuki. A polynomial time algorithm for finding finite unions of tree pattern languages. Proceedings of the 2nd International Workshop on Nonmonotonic and Inductive Logic, Lecture Notes in Artificial Intelligence, Vol.659, Springer-Verlag, pp.118–131, 1993.

   Article  MathSciNet  Google Scholar 

4. Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara. Learning Unions of Tree Patterns Using Queries. Theoretical Computer Science, Vol.185, pp.47–62, 1997.

   Article  MATH  MathSciNet  Google Scholar 

5. Hiroki Arimura and Akihiro Yamamoto. Inductive Logic Programming: From Logic of Discovery to Machine Learning. IEICE Transactions on Information and Systems, Vol.E83-D, No.1, pp.10–18, 2000.

   Google Scholar 

6. Edmund M. Clarke, Jr., Orna Grumberg, and Doron A. Peled. Model Checking, The MIT Press, 1999.

   Google Scholar 

7. Patrick Cousot and Radhia Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. Conference Record of the 4th ACM Symposium on Principles of Programming Languages, pp.238–252, 1977.

   Google Scholar 

8. Patrick Cousot and Nicolas Halbwachs. Automatic discovery of linear restraints among variables of a program. Conference Record of the 5th ACM Symposium on Principles of Programming Languages, pp.84–97, 1978.

   Google Scholar 

9. Edsger W. Dijkstra, Leslie Lamport, A.J. Martin, C.S. Scholten, and E.F.M. Steffens. On-the-Fly Garbage Collection: An Exercise in Cooperation. Communications of the ACM, Vol.21, No.11, pp.966–975, 1978.

   Article  MATH  Google Scholar 

10. Nobuhisa Fujinami. Superoptimization of Scheduling Machine Instruction Pipelines (in Japanese). Computer Software, Vol.16, No.2, pp.80–84, Japan Society for Software Science and Technology, 1999.

    Google Scholar 

11. E.Mark Gold. Language identification in the limit. Information and Control, Vol.10, pp.447–474, 1967.

    Article  MATH  Google Scholar 

12. Torbjörn Granlund and Richard Kenner. Eliminating Branches using a Superoptimizer and the GNU C Compiler. PLDI’92, Proceedings of the conference on Programming language design and implementation, pp.341–352, 1992.

    Google Scholar 

13. Masami Hagiya. A proof description language and its reduction system, Publications of the Research Institute for Mathematical Sciences, Kyoto University, Vol.19, No.1, pp.237–261, 1983.

    Article  MATH  MathSciNet  Google Scholar 

14. Nicolas Halbwachs. Détermination automatique de relations linéaires vérifiées par les variables d’un programme. Thése de 3^éme cycle d’informatique, Université scientifique et médicale de Grenoble, Grenoble, France, 12 March 1979.

    Google Scholar 

15. Nicolas Halbwachs, Yann-Erick Proy and Patrick Roumanoff. Verification of Real-Time Systems using Linear Relation Analysis. Formal Methods in System Design, Vol.11, No.2, pp.157–185, 1997.

    Article  Google Scholar 

16. Susumu Hayashi and Hiroshi Nakano. PX: A computational logic, The MIT Press, 1989.

    Google Scholar 

17. Susumu Hayashi and Ryosuke Sumitomo. Testing Proofs by Examples. Advances in Computing Science, Asian’ 98, 4th Asian Computing Science Conference, Lecture notes in Computer Science, Vol.1538, pp.1–3, 1998.

    Google Scholar 

18. Gerald J. Holzmann. The Model Checker SPIN. IEEE Transactions on Software Engineering, Vol.23, No.5, pp.279–295, 1997.

    Article  MathSciNet  Google Scholar 

19. Steffen Lange and Thomas Zeugmann. Monotonic Versus Non-monotonic Language Learning. Proceedings of the 2nd International Workshop on Nonmonotonic and Inductive Logic, Lecture Notes in Artificial Intelligence, Vol.659, Springer-Verlag, pp.254–269, 1993.

    Article  MathSciNet  Google Scholar 

20. Zohar Manna and Richard Waldinger. A deductive approach to program synthesis, ACM Transactions on Programming Languages and Systems, Vol.2, No.1, pp.90–121, 1980.

    Article  MATH  Google Scholar 

21. Henry Massalin. Superoptimizer: A Look at the Smallest Program. Proceedings of the Second International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS II, pp.122–126, 1987.

    Google Scholar 

22. Tatsuo Mizukami. Report for Exercise III in Information Science (in Japanese). Department of Information Science, University of Tokyo, 2000.

    Google Scholar 

23. Adrian Perrig and Dawn Song. A First Step on Automatic Protocol Generation of Security Protocols. Proceedings of Network and Distributed System Security, 2000 Feb.

    Google Scholar 

24. Masahiko Sato. Towards a mathematical theory of program synthesis, Proceedings of IJCAI 79, pp.757–762, 1979.

    Google Scholar 

25. Dawn Xiaodong Song. Athena: a New Efficient Automatic Checker for Security Protocol Analysis, Proceedings of the 12th IEEE Computer Security Foundations Workshop, pp.192–202, 1999.

    Google Scholar 

26. Koichi Takahashi and Masami Hagiya. Abstract Model Checking of Concurrent Garbage Collection by Regular Expressions (in Japanese). IPSJ Transactions on Programming, Information Processing Society of Japan, to appear, 2000.

    Google Scholar 

27. Taiichi Yuasa. Real-Time Garbage Collection on General-Purpose Machines. Journal of Systems and Software, Vol.11, 1990.

    Google Scholar 

28. Taiichi Yuasa. Algorithms for Realtime Garbage Collection (in Japanese). IPSJ Magazine, Information Processing Society of Japan, Vol.35, No.11, pp.1006–1013, 1994.

    Google Scholar 

Download references