... interesting specialized event co-located with FSE; the CFP explcitly
welcomes negative results, if we sth in our fundus ;-)
Best,
Timo
-------- Weitergeleitete Nachricht --------
Betreff: [SEWORLD] CfP: PROMISE 2025 - 21st International Conference on
Predictive Models and Data Analytics in Software Engineering
Weitersenden-Datum: Mon, 13 Jan 2025 03:53:20 +0000
Weitersenden-Von: SEWORLD Moderator <seworld-moderator(a)sigsoft.org>
Weitersenden-An: seworld(a)sigsoft.org
Datum: Fri, 10 Jan 2025 22:50:25 +0000
Von: Yiming Tang <seworld(a)volunteer.acm.org>
An: SEWORLD(a)SIGSOFT.ORG <SEWORLD(a)SIGSOFT.ORG>
Kopie (CC): wshang(a)uwaterloo.ca <wshang(a)uwaterloo.ca>, Lili Wei, Prof.
<lili.wei(a)mcgill.ca>
===================================================================
21st International Conference on Predictive Models and Data Analytics in
Software Engineering (PROMISE 2025)
https://conf.researchr.org/home/promise-2025
June, 2025, Trondheim, Norway
Co-located with the International Conference on the Foundations of
Software Engineering (FSE 2025)
Submit your papers by February 25th, 2025
https://conf.researchr.org/home/promise-2025#Call-for-Papers
===================================================================
The International Conference on Predictive Models and Data Analytics in
Software Engineering (PROMISE) is an annual forum for researchers and
practitioners to present, discuss and exchange ideas, results, expertise
and experiences in construction and/or application of predictive models,
artificial intelligence, and data analytics in software engineering.
PROMISE encourages researchers to publicly share their data in order to
provide interdisciplinary research between the software engineering and
data mining communities, and seek for verifiable and repeatable
experiments that are useful in practice.
=== Important Dates ===
- Abstract submission: Feb 18th, 2025 AoE
- Paper submission: Feb 25th, 2025 AoE
- Author notification: Mar 24th, 2025 AoE
- Camera-ready: Apr 24th, 2025 AoE
- Conference Date: June, 2025
=== Types of Submissions ===
Technical papers (10 pages)
* PROMISE accepts a wide range of papers where AI tools have been
applied to SE such as predictive modeling and other AI methods. Both
positive and negative results are welcome, though negative results
should still be based on rigorous research and provide details on
lessons learned.
Industrial papers (2-4 pages)
* Results, challenges, lessons learned from industrial applications of
software analytics.
New idea papers (2-4 pages)
* Novel insights or ideas that may yet to be fully tested.
Journal First
* Selected papers will be invited for journal first presentations at
PROMISE. Details to follow.
=== Topics of Interest ===
PROMISE papers can explore any of the following topics (or more).
Application-oriented papers:
* prediction of cost, effort, quality, defects, business value;
* quantification and prediction of other intermediate or final
properties of interest in software development regarding people, process
or product aspects;
* using predictive models and data analytics in different settings, e.g.
lean/agile, waterfall, distributed, community-based software development;
* dealing with changing environments in software engineering tasks;
* dealing with multiple-objectives in software engineering tasks;
* using predictive models and software data analytics in policy and
decision-making.
Ethically-aligned papers:
* Can we apply and adjust our AI-for-SE tools (including predictive
models) to handle ethical non-functional requirements such as
inclusiveness, transparency, oversight and accountability, privacy,
security, reliability, safety, diversity and fairness?
Theory-oriented papers:
* model construction, evaluation, sharing and reusability;
* interdisciplinary and novel approaches to predictive modelling and
data analytics that contribute to the theoretical body of knowledge in
software engineering;
* verifying/refuting/challenging previous theory and results;
* combinations of predictive models and search-based software engineering;
* the effectiveness of human experts vs. automated models in predictions.
Data-oriented papers:
* data quality, sharing, and privacy;
* curated data sets made available for the community to use; ethical
issues related to data collection and sharing;
* metrics;
* tools and frameworks to support researchers and practitioners to
collect data and construct models to share/repeat experiments and results.
Validity-oriented papers:
* replication and repeatability of previous work using predictive
modelling and data analytics in software engineering;
* assessment of measurement metrics for reporting the performance of
predictive models;
* evaluation of predictive models with industrial collaborators.
=== Submissions ===
PROMISE 2025 submissions must meet the following criteria:
* be original work, not published or under review elsewhere while being
considered;
*
conform to the submission format requirements of the FSE 2025 Companion
proceedings;<https://conf.researchr.org/track/fse-2025/fse-2025-how-to-submit#submission…>
* not exceed 10 (4) pages for technical (industrial, new-ideas) papers
including references;
* be written in English;
* be prepared for double blind review
* Exception: for data-oriented papers, authors may elect not to use
double blind by placing a footnote on page 1 saying “Offered for
single-blind review”.
*
be submitted via HotPRC and the submission link will be posted shortly.
* on submission, please choose the paper category appropriately, i.e.,
technical (main track, 10 pages max); industrial (4 pages max); and new
idea papers (4 pages max).
To satisfy the double blind requirement submissions must meet the
following criteria:
* no author names and affiliations in the body and metadata of the
submitted paper;
* self-citations are written in the third person;
* no references to the authors personal, lab, or university website;
* no references to personal accounts on GitHub, bitbucket, Google Drive,
etc.
=== Publication and Attendance ===
Accepted papers will be published in the ACM Digital Library within its
International Conference Proceedings Series and will be available
electronically via ACM Digital Library.
Each accepted paper needs to have one registration at the full
conference rate and be presented in person at the conference.
=== Evaluation ===
Submissions will be peer reviewed by at least three experts from the
international program committee. Submissions will be evaluated on the
basis of their originality, importance of contribution, soundness,
evaluation, quality, and consistency of presentation, and appropriate
comparison to related work.
=== Green Open Access ===
Similar to other leading SE conferences, PROMISE supports and encourages
Green Open Access, i.e., self-archiving. Authors can archive their
papers on their personal home page, an institutional repository of their
employer, or at an e-print server such as arXiv (preferred). Also, given
that PROMISE papers heavily rely on software data, we would like to draw
authors that leverage data scraped from GitHub of GitHub’s Terms of
Service, which require that “publications resulting from that research
are open access”.
We also strongly encourage authors to submit their tools and data to
Zenodo, which adheres to FAIR (findable, accessible, interoperable and
re-usable) principles and provides DOI versioning.
============================================================
To contribute to SEWORLD, send your submission to
mailto:seworld@sigsoft.org
http://sigsoft.org/resources/seworld.html
provides more
information on SEWORLD as well as links to a complete
archive of messages posted to the list.
============================================================
Dear all,
to those I have not seen or chatted with yet: Happy new year!
Please notice the invitation below, the talks are open for everybody who
is interested.
Best,
Timo
-------- Weitergeleitete Nachricht --------
Betreff: Invitation: Mini-Symposium on Software Engineering Research –
January 10th
Datum: Tue, 7 Jan 2025 11:24:38 +0100
Von: Alberto Bacchelli <bacchelli(a)ifi.uzh.ch>
An: SoSy Mailing List <sosy(a)lists.ifi.uzh.ch>, April Wang
<april.wang(a)inf.ethz.ch>, Salvaneschi, Guido
<guido.salvaneschi(a)unisg.ch>, Gabriele Bavota <gabriele.bavota(a)usi.ch>,
Carlo A. Furia <furiac(a)usi.ch>, Timo Kehrer <timo.kehrer(a)unibe.ch>
Kopie (CC): Bogdan Vasilescu <vasilescu(a)cmu.edu>, Thomas D Latoza
<tlatoza(a)gmu.edu>, Maurício Aniche <Mauricio.aniche(a)adyen.com>
Dear all,
I am delighted to invite you to a mini-symposium featuring talks by
three outstanding researchers in software engineering. This event will
be on the morning of **this Friday, January 10th**, 2025, in Room
2.A.10, of the BIN building (Binzmühlestrasse 14) at the University of
Zurich.
The mini-symposium is part of the events surrounding the PhD defense of
Pavlína Wurzel Gonçalves. It is an excellent opportunity to hear about
the speakers' latest research and engage in discussions with the
speakers and other participants.
Program
- 09:00–09:30, Arrival and Welcome
- 09:30–10:30, Prof. Dr. Bogdan Vasilescu, The Strength of Weak Ties in
Open-Source Software Development Networks
- 10:30–11:30, Dr. Mauricio Aniche, Test Selection at Adyen: saving time
and resources
- 11:30–12:30, Prof. Dr. Thomas LaToza, Sharing Programming Expertise
We welcome all software engineering researchers and enthusiasts to join
us for this exciting event. Feel free to extend this invitation to any
interested people. Attached to this email, you find more information
about the talks and speakers.
Please respond to this email to confirm your attendance and let me know
how many people will be joining you, so I can ensure we have enough
coffee and refreshments for everyone in the morning.
I look forward to seeing you there!
Warm regards,
Alberto
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