Dear all,
Please find the final schedule for the seminar presentations tomorrow
and on Wednesday below.
You are kindly invited to join the presentations, either on-site (see
room numbers below), or online via Zoom:
https://unibe-ch.zoom.us/j/6743951552
Best,
Timo
== Dec. 17, E8 room 107
08:30-09:20 -- Jairo Erazo Botero, Michal Stetina, Dennis Berger,
Marilena Manoli: LLM Contamination in the Wild
09:20-09:50 -- Daniel Zeidan: Mutation Testing-based Assessment of Code
Contracts
10:00-10:30 -- Jonathan Bernhard: RaQuN Lab for Experimenting with N-Way
Model Matching
10:30-11:00 -- William Dan: UAV Test Surrogate Models
11:00-11:30 -- Mohammad Eglil: Passless
16:15-16:45 -- Ramona Christen: Enhancing Automated Contract Generation:
A Context-Aware LLM-Based Approach
16:50-17:20 -- Mohd Dayatar: Automated Code Contract Repair: An
LLM-Based Approach
17:30-18:00 -- Maurice Amon: Towards a Fully Functional Mini-IDE for the
SPL' Language
== Dec. 18, E8 room 105
09:30-10:00 -- Cindy Schnyder: How do open source developers implement
variability in their system?
10:00-10:30 -- Sascha Künzler: BIP Mining for Network Graph
Dear all,
please find the current plan for next week's seminar presentations below.
I curated this from all sources I have, but please double-check for
correctness and completeness (until Monday, lunch time).
Best,
Timo
== Dec. 17, E8 room 107
08:30-09:20 -- Jairo Erazo Botero, Michal Stetina, Dennis Berger,
Marilena Manoli: LLM Contamination in the Wild
09:20-09:50 -- Daniel Zeidan: Mutation Testing-based Assessment of Code
Contracts
10:00-10:30 -- Jonathan Bernhard: RaQuN Lab for Experimenting with N-Way
Model Matching
10:30-11:00 -- William Dan: UAV Test Surrogate Models
11:00-11:30 -- Mohammad Eglil: Passless
16:15-16:45 -- Ramona Christen: Enhancing Automated Contract Generation
with Summaries
16:50-17:20 -- Mohd Dayatar: Automated Code Contract Repair: An
LLM-Based Approach
== Dec. 18, E8 room 105
09:30-10:00 -- Cindy Schnyder: How do open source developers implement
variability in their system?
10:00-10:30 -- Sascha Künzler: BIP Mining for Network Graph
Dear all,
as already mentioned, we will have the following research talks in our
next SPL lecture.
Tuesday, December 10, 14:15 - 16:00, Engehalde 8, Room 002.
Both are highly recommended!
Best,
Timo
*Speaker*
Alexander Schultheiß (University of Paderborn and University of Bern)
*Title*
Decades of GNU Patch and Git Cherry-Pick: Can We Do Better?
*Abstract*
Patching is a fundamental software maintenance
and evolution task enabling the (semi-)automated propagation
of changes across different software versions. Established and
widely used general-purpose patchers, such as GNU-patch and
git cherry-pick, work on textual artifact representations
(i.e., files) and typically rely on line numbers and contexts (i.e.,
surrounding unchanged text) to apply changes. This strategy
often fails if source and target of a patch differ: Some required
changes may be rejected, others may be applied to the wrong
location; provoking cumbersome manual effort. In this paper, we
study the effectiveness of commonly-used patchers, and propose a
novel technique that pushes the boundaries of patch automation.
First, we curate and analyze a large dataset of more than 400,000
patch scenarios (i.e., cherry picks) from 5,000 GitHub projects.
Next, we examine the effectiveness of established patchers on
the gathered patch scenarios, observing that patchers often fail
to apply changes correctly. Third, we develop a novel general-
purpose patch technique, mpatch, that utilizes a source-to-target
matching to determine suitable change locations. By comparing
mpatch to other patchers, we find that it can correctly apply
44% more patches automatically than other general-purpose
patchers, while it also requires fewer manual fixes in cases that
cannot be automated completely. Thus, mpatch considerably
reduces the burden of manually fixing failed patches in practice,
specifically in projects with frequent patch applications.
--
*Speaker*
Paul Bittner (University of Ulm and TU Braunschweig)
*Title*
On the Expressive Power of Languages for Static Variability
*Abstract*
Variability permeates software development to satisfy ever-changing
requirements and mass-customization needs. A prime example is the Linux
kernel, which employs the C preprocessor to specify a set of related but
distinct kernel variants. To study, analyze, and verify variational
software, several formal languages have been proposed. For example, the
choice calculus has been successfully applied for type checking and
symbolic execution of configurable software, while other formalisms have
been used for variational model checking, change impact analysis, among
other use cases. Yet, these languages have not been formally compared,
hence, little is known about their relationships. Crucially, it is
unclear to what extent one language subsumes another, how research
results from one language can be applied to other languages, and which
language is suitable for which purpose or domain. In this paper, we
propose a formal framework to compare the expressive power of languages
for static (i.e. compile-time) variability. By establishing a common
semantic domain to capture the essence of explicit variability, we can
formulate the basic, yet to date neglected, properties of soundness,
completeness, and expressiveness for variability languages. We then
prove the (un)soundness and (in)completeness of a range of existing
languages, and relate their ability to express the same variational
systems. We implement our framework as an extensible open source Agda
library in which proofs act as correct compilers between languages or
differencing algorithms. We find that most variability languages are
complete, sound, and equally expressive, rendering existing and future
research more broadly applicable by bridging the gaps between parallel
research efforts.
Dear all,
in the week Dec 09 - 13, Prof. Thomas Thüm and some members of his team
will visit us.
They will arrive on Monday, so the first "real work day" will be
probably Tuesday Dec 10.
For a good start into the research part of their visit, we will have two
research talks in terms of our SPL lecture on Tuesday 10, Titles and
Abstracts to be announced.
For a good start into the socializing and networking part of their
visit, we plan to have a fondue together on Tuesday 10.
ACTION ITEM (until Dec 6, latest):
Please let me know if you will join the fondue on Dec. 10. The plan is
to start not too late, say around 6:00, such that all non-Bernesians (?)
will not arrive at home too late.
Best,
Timo
Dear all,
Another talk announcement for Dec. 4, scheduled in a way that avoids
conflicts with Adi Seredinschi's talk ;-)
*Date and Location*
4. December 2024, 10:00-11:00 (s.t.)
Engehalde 8, Seminarraum 109
*Speaker*
Dr. Khashayar Someoliayi
*Title*
Efficient Exploration and Analysis of Program Repair Search Spaces
*Abstract*
In the presented work, we aim at improving the efficiency of three main
components involved in the exploration and analysis of APR search
spaces: patch generation, automated patch assessment, and manual patch
assessment. For this purpose, we present the three following contributions.
To make patch generation efficient, we introduce Sorald, a
template-based APR approach for fixing SonarJava static warnings. Sorald
employs accurately designed templates to generate exactly one patch that
is highly likely to fix the bug. The lightweight patch generation
technique and the small search space that needs little analysis makes
Sorald an efficient APR approach.
For making automated patch assessment efficient, we propose LighteR, a
lightweight tool for estimating the potential of fix templates used by
template-based APR approaches. LighteR compares fix templates against
developer-made bug-fixes to assess if the templates follow the
modification patterns used by experts. The result of this assessment is
used to rank the patches based on the potential of templates used for
their generation. This ranking is used to prioritize patches for manual
assessment and thus, finding the correct patch with minimal manual analysis.
Finally, we introduce Collector-Sahab, which aims at helping code
reviewers better understand behavioral changes caused by patches. Given
two versions of a program P & Q, Collector-Sahab collects the execution
trace of both P & Q. It next compares the traces and identifies runtime
differences at variable and return value level. Finally, it augments the
code diff between P & Q with a concise selection of extracted runtime
differences. This code augmentation helps code reviewers to better
understand the behavior of APR patches and thus, reduces human effort
needed for manual patch assessment.
To sum up, in this study we aim at making APR useful in practice by
improving its efficiency. For this purpose, we propose novel methods to
make patch generation, automated patch assessment, and manual patch
assessment efficient.
*Short Bio*
Khashayar Etemadi received his PhD in software engineering from KTH
Royal Institute of Technology, Sweden. His research interests are
automated program repair, software testing, and software evolution
Happy to see you there!
Best,
Timo
Good Morning
We have started to shape the schedule for the upcoming seminar final presentations, see bottom of the README.md in our GitLab repo on seminar-topics<https://gitlab.inf.unibe.ch/SEG/team/courses/seminar-software-engineering/s…>.
Please enter your time slots as well, as soon as possible -- regardless of whether physical-only, virtual-only, or hybrid.
In case you need additional room reservations, you can contact Bettina or book (smaller) rooms yourself<https://raumreservation.ub.unibe.ch/select>. Please update the room reservation info in the README as well then.
Further, I recommend adding all the required attendees (e.g. Timo) to your Outlook meeting invite for two reasons: (1) It helps you find a time when everyone required is available, (2) it ensures that the selected time slot is reserved in all attendees’ calendars, rendering these times unavailable for other.
Ideally, we have nice and sound schedule by end of next week (i.e. Dez 6th), so we can disseminate it among the students, such that they can (plant to) visit each other’s presentations as well.
Best regards
Roman
Dear all
I would like to inform / remind you that I am only working this week and
next. From December 8th I will be on vacation until almost the end of
the year. If you still have a concern that needs to be dealt with in
2024, please let me know as soon as possible.
Best wishes
Bettina
--
Institut für Informatik
Neubrückstrasse 10
CH-3012 Bern
+41 31 684 84 26
Dear all,
the end of the semester is getting closer and some seminar projects
maybe already in a state where the results can be presented by mid/end
of December.
We will have the first seminar presentation slots on
- Dec. 17 (before 12:00 and after 16:00)
- Dec. 18 (before 14:00)
Please talk to your supervised students whether they want to present in
these slots (20 min talk + 10 min discussion).
For those who will not manage to finish their seminar work until
December (which is totally fine), we will have further slots in January
and early February (dates to be fixed).
Best,
Timo
Dear all
Next Wednesday, 27. Nov 2024, we host a guest lecture held by Michael Ahrens and Daniel Roth.
Both hold leading positions in the Software Engineering department at VZ VermögensZentrum, a Swiss financial service provider with around ~1400 employees among various entities (including banking, insurance, pension funds, taxation, legal, etc.). See more details below. Note that the talk will be in German.
-----------
Wann
Mittwoch, 27. November 2024, 14:15 Uhr
Wo
Uni Engehalde, Engehaldestrasse 8, Hörsaal 1 001
Wer
Michael Ahrens, Expert Software Engineer & Teamleiter Firmenkunden, Privatversicherungen, Forschung & Entwicklung
Daniel Roth (Vorwort), Bereichsleiter Software Engineering
VZ VermögensZentrum AG, https://www.vermoegenszentrum.ch/
Titel
Compliance-First: Software Engineering in der Finanzindustrie
-----------
Best regards
Roman
Dear all
On October 8, someone paid an amount of 18.65 for “Grammarly VDW3* with
the SEG credit card via Paypal. I really need the receipt for this.
Thank you very much!
Best
Bettina
--
Institut für Informatik
Neubrückstrasse 10
CH-3012 Bern
+41 31 684 84 26
