Logo des Repositoriums

Auflistung nach Autor:in "Zuleger, Florian"

1 - 4 von 4
  • Textdokument
    Algorithmenerkennung und Programmreparatur mittels Dynamischer ProgrammanalyseAlgorithmenerkennung und Programmreparatur mittels Dynamischer Programmanalyse
    (Proceedings of the Sixth Workshop "Automatische Bewertung von Programmieraufgaben" (ABP 2023), 2023) Zuleger, Florian
    In diesem Vortrag beschreibe ich zwei Ansätze zur Erkennung der algorithmischen Idee eines Programms und ihre Anwendung in der Feedback-Generierung für einführende Program-mieraufgaben. Beide Techniken basieren auf der dynamischen Programmanalyse, in Verbindung mit Constraintprogrammierung. Die erste Technik ist halbautomatisch und zielt darauf ab, Performanceprobleme in Programmen zu finden. Die zweite Technik verwendet einen großen Korpus korrekter Programme, die anhand von syntaktischen Kriterien und Programmausführungen geclustert und anschließend zur Reparatur fehlerhafter Programme verwendet werden.
  • Konferenzbeitrag
    Empirical software metrics for benchmarking of verification tools
    (Software Engineering 2016, 2016) Demyanova, Yulia; Pani, Thomas; Veith, Helmut; Zuleger, Florian
    In recent work [De15, PVZ15, DVZ13], we study empirical metrics for software (SW) source code, which can predict the performance of verification tools on specific types of SW. Our metrics comprise variable usage patterns, loop patterns, as well as indicators of control-flow complexity and are extracted by simple data-flow analyses. We demonstrate that our metrics are powerful enough to devise a machine-learning based portfolio solver for SW verification. We show that this portfolio solver would be the (hypothetical) overall winner of both the 2014 and 2015 International Competition on Software Verification (SV-COMP). This gives strong empirical evidence for the predictive power of our metrics and demonstrates the viability of portfolio solvers for SW verification.
  • Konferenzbeitrag
    Feedback generation for performance problems in introductory programming assignments
    (Software Engineering 2016, 2016) Zuleger, Florian; Radicek, Ivan; Gulwani, Sumit
    Providing feedback on programming assignments manually is a tedious, error prone, and time-consuming task. In [GRZ14], we motivate and address the problem of generating feedback on performance aspects in introductory programming assignments. We studied a large number of functionally correct student solutions to introductory programming assignments and observed: (1) There are different algorithmic strategies, with varying levels of efficiency, for solving a given problem. These different strategies merit different feedback. (2) The same algorithmic strategy can be implemented in countless different ways, which are not relevant for reporting feedback on the student program. We propose a light-weight programming language extension that allows a teacher to define an algorithmic strategy by specifying certain key values that should occur during the execution of an implementation. We describe a dynamic analysis based approach to test whether a student's program matches a teacher's specification. Our experimental results illustrate the effectiveness of both our specification language and our dynamic analysis.
  • Konferenzbeitrag
    A simple and scalable static analysis for bound analysis and amortized complexity analysis
    (Software Engineering 2016, 2016) Sinn, Moritz; Zuleger, Florian; Veith, Helmut