THThomas S. Heinze

Thomas S. Heinze

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Thomas S. Heinze has a total of 19 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Performance of high sulfonated poly(ether ether ketone) improved with microcrystalline cellulose and 2,3-dialdehyde cellulose for proton exchange membranes

    by Mohamed Amine Ben Moussa, Zakarya Ahmed, Khaled Charradi, Boutheina Ben Fraj, Sami Boufi, Andreas Koschella, Thomas Heinze, Sherif M. A. S. Keshk, Ibtissem Ben Assaker

    Sulfonated poly (ether ether ketone) (SPEEK) has received substantial attention for its potential to improve the electrochemical behavior and thermomechanical capabilities of direct methanol fuel cells. This study examines how the integration by solution casting of microcrystalline cellulose (MCC) and 2,3-dialdehyde cellulose (DAC) onto highly sulfonated PEEK (with a sulfonation degree of 80%) affects its physicochemical properties and morphological structures. The mechanical attributes and proton conductivity of the polymer matrix are impacted by MCC and DAC inclusion into SPEEK membrane. The maximum proton conductivity was seen in the SPEEK/MCC membranes at 70 °C (up to 0.1 S cm−1). The proton conductivity in methanol vapor was increased by SPEEK/DAC membranes at high temperatures as opposed to pristine SPEEK and SPEEK/MCC membranes.


  • Open Access

    Cross-Domain Evaluation of a Deep Learning-Based Type Inference System

    by Bernd Gruner, Tim Sonnekalb, Thomas S. Heinze, Clemens-Alexander Brust

    Optional type annotations allow for enriching dynamic programming languages with static typing features like better Integrated Development Environment (IDE) support, more precise program analysis, and early detection and prevention of type-related runtime errors. Machine learning-based type inference promises interesting results for automating this task. However, the practical usage of such systems depends on their ability to generalize across different domains, as they are often applied outside their training domain. In this work, we investigate Type4Py as a representative of state-of-the-art deep learning-based type inference systems, by conducting extensive cross-domain experiments. Thereby, we address the following problems: class imbalances, out-of-vocabulary words, dataset shifts, and unknown classes. To perform such experiments, we use the datasets ManyTypes4Py and CrossDomainTypes4Py. The latter we introduce in this paper. Our dataset enables the evaluation of type inference systems in different domains of software projects and has over 1,000,000 type annotations mined on the platforms GitHub and Libraries. It consists of data from the two domains web development and scientific calculation. Through our experiments, we detect that the shifts in the dataset and the long-tailed distribution with many rare and unknown data types decrease the performance of the deep learning-based type inference system drastically. In this context, we test unsupervised domain adaptation methods and fine-tuning to overcome these issues. Moreover, we investigate the impact of out-of-vocabulary words.

  • Open Access

    Deep security analysis of program code

    by Tim Sonnekalb, Thomas S. Heinze, Patrick Mäder

    Due to the continuous digitalization of our society, distributed and web-based applications become omnipresent and making them more secure gains paramount relevance. Deep learning (DL) and its representation learning approach are increasingly been proposed for program code analysis potentially providing a powerful means in making software systems less vulnerable. This systematic literature review (SLR) is aiming for a thorough analysis and comparison of 32 primary studies on DL-based vulnerability analysis of program code. We found a rich variety of proposed analysis approaches, code embeddings and network topologies. We discuss these techniques and alternatives in detail. By compiling commonalities and differences in the approaches, we identify the current state of research in this area and discuss future directions. We also provide an overview of publicly available datasets in order to foster a stronger benchmarking of approaches. This SLR provides an overview and starting point for researchers interested in deep vulnerability analysis on program code.


  • Benchmarking Open-Source Static Analyzers for Security Testing for C

    by Christoph Gentsch, Rohan Krishnamurthy, Thomas S. Heinze


  • Mining BPMN Processes on GitHub for Tool Validation and Development

    by Thomas S. Heinze, Viktor Stefanko, Wolfram Amme

    Today, business process designers can choose from an increasing number of analysis tools to check their process model with respect to defects or flaws, before, e.g., deploying the model in a process engine. Answering questions about the tools’ effectiveness though is difficult, as their validation often lacks empirical evidence. In particular, for a modeling language like BPMN, where the process is the product, tools are validated by means of case studies or even artificial process examples. We here advocate instead an approach to systematically mine software repositories on GitHub.com for a large corpus of BPMN business process models and discuss how it can be used for tool validation and guiding tool development, using the example of the linting tool BPMNspector.


  • Static analysis and process model transformation for an advanced business process to Petri net mapping

    by Thomas S. Heinze, Wolfram Amme, Simon Moser

    Summary: Verification of business processes typically relies on Petri net–based process models. While they allow for natural modeling and analysis of aspects such as parallelism and message exchange, such a process model is seldom complete and precise. This is mainly because the available techniques for deriving a Petri net model from the original model neglect process data in favor of feasible verification. In this paper, we present an approach for deriving more precise process models by leveraging a process‐to‐Petri‐net compiler, which takes as input a business process and generates as output a Petri net model for the process. This can be subsequently used for verification. However, in contrast to a conventional compiler, our compiler's objective is not to create the most efficient code but rather to produce a most precise but still effectively verifiable Petri net–based process model.