#### Filter Results:

- Full text PDF available (24)

#### Publication Year

1950

2017

- This year (4)
- Last 5 years (26)
- Last 10 years (31)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Johannes Kinder, Florian Zuleger, Helmut Veith
- VMCAI
- 2009

Due to indirect branch instructions, analyses on executables commonly suffer from the problem that a complete control flow graph of the program is not available. Data flow analysis has been proposed before to statically determine branch targets in many cases, yet a generic strategy without assumptions on compiler idioms or debug information is lacking. We… (More)

- Sumit Gulwani, Florian Zuleger
- PLDI
- 2010

We define the <i>reachability-bound problem</i> to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in terms of the inputs to that procedure. This has applications in bounding resources consumed by a program such as time, memory, network-traffic, power, as well as estimating… (More)

- Moritz Sinn, Florian Zuleger, Helmut Veith
- Software Engineering
- 2014

Automatic methods for computing bounds on the resource consumption of programs are an active area of research. In [SZV14] we present the first scalable bound analysis for imperative programs that achieves amortized complexity analysis. Our techniques can be applied for deriving upper bounds on how often loops can be iterated as well as on how often a single… (More)

- Byron Cook, Abigail See, Florian Zuleger
- TACAS
- 2013

Termination proving has traditionally been based on the search for (possibly lexicographic) ranking functions. In recent years, however, the discovery of termination proof techniques based on Ramsey’s theorem have led to new automation strategies, e.g. size-change, or iterative reductions from termination to safety. In this paper we revisit the decision to… (More)

- Thomas Colcombet, Laure Daviaud, Florian Zuleger
- MFCS
- 2014

Max-plus automata (over N ∪ {−∞}) are nite devices that map input words to non-negative integers or −∞. In this paper we present (a) an algorithm allowing to compute the asymptotic behaviour of max-plus automata, and (b) an application of this technique to the evaluation of the computational time complexity of programs.

- Florian Zuleger, Sumit Gulwani, Moritz Sinn, Helmut Veith
- SAS
- 2011

The size-change abstraction (SCA) is an important program abstraction for termination analysis, which has been successfully imple-ion for termination analysis, which has been successfully implemented in many tools for functional and logic programs. In this paper, we demonstrate that SCA is also a highly effective abstract domain for the bound analysis of… (More)

- Florian Zuleger, Ivan Radicek, Sumit Gulwani
- Software Engineering
- 2014

Providing feedback on programming assignments manually is a tedious, error prone, and time-consuming task. In this paper, we motivate and address the problem of generating feedback on performance aspects in introductory programming assignments. We studied a large number of functionally correct student solutions to introductory programming assignments and… (More)

- Moritz Sinn, Florian Zuleger, Helmut Veith
- Journal of Automated Reasoning
- 2016

Difference constraints have been used for termination analysis in the literature, where they denote relational inequalities of the form $$x' \le y + c$$ x ′ ≤ y + c , and describe that the value of x in the current state is at most the value of y in the previous state plus some constant $$c \in \mathbb {Z}$$ c ∈ Z . We believe that difference constraints… (More)

- Diego Calvanese, Tomer Kotek, Mantas Simkus, Helmut Veith, Florian Zuleger
- Description Logics
- 2014

The verification community has studied dynamic data structures primarily in a bottom-up way by analyzing pointers and the shapes induced by them. Recent work in fields such as separation logic has made significant progress in extracting shapes from program source code. Many real world programs however manipulate complex data whose structure and content is… (More)

- Moritz Sinn, Florian Zuleger, Helmut Veith
- FMCAD
- 2015

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 previous state plus some constant c ∈ Z. In this paper, we argue that the complexity of imperative programs typically arises… (More)