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

Florian Merz 0001

dblp:60/7861 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · none

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

Software engineering, systems software and programming languages · 4

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 · 61% Program verification · 30% Compilers and program optimization · 9%

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

TopicWeightPapersLastEvidence papers
Program verification › model checking
bounded model checking
0.212013
The bounded model checker LLBMC · ASE 2013
Program analysis › static analysis
bug detection
0.212013
The bounded model checker LLBMC · ASE 2013
Program analysis › error detection
runtime error detection
0.212013
The bounded model checker LLBMC · ASE 2013
Compilers and program optimization
intermediate representation
0.012013
The bounded model checker LLBMC · ASE 2013

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

bit-vector theory · 0.2SMT solving · 0.2
YearPublicationVenuePosition
2013 The bounded model checker LLBMC
abstract
This paper presents LLBMC, a tool for finding bugs and runtime errors in sequential C/C++ programs. LLBMC employs bounded model checking using an SMT-solver for the theory of bitvectors and arrays and thus achieves precision down to the level of single bits. The two main features of LLBMC that distinguish it from other bounded model checking tools for C/C++ are (i) its bit-precise memory model, which makes it possible to support arbitrary type conversions via stores and loads; and (ii) that it operates on a compiler intermediate representation and not directly on the source code.
Stephan Falke 0001, Florian Merz 0001, Carsten Sinz
ASE2
2013 LLBMC: Improved Bounded Model Checking of C Programs Using LLVM - (Competition Contribution)
Stephan Falke 0001, Florian Merz 0001, Carsten Sinz
TACAS2
2012 LLBMC: A Bounded Model Checker for LLVM's Intermediate Representation - (Competition Contribution)
Carsten Sinz, Florian Merz 0001, Stephan Falke 0001
TACAS2
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
RE3