Michael W. Whalen

Michael W. Whalen

Auto-generated profile, based on publicly available information

Michael W. Whalen

Amazon Web Services

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 July 2018
Verified
Book Chapter
Open access
PDF file
AGAndrew Gacek
Andrew Gacek
JBJohn Backes
John Backes
MWMike Whalen
Mike Whalen
LWLucas Wagner
Lucas Wagner
EGElaheh Ghassabani
Elaheh Ghassabani
JKind is an open-source industrial model checker developed by Rockwell Collins and the University of Minnesota. JKind uses multiple parallel engines to prove or falsify safety properties of infinite state models. It is portable, easy to install, performance competitive with other state-of-the-art model checkers, and has features designed to improve the results presented to users: inductive validity cores for proofs and counterexample smoothing for test-case generation. It serves as the back-end for various industrial applications.

1 November 2019 in IEEE Software
Verified
Journal Article
Closed access
JBJohn Backes
John Backes
PBPauline Bolignano
Pauline Bolignano
BCByron Cook
Byron Cook
AGAndrew Gacek
Andrew Gacek
KLKasper Soe Luckow
Kasper Soe Luckow
MWMichael Whalen
Michael Whalen

7 November 2020
Verified
Conference Paper
Open access
VSVaibhav Sharma
Vaibhav Sharma
SHSoha Hussein
Soha Hussein
MWMichael W. Whalen
Michael W. Whalen
SMStephen McCamant
Stephen McCamant
WVWillem Visser
Willem Visser
Merging execution paths is a powerful technique for reducing path explosion in symbolic execution. One approach, introduced and dubbed “veritesting” by Avgerinos et al., works by translating abounded control flow region into a single constraint. This approach is a convenient way to achieve path merging as a modification to a pre-existing single-path symbolic execution engine. Previous work evaluated this approach for symbolic execution of binary code, but different design considerations apply when building tools for other languages. In this paper, we extend the previous approach for symbolic execution of Java. Because Java code typically contains many small dynamically dispatched methods, it is important to include them in multi-path regions; we introduce dynamic inlining of method-regions to do so modularly. Java’s typed memory structure is very different from the binary representation, but we show how the idea of static single assignment (SSA) form can be applied to object references to statically account for aliasing. We have implemented our algorithms in Java Ranger, an extension to the widely used Symbolic Pathfinder tool. In a set of nine benchmarks, Java Ranger reduces the running time and number of execution paths by a total of 38% and 71% respectively as compared to SPF. Our results are a significant improvement over the performance of JBMC, a recently released verification tool for Java bytecode. We also participated in a static verification competition at a top theory conference where other participants included state-of-the-art Java verifiers. JR won first place in the competition’s Java verification track.

17 April 2020
Verified
Book Chapter
Open access
PDF file
VSVaibhav Sharma
Vaibhav Sharma
SHSoha Hussein
Soha Hussein
MWMichael W. Whalen
Michael W. Whalen
SMStephen McCamant
Stephen McCamant
WVWillem Visser
Willem Visser
Path-merging is a known technique for accelerating symbolic execution. One technique, named “veritesting” by Avgerinos et al. uses summaries of bounded control-flow regions and has been shown to accelerate symbolic execution of binary code. But, when applied to symbolic execution of Java code, veritesting needs to be extended to summarize dynamically dispatched methods and exceptional control-flow. Such an extension of veritesting has been implemented in Java Ranger by implementing as an extension of Symbolic PathFinder, a symbolic executor for Java bytecode. In this paper, we briefly describe the architecture of Java Ranger and describe its setup for SV-COMP 2020.

20 April 2023
Verified
Book Chapter
Open access
PDF file
SHSoha Hussein
Soha Hussein
QYQiuchen Yan
Qiuchen Yan
SMStephen McCamant
Stephen McCamant
VSVaibhav Sharma
Vaibhav Sharma
MWMichael W. Whalen
Michael W. Whalen
Java Ranger is a path-merging tool for Java Programs. It identifies branching regions of code and summarizes them by generating a disjunctive logical constraint that describes the behavior of the code region. Previously, Java Ranger showed that a reduction of 70% of execution paths is possible when used to merge branching regions of code that support numeric constraints.In this paper, we describe the support of two additional features since participation in SV-COMP 2020: symbolic array and symbolic string operations. Finally, we present a preliminary evaluation of the effect of the structure of the disjunctive constraint on the solver’s performance. Results suggest that certain constraint structures can speed up the performance of Java Ranger.

14 May 2016
Verified
Conference Paper
Open access
AKAndreas Katis
Andreas Katis
AGAndrew Gacek
Andrew Gacek
MWMichael W. Whalen
Michael W. Whalen
In previous work, we have introduced a contract-based realizability checking algorithm for assume-guarantee contracts involving infinite theories, such as linear integer/real arithmetic and uninterpreted functions over infinite domains. This algorithm can determine whether or not it is possible to construct a realization (i.e. an implementation) of an assumeguarantee contract. The algorithm is similar to k-induction model checking, but involves the use of quantifiers to determine implementability. While our work on realizability is inherently useful for virtual integration in determining whether it is possible for suppliers to build software that meets a contract, it also provides the foundations to solving the more challenging problem of component synthesis. In this paper, we provide an initial synthesis algorithm for assume-guarantee contracts involving infinite theories. To do so, we take advantage of our realizability checking procedure and a skolemization solver for ∀∃-formulas, called AE-VAL. We show that it is possible to immediately adapt our existing algorithm towards synthesis by using this solver, using a demonstration example. We then discuss challenges towards creating a more robust synthesis algorithm.