Christop Beierle
Wissensbasierte Systeme, Fachbereich Informatik, FernUniversität in Hagen, Germany
Marija Kulas
Wissensbasierte Systeme, Fachbereich Informatik, FernUniversität in Hagen, Germany
Manfred Widera
Wissensbasierte Systeme, Fachbereich Informatik, FernUniversität in Hagen, Germany
Ladda ner artikel
Ingår i: Proceedings of the First International Workshop on Teaching Logic Programming: TeachLP 2004
Linköping Electronic Conference Proceedings 12:2, s. 18-34
Publicerad: 2004-10-04
ISBN:
ISSN: 1650-3686 (tryckt), 1650-3740 (online)
For the automatic revision of homework assignments in Prolog programming courses; in general one has to rely on testing or on validating programs with respect to a specification. Here; we present a pragmatic and flexible method for the partial specification of program properties. Within the AT(P) system; partial specifications can be used for automatic analysis of student solutions to Prolog exercises; yielding automatically generated feedback to the student. AT(P) is integrated into the Virtual University system of the FernUniversität at in Hagen.
[1] C. Beierle; M. Kulas; and M. Widera. A pragmatic approach to pre-testing Prolog programs. In D. Seipel; M. Hanus; U. Geske; and O. Breitenstein; editors; Proc. 15th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2004) and 18th Workschop on Logic Programming (WLP 2004); pages 102–114. Technical Report 327; Univ. W¨urzburg; March 2004.
[2] J. Brunsmann; A. Homrighausen; H.-W. Six; and J. Voss. Assignments in a Virtual University – The WebAssign-System. In Proc. 19th World Conference on Open Learning and Distance Education; Vienna; Austria; June 1999.
[3] M. Ducasse. Opium: An extendable trace analyser for prolog. J. of Logic Programming; 39:177–223; 1999.
[4] M. Hermenegildo; G. Puebla; and F. Bueno. Using global analysis; partial specifications; and an extensible assertion language for program validation and debugging. In K. Apt; V. Marek; M. Truszczynski; and D. S. Warren; editors; The Logic Programming Paradigm: A 25-Year Perspective. Springer- Verlag; 1999.
[5] M. Kula?s. Annotations for Prolog – A concept and runtime handling. In A. Bossi; editor; Logic-Based Program Synthesis and Transformation. Selected Papers of the 9th Int. Workshop (LOPSTR’99); Venezia; volume 1817 of LNCS; pages 234–254. Springer-Verlag; 2000.
[6] Homepage LVU; Fernuniversit¨at Hagen; http://www.fernuni-hagen.de/LVU/. 2003.
[7] H. Neumann. Automatisierung des Testens von Zusicherungen f¨ur Prolog-Programme. Diplomarbeit; Fern Universität Hagen; 1998.
[8] U. Neumerkel and S. Kral. Declarative program development in Prolog with GUPU. In Proc. of the 12th Internat. Workshop on Logic Programming Environments (WLPE’02); Copenhagen; pages 77–86; 2002.
[9] Richard A. O’Keefe. advice.pl. 1984. Interlisp-like advice package.
[10] Swedish Institute of Computer Science. SICStus Prolog User’s Manual; April 2001. Release 3.8.6.
[11] Robert F. Stärk. The theoretical foundations of LPTP (a logic program theorem prover). J. of Logic Programming; 36(3):241–269; 1998. Source distribution http://www.inf.ethz.ch/˜staerk/lptp.html.
[12] Homepage WebAssign. http://www-pi3.fernuni-hagen.de/WebAssign/. 2003.
[13] Manfred Widera. Testing Scheme programming assignments automatically. In S. Gilmore; editor; Trends in Functional Programming; volume 4. Intellect; 2004. (to appear).
