#### Filter Results:

- Full text PDF available (20)

#### Publication Year

2003

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Margus Veanes, Colin Campbell, Wolfgang Grieskamp, Wolfram Schulte, Nikolai Tillmann, Lev Nachmanson
- Formal Methods and Testing
- 2008

Testing is one of the costliest aspects of commercial software development. Model-based testing is a promising approach addressing these deficits. At Mi-crosoft, model-based testing technology developed by the Foundations of Software Engineering group in Microsoft Research has been used since 2003. The second generation of this tool set, Spec Explorer,… (More)

- Sergey Pupyrev, Lev Nachmanson, Sergey Bereg, Alexander E. Holroyd
- Graph Drawing
- 2011

Edge bundling reduces the visual clutter in a drawing of a graph by uniting the edges into bundles. We propose a method of edge bundling drawing each edge of a bundle separately as in metro-maps and call our method ordered bundles. To produce aesthetically looking edge routes it minimizes a cost function on the edges. The cost function depends on the ink,… (More)

This paper deals with testing of nondeterministic software systems. We assume that a model of the nondeterministic system is given by a directed graph with two kind of vertices: states and choice points. Choice points represent the nondeterministic behaviour of the implementation under test (IUT). Edges represent transitions. They have costs and… (More)

We present work on a tool environment for model-based testing with the Abstract State Machine Language (AsmL). Our environment supports semi-automatic parameter generation, call sequence generation and conformance testing. We outline the usage of the environment by an example, discuss its underlying technologies, and report on some applications conducted in… (More)

- Sergey Pupyrev, Lev Nachmanson, Michael Kaufmann
- Graph Drawing
- 2010

We show how to improve the Sugiyama scheme by using edge bundling. Our method modifies the layout produced by the Sugiyama scheme by bundling some of the edges together. The bundles are created by a new algorithm based on minimizing the total ink needed to draw the graph edges. We give several implementations that vary in quality of the resulting layout and… (More)

We describe a practical model-based testing tool developed at Mi-crosoft Research called Spec Explorer. Spec Explorer enables modeling and automatic testing of concurrent object-oriented systems. These systems take inputs as well as provide outputs in form of spontaneous reactions, where inputs and outputs can be arbitrary data types, including objects.… (More)

- Tim Dwyer, Lev Nachmanson
- Graph Drawing
- 2009

To produce high quality drawings of graphs with nodes drawn as shapes it is important to find routes for the edges which do not intersect node boundaries. Recent work in this area involves finding shortest paths in a tangent-visibility graph. However, construction of the full tangent-visibility graph is expensive, at least quadratic time in the number of… (More)

- Andreas Blass, Yuri Gurevich, Lev Nachmanson, Margus Veanes
- FATES
- 2005

Testing tasks can be viewed (and organized!) as games against nature. We study reachability games in the context of testing. Such games are ubiquitous. A single industrial test suite may involve many instances of a reachability game. Hence the importance of optimal or near optimal strategies for reachability games. One can use linear programming or the… (More)

- Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander
- Graph Drawing
- 2004

This report describes the Fifth Annual Graph Drawing Contest , held in conjunction with the 1998 Graph Drawing Symposium in Montreal, Canada. The purpose of the contest is to monitor and challenge the current state of the art in graph-drawing technology 4, 5, 6, 7].

- Lev Nachmanson, George G. Robertson, Bongshin Lee
- Graph Drawing
- 2007

This paper describes novel methods we developed to lay out graphs using Sugiyama's scheme [16] in a tool named GLEE. The main contributions are: a heuristic for creating a graph layout with a given aspect ratio, an efficient method of edge-crossings counting while performing adjacent vertex swaps, and a simple and fast spline routing algorithm.