You searched for subject:(Test input generation).
Showing records 1 – 8 of
8 total matches.
No search limiters apply to these results.
University of Texas – Austin
1.
Dini, Nima.
MKorat : a novel approach for memorizing the Korat search and some potential applications.
Degree: MSin Engineering, Electrical and Computer engineering, 2016, University of Texas – Austin
URL: http://hdl.handle.net/2152/38682 
► Writing logical constraints that describe properties of desired inputs enables an effective approach for systematic software testing, which can find many bugs. The key problem…
(more)
▼ Writing logical constraints that describe properties of desired inputs enables an effective approach for systematic software testing, which can find many bugs. The key problem in systematic constraint-based testing is efficiently exploring very large spaces of all possible inputs to enumerate desired valid inputs. The Korat technique provides an effective solution to this problem. Korat uses desired
input properties written as imperative predicates and implements a backtracking search that prunes large parts of the
input space and enumerates all non-isomorphic inputs within a given bound on
input size. Despite the effectiveness of Korat’s pruning, systematically creating and running large numbers of tests can be costly in practice. Previous work introduced parallel
test generation and execution using Korat to make it more practical. We build on a specific algorithm, SEQ-ON, introduced in previous work for equi-distancing candidate inputs, which allows re-execution of Korat for
input generation using parallel workers with evenly distributed workload. Our key insight is that the Korat search typically encounters many consecutive candidates that are all invalid inputs and such invalid ranges of candidates can be memoized succinctly to optimize re-execution of Korat. We introduce a novel approach for memoizing Korat’s checking of consecutive invalid candidates, embody the approach into three new techniques based on SEQ-ON, evaluate the techniques using a standard suite of data structure subjects to show the efficacy of our approach, and show some potential applications of it in two new application domains for Korat. We believe our work opens a promising new direction to optimize solving of imperative constraints and using them in novel application domains.
Advisors/Committee Members: Khurshid, Sarfraz (advisor), Gligoric, Milos (committee member).
Subjects/Keywords: Software testing; Test input generation
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Dini, N. (2016). MKorat : a novel approach for memorizing the Korat search and some potential applications. (Masters Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/38682
Chicago Manual of Style (16th Edition):
Dini, Nima. “MKorat : a novel approach for memorizing the Korat search and some potential applications.” 2016. Masters Thesis, University of Texas – Austin. Accessed March 06, 2021.
http://hdl.handle.net/2152/38682.
MLA Handbook (7th Edition):
Dini, Nima. “MKorat : a novel approach for memorizing the Korat search and some potential applications.” 2016. Web. 06 Mar 2021.
Vancouver:
Dini N. MKorat : a novel approach for memorizing the Korat search and some potential applications. [Internet] [Masters thesis]. University of Texas – Austin; 2016. [cited 2021 Mar 06].
Available from: http://hdl.handle.net/2152/38682.
Council of Science Editors:
Dini N. MKorat : a novel approach for memorizing the Korat search and some potential applications. [Masters Thesis]. University of Texas – Austin; 2016. Available from: http://hdl.handle.net/2152/38682
University of Illinois – Urbana-Champaign
2.
Cao, Jiayi.
Aiding automated testing generation process by visualizing dynamic symbolic execution.
Degree: MS, Computer Science, 2018, University of Illinois – Urbana-Champaign
URL: http://hdl.handle.net/2142/101243
► Significant progress has been made in the field of automatic test generation, and Dynamic Symbolic Execution (DSE) is among the most effective techniques in this…
(more)
▼ Significant progress has been made in the field of automatic
test generation, and Dynamic Symbolic Execution (DSE) is among the most effective techniques in this field. Despite its success, DSE still suffers from various obstacles when applied on complex programs. Users of DSE-based testing tools often experience three main categories of problems: the object creation problem, external method call problem, and boundary problem. When these problems arise, the testing tools present little information about the problem causes, leaving the users in the dark. Furthermore, there is little visual (i.e., easy to digest) guidance readily available to solve the problems effectively. The lack of guidance is especially troublesome given that the tools do not scale well when the number of problems increases. As a result, the time needed to investigate the root causes of the problems is prohibitive.
To address such issue, in this thesis, we propose a visualization approach named PexViz. Our approach helps the tool users better understand and diagnose the encountered problems by reducing the large search space for problem root causes by aggregating information gathered through DSE exploration. In this thesis, we illustrate the benefits of the visualized information in assisting the tool users and our design decisions for such visualization. We provide a comparison between the proposed approach and two related previous approaches: IntelliTest, an industrial
test generator available in Visual Studio 2015/2017, and an existing state-of-the-art visualization approach, SEViz. Our initial comparison results on example cases demonstrate the benefits of our proposed approach and its superiority over the related approaches.
Advisors/Committee Members: Xie, Tao (advisor).
Subjects/Keywords: Visualization; Dynamic Symbolic Execution; Test Input Generation
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Cao, J. (2018). Aiding automated testing generation process by visualizing dynamic symbolic execution. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/101243
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Cao, Jiayi. “Aiding automated testing generation process by visualizing dynamic symbolic execution.” 2018. Thesis, University of Illinois – Urbana-Champaign. Accessed March 06, 2021.
http://hdl.handle.net/2142/101243.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Cao, Jiayi. “Aiding automated testing generation process by visualizing dynamic symbolic execution.” 2018. Web. 06 Mar 2021.
Vancouver:
Cao J. Aiding automated testing generation process by visualizing dynamic symbolic execution. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2018. [cited 2021 Mar 06].
Available from: http://hdl.handle.net/2142/101243.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Cao J. Aiding automated testing generation process by visualizing dynamic symbolic execution. [Thesis]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/101243
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Illinois – Chicago
3.
Nair, Aswathy.
Automatically Finding Abstractions for Input Space Partitioning for Software Performance Testing.
Degree: 2012, University of Illinois – Chicago
URL: http://hdl.handle.net/10027/8947
► The goal of performance testing is to uncover problems where an application unexpectedly exhibits worsened characteristics for a speci c workload. It is di cult…
(more)
▼ The goal of performance testing is to uncover problems where an application unexpectedly
exhibits worsened characteristics for a speci c workload. It is di cult to construct e ective
performance
test cases that can nd performance problems in a short period of time, since it
requires
test engineers to
test a large number of combinations of actions and data for large-scale
applications. A fundamental question of performance testing is how to nd "key abstractions"
that allow testers to select a manageable subset of the
input data for
test cases without compromising
the e ectiveness of testing.
We o er a novel solution for Abstraction Search for
Input partitioning for Software performance
Testing (ASSIST) for nding key abstractions for
input space partitioning for performance
testing automatically. ASSIST is an adaptive, feedback-directed learning testing system
that starts with a small subset of
test cases to enable testers to steer towards challenging tests
automatically to nd more performance problems in applications in a shorter period of testing
time. We have implemented ASSIST and have applied it to a dummy web application called
JPetstore which has all the functionality found in any e-commerce application.
Advisors/Committee Members: Grechanik, Mark (advisor).
Subjects/Keywords: Automatic Test case generation; Performance Testing; Input space partitioning; software testing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Nair, A. (2012). Automatically Finding Abstractions for Input Space Partitioning for Software Performance Testing. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/8947
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Nair, Aswathy. “Automatically Finding Abstractions for Input Space Partitioning for Software Performance Testing.” 2012. Thesis, University of Illinois – Chicago. Accessed March 06, 2021.
http://hdl.handle.net/10027/8947.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Nair, Aswathy. “Automatically Finding Abstractions for Input Space Partitioning for Software Performance Testing.” 2012. Web. 06 Mar 2021.
Vancouver:
Nair A. Automatically Finding Abstractions for Input Space Partitioning for Software Performance Testing. [Internet] [Thesis]. University of Illinois – Chicago; 2012. [cited 2021 Mar 06].
Available from: http://hdl.handle.net/10027/8947.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Nair A. Automatically Finding Abstractions for Input Space Partitioning for Software Performance Testing. [Thesis]. University of Illinois – Chicago; 2012. Available from: http://hdl.handle.net/10027/8947
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
4.
Srinivasan, Raghavendra.
Improving constraint-based test input generation using Korat.
Degree: MSin Engineering, Electrical and Computer Engineering, 2015, University of Texas – Austin
URL: http://hdl.handle.net/2152/30200
► Korat is an existing technique for test input generation using imperative constraints that describe properties of desired inputs written as Java predicates, termed RepOk methods,…
(more)
▼ Korat is an existing technique for
test input generation using imperative constraints that describe properties of desired inputs written as Java predicates, termed RepOk methods, which are executable checks for those properties. Korat efficiently prunes the space of candidate inputs for the RepOk method by executing it on candidate inputs and monitoring the object fields that RepOk accesses in deciding if the properties are satisfied. While Korat generates inputs effectively, its correctness and efficiency rely on two assumptions about the RepOk methods. For correctness, Korat assumes the RepOk methods do not use the Java reflection API for field accesses; the use of reflection renders Korat unable to enumerate all desired inputs. For efficiency, Korat assumes the RepOk methods do not make unnecessary field accesses, which can reduce the effectiveness of Korat’s pruning. Our thesis addresses both these limitations. To support reflection, we build on the core Korat to enhance it such that it can monitor field accesses based on reflection. To assist the users with writing RepOk’s, we introduce a static analysis tool that detects potential places where the
input RepOk may be edited to enhance performance of Korat. We
also present experimental results using a suite of standard data structure subjects.
Advisors/Committee Members: Khurshid, Sarfraz (advisor).
Subjects/Keywords: Constraint solving; Korat; Test input generation; Automatic testing
…solving [4, 9, 10, 11, 15, 16, 18, 20].
The focus of our work is test input generation… …constraint-based test input generation is to represent the
property of the desired test inputs as a… …method that uses
this re-usable check as a helper method can provide test input generation… …constraint such that the solution to the con-
2
straint represents a test input. While there are… …several previous approaches for
constraint-based input generation, most address program with…
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Srinivasan, R. (2015). Improving constraint-based test input generation using Korat. (Masters Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/30200
Chicago Manual of Style (16th Edition):
Srinivasan, Raghavendra. “Improving constraint-based test input generation using Korat.” 2015. Masters Thesis, University of Texas – Austin. Accessed March 06, 2021.
http://hdl.handle.net/2152/30200.
MLA Handbook (7th Edition):
Srinivasan, Raghavendra. “Improving constraint-based test input generation using Korat.” 2015. Web. 06 Mar 2021.
Vancouver:
Srinivasan R. Improving constraint-based test input generation using Korat. [Internet] [Masters thesis]. University of Texas – Austin; 2015. [cited 2021 Mar 06].
Available from: http://hdl.handle.net/2152/30200.
Council of Science Editors:
Srinivasan R. Improving constraint-based test input generation using Korat. [Masters Thesis]. University of Texas – Austin; 2015. Available from: http://hdl.handle.net/2152/30200
University of Texas – Austin
5.
Chang, Walter Chochen.
Improving dynamic analysis with data flow analysis.
Degree: PhD, Computer Sciences, 2010, University of Texas – Austin
URL: http://hdl.handle.net/2152/ETD-UT-2010-08-1586
► Many challenges in software quality can be tackled with dynamic analysis. However, these techniques are often limited in their efficiency or scalability as they are…
(more)
▼ Many challenges in software quality can be tackled with dynamic analysis. However, these techniques are often limited in their efficiency or scalability as they are often applied uniformly to an entire program. In this thesis, we show that dynamic program analysis can be made significantly more efficient and scalable by first performing a static data flow analysis so that the dynamic analysis can be selectively applied only to important parts of the program. We apply this general principle to the design and implementation of two different systems, one for runtime security policy enforcement and the other for software
test input generation.
For runtime security policy enforcement, we enforce user-defined policies using a dynamic data flow analysis that is more general and flexible than previous systems. Our system uses the user-defined policy to drive a static data flow analysis that identifies and instruments only the statements that may be involved in a security vulnerability, often eliminating the need to track most objects and greatly reducing the overhead. For taint analysis on a set of five
server programs, the slowdown is only 0.65%, two orders of magnitude lower than previous taint tracking systems. Our system also has negligible overhead on file disclosure vulnerabilities, a problem that taint tracking cannot handle.
For software
test case
generation, we introduce the idea of targeted testing, which focuses testing effort on select parts of the program instead of treating all program paths equally. Our “Bullseye” system uses a static analysis performed with respect to user-defined “interesting points” to steer the search down certain paths, thereby finding bugs faster. We also introduce a compiler transformation that allows symbolic execution to automatically perform boundary condition testing, revealing bugs that could be missed even if the correct path is tested. For our set of 9 benchmarks, Bullseye finds bugs an average of 2.5× faster than a conventional depth-first search and finds numerous bugs that DFS could not. In addition, our automated boundary condition testing transformation allows both Bullseye and depth-first search to find numerous bugs that they could not find before, even when all paths were explored.
Advisors/Committee Members: Lin, Yun Calvin (advisor), McKinley, Kathryn (committee member), Browne, James C. (committee member), Khurshid, Sarfraz (committee member), Myers, Andrew (committee member).
Subjects/Keywords: Data flow; Software testing; Software security; Dynamic analysis; Static analysis; Test input generation
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Chang, W. C. (2010). Improving dynamic analysis with data flow analysis. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2010-08-1586
Chicago Manual of Style (16th Edition):
Chang, Walter Chochen. “Improving dynamic analysis with data flow analysis.” 2010. Doctoral Dissertation, University of Texas – Austin. Accessed March 06, 2021.
http://hdl.handle.net/2152/ETD-UT-2010-08-1586.
MLA Handbook (7th Edition):
Chang, Walter Chochen. “Improving dynamic analysis with data flow analysis.” 2010. Web. 06 Mar 2021.
Vancouver:
Chang WC. Improving dynamic analysis with data flow analysis. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2010. [cited 2021 Mar 06].
Available from: http://hdl.handle.net/2152/ETD-UT-2010-08-1586.
Council of Science Editors:
Chang WC. Improving dynamic analysis with data flow analysis. [Doctoral Dissertation]. University of Texas – Austin; 2010. Available from: http://hdl.handle.net/2152/ETD-UT-2010-08-1586
6.
Nguyen, Ngo Minh Thang.
Test case generation for Symbolic Distributed System Models : Application to Trickle based IoT Protocol : Génération de cas de test pour les modèles symboliques de système distribués : Application au protocole IoT à base de Trickle.
Degree: Docteur es, Informatique, 2019, Université Paris-Saclay (ComUE)
URL: http://www.theses.fr/2019SACLC092
► Les systèmes distribués sont composés de nombreux sous-systèmes distants les uns des autres. Afin de réaliser une même tâche, les sous-systèmes communiquent à la fois…
(more)
▼ Les systèmes distribués sont composés de nombreux sous-systèmes distants les uns des autres. Afin de réaliser une même tâche, les sous-systèmes communiquent à la fois avec l’environnement par des messages externes et avec d’autres sous-systèmes par des messages internes, via un réseau de communication. En pratique, les systèmes distribués mettent en jeu plusieurs types d’erreurs, propres aux sous-systèmes les constituant, ou en lien avec les communications internes. Afin de s’assurer de leur bon fonctionnement, savoir tester de tels systèmes est essentiel. Cependant, il est très compliqué de les tester car sans horloge globale, les sous-systèmes ne peuvent pas facilement synchroniser leurs envois de messages, ce qui explique l’existence des situations non déterministes. Le test à base de modèles (MBT) est une approche qui consiste à vérifier si le comportement d’un système sous test (SUT) est conforme à son modèle, qui spécifie les comportements souhaités. MBT comprend deux étapes principales: la génération de cas de test et le calcul de verdict. Dans cette thèse, nous nous intéressons à la génération de cas de test dans les systèmes distribués. Nous utilisons les systèmes de transition symbolique temporisé à entrées et sorties (TIOSTS) et les analysons à l’aide des techniques d’exécution symbolique pour obtenir les comportements symboliques du système distribué. Dans notre approche, l’architecture de test permet d’observer au niveau de chaque soussystème à la fois les messages externes émis vers l’environnement et les messages internes reçus et envoyés. Notre framework de test comprend plusieurs étapes: sélectionner un objectif de test global, défini comme un comportement particulier exhibé par exécution symbolique, projeter l’objectif de test global sur chaque sous-système pour obtenir des objectifs de test locaux, dériver des cas de test unitaires pour chacun des sous-systèmes. L’exécution du test consiste à exécuter des cas de test locaux sur les sous-systèmes paramétrés par les objectifs de tests en calculant à la volée les données de test à soumettre au sous-système en fonction de données observées. Enfin, nous mettons en œuvre notre approche sur un cas d’étude décrivant un protocole utilisé dans le contexte de l’IoT.
Distributed systems are composed of many distant subsystems. In order to achieve a common task, subsystems communicate both with the local environment by external messages and with other subsystems by internal messages through a communication network. In practice, distributed systems are likely to reveal many kinds of errors, so that we need to test them before reaching a certain level of confidence in them. However, testing distributed systems is complicated due to their intrinsic characteristics. Without global clocks, subsystems cannot synchronize messages, leading to non-deterministic situations.Model-Based Testing (MBT) aims at checking whether the behavior of a system under test (SUT) is consistent with its model, specifying expected behaviors. MBT is useful for two main steps: test case…
Advisors/Committee Members: Le Gall, Pascale (thesis director).
Subjects/Keywords: Systèmes distribués; Test à base de modèles; Systèmes de Transition Symbolique Temporisé avec des Entrées et Sorties; Génération de cas de test; Critères de couverture; Protocole MPL; Distributed systems; Model-Based Testing; Timed Input Output Symbolic Transition Systems; Test case generation; Coverage criteria; MPL protocol
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Nguyen, N. M. T. (2019). Test case generation for Symbolic Distributed System Models : Application to Trickle based IoT Protocol : Génération de cas de test pour les modèles symboliques de système distribués : Application au protocole IoT à base de Trickle. (Doctoral Dissertation). Université Paris-Saclay (ComUE). Retrieved from http://www.theses.fr/2019SACLC092
Chicago Manual of Style (16th Edition):
Nguyen, Ngo Minh Thang. “Test case generation for Symbolic Distributed System Models : Application to Trickle based IoT Protocol : Génération de cas de test pour les modèles symboliques de système distribués : Application au protocole IoT à base de Trickle.” 2019. Doctoral Dissertation, Université Paris-Saclay (ComUE). Accessed March 06, 2021.
http://www.theses.fr/2019SACLC092.
MLA Handbook (7th Edition):
Nguyen, Ngo Minh Thang. “Test case generation for Symbolic Distributed System Models : Application to Trickle based IoT Protocol : Génération de cas de test pour les modèles symboliques de système distribués : Application au protocole IoT à base de Trickle.” 2019. Web. 06 Mar 2021.
Vancouver:
Nguyen NMT. Test case generation for Symbolic Distributed System Models : Application to Trickle based IoT Protocol : Génération de cas de test pour les modèles symboliques de système distribués : Application au protocole IoT à base de Trickle. [Internet] [Doctoral dissertation]. Université Paris-Saclay (ComUE); 2019. [cited 2021 Mar 06].
Available from: http://www.theses.fr/2019SACLC092.
Council of Science Editors:
Nguyen NMT. Test case generation for Symbolic Distributed System Models : Application to Trickle based IoT Protocol : Génération de cas de test pour les modèles symboliques de système distribués : Application au protocole IoT à base de Trickle. [Doctoral Dissertation]. Université Paris-Saclay (ComUE); 2019. Available from: http://www.theses.fr/2019SACLC092
7.
Siddiqui, Junaid Haroon.
Improving systematic constraint-driven analysis using incremental and parallel techniques.
Degree: PhD, Electrical and Computer Engineering, 2012, University of Texas – Austin
URL: http://hdl.handle.net/2152/19568
► This dissertation introduces Pikse, a novel methodology for more effective and efficient checking of code conformance to specifications using parallel and incremental techniques, describes a…
(more)
▼ This dissertation introduces Pikse, a novel methodology for more effective and efficient checking of code conformance to specifications using parallel and incremental techniques, describes a prototype implementation that embodies the methodology, and presents experiments that demonstrate its efficacy. Pikse has at its foundation a well-studied approach – systematic constraint-driven analysis – that has two common forms: (1) constraint-based testing – where logical constraints that define desired inputs and expected program behavior are used for
test input generation and correctness checking, say to perform black-box testing; and (2) symbolic execution – where a systematic exploration of (bounded) program paths using symbolic
input values is used to check properties of program behavior, say to perform white-box testing.
Our insight at the heart of Pikse is that for certain path-based analyses, (1) the state of a run of the analysis can be encoded compactly, which provides a basis for parallel techniques that have low communication overhead; and (2) iterations performed by the analysis have commonalities, which provides the basis for incremental techniques that re-use results of computations common to successive iterations.
We embody our insight into a suite of parallel and incremental techniques that enable more effective and efficient constraint-driven analysis. Moreover, our techniques work in tandem, for example, for combined black-box constraint-based
input generation with white-box symbolic execution. We present a series of experiments to evaluate our techniques. Experimental results show Pikse enables significant speedups over previous state-of-the-art.
Advisors/Committee Members: Perry, Dewayne E. (advisor), Khurshid, Sarfraz (committee member), Aziz, Adnan (committee member), Marinov, Darko (committee member), Chiou, Derek (committee member).
Subjects/Keywords: Software engineering; Software testing and verification; test input generation; Symbolic execution; Incremental test generation algorithms; Parallel test generation; Constraint-driven analysis; Constraint-based testing
…tandem, for example, for combined black-box constraint-based
input generation with white-box… …3.1.1 Illustrative Example . . . . . . . . . .
3.1.2 Test input as analysis state… …code, e.g,
statements and branches, are leveraged, e.g., to direct input generation to… …symbolic execution is input
generation for (bounded) path coverage in white-box testing… …that an input constraint can be solved partially to build abstract test suites that can be…
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Siddiqui, J. H. (2012). Improving systematic constraint-driven analysis using incremental and parallel techniques. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/19568
Chicago Manual of Style (16th Edition):
Siddiqui, Junaid Haroon. “Improving systematic constraint-driven analysis using incremental and parallel techniques.” 2012. Doctoral Dissertation, University of Texas – Austin. Accessed March 06, 2021.
http://hdl.handle.net/2152/19568.
MLA Handbook (7th Edition):
Siddiqui, Junaid Haroon. “Improving systematic constraint-driven analysis using incremental and parallel techniques.” 2012. Web. 06 Mar 2021.
Vancouver:
Siddiqui JH. Improving systematic constraint-driven analysis using incremental and parallel techniques. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2012. [cited 2021 Mar 06].
Available from: http://hdl.handle.net/2152/19568.
Council of Science Editors:
Siddiqui JH. Improving systematic constraint-driven analysis using incremental and parallel techniques. [Doctoral Dissertation]. University of Texas – Austin; 2012. Available from: http://hdl.handle.net/2152/19568
8.
Nokhbeh Zaeem, Razieh.
Contract-driven data structure repair : a novel approach for error recovery.
Degree: PhD, Electrical and Computer Engineering, 2014, University of Texas – Austin
URL: http://hdl.handle.net/2152/24967
► Software systems are now pervasive throughout our world. The reliability of these systems is an urgent necessity. A large degree of research effort on increasing…
(more)
▼ Software systems are now pervasive throughout our world. The reliability of these systems is an urgent necessity. A large degree of research effort on increasing software reliability is dedicated to requirements, architecture, design, implementation and testing – activities that are performed before system deployment. While such approaches have become substantially more advanced, software remains buggy and failures remain expensive. We take a radically different approach to reliability from previous approaches, namely contract-driven data structure repair for runtime error recovery, where erroneous executions of deployed software are corrected on-the-fly using rich behavioral contracts. Our key insight is to transform the software contract – which gives a high level description of the expected behavior – to an efficient implementation which repairs the erroneous data structures in the program state upon an error. To improve efficiency, scalability, and effectiveness of repair, in addition to rich behavioral contracts, we leverage the current erroneous state, dynamic behavior of the program, as well as repair history and abstraction. A core technical problem our approach to repair addresses is construction of structurally complex data that satisfy desired properties. We present a novel structure
generation technique based on dynamic programming – a classic optimization approach – to utilize the recursive nature of the structures. We use our technique for constraint-based testing. It provides better scalability than previous work. We applied it to
test widely-used web browsers and found some known and unknown bugs. Our use of dynamic programming in structure
generation opens a new future direction to tackle the scalability problem of data structure repair. This research advances our ability to develop correct programs. For programs that already have contracts, error recovery using our approach can come at a low cost. The same contracts can be used for systematically testing code before deployment using existing as well as our new techniques. Thus, we enable a novel unification of software verification and error recovery.
Advisors/Committee Members: Khurshid, Sarfraz (advisor).
Subjects/Keywords: Data structure; Repair; Error recovery; Repair history; Repair abstraction; Alloy; Dynamic programming; Test input generation; Contracts
…Problem in Testing and Repair . . . . .
1.4.1 Test Input Generation Using Dynamic Programming… …2.2 Test Input Generation . . . . . . . . . . . . . . . . . . . . . .
18
18
22
ix
1
2
5
7… …Example . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
85
Test Input Generation… …Generation Algorithm . . . . . . . . . 100
Evaluation: Test Input Generation Using Dynamic… …Safari test input generation results. . . . . . . . .
121
xiv
List of Figures
1.1…
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Nokhbeh Zaeem, R. (2014). Contract-driven data structure repair : a novel approach for error recovery. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/24967
Chicago Manual of Style (16th Edition):
Nokhbeh Zaeem, Razieh. “Contract-driven data structure repair : a novel approach for error recovery.” 2014. Doctoral Dissertation, University of Texas – Austin. Accessed March 06, 2021.
http://hdl.handle.net/2152/24967.
MLA Handbook (7th Edition):
Nokhbeh Zaeem, Razieh. “Contract-driven data structure repair : a novel approach for error recovery.” 2014. Web. 06 Mar 2021.
Vancouver:
Nokhbeh Zaeem R. Contract-driven data structure repair : a novel approach for error recovery. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2014. [cited 2021 Mar 06].
Available from: http://hdl.handle.net/2152/24967.
Council of Science Editors:
Nokhbeh Zaeem R. Contract-driven data structure repair : a novel approach for error recovery. [Doctoral Dissertation]. University of Texas – Austin; 2014. Available from: http://hdl.handle.net/2152/24967
. 
Open Access Theses and Dissertations
