Helmut Veith
YOU?
Author Swipe
View article: Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues
Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues Open
Priority queues with parallel access are an attractive data structure for applications like prioritized online scheduling, discrete event simulation, or greedy algorithms. However, a classical priority queue constitutes a severe bottleneck…
View article: Pebble-Intervals Automata and FO2 with Two Orders (Extended Version)
Pebble-Intervals Automata and FO2 with Two Orders (Extended Version) Open
We introduce a novel automata model, called pebble-intervals automata (PIA), and study its power and closure properties. PIAs are tailored for a decidable fragment of FO that is important for reasoning about structures that use data values…
View article: iDQ: Instantiation-Based DQBF Solving
iDQ: Instantiation-Based DQBF Solving Open
Dependency Quantified Boolean Formulas (DQBF) are obtained by adding Henkin quantifiers to Boolean formulas and have seen growing interest in the last years. Since deciding DQBF is NEXPTIME-complete, efficient ways of solving it would have…
View article: Empirical software metrics for benchmarking of verification tools
Empirical software metrics for benchmarking of verification tools Open
We study empirical metrics for software source code, which can predict the performance of verification tools on specific types of software. Our metrics comprise variable usage patterns, loop patterns, as well as indicators of control-flow …
View article: On the Automated Verification of Web Applications with Embedded SQL
On the Automated Verification of Web Applications with Embedded SQL Open
A large number of web applications is based on a relational database together with a program, typically a script, that enables the user to interact with the database through embedded SQL queries and commands. In this paper, we introduce a …
View article: On the automated verification of web applications with embedded SQL
On the automated verification of web applications with embedded SQL Open
A large number of web applications is based on a relational database together with a program, typically a script, that enables the user to interact with the database through embedded SQL queries and commands. In this paper, we introduce a …
View article: On the completeness of bounded model checking for threshold-based distributed algorithms: Reachability
On the completeness of bounded model checking for threshold-based distributed algorithms: Reachability Open
Counter abstraction is a powerful tool for parameterized model checking, if the number of local states of the concurrent processes is relatively small. In recent work, we introduced parametric interval counter abstraction that allowed us t…
View article: Parameterized Systems in BIP: Design and Model Checking
Parameterized Systems in BIP: Design and Model Checking Open
BIP is a component-based framework for system design that has important industrial applications. BIP is built on three pillars: behavior, interaction, and priority. In this paper, we introduce first-order interaction logic (FOIL) that exte…
View article: Loop Patterns in C Programs
Loop Patterns in C Programs Open
In this work, we conduct a systematic study of loops in C programs. We describe static analyses capable of efficiently identifying definite iteration in C code. Our experiments show that over one third of loops in our benchmarks take this …
View article: Difference Constraints: An adequate Abstraction for Complexity Analysis of Imperative Programs
Difference Constraints: An adequate Abstraction for Complexity Analysis of Imperative Programs Open
Difference constraints have been used for termination analysis in the literature, where they denote relational inequalities of the form x' <= y + c, and describe that the value of x in the current state is at most the value of y in the pre…
View article: Monadic second order finite satisfiability and unbounded tree-width
Monadic second order finite satisfiability and unbounded tree-width Open
The finite satisfiability problem of monadic second order logic is decidable only on classes of structures of bounded tree-width by the classic result of Seese (1991). We prove the following problem is decidable: Input: (i) A monadic secon…
View article: Local Linearizability
Local Linearizability Open
The semantics of concurrent data structures is usually given by a sequential specification and a consistency condition. Linearizability is the most popular consistency condition due to its simplicity and general applicability. Nevertheless…