Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ulf Nilsson

dblp:n/UlfNilsson · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
1since 2021 · last 2025
0000-0003-0269-9268ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Empirical software engineering · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Empirical software engineering
mining software repositories
0.912025
Why Do Machine Learning Notebooks Crash? An Empirical Study on Public Python Jupyter Notebooks · IEEE Trans. Software Eng. 2025
Empirical software engineering › software fault analysis
bug study
0.312025
Why Do Machine Learning Notebooks Crash? An Empirical Study on Public Python Jupyter Notebooks · IEEE Trans. Software Eng. 2025
Embedded and real-time systems
real-time scheduling
0.011998
Detailed Design of Avionics Control Software · RTSS 1998

Methods — techniques the papers use, named apart from their topics

manual analysis · 0.9empirical study · 0.9period calibration method · 0.0
YearPublicationVenuePosition
2025 Why Do Machine Learning Notebooks Crash? An Empirical Study on Public Python Jupyter Notebooks
abstract
Jupyter notebooks have become central in data science, integrating code, text and output in a flexible environment. With the rise of machine learning (ML), notebooks are increasingly used for prototyping and data analysis. However, due to their dependence on complex ML libraries and the flexible notebook semantics that allow cells to be run in any order, notebooks are susceptible to software bugs that may lead to program crashes. This paper presents a comprehensive empirical study focusing on crashes in publicly available Python ML notebooks. We collect 64,031 notebooks containing 92,542 crashes from GitHub and Kaggle, and manually analyze a sample of 746 crashes across various aspects, including crash types and root causes. Our analysis identifies unique ML-specific crash types, such as tensor shape mismatches and dataset value errors that violate API constraints. Additionally, we highlight unique root causes tied to notebook semantics, including out-of-order execution and residual errors from previous cells, which have been largely overlooked in prior research. Furthermore, we identify the most error-prone ML libraries, and analyze crash distribution across ML pipeline stages. We find that over 40% of crashes stem from API misuse and notebook-specific issues. Crashes frequently occur when using ML libraries like TensorFlow/Keras and Torch. Additionally, over 70% of the crashes occur during data preparation, model training, and evaluation or prediction stages of the ML pipeline, while data visualization errors tend to be unique to ML notebooks.
Willem Meijer, José Antonio Hernández López, Ulf Nilsson, Dániel Varró
IEEE Trans. Software Eng.4
2001 Unavoidable Configurations of Parameterized Rings of Processes
Marie Duflot, Laurent Fribourg, Ulf Nilsson
CONCUR3
1998 Detailed Design of Avionics Control Software
abstract
Avionics control systems are typical real time systems-automatic control algorithms are realized as periodic computations where strict requirements on the timing can be derived by a control analysis. The requirements are effectively end to end timing requirements on the computation-from sensory input to actuator output-and have to be transformed into a detailed control software design. This analysis, together with a resource and performance analysis, is required early in the development process-neither hardware nor prototypes of the software can be assumed to exist-in order to estimate the cost of development and the cost of hardware to meet customer requirements. The paper investigates the applicability of a method (the period calibration method) to transform the end to end requirements of an avionics control software, into a design consisting of a set of periodic tasks with buffered data flows. The experience is discussed and shortcomings of the method are analysed.
Ulf Nilsson, S. Streiffert, Anders Törne
RTSS1
1995 Abstract Interpretation: A Kind of Magic
Ulf Nilsson
Theor. Comput. Sci.1
1991 A Simple Fixed Point Characterization of Three-Valued Stable Model Semantics
Staffan Bonnier, Ulf Nilsson, Torbjörn Näslund
Inf. Process. Lett.2