Seminar Programmierwerkzeuge

Wintersemester 2006/07
Lehrstuhl für Programmiersprachen und Übersetzerkonstruktion

Vorträge:

6.11.06: Fabian Reck: QuickCheck: Generierung von Testdaten für funktionale Programme

• QuickCheck
• Koen Claessen and John Hughes. QuickCheck: A Lightweight Tool for Random Testing of Haskell Programs In Proc. of International Conference on Functional Programming (ICFP), ACM SIGPLAN, pages 268-279, 2000. (PS)
• Koen Claessen and John Hughes. Testing Monadic Code with QuickCheck. In Proc. of Haskell Workshop, ACM SIGPLAN, pages 65-77, 2002. (PS)

13.11.06: Arne Schipper: Testen von Clean-Programmen mit GAST

• GAST
• Pieter Koopman, Artem Alimarine, Jan Tretmans, Rinus Plasmeijer. Gast: Generic Automated Software Testing. In 14th International Workshop on Implementation of Functional Languages, Springer LNCS 2670, pages 84-100, 2003. (PDF)
• Pieter Koopman, Rinus Plasmeijer. Generic Generation of Elements of Types. Proc. 6th Symposium on Trends in Functional Programming, 2005. (PDF)

20.11.06: Stefan Junge: Deklaratives Debugging für Haskell

• Buddha
• B. Pope. Buddha: A declarative debugger for Haskell, In Technical Report, Dept. of Computer Science, University of Melbourne, Australia, June 1998. Honours Thesis. (PS.GZ)
• J. Sparud and H. Nilsson. The Architecture of a Debugger for Lazy Functional Langauges. In Proceedings of AADEBUG '95, 2nd International Workshop on Automated and Algorithmic Debugging, 1995. (PS.GZ)

27.11.06: Maik Barz: Debuggen mittels Tracing (Haskell)

• Hat
• J. Sparud and C. Runciman. Tracing lazy functional computations using redex trails. In Proc. 9th Intl. Symposium on Programming Languages, Implementations, Logics and Programs (PLILP'97), pages 291-308. Springer LNCS Vol. 1292, September 1997
• J. Sparud and C. Runciman. Complete and partial redex trails of functional computations. In C. Clack, K. Hammond, and T. Davie, editors, Selected papers from 9th Intl. Workshop on the Implementation of Functional Languages (IFL'97), pages 160--177. Springer LNCS Vol. 1467, September 1997.
• O. Chitil, C. Runciman and M. Wallace. Freja, Hat and Hood - A Comparative Evaluation of Three Systems for Tracing and Debugging Lazy Functional Programs. In Proceedings of the 12th International Workshop on Implementation of Functional Languages, pages 176-193, Aachen, 2001, LNCS 2011. (PDF)

4.12.06: Jonas Völcker: Debuggen durch Beobachten (Haskell)

• Hood
• A. Gill: Debugging Haskell by observing intermediate data structures. In Electronic Notes in Theoretical Computer Science, Volume 41 (Graham Hutton, editor), Elsevier, 2001 (siehe auch hier)
• O. Chitil, C. Runciman and M. Wallace. Freja, Hat and Hood - A Comparative Evaluation of Three Systems for Tracing and Debugging Lazy Functional Programs. In Proceedings of the 12th International Workshop on Implementation of Functional Languages, pages 176-193, Aachen, 2001, LNCS 2011. (PDF)

11.12.06: Holger Siegel: Refactoring (allgemein und Haskell)

• M. Fowler: Refactoring. Improving the Design of Existing Code. Addison-Wesley, 1999 (ISBN: 0201485672)
• S. Thompson. Refactoring Functional Programs. In 5th International School on Advanced Functional Programming, Springer LNCS 3622, pages 331-357, 2005. (PDF)
• Refactoring Home Page
• Refactoring Functional Programs

18.12.06: Erik Steffen: Partielle Auswertung von Prolog-Programmen

• LOGEN
• Leuschel, M., Jørgensen, J., Vanhoof, W. and Bruynooghe, M. Offline Specialisation in Prolog Using a Hand-Written Compiler Generator. In Theory and Practice of Logic Programming 4(1), pp. 139-191, 2004. (PDF)

8.1.07: Peer Brauer: Analyse nebenläufiger Programme

• S. Qadeer and D. Wu. KISS: Keep it simple and sequential. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'04), pages 14-24, ACM, 2004 (PDF)
• S. Qadeer and J. Rehof. Context-bounded model checking of concurrent software. In Proceedings of the 11th International Symposium on Tools and Algorithms for the Construction and Analysis of Systems, Springer LNCS 3440, pages 93-107, 2005 (PS)

Weitere Themen:

Profiling (Haskell)

• Sansom, P.M. and S.L. Peyton Jones. Formally Based Profiling for Higher-Order Functional Languages. In Journal of Functional Programming 19(2), pages 334-385, 1997. (PS.GZ)

Terminierungsnachweise mittels Größenordnungen

• Chin Soon Lee, Neil D. Jones, Amir M. Ben-Amram. The Size-Change Principle for Program Termination. In ACM Symposium on Principles of Programming Languages (POPL'01), pages 81-92, ACM Press, 2001 (PS)

Automatisierte Terminierungsnachweise mit AProVE

• AProVE
• J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke. Automated Termination Proofs with AProVE In Proceedings of the 15th International Conference on Rewriting Techniques and Applications (RTA-04), Springer LNCS 3091, pages 210-220, 2004. (PDF)
• J. Giesl, R. Thiemann, and P. Schneider-Kamp. The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs. In Proceedings of the 11th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR '04), Springer LNCS 3452, pages 301-331, 2005. (PS)

Terminierungsbeweise für Haskell-Programme

• J. Giesl, S. Swiderski, P. Schneider-Kamp, and R. Thiemann Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages. In Proceedings of the 17th International Conference on Rewriting Techniques and Applications (RTA-06), Springer LNCS, 2006. To appear.

Terminierungsbeweise für Prolog-Programme