The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Feb. 26, 2013
Filed:
Sep. 26, 2008
Dries Vanoverberghe, Redmond, WA (US);
Nikolai Tillmann, Redmond, WA (US);
Jonathan Paul DE Halleux, Seattle, WA (US);
Nikolaj S Bjorner, Woodinville, WA (US);
Wolfram Schulte, Redmond, WA (US);
Dries Vanoverberghe, Redmond, WA (US);
Nikolai Tillmann, Redmond, WA (US);
Jonathan Paul de Halleux, Seattle, WA (US);
Nikolaj S Bjorner, Woodinville, WA (US);
Wolfram Schulte, Redmond, WA (US);
Microsoft Corporation, Redmond, WA (US);
Abstract
An extension of symbolic execution for programs involving contracts with quantifiers over large and potentially unbounded domains is described. Symbolic execution is used to generate, from a program, concrete test cases that exhibit mismatches between the program code and its contracts with quantifiers. Quantifiers are instantiated using symbolic values encountered during a set of exhibited runs. In this setting, quantifier instantiation is limited to values supplied to or produced by a symbolic execution. Quantifier instantiation is controlled by performing a matching algorithm that uses run-time values of input and program variables in order to guide and limit the set of quantifier instantiations. With a sufficient set of instances, test cases are derived that directly witness limitations of the auxiliary assertions.