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 +publisher:"University of Texas – Austin" +contributor:("Emerson, E. Allen"). Showing records 1 – 8 of 8 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters

1. Samanta, Roopsha. Program reliability through algorithmic design and analysis.

Degree: PhD, Electrical and Computer Engineering, 2013, University of Texas – Austin

 Software systems are ubiquitous in today's world and yet, remain vulnerable to the fallibility of human programmers as well as the unpredictability of their operating… (more)

Subjects/Keywords: Automated program repair; Automated program debugging; Automated program synthesis; Automated synchronization synthesis; Robustness analysis

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

Samanta, R. (2013). Program reliability through algorithmic design and analysis. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/23103

Chicago Manual of Style (16th Edition):

Samanta, Roopsha. “Program reliability through algorithmic design and analysis.” 2013. Doctoral Dissertation, University of Texas – Austin. Accessed February 27, 2021. http://hdl.handle.net/2152/23103.

MLA Handbook (7th Edition):

Samanta, Roopsha. “Program reliability through algorithmic design and analysis.” 2013. Web. 27 Feb 2021.

Vancouver:

Samanta R. Program reliability through algorithmic design and analysis. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2013. [cited 2021 Feb 27]. Available from: http://hdl.handle.net/2152/23103.

Council of Science Editors:

Samanta R. Program reliability through algorithmic design and analysis. [Doctoral Dissertation]. University of Texas – Austin; 2013. Available from: http://hdl.handle.net/2152/23103


University of Texas – Austin

2. Wahl, Thomas, 1973-. Exploiting replication in automated program verification.

Degree: PhD, Computer Sciences, 2007, University of Texas – Austin

 This dissertation shows how systems of many concurrent components, which naively engender intractably large state spaces, can nevertheless be successfully subject to exhaustive formal verification,… (more)

Subjects/Keywords: Computer software – Verification; Formal methods (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wahl, Thomas, 1. (2007). Exploiting replication in automated program verification. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/3338

Chicago Manual of Style (16th Edition):

Wahl, Thomas, 1973-. “Exploiting replication in automated program verification.” 2007. Doctoral Dissertation, University of Texas – Austin. Accessed February 27, 2021. http://hdl.handle.net/2152/3338.

MLA Handbook (7th Edition):

Wahl, Thomas, 1973-. “Exploiting replication in automated program verification.” 2007. Web. 27 Feb 2021.

Vancouver:

Wahl, Thomas 1. Exploiting replication in automated program verification. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2007. [cited 2021 Feb 27]. Available from: http://hdl.handle.net/2152/3338.

Council of Science Editors:

Wahl, Thomas 1. Exploiting replication in automated program verification. [Doctoral Dissertation]. University of Texas – Austin; 2007. Available from: http://hdl.handle.net/2152/3338


University of Texas – Austin

3. Iyer, Subramanian Krishnan. Efficient and effective symbolic model checking.

Degree: PhD, Computer Sciences, 2006, University of Texas – Austin

 The main bottleneck in practical symbolic model checking is that it is restricted by the ability to efficiently represent and perform operations on sets of… (more)

Subjects/Keywords: Computer programs – Verification; State-space methods; Formal methods (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Iyer, S. K. (2006). Efficient and effective symbolic model checking. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/2888

Chicago Manual of Style (16th Edition):

Iyer, Subramanian Krishnan. “Efficient and effective symbolic model checking.” 2006. Doctoral Dissertation, University of Texas – Austin. Accessed February 27, 2021. http://hdl.handle.net/2152/2888.

MLA Handbook (7th Edition):

Iyer, Subramanian Krishnan. “Efficient and effective symbolic model checking.” 2006. Web. 27 Feb 2021.

Vancouver:

Iyer SK. Efficient and effective symbolic model checking. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2006. [cited 2021 Feb 27]. Available from: http://hdl.handle.net/2152/2888.

Council of Science Editors:

Iyer SK. Efficient and effective symbolic model checking. [Doctoral Dissertation]. University of Texas – Austin; 2006. Available from: http://hdl.handle.net/2152/2888


University of Texas – Austin

4. Amla, Nina. Efficient model checking for timing diagrams.

Degree: PhD, Computer Sciences, 2001, University of Texas – Austin

Subjects/Keywords: Computer systems; Computer software

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Amla, N. (2001). Efficient model checking for timing diagrams. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/1681

Chicago Manual of Style (16th Edition):

Amla, Nina. “Efficient model checking for timing diagrams.” 2001. Doctoral Dissertation, University of Texas – Austin. Accessed February 27, 2021. http://hdl.handle.net/2152/1681.

MLA Handbook (7th Edition):

Amla, Nina. “Efficient model checking for timing diagrams.” 2001. Web. 27 Feb 2021.

Vancouver:

Amla N. Efficient model checking for timing diagrams. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2001. [cited 2021 Feb 27]. Available from: http://hdl.handle.net/2152/1681.

Council of Science Editors:

Amla N. Efficient model checking for timing diagrams. [Doctoral Dissertation]. University of Texas – Austin; 2001. Available from: http://hdl.handle.net/2152/1681


University of Texas – Austin

5. Kahlon, Vineet. Model checking: beyond the finite.

Degree: PhD, Computer Sciences, 2004, University of Texas – Austin

Subjects/Keywords: Computer programs – Verification

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kahlon, V. (2004). Model checking: beyond the finite. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/1158

Chicago Manual of Style (16th Edition):

Kahlon, Vineet. “Model checking: beyond the finite.” 2004. Doctoral Dissertation, University of Texas – Austin. Accessed February 27, 2021. http://hdl.handle.net/2152/1158.

MLA Handbook (7th Edition):

Kahlon, Vineet. “Model checking: beyond the finite.” 2004. Web. 27 Feb 2021.

Vancouver:

Kahlon V. Model checking: beyond the finite. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2004. [cited 2021 Feb 27]. Available from: http://hdl.handle.net/2152/1158.

Council of Science Editors:

Kahlon V. Model checking: beyond the finite. [Doctoral Dissertation]. University of Texas – Austin; 2004. Available from: http://hdl.handle.net/2152/1158

6. Davis, Jared Curran. A self-verifying theorem prover.

Degree: PhD, Computer Sciences, 2009, University of Texas – Austin

 Programs have precise semantics, so we can use mathematical proof to establish their properties. These proofs are often too large to validate with the usual… (more)

Subjects/Keywords: Milawa; mathematical logic; formal verification; Lisp; proof checking; theorem proving; automated reasoning; reflection; soundness; fidelity; faithfulness; rewriting; proof building; tactics; first-order logic; verified verifier

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

Davis, J. C. (2009). A self-verifying theorem prover. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2009-12-435

Chicago Manual of Style (16th Edition):

Davis, Jared Curran. “A self-verifying theorem prover.” 2009. Doctoral Dissertation, University of Texas – Austin. Accessed February 27, 2021. http://hdl.handle.net/2152/ETD-UT-2009-12-435.

MLA Handbook (7th Edition):

Davis, Jared Curran. “A self-verifying theorem prover.” 2009. Web. 27 Feb 2021.

Vancouver:

Davis JC. A self-verifying theorem prover. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2009. [cited 2021 Feb 27]. Available from: http://hdl.handle.net/2152/ETD-UT-2009-12-435.

Council of Science Editors:

Davis JC. A self-verifying theorem prover. [Doctoral Dissertation]. University of Texas – Austin; 2009. Available from: http://hdl.handle.net/2152/ETD-UT-2009-12-435

7. Wehrman, Ian Anthony. Weak-memory local reasoning.

Degree: PhD, Computer Science, 2012, University of Texas – Austin

 Program logics are formal logics designed to facilitate specification and correctness reasoning for software programs. Separation logic, a recent program logic for C-like programs, has… (more)

Subjects/Keywords: Programming; Formal methods; Concurrency; Memory models

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

Wehrman, I. A. (2012). Weak-memory local reasoning. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/19475

Chicago Manual of Style (16th Edition):

Wehrman, Ian Anthony. “Weak-memory local reasoning.” 2012. Doctoral Dissertation, University of Texas – Austin. Accessed February 27, 2021. http://hdl.handle.net/2152/19475.

MLA Handbook (7th Edition):

Wehrman, Ian Anthony. “Weak-memory local reasoning.” 2012. Web. 27 Feb 2021.

Vancouver:

Wehrman IA. Weak-memory local reasoning. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2012. [cited 2021 Feb 27]. Available from: http://hdl.handle.net/2152/19475.

Council of Science Editors:

Wehrman IA. Weak-memory local reasoning. [Doctoral Dissertation]. University of Texas – Austin; 2012. Available from: http://hdl.handle.net/2152/19475


University of Texas – Austin

8. Deshmukh, Jyotirmoy Vinay. Verification of sequential and concurrent libraries.

Degree: PhD, Electrical and Computer Engineering, 2010, University of Texas – Austin

 The goal of this dissertation is to present new and improved techniques for fully automatic verification of sequential and concurrent software libraries. In most cases,… (more)

Subjects/Keywords: Computer software; Verification; Static analysis; Shape analysis; Data structures; Deadlocks; Deadlock detection; Concurrency; Concurrent libraries; Multi-threaded; Wait-notify; Synchronization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Deshmukh, J. V. (2010). Verification of sequential and concurrent libraries. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2010-08-1771

Chicago Manual of Style (16th Edition):

Deshmukh, Jyotirmoy Vinay. “Verification of sequential and concurrent libraries.” 2010. Doctoral Dissertation, University of Texas – Austin. Accessed February 27, 2021. http://hdl.handle.net/2152/ETD-UT-2010-08-1771.

MLA Handbook (7th Edition):

Deshmukh, Jyotirmoy Vinay. “Verification of sequential and concurrent libraries.” 2010. Web. 27 Feb 2021.

Vancouver:

Deshmukh JV. Verification of sequential and concurrent libraries. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2010. [cited 2021 Feb 27]. Available from: http://hdl.handle.net/2152/ETD-UT-2010-08-1771.

Council of Science Editors:

Deshmukh JV. Verification of sequential and concurrent libraries. [Doctoral Dissertation]. University of Texas – Austin; 2010. Available from: http://hdl.handle.net/2152/ETD-UT-2010-08-1771

.