N. Tillmann

Publications
Influence

N. Tillmann, J. D. Halleux
Computer Science
TAP
9 April 2008

Pex automatically produces a small test suite with high code coverage for a .NET program that has already been extensively tested over several years. Expand

Model-Based Testing of Object-Oriented Reactive Systems with Spec Explorer

M. Veanes, C. Campbell, W. Grieskamp, W. Schulte, N. Tillmann, Lev Nachmanson
Computer Science
Formal Methods and Testing
2008

Spec Explorer is a tool for testing reactive, object-oriented software systems. Expand

Parameterized unit tests

N. Tillmann, W. Schulte
Computer Science
ESEC/FSE-13
5 September 2005

Parameterized unit tests extend the current industry practice of using closed unit tests defined as parameterless methods. Expand

Path Feasibility Analysis for String-Manipulating Programs

N. Bjørner, N. Tillmann, A. Voronkov
Mathematics, Computer Science
TACAS
27 March 2009

We discuss the problem of path feasibility for programs manipulating strings using a collection of standard string library functions. Expand

Demand-Driven Compositional Symbolic Execution

S. Anand, Patrice Godefroid, N. Tillmann
Computer Science
TACAS
29 March 2008

We discuss how to perform symbolic execution of large programs in a manner that is both compositional (hence more scalable) and demand-driven. Expand

Symbolic execution for software testing in practice: preliminary assessment

Cristian Cadar, Patrice Godefroid, +4 authors W. Visser
Computer Science
33rd International Conference on Software…
21 May 2011

We present results for the "Impact Project Focus Area" on the topic of symbolic execution as used in software testing. Expand

Rex: Symbolic Regular Expression Explorer

M. Veanes, J. D. Halleux, N. Tillmann
Computer Science
Third International Conference on Software…
6 April 2010

We introduce a method and a tool called Rex, for symbolically expressing and analyzing regular expression constraints. Expand

DySy: dynamic symbolic execution for invariant inference

C. Csallner, N. Tillmann, Y. Smaragdakis
Computer Science
ICSE '08
15 May 2008

In this paper, we introduce a technique that can drastically increase the relevance of inferred invariants, or reduce the size of the test suite required to obtain good invariants. Expand

Fitness-guided path exploration in dynamic symbolic execution

T. Xie, N. Tillmann, J. D. Halleux, W. Schulte
Computer Science
IEEE/IFIP International Conference on Dependable…
29 September 2009

We propose a novel approach called Fitnex, a search strategy that uses state-dependent fitness values (computed through a fitness function) to guide path exploration. Expand

SPUR: a trace-based JIT compiler for CIL

Michael Bebenita, F. Brandner, +4 authors H. Venter
Computer Science
OOPSLA
17 October 2010

We propose a trace JIT for Microsoft's Common Intermediate Language CIL (the target language of C#, VisualBasic, F#, and many other languages). Expand

Recommended Authors