Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Symbolic Execution). Showing records 1 – 30 of 97 total matches.

[1] [2] [3] [4]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Country

▼ Search Limiters


Università della Svizzera italiana

1. Tsitovich, Aliaksei. Scalable abstractions for efficient security checks.

Degree: 2011, Università della Svizzera italiana

 Following the industrial demand to address the problem of software correctness, the computer science research community puts a lot of efforts into development of scalable… (more)

Subjects/Keywords: Symbolic execution

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Tsitovich, A. (2011). Scalable abstractions for efficient security checks. (Thesis). Università della Svizzera italiana. Retrieved from http://doc.rero.ch/record/25000

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):

Tsitovich, Aliaksei. “Scalable abstractions for efficient security checks.” 2011. Thesis, Università della Svizzera italiana. Accessed April 16, 2021. http://doc.rero.ch/record/25000.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Tsitovich, Aliaksei. “Scalable abstractions for efficient security checks.” 2011. Web. 16 Apr 2021.

Vancouver:

Tsitovich A. Scalable abstractions for efficient security checks. [Internet] [Thesis]. Università della Svizzera italiana; 2011. [cited 2021 Apr 16]. Available from: http://doc.rero.ch/record/25000.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tsitovich A. Scalable abstractions for efficient security checks. [Thesis]. Università della Svizzera italiana; 2011. Available from: http://doc.rero.ch/record/25000

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Texas – Austin

2. Qiu, Rui, active 21st century. Scaling and certifying symbolic execution.

Degree: PhD, Electrical and Computer engineering, 2016, University of Texas – Austin

Symbolic execution is a powerful, systematic program analysis approach that has received much visibility in the last decade. The key idea in symbolic execution is… (more)

Subjects/Keywords: Symbolic execution; Composition; Certification; Distribution; Symbolic PathFinder

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Qiu, Rui, a. 2. c. (2016). Scaling and certifying symbolic execution. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/46495

Chicago Manual of Style (16th Edition):

Qiu, Rui, active 21st century. “Scaling and certifying symbolic execution.” 2016. Doctoral Dissertation, University of Texas – Austin. Accessed April 16, 2021. http://hdl.handle.net/2152/46495.

MLA Handbook (7th Edition):

Qiu, Rui, active 21st century. “Scaling and certifying symbolic execution.” 2016. Web. 16 Apr 2021.

Vancouver:

Qiu, Rui a2c. Scaling and certifying symbolic execution. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2016. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/2152/46495.

Council of Science Editors:

Qiu, Rui a2c. Scaling and certifying symbolic execution. [Doctoral Dissertation]. University of Texas – Austin; 2016. Available from: http://hdl.handle.net/2152/46495


Georgia Tech

3. Hill, Brennan. Malware capability reverse engineering via coordination with symbolic analysis.

Degree: MS, Electrical and Computer Engineering, 2018, Georgia Tech

 A key feature of cyber attack investigations is to quickly understand the capabilities and payloads of malware so proper countermeasures can be adopted. Unfortunately, due… (more)

Subjects/Keywords: Malware analysis; Symbolic execution; Memory forensics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hill, B. (2018). Malware capability reverse engineering via coordination with symbolic analysis. (Masters Thesis). Georgia Tech. Retrieved from http://hdl.handle.net/1853/62254

Chicago Manual of Style (16th Edition):

Hill, Brennan. “Malware capability reverse engineering via coordination with symbolic analysis.” 2018. Masters Thesis, Georgia Tech. Accessed April 16, 2021. http://hdl.handle.net/1853/62254.

MLA Handbook (7th Edition):

Hill, Brennan. “Malware capability reverse engineering via coordination with symbolic analysis.” 2018. Web. 16 Apr 2021.

Vancouver:

Hill B. Malware capability reverse engineering via coordination with symbolic analysis. [Internet] [Masters thesis]. Georgia Tech; 2018. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/1853/62254.

Council of Science Editors:

Hill B. Malware capability reverse engineering via coordination with symbolic analysis. [Masters Thesis]. Georgia Tech; 2018. Available from: http://hdl.handle.net/1853/62254


University of Illinois – Urbana-Champaign

4. Cao, Jiayi. Aiding automated testing generation process by visualizing dynamic symbolic execution.

Degree: MS, Computer Science, 2018, University of Illinois – Urbana-Champaign

 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)

Subjects/Keywords: Visualization; Dynamic Symbolic Execution; Test Input Generation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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 April 16, 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. 16 Apr 2021.

Vancouver:

Cao J. Aiding automated testing generation process by visualizing dynamic symbolic execution. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2018. [cited 2021 Apr 16]. 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


Penn State University

5. Kilmer, Eric David. Extending Vulnerability Discovery with Fuzzing and Symbolic Execution to Realistic Applications.

Degree: 2017, Penn State University

 In 2016, DARPA held the Cyber Grand Challenge (CGC) using a special execution and evaluation environment to compare the results of different techniques in automated… (more)

Subjects/Keywords: Symbolic Execution; Vulnerability Discovery; Program Analysis; Fuzzing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kilmer, E. D. (2017). Extending Vulnerability Discovery with Fuzzing and Symbolic Execution to Realistic Applications. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/14016eyk5120

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):

Kilmer, Eric David. “Extending Vulnerability Discovery with Fuzzing and Symbolic Execution to Realistic Applications.” 2017. Thesis, Penn State University. Accessed April 16, 2021. https://submit-etda.libraries.psu.edu/catalog/14016eyk5120.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Kilmer, Eric David. “Extending Vulnerability Discovery with Fuzzing and Symbolic Execution to Realistic Applications.” 2017. Web. 16 Apr 2021.

Vancouver:

Kilmer ED. Extending Vulnerability Discovery with Fuzzing and Symbolic Execution to Realistic Applications. [Internet] [Thesis]. Penn State University; 2017. [cited 2021 Apr 16]. Available from: https://submit-etda.libraries.psu.edu/catalog/14016eyk5120.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kilmer ED. Extending Vulnerability Discovery with Fuzzing and Symbolic Execution to Realistic Applications. [Thesis]. Penn State University; 2017. Available from: https://submit-etda.libraries.psu.edu/catalog/14016eyk5120

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Melbourne

6. Lin, Yude. Symbolic execution with over-approximation.

Degree: 2017, University of Melbourne

 Program verification is difficult but crucial in establishing software's reliability and security. As the software industry grows rapidly, traditional verification methods, such as code reviewing,… (more)

Subjects/Keywords: symbolic execution; test generation; program verification

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lin, Y. (2017). Symbolic execution with over-approximation. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/197985

Chicago Manual of Style (16th Edition):

Lin, Yude. “Symbolic execution with over-approximation.” 2017. Doctoral Dissertation, University of Melbourne. Accessed April 16, 2021. http://hdl.handle.net/11343/197985.

MLA Handbook (7th Edition):

Lin, Yude. “Symbolic execution with over-approximation.” 2017. Web. 16 Apr 2021.

Vancouver:

Lin Y. Symbolic execution with over-approximation. [Internet] [Doctoral dissertation]. University of Melbourne; 2017. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/11343/197985.

Council of Science Editors:

Lin Y. Symbolic execution with over-approximation. [Doctoral Dissertation]. University of Melbourne; 2017. Available from: http://hdl.handle.net/11343/197985


Virginia Tech

7. Murali, Dilip Venkateswaran. Verification of Cyber Physical Systems.

Degree: MS, Computer Engineering, 2013, Virginia Tech

 Due to the increasing complexity of today\'s cyber-physical systems, defects become inevitable and harder to detect. The complexity of such software is generally huge, with… (more)

Subjects/Keywords: Invariants detection; Symbolic Execution; KLEE; Cloud9; VCC

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Murali, D. V. (2013). Verification of Cyber Physical Systems. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/23824

Chicago Manual of Style (16th Edition):

Murali, Dilip Venkateswaran. “Verification of Cyber Physical Systems.” 2013. Masters Thesis, Virginia Tech. Accessed April 16, 2021. http://hdl.handle.net/10919/23824.

MLA Handbook (7th Edition):

Murali, Dilip Venkateswaran. “Verification of Cyber Physical Systems.” 2013. Web. 16 Apr 2021.

Vancouver:

Murali DV. Verification of Cyber Physical Systems. [Internet] [Masters thesis]. Virginia Tech; 2013. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/10919/23824.

Council of Science Editors:

Murali DV. Verification of Cyber Physical Systems. [Masters Thesis]. Virginia Tech; 2013. Available from: http://hdl.handle.net/10919/23824


Texas State University – San Marcos

8. Wen, Junye. Parallelizing Path Exploration and Optimizing Constraint Solving for Efficient Symbolic Execution.

Degree: PhD, Computer Science, 2020, Texas State University – San Marcos

Symbolic execution executes programs with symbolic inputs and systematically analyzes program behaviors by exploring all feasible paths. For each path it explores, it builds a… (more)

Subjects/Keywords: Symbolic execution; Parallel processing; Deep learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wen, J. (2020). Parallelizing Path Exploration and Optimizing Constraint Solving for Efficient Symbolic Execution. (Doctoral Dissertation). Texas State University – San Marcos. Retrieved from https://digital.library.txstate.edu/handle/10877/12836

Chicago Manual of Style (16th Edition):

Wen, Junye. “Parallelizing Path Exploration and Optimizing Constraint Solving for Efficient Symbolic Execution.” 2020. Doctoral Dissertation, Texas State University – San Marcos. Accessed April 16, 2021. https://digital.library.txstate.edu/handle/10877/12836.

MLA Handbook (7th Edition):

Wen, Junye. “Parallelizing Path Exploration and Optimizing Constraint Solving for Efficient Symbolic Execution.” 2020. Web. 16 Apr 2021.

Vancouver:

Wen J. Parallelizing Path Exploration and Optimizing Constraint Solving for Efficient Symbolic Execution. [Internet] [Doctoral dissertation]. Texas State University – San Marcos; 2020. [cited 2021 Apr 16]. Available from: https://digital.library.txstate.edu/handle/10877/12836.

Council of Science Editors:

Wen J. Parallelizing Path Exploration and Optimizing Constraint Solving for Efficient Symbolic Execution. [Doctoral Dissertation]. Texas State University – San Marcos; 2020. Available from: https://digital.library.txstate.edu/handle/10877/12836

9. Rönn, Mattias. Symvex : A Symbolic Execution System for Machine Code.

Degree: Database and information techniques, 2016, Linköping University

  This thesis is a part of an ongoing research project at Link ̈oping University. The goal of the thesis work is to design and… (more)

Subjects/Keywords: symbolic execution; concolic execution; testing

…Program . . . . . . 4.7.3 Making Symbolic Execution 4.7.4 Conclusion . . . . . . . . . 5 Design… …5.4 Symbolic Execution of the Trace 5.4.1 Memory Model . . . . . . 5.4.2 Approximations… …project is to develop a prototype symbolic execution system for use in future research efforts… …path in that program. This is a high level description of what is called symbolic execution… …Being able to use symbolic execution 2 3 1 INTRODUCTION on all types of software, both… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Rönn, M. (2016). Symvex : A Symbolic Execution System for Machine Code. (Thesis). Linköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-124181

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):

Rönn, Mattias. “Symvex : A Symbolic Execution System for Machine Code.” 2016. Thesis, Linköping University. Accessed April 16, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-124181.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Rönn, Mattias. “Symvex : A Symbolic Execution System for Machine Code.” 2016. Web. 16 Apr 2021.

Vancouver:

Rönn M. Symvex : A Symbolic Execution System for Machine Code. [Internet] [Thesis]. Linköping University; 2016. [cited 2021 Apr 16]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-124181.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rönn M. Symvex : A Symbolic Execution System for Machine Code. [Thesis]. Linköping University; 2016. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-124181

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Georgia Tech

10. Kilger, Fabian. Extracting ICS models from malware via concolic analysis.

Degree: MS, Computer Science, 2020, Georgia Tech

 While there has been significant progress in automated malware analysis, the focus of prior work has been mostly on programs written in C/C++. Advanced malware… (more)

Subjects/Keywords: Malware; Symbolic execution; Concolic execution; Dynamic binary insrumentation; Industrial control system; Triton; Trisis; Search strategy

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kilger, F. (2020). Extracting ICS models from malware via concolic analysis. (Masters Thesis). Georgia Tech. Retrieved from http://hdl.handle.net/1853/63696

Chicago Manual of Style (16th Edition):

Kilger, Fabian. “Extracting ICS models from malware via concolic analysis.” 2020. Masters Thesis, Georgia Tech. Accessed April 16, 2021. http://hdl.handle.net/1853/63696.

MLA Handbook (7th Edition):

Kilger, Fabian. “Extracting ICS models from malware via concolic analysis.” 2020. Web. 16 Apr 2021.

Vancouver:

Kilger F. Extracting ICS models from malware via concolic analysis. [Internet] [Masters thesis]. Georgia Tech; 2020. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/1853/63696.

Council of Science Editors:

Kilger F. Extracting ICS models from malware via concolic analysis. [Masters Thesis]. Georgia Tech; 2020. Available from: http://hdl.handle.net/1853/63696


NSYSU

11. Lai, Yan-shun. Effectiveness comparison between Concolic and Random Testing.

Degree: Master, Information Management, 2011, NSYSU

 The development of software today, the company has their own test system usually. Because there has a few bugs in the every software. And it… (more)

Subjects/Keywords: Symbolic Execution; path constraints; Automatic Testing; Concolic Testing; Random Testing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lai, Y. (2011). Effectiveness comparison between Concolic and Random Testing. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-1031111-020007

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):

Lai, Yan-shun. “Effectiveness comparison between Concolic and Random Testing.” 2011. Thesis, NSYSU. Accessed April 16, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-1031111-020007.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lai, Yan-shun. “Effectiveness comparison between Concolic and Random Testing.” 2011. Web. 16 Apr 2021.

Vancouver:

Lai Y. Effectiveness comparison between Concolic and Random Testing. [Internet] [Thesis]. NSYSU; 2011. [cited 2021 Apr 16]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-1031111-020007.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lai Y. Effectiveness comparison between Concolic and Random Testing. [Thesis]. NSYSU; 2011. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-1031111-020007

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Penn State University

12. Guo, Pinyao. Design, Implementation and Evaluation of a Symbolic N-variant Simulator.

Degree: 2016, Penn State University

 Artificial diversity is an approach aims to increase the cost for attackers to compromise software systems by randomizing implementation properties of software. However, its protection… (more)

Subjects/Keywords: Symbolic Execution; Intrusion Detection System; N-Variant System; Artificial Diversity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Guo, P. (2016). Design, Implementation and Evaluation of a Symbolic N-variant Simulator. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/26225

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):

Guo, Pinyao. “Design, Implementation and Evaluation of a Symbolic N-variant Simulator.” 2016. Thesis, Penn State University. Accessed April 16, 2021. https://submit-etda.libraries.psu.edu/catalog/26225.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Guo, Pinyao. “Design, Implementation and Evaluation of a Symbolic N-variant Simulator.” 2016. Web. 16 Apr 2021.

Vancouver:

Guo P. Design, Implementation and Evaluation of a Symbolic N-variant Simulator. [Internet] [Thesis]. Penn State University; 2016. [cited 2021 Apr 16]. Available from: https://submit-etda.libraries.psu.edu/catalog/26225.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Guo P. Design, Implementation and Evaluation of a Symbolic N-variant Simulator. [Thesis]. Penn State University; 2016. Available from: https://submit-etda.libraries.psu.edu/catalog/26225

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Univerzitet u Beogradu

13. Vujošević Janičić, Milena M., 1980-. Аутоматско генерисање и проверавање услова исправности програма.

Degree: Matematički fakultet, 2015, Univerzitet u Beogradu

Računarstvo - Verifikacija softvera / Computer Science - Software Verification Datum odbrane: 17.12.2013.

LAV je систем за аутоматско генерисање и проверавање услова исправности програма ...

Advisors/Committee Members: Tošić, Dušan, 1949-.

Subjects/Keywords: software verification; automated bug finding; symbolic execution; bounded model checking

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Vujošević Janičić, Milena M., 1. (2015). Аутоматско генерисање и проверавање услова исправности програма. (Thesis). Univerzitet u Beogradu. Retrieved from https://fedorabg.bg.ac.rs/fedora/get/o:7433/bdef:Content/get

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):

Vujošević Janičić, Milena M., 1980-. “Аутоматско генерисање и проверавање услова исправности програма.” 2015. Thesis, Univerzitet u Beogradu. Accessed April 16, 2021. https://fedorabg.bg.ac.rs/fedora/get/o:7433/bdef:Content/get.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Vujošević Janičić, Milena M., 1980-. “Аутоматско генерисање и проверавање услова исправности програма.” 2015. Web. 16 Apr 2021.

Vancouver:

Vujošević Janičić, Milena M. 1. Аутоматско генерисање и проверавање услова исправности програма. [Internet] [Thesis]. Univerzitet u Beogradu; 2015. [cited 2021 Apr 16]. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:7433/bdef:Content/get.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Vujošević Janičić, Milena M. 1. Аутоматско генерисање и проверавање услова исправности програма. [Thesis]. Univerzitet u Beogradu; 2015. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:7433/bdef:Content/get

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

14. Bang, Lucas Adam. Software Side-Channel Analysis.

Degree: 2018, University of California – eScholarship, University of California

 Software side-channel attacks are able to recover confidential information by observing non-functional computation characteristics of program execution such as elapsed time, amount of allocated memory,… (more)

Subjects/Keywords: Computer science; Side Channel; Software Security; Symbolic Execution

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bang, L. A. (2018). Software Side-Channel Analysis. (Thesis). University of California – eScholarship, University of California. Retrieved from http://www.escholarship.org/uc/item/6fw2n189

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):

Bang, Lucas Adam. “Software Side-Channel Analysis.” 2018. Thesis, University of California – eScholarship, University of California. Accessed April 16, 2021. http://www.escholarship.org/uc/item/6fw2n189.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Bang, Lucas Adam. “Software Side-Channel Analysis.” 2018. Web. 16 Apr 2021.

Vancouver:

Bang LA. Software Side-Channel Analysis. [Internet] [Thesis]. University of California – eScholarship, University of California; 2018. [cited 2021 Apr 16]. Available from: http://www.escholarship.org/uc/item/6fw2n189.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bang LA. Software Side-Channel Analysis. [Thesis]. University of California – eScholarship, University of California; 2018. Available from: http://www.escholarship.org/uc/item/6fw2n189

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Indiana University

15. Bonnaire-Sergeant, Ambrose. Typed Clojure in Theory and Practice .

Degree: 2019, Indiana University

 Typed Clojure is an optional type system for the Clojure programming language that aims to type check idiomatic Clojure code. This dissertation presents the design… (more)

Subjects/Keywords: Automatic annotations; Clojure; Optional type systems; Symbolic execution

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bonnaire-Sergeant, A. (2019). Typed Clojure in Theory and Practice . (Thesis). Indiana University. Retrieved from http://hdl.handle.net/2022/23207

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):

Bonnaire-Sergeant, Ambrose. “Typed Clojure in Theory and Practice .” 2019. Thesis, Indiana University. Accessed April 16, 2021. http://hdl.handle.net/2022/23207.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Bonnaire-Sergeant, Ambrose. “Typed Clojure in Theory and Practice .” 2019. Web. 16 Apr 2021.

Vancouver:

Bonnaire-Sergeant A. Typed Clojure in Theory and Practice . [Internet] [Thesis]. Indiana University; 2019. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/2022/23207.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bonnaire-Sergeant A. Typed Clojure in Theory and Practice . [Thesis]. Indiana University; 2019. Available from: http://hdl.handle.net/2022/23207

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Washington

16. Bergan, Thomas. Avoiding State-Space Explosion in Multithreaded Programs with Input-Covering Schedules and Symbolic Execution.

Degree: PhD, 2014, University of Washington

 This dissertation makes two high-level contributions: First, we propose an algorithm to perform symbolic execution of multithreaded programs from arbitrary program contexts. We argue that… (more)

Subjects/Keywords: concurrency; static analysis; symbolic execution; Computer science; computer science and engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bergan, T. (2014). Avoiding State-Space Explosion in Multithreaded Programs with Input-Covering Schedules and Symbolic Execution. (Doctoral Dissertation). University of Washington. Retrieved from http://hdl.handle.net/1773/25357

Chicago Manual of Style (16th Edition):

Bergan, Thomas. “Avoiding State-Space Explosion in Multithreaded Programs with Input-Covering Schedules and Symbolic Execution.” 2014. Doctoral Dissertation, University of Washington. Accessed April 16, 2021. http://hdl.handle.net/1773/25357.

MLA Handbook (7th Edition):

Bergan, Thomas. “Avoiding State-Space Explosion in Multithreaded Programs with Input-Covering Schedules and Symbolic Execution.” 2014. Web. 16 Apr 2021.

Vancouver:

Bergan T. Avoiding State-Space Explosion in Multithreaded Programs with Input-Covering Schedules and Symbolic Execution. [Internet] [Doctoral dissertation]. University of Washington; 2014. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/1773/25357.

Council of Science Editors:

Bergan T. Avoiding State-Space Explosion in Multithreaded Programs with Input-Covering Schedules and Symbolic Execution. [Doctoral Dissertation]. University of Washington; 2014. Available from: http://hdl.handle.net/1773/25357


Linköping University

17. Pettersson, Niklas. Systematically uncovering mutants in testing safety critical software : Using symbolic execution on surviving mutants from mutation testing.

Degree: Software and Systems, 2019, Linköping University

  This thesis investigates how symbolic execution and constraint solving can be used for detecting equivalent and non-equivalent mutants in mutation testing. The presented method… (more)

Subjects/Keywords: Mutation Testing; Symbolic Execution; Dextool; Computer Engineering; Datorteknik; Computer Systems; Datorsystem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Pettersson, N. (2019). Systematically uncovering mutants in testing safety critical software : Using symbolic execution on surviving mutants from mutation testing. (Thesis). Linköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-163338

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):

Pettersson, Niklas. “Systematically uncovering mutants in testing safety critical software : Using symbolic execution on surviving mutants from mutation testing.” 2019. Thesis, Linköping University. Accessed April 16, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-163338.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Pettersson, Niklas. “Systematically uncovering mutants in testing safety critical software : Using symbolic execution on surviving mutants from mutation testing.” 2019. Web. 16 Apr 2021.

Vancouver:

Pettersson N. Systematically uncovering mutants in testing safety critical software : Using symbolic execution on surviving mutants from mutation testing. [Internet] [Thesis]. Linköping University; 2019. [cited 2021 Apr 16]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-163338.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Pettersson N. Systematically uncovering mutants in testing safety critical software : Using symbolic execution on surviving mutants from mutation testing. [Thesis]. Linköping University; 2019. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-163338

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Minnesota

18. Sharma, Vaibhav. Adapter Synthesis: Synthesizing And Repairing Programs Using Scalable Symbolic Execution.

Degree: PhD, Computer Science, 2020, University of Minnesota

 Independently developed codebases typically contain many segments of code that perform the same or closely related operations (semantic clones). Finding functionally equivalent segments enables applications… (more)

Subjects/Keywords: adapter synthesis; binary analysis; cegis; program repair; program synthesis; symbolic execution

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sharma, V. (2020). Adapter Synthesis: Synthesizing And Repairing Programs Using Scalable Symbolic Execution. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/213126

Chicago Manual of Style (16th Edition):

Sharma, Vaibhav. “Adapter Synthesis: Synthesizing And Repairing Programs Using Scalable Symbolic Execution.” 2020. Doctoral Dissertation, University of Minnesota. Accessed April 16, 2021. http://hdl.handle.net/11299/213126.

MLA Handbook (7th Edition):

Sharma, Vaibhav. “Adapter Synthesis: Synthesizing And Repairing Programs Using Scalable Symbolic Execution.” 2020. Web. 16 Apr 2021.

Vancouver:

Sharma V. Adapter Synthesis: Synthesizing And Repairing Programs Using Scalable Symbolic Execution. [Internet] [Doctoral dissertation]. University of Minnesota; 2020. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/11299/213126.

Council of Science Editors:

Sharma V. Adapter Synthesis: Synthesizing And Repairing Programs Using Scalable Symbolic Execution. [Doctoral Dissertation]. University of Minnesota; 2020. Available from: http://hdl.handle.net/11299/213126


University of Melbourne

19. Hansen, Trevor Alexander. A constraint solver and its application to machine code test generation.

Degree: 2012, University of Melbourne

 Software defects are a curse, they are so difficult to find that most software is declared finished, only later to have defects discovered. Ideally, software… (more)

Subjects/Keywords: bit-vector; array; SMT solving; binary analysis; symbolic execution

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hansen, T. A. (2012). A constraint solver and its application to machine code test generation. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/37952

Chicago Manual of Style (16th Edition):

Hansen, Trevor Alexander. “A constraint solver and its application to machine code test generation.” 2012. Doctoral Dissertation, University of Melbourne. Accessed April 16, 2021. http://hdl.handle.net/11343/37952.

MLA Handbook (7th Edition):

Hansen, Trevor Alexander. “A constraint solver and its application to machine code test generation.” 2012. Web. 16 Apr 2021.

Vancouver:

Hansen TA. A constraint solver and its application to machine code test generation. [Internet] [Doctoral dissertation]. University of Melbourne; 2012. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/11343/37952.

Council of Science Editors:

Hansen TA. A constraint solver and its application to machine code test generation. [Doctoral Dissertation]. University of Melbourne; 2012. Available from: http://hdl.handle.net/11343/37952


University of Melbourne

20. Francis, Kathryn Glenn. Natural optimisation modelling for software developers.

Degree: 2016, University of Melbourne

 Constraint solving technology has been successfully applied to large industrial combinatorial optimisation problems with high impact, but is not widely applied to smaller problems. Unfortunately,… (more)

Subjects/Keywords: combinatorial optimisation; modelling; symbolic execution; native interface; constraint programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Francis, K. G. (2016). Natural optimisation modelling for software developers. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/128081

Chicago Manual of Style (16th Edition):

Francis, Kathryn Glenn. “Natural optimisation modelling for software developers.” 2016. Doctoral Dissertation, University of Melbourne. Accessed April 16, 2021. http://hdl.handle.net/11343/128081.

MLA Handbook (7th Edition):

Francis, Kathryn Glenn. “Natural optimisation modelling for software developers.” 2016. Web. 16 Apr 2021.

Vancouver:

Francis KG. Natural optimisation modelling for software developers. [Internet] [Doctoral dissertation]. University of Melbourne; 2016. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/11343/128081.

Council of Science Editors:

Francis KG. Natural optimisation modelling for software developers. [Doctoral Dissertation]. University of Melbourne; 2016. Available from: http://hdl.handle.net/11343/128081


University of Arizona

21. Yadegari, Babak. Automatic Deobfuscation and Reverse Engineering of Obfuscated Code .

Degree: 2016, University of Arizona

 Automatic malware analysis is an essential part of today's computer security practices. Nearly one million malware samples were delivered to the analysts on a daily… (more)

Subjects/Keywords: Malware; Obfuscated Code; Symbolic Execution; Taint Analysis; Computer Science; Binary Analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Yadegari, B. (2016). Automatic Deobfuscation and Reverse Engineering of Obfuscated Code . (Doctoral Dissertation). University of Arizona. Retrieved from http://hdl.handle.net/10150/613135

Chicago Manual of Style (16th Edition):

Yadegari, Babak. “Automatic Deobfuscation and Reverse Engineering of Obfuscated Code .” 2016. Doctoral Dissertation, University of Arizona. Accessed April 16, 2021. http://hdl.handle.net/10150/613135.

MLA Handbook (7th Edition):

Yadegari, Babak. “Automatic Deobfuscation and Reverse Engineering of Obfuscated Code .” 2016. Web. 16 Apr 2021.

Vancouver:

Yadegari B. Automatic Deobfuscation and Reverse Engineering of Obfuscated Code . [Internet] [Doctoral dissertation]. University of Arizona; 2016. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/10150/613135.

Council of Science Editors:

Yadegari B. Automatic Deobfuscation and Reverse Engineering of Obfuscated Code . [Doctoral Dissertation]. University of Arizona; 2016. Available from: http://hdl.handle.net/10150/613135


University of Maryland

22. Ma, Kin Keung. Improving Program Testing and Understanding via Symbolic Execution.

Degree: Computer Science, 2011, University of Maryland

Symbolic execution is an automated technique for program testing that has recently become practical, thanks to advances in constraint solvers. Generally speak- ing, a symbolic(more)

Subjects/Keywords: Computer science; programming languages; program testing; static analysis; symbolic execution

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ma, K. K. (2011). Improving Program Testing and Understanding via Symbolic Execution. (Thesis). University of Maryland. Retrieved from http://hdl.handle.net/1903/12399

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):

Ma, Kin Keung. “Improving Program Testing and Understanding via Symbolic Execution.” 2011. Thesis, University of Maryland. Accessed April 16, 2021. http://hdl.handle.net/1903/12399.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ma, Kin Keung. “Improving Program Testing and Understanding via Symbolic Execution.” 2011. Web. 16 Apr 2021.

Vancouver:

Ma KK. Improving Program Testing and Understanding via Symbolic Execution. [Internet] [Thesis]. University of Maryland; 2011. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/1903/12399.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ma KK. Improving Program Testing and Understanding via Symbolic Execution. [Thesis]. University of Maryland; 2011. Available from: http://hdl.handle.net/1903/12399

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Virginia Tech

23. Prabhu, Sarvesh P. An Efficient 2-Phase Strategy to Achieve High Branch Coverage.

Degree: MS, Electrical and Computer Engineering, 2012, Virginia Tech

Symbolic execution-based test generation is gaining popularity for software test generation. The increasing complexity of the software program is posing new challenges in software execution-based… (more)

Subjects/Keywords: Branch Coverage; Conflict-driven Learning; Symbolic Execution; Software Testing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Prabhu, S. P. (2012). An Efficient 2-Phase Strategy to Achieve High Branch Coverage. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/40931

Chicago Manual of Style (16th Edition):

Prabhu, Sarvesh P. “An Efficient 2-Phase Strategy to Achieve High Branch Coverage.” 2012. Masters Thesis, Virginia Tech. Accessed April 16, 2021. http://hdl.handle.net/10919/40931.

MLA Handbook (7th Edition):

Prabhu, Sarvesh P. “An Efficient 2-Phase Strategy to Achieve High Branch Coverage.” 2012. Web. 16 Apr 2021.

Vancouver:

Prabhu SP. An Efficient 2-Phase Strategy to Achieve High Branch Coverage. [Internet] [Masters thesis]. Virginia Tech; 2012. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/10919/40931.

Council of Science Editors:

Prabhu SP. An Efficient 2-Phase Strategy to Achieve High Branch Coverage. [Masters Thesis]. Virginia Tech; 2012. Available from: http://hdl.handle.net/10919/40931


Georgia Tech

24. Xu, Meng. Finding race conditions in kernels: The symbolic way and the fuzzy way.

Degree: PhD, Computer Science, 2020, Georgia Tech

 The scale and pervasiveness of concurrent software pose challenges for security researchers: race conditions are more prevalent than ever, and the growing software complexity keeps… (more)

Subjects/Keywords: Race condition; Fuzz testing; Symbolic execution; Bug finding; OS kernel

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Xu, M. (2020). Finding race conditions in kernels: The symbolic way and the fuzzy way. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/63668

Chicago Manual of Style (16th Edition):

Xu, Meng. “Finding race conditions in kernels: The symbolic way and the fuzzy way.” 2020. Doctoral Dissertation, Georgia Tech. Accessed April 16, 2021. http://hdl.handle.net/1853/63668.

MLA Handbook (7th Edition):

Xu, Meng. “Finding race conditions in kernels: The symbolic way and the fuzzy way.” 2020. Web. 16 Apr 2021.

Vancouver:

Xu M. Finding race conditions in kernels: The symbolic way and the fuzzy way. [Internet] [Doctoral dissertation]. Georgia Tech; 2020. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/1853/63668.

Council of Science Editors:

Xu M. Finding race conditions in kernels: The symbolic way and the fuzzy way. [Doctoral Dissertation]. Georgia Tech; 2020. Available from: http://hdl.handle.net/1853/63668


Virginia Tech

25. Marcellino, Brendan Adrian. Partitioning Strategies to Enhance Symbolic Execution.

Degree: MS, Computer Engineering, 2015, Virginia Tech

 Software testing is a fundamental part of the software development process. However, testing is still costly and consumes about half of the development cost. The… (more)

Subjects/Keywords: Symbolic Execution; Software Testing; Static Analysis; Partitioning Strategies

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Marcellino, B. A. (2015). Partitioning Strategies to Enhance Symbolic Execution. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/74883

Chicago Manual of Style (16th Edition):

Marcellino, Brendan Adrian. “Partitioning Strategies to Enhance Symbolic Execution.” 2015. Masters Thesis, Virginia Tech. Accessed April 16, 2021. http://hdl.handle.net/10919/74883.

MLA Handbook (7th Edition):

Marcellino, Brendan Adrian. “Partitioning Strategies to Enhance Symbolic Execution.” 2015. Web. 16 Apr 2021.

Vancouver:

Marcellino BA. Partitioning Strategies to Enhance Symbolic Execution. [Internet] [Masters thesis]. Virginia Tech; 2015. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/10919/74883.

Council of Science Editors:

Marcellino BA. Partitioning Strategies to Enhance Symbolic Execution. [Masters Thesis]. Virginia Tech; 2015. Available from: http://hdl.handle.net/10919/74883


Wright State University

26. Jackson, Nathan D. Finding Data Races in Software Binaries with Symbolic Execution.

Degree: MS, Computer Science, 2020, Wright State University

 Modern software applications frequently make use of multithreading to utilize hardware resources better and promote application responsiveness. In these applications, threads share the program state,… (more)

Subjects/Keywords: Computer Science; multithreading; data races; symbolic execution; software binaries

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Jackson, N. D. (2020). Finding Data Races in Software Binaries with Symbolic Execution. (Masters Thesis). Wright State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=wright1589358160703163

Chicago Manual of Style (16th Edition):

Jackson, Nathan D. “Finding Data Races in Software Binaries with Symbolic Execution.” 2020. Masters Thesis, Wright State University. Accessed April 16, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=wright1589358160703163.

MLA Handbook (7th Edition):

Jackson, Nathan D. “Finding Data Races in Software Binaries with Symbolic Execution.” 2020. Web. 16 Apr 2021.

Vancouver:

Jackson ND. Finding Data Races in Software Binaries with Symbolic Execution. [Internet] [Masters thesis]. Wright State University; 2020. [cited 2021 Apr 16]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=wright1589358160703163.

Council of Science Editors:

Jackson ND. Finding Data Races in Software Binaries with Symbolic Execution. [Masters Thesis]. Wright State University; 2020. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=wright1589358160703163


Texas State University – San Marcos

27. Wen, Junye. Distributed Symbolic Execution For Property Checking.

Degree: MS, Software Engineering, 2017, Texas State University – San Marcos

Symbolic execution is a powerful technique for checking properties in the form of assertions. It can systematically explore the program’s state space to find paths… (more)

Subjects/Keywords: Symbolic execution; Property checking; Parallel algorithm; Software engineering; Computer software – Testing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wen, J. (2017). Distributed Symbolic Execution For Property Checking. (Masters Thesis). Texas State University – San Marcos. Retrieved from https://digital.library.txstate.edu/handle/10877/7730

Chicago Manual of Style (16th Edition):

Wen, Junye. “Distributed Symbolic Execution For Property Checking.” 2017. Masters Thesis, Texas State University – San Marcos. Accessed April 16, 2021. https://digital.library.txstate.edu/handle/10877/7730.

MLA Handbook (7th Edition):

Wen, Junye. “Distributed Symbolic Execution For Property Checking.” 2017. Web. 16 Apr 2021.

Vancouver:

Wen J. Distributed Symbolic Execution For Property Checking. [Internet] [Masters thesis]. Texas State University – San Marcos; 2017. [cited 2021 Apr 16]. Available from: https://digital.library.txstate.edu/handle/10877/7730.

Council of Science Editors:

Wen J. Distributed Symbolic Execution For Property Checking. [Masters Thesis]. Texas State University – San Marcos; 2017. Available from: https://digital.library.txstate.edu/handle/10877/7730


Penn State University

28. Luo, Lannan. TOWARDS ENHANCING ANDROID APPLICATION AND SYSTEM SECURITY.

Degree: 2017, Penn State University

 The market for smartphones has been booming in the past few years. Android dominates the market with 87.5% of the global smartphone shipments and over… (more)

Subjects/Keywords: Symbolic execution; Concolic execution; Vulnerability discovery; Exploit generation; Android Framewor; Code obfuscation; Android apps; Android app repackaging; Tamper-proofing; Obfuscation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Luo, L. (2017). TOWARDS ENHANCING ANDROID APPLICATION AND SYSTEM SECURITY. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/14327lzl144

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):

Luo, Lannan. “TOWARDS ENHANCING ANDROID APPLICATION AND SYSTEM SECURITY.” 2017. Thesis, Penn State University. Accessed April 16, 2021. https://submit-etda.libraries.psu.edu/catalog/14327lzl144.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Luo, Lannan. “TOWARDS ENHANCING ANDROID APPLICATION AND SYSTEM SECURITY.” 2017. Web. 16 Apr 2021.

Vancouver:

Luo L. TOWARDS ENHANCING ANDROID APPLICATION AND SYSTEM SECURITY. [Internet] [Thesis]. Penn State University; 2017. [cited 2021 Apr 16]. Available from: https://submit-etda.libraries.psu.edu/catalog/14327lzl144.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Luo L. TOWARDS ENHANCING ANDROID APPLICATION AND SYSTEM SECURITY. [Thesis]. Penn State University; 2017. Available from: https://submit-etda.libraries.psu.edu/catalog/14327lzl144

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

29. Tofighi Shirazi, Matthieu. Evaluation des méthodes d'obscurcissement de binaire : Analysis of obfuscation transformations on binary code.

Degree: Docteur es, Mathématiques et informatique, 2019, Université Grenoble Alpes (ComUE)

 L'obscurcissement de code est perçu comme une stratégie de gestion de l'information visant à masquer le sens pouvant être tiré d'un logiciel, tout en préservant… (more)

Subjects/Keywords: Execution symbolique; Analyse de binaire; Apprentissage automatique; Des-Obscurcissement; Rétro-Ingiénerie; Reverse engineering; Deobfuscation; Binary analysis; Symbolic execution; Machine learning; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Tofighi Shirazi, M. (2019). Evaluation des méthodes d'obscurcissement de binaire : Analysis of obfuscation transformations on binary code. (Doctoral Dissertation). Université Grenoble Alpes (ComUE). Retrieved from http://www.theses.fr/2019GREAM069

Chicago Manual of Style (16th Edition):

Tofighi Shirazi, Matthieu. “Evaluation des méthodes d'obscurcissement de binaire : Analysis of obfuscation transformations on binary code.” 2019. Doctoral Dissertation, Université Grenoble Alpes (ComUE). Accessed April 16, 2021. http://www.theses.fr/2019GREAM069.

MLA Handbook (7th Edition):

Tofighi Shirazi, Matthieu. “Evaluation des méthodes d'obscurcissement de binaire : Analysis of obfuscation transformations on binary code.” 2019. Web. 16 Apr 2021.

Vancouver:

Tofighi Shirazi M. Evaluation des méthodes d'obscurcissement de binaire : Analysis of obfuscation transformations on binary code. [Internet] [Doctoral dissertation]. Université Grenoble Alpes (ComUE); 2019. [cited 2021 Apr 16]. Available from: http://www.theses.fr/2019GREAM069.

Council of Science Editors:

Tofighi Shirazi M. Evaluation des méthodes d'obscurcissement de binaire : Analysis of obfuscation transformations on binary code. [Doctoral Dissertation]. Université Grenoble Alpes (ComUE); 2019. Available from: http://www.theses.fr/2019GREAM069

30. Zhang, Chaoqiang. Test Case Reduction, Prioritization, and Selection for Symbolic Execution.

Degree: PhD, Computer Science, 2015, Oregon State University

 Software testing is of critical importance for the success of software projects. Current inefficient testing methods often still take up half or more of a… (more)

Subjects/Keywords: Symbolic execution; Computer software  – Testing

…7 2.2 Symbolic Execution . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2.2.1… …Using Existing Test Cases for Seeding Symbolic Execution . 9 13 2.3 Test Case Reduction… …Reduction for Symbolic Execution 20 3.1 Introduction… …Symbolic Execution 60 4.1 Introduction… …C program foo, its control flow graph, and its symbolic execution tree… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zhang, C. (2015). Test Case Reduction, Prioritization, and Selection for Symbolic Execution. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/56362

Chicago Manual of Style (16th Edition):

Zhang, Chaoqiang. “Test Case Reduction, Prioritization, and Selection for Symbolic Execution.” 2015. Doctoral Dissertation, Oregon State University. Accessed April 16, 2021. http://hdl.handle.net/1957/56362.

MLA Handbook (7th Edition):

Zhang, Chaoqiang. “Test Case Reduction, Prioritization, and Selection for Symbolic Execution.” 2015. Web. 16 Apr 2021.

Vancouver:

Zhang C. Test Case Reduction, Prioritization, and Selection for Symbolic Execution. [Internet] [Doctoral dissertation]. Oregon State University; 2015. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/1957/56362.

Council of Science Editors:

Zhang C. Test Case Reduction, Prioritization, and Selection for Symbolic Execution. [Doctoral Dissertation]. Oregon State University; 2015. Available from: http://hdl.handle.net/1957/56362

[1] [2] [3] [4]

.