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

Thomas Gorges

dblp:95/2111 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0007-0573-0992ORCID · corroborated

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

Software engineering, systems software and programming languages · 3Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021

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
Program analysis · 67% Program verification · 33%

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

TopicWeightPapersLastEvidence papers
Program analysis › static analysis
abstract interpretation
0.112008
Reducing False Positives by Combining Abstract Interpretation and Bounded Model Checking · ASE 2008
Program verification › model checking
bounded model checking
0.112008
Reducing False Positives by Combining Abstract Interpretation and Bounded Model Checking · ASE 2008
Program analysis › static analysis › bug detection
false positive reduction
0.112008
Reducing False Positives by Combining Abstract Interpretation and Bounded Model Checking · ASE 2008

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

bounded model checking · 0.1abstract interpretation · 0.1SAT solving · 0.1
YearPublicationVenuePosition
2026 An Analysis of Lightweight Models for Document Image Machine Translation
Abantika Bose, Thomas Gorges, Lukas Hüttner, Linda-Sophie Schneider, Mathias Seuret, Fei Wu 0025, Vincent Christlein
ICDAR (2)2
2013 Predicting the Flow of Defect Correction Effort using a Bayesian Network Model
Thomas Schulz, Lukasz Radlinski, Thomas Gorges, Wolfgang Rosenstiel
Empir. Softw. Eng.3
2009 Linking Functional Requirements and Software Verification
abstract
Synchronization between component requirements and implementation centric tests remains a challenge that is usually addressed by requirements reviews with testers and traceability policies. The claim of this work is that linking requirements, their scenario-based formalizations, and software verification provides a promising extension to this approach. Formalized scenarios, for example in the form of low-level assume/assert statements in C, are easier to trace to requirements than traditional test sets. For a verification engineer, they offer an opportunity to better participate in requirements changes. Changes in requirements can be more easily propagated because adapting formalized scenarios is often easier than deriving and updating a large set of test cases. The proposed idea is evaluated in a case study encompassing over 50 functional requirements of an automotive software developed at Robert Bosch GmbH. Results indicate that requirement formalization together with formal verification leads to the discovery of implementation problems missed in a traditional testing process.
Hendrik Post, Carsten Sinz, Florian Merz 0001, Thomas Gorges, Thomas Kropf
RE4
2008 Reducing False Positives by Combining Abstract Interpretation and Bounded Model Checking
abstract
Fully automatic source code analysis tools based on abstract interpretation have become an integral part of the embedded software development process in many companies. And although these tools are of great help in identifying residual errors, they still possess a major drawback: analyzing industrial code comes at the cost of many spurious errors that must be investigated manually. The need for efficient development cycles prohibits extensive manual reviews, however. To overcome this problem, the combination of different software verification techniques has been suggested in the literature. Following this direction, we present a novel approach combining abstract interpretation and source code bounded model checking, where the model checker is used to reduce the number of false error reports. We apply our methodology to source code from the automotive industry written in C, and show that the number of spurious errors emitted by an abstract interpretation product can be reduced considerably.
Hendrik Post, Carsten Sinz, Alexander Kaiser 0001, Thomas Gorges
ASE4