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 Illinois – Urbana-Champaign" +contributor:("Gunter, Elsa"). Showing records 1 – 11 of 11 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Illinois – Urbana-Champaign

1. Griffith, Dennis Edward. Polarized substructural session types.

Degree: PhD, Computer Science, 2016, University of Illinois – Urbana-Champaign

 Concurrent processes can be extremely difficult to reason about, both for programmers and formally. One approach to coping with this difficulty is to study new… (more)

Subjects/Keywords: Programming Languages; Session Types; Curry-Howard

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Griffith, D. E. (2016). Polarized substructural session types. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/90544

Chicago Manual of Style (16th Edition):

Griffith, Dennis Edward. “Polarized substructural session types.” 2016. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed August 20, 2019. http://hdl.handle.net/2142/90544.

MLA Handbook (7th Edition):

Griffith, Dennis Edward. “Polarized substructural session types.” 2016. Web. 20 Aug 2019.

Vancouver:

Griffith DE. Polarized substructural session types. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2016. [cited 2019 Aug 20]. Available from: http://hdl.handle.net/2142/90544.

Council of Science Editors:

Griffith DE. Polarized substructural session types. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/90544


University of Illinois – Urbana-Champaign

2. Popescu, Andrei. Contributions to the theory of syntax with bindings and to process algebra.

Degree: PhD, 0112, 2011, University of Illinois – Urbana-Champaign

 We develop a theory of syntax with bindings, focusing on: - methodological issues concerning the convenient representation of syntax; - techniques for recursive definitions and… (more)

Subjects/Keywords: Syntax with Bindings; Lambda Calculus; Coinduction; Theorem proving; Isabelle

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Popescu, A. (2011). Contributions to the theory of syntax with bindings and to process algebra. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/18477

Chicago Manual of Style (16th Edition):

Popescu, Andrei. “Contributions to the theory of syntax with bindings and to process algebra.” 2011. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed August 20, 2019. http://hdl.handle.net/2142/18477.

MLA Handbook (7th Edition):

Popescu, Andrei. “Contributions to the theory of syntax with bindings and to process algebra.” 2011. Web. 20 Aug 2019.

Vancouver:

Popescu A. Contributions to the theory of syntax with bindings and to process algebra. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2011. [cited 2019 Aug 20]. Available from: http://hdl.handle.net/2142/18477.

Council of Science Editors:

Popescu A. Contributions to the theory of syntax with bindings and to process algebra. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/18477


University of Illinois – Urbana-Champaign

3. Yasmeen, Ayesha. Formalizing operator task analysis.

Degree: PhD, 0112, 2011, University of Illinois – Urbana-Champaign

 Human operators are unique in their decision making capability, judgment and nondeterminism. Their sense of judgment, unpredictable decision procedures, susceptibility to environmental elements can cause… (more)

Subjects/Keywords: human operators; system verification; task analysis; human error; formal methods; model checking; runtime monitoring; reliability; Model theory; temporal logic; model refinement; requirement satisfaction; system robustness; protected task execution; incomplete information; concurrent game structures; formal human behavior model; tolerance of erroneous human behaviors

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yasmeen, A. (2011). Formalizing operator task analysis. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/26103

Chicago Manual of Style (16th Edition):

Yasmeen, Ayesha. “Formalizing operator task analysis.” 2011. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed August 20, 2019. http://hdl.handle.net/2142/26103.

MLA Handbook (7th Edition):

Yasmeen, Ayesha. “Formalizing operator task analysis.” 2011. Web. 20 Aug 2019.

Vancouver:

Yasmeen A. Formalizing operator task analysis. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2011. [cited 2019 Aug 20]. Available from: http://hdl.handle.net/2142/26103.

Council of Science Editors:

Yasmeen A. Formalizing operator task analysis. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/26103

4. Moore, Brandon Michael. Coinductive program verification.

Degree: PhD, Computer Science, 2016, University of Illinois – Urbana-Champaign

 We present a program-verification approach based on coinduction, which makes it feasible to verify programs given an operational semantics of a programming language, without constructing… (more)

Subjects/Keywords: Program Verification; Coinduction; Operational Semantics; Formal Methods; Software Verification

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Moore, B. M. (2016). Coinductive program verification. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/95372

Chicago Manual of Style (16th Edition):

Moore, Brandon Michael. “Coinductive program verification.” 2016. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed August 20, 2019. http://hdl.handle.net/2142/95372.

MLA Handbook (7th Edition):

Moore, Brandon Michael. “Coinductive program verification.” 2016. Web. 20 Aug 2019.

Vancouver:

Moore BM. Coinductive program verification. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2016. [cited 2019 Aug 20]. Available from: http://hdl.handle.net/2142/95372.

Council of Science Editors:

Moore BM. Coinductive program verification. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/95372


University of Illinois – Urbana-Champaign

5. Ștefănescu, Andrei. Toward language-independent program verification.

Degree: PhD, Computer Science, 2016, University of Illinois – Urbana-Champaign

 Recent years have seen a renewed interest in the area of deductive program verification, with focus on verifying real-world software components. Success stories include the… (more)

Subjects/Keywords: program verification; operational semantics; automated reasoning; logics; programming languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ștefănescu, A. (2016). Toward language-independent program verification. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/92779

Chicago Manual of Style (16th Edition):

Ștefănescu, Andrei. “Toward language-independent program verification.” 2016. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed August 20, 2019. http://hdl.handle.net/2142/92779.

MLA Handbook (7th Edition):

Ștefănescu, Andrei. “Toward language-independent program verification.” 2016. Web. 20 Aug 2019.

Vancouver:

Ștefănescu A. Toward language-independent program verification. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2016. [cited 2019 Aug 20]. Available from: http://hdl.handle.net/2142/92779.

Council of Science Editors:

Ștefănescu A. Toward language-independent program verification. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/92779


University of Illinois – Urbana-Champaign

6. Charalambides, Minas. Actor programming with static guarantees.

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

 This thesis discusses two methodologies for applying type discipline to concurrent programming with actors: process types, and session types. A system based on each of… (more)

Subjects/Keywords: actors; type; static; session; concurrency

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Charalambides, M. (2018). Actor programming with static guarantees. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/101036

Chicago Manual of Style (16th Edition):

Charalambides, Minas. “Actor programming with static guarantees.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed August 20, 2019. http://hdl.handle.net/2142/101036.

MLA Handbook (7th Edition):

Charalambides, Minas. “Actor programming with static guarantees.” 2018. Web. 20 Aug 2019.

Vancouver:

Charalambides M. Actor programming with static guarantees. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2019 Aug 20]. Available from: http://hdl.handle.net/2142/101036.

Council of Science Editors:

Charalambides M. Actor programming with static guarantees. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/101036

7. Nip, Terence. Efficacy of frequent, secure, automated testing on student academic performance.

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

 This thesis discusses the effects of frequent, secure automated testing on student performance in CS 421, a class titled Programming Languages and Compilers at the… (more)

Subjects/Keywords: computer science; education; automated testing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nip, T. (2016). Efficacy of frequent, secure, automated testing on student academic performance. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/90664

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

Nip, Terence. “Efficacy of frequent, secure, automated testing on student academic performance.” 2016. Thesis, University of Illinois – Urbana-Champaign. Accessed August 20, 2019. http://hdl.handle.net/2142/90664.

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

MLA Handbook (7th Edition):

Nip, Terence. “Efficacy of frequent, secure, automated testing on student academic performance.” 2016. Web. 20 Aug 2019.

Vancouver:

Nip T. Efficacy of frequent, secure, automated testing on student academic performance. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2016. [cited 2019 Aug 20]. Available from: http://hdl.handle.net/2142/90664.

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

Council of Science Editors:

Nip T. Efficacy of frequent, secure, automated testing on student academic performance. [Thesis]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/90664

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

8. Osborn, Christopher J. Circular Reasoner: A package in Mathematica for the execution of certain otherwise non-terminating functional programs.

Degree: MS, 0112, 2010, University of Illinois – Urbana-Champaign

 We have designed Circular Reasoner, a package in Mathematica for the specification of functional programs using rewrite rules. The package detects certain recursions of a… (more)

Subjects/Keywords: Mathematica; term rewriting; circular reasoner

Page 1 Page 2 Page 3 Page 4 Page 5

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Osborn, C. J. (2010). Circular Reasoner: A package in Mathematica for the execution of certain otherwise non-terminating functional programs. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/16748

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

Osborn, Christopher J. “Circular Reasoner: A package in Mathematica for the execution of certain otherwise non-terminating functional programs.” 2010. Thesis, University of Illinois – Urbana-Champaign. Accessed August 20, 2019. http://hdl.handle.net/2142/16748.

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

MLA Handbook (7th Edition):

Osborn, Christopher J. “Circular Reasoner: A package in Mathematica for the execution of certain otherwise non-terminating functional programs.” 2010. Web. 20 Aug 2019.

Vancouver:

Osborn CJ. Circular Reasoner: A package in Mathematica for the execution of certain otherwise non-terminating functional programs. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2010. [cited 2019 Aug 20]. Available from: http://hdl.handle.net/2142/16748.

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

Council of Science Editors:

Osborn CJ. Circular Reasoner: A package in Mathematica for the execution of certain otherwise non-terminating functional programs. [Thesis]. University of Illinois – Urbana-Champaign; 2010. Available from: http://hdl.handle.net/2142/16748

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

9. Bay, Michael. A static semantics for labels in OCaml.

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

 In this thesis, we are proposing a type system and a type inferencer for the label-feature of OCaml. Labels in OCaml allow the naming of… (more)

Subjects/Keywords: OCaml

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bay, M. (2016). A static semantics for labels in OCaml. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/92854

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

Bay, Michael. “A static semantics for labels in OCaml.” 2016. Thesis, University of Illinois – Urbana-Champaign. Accessed August 20, 2019. http://hdl.handle.net/2142/92854.

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

MLA Handbook (7th Edition):

Bay, Michael. “A static semantics for labels in OCaml.” 2016. Web. 20 Aug 2019.

Vancouver:

Bay M. A static semantics for labels in OCaml. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2016. [cited 2019 Aug 20]. Available from: http://hdl.handle.net/2142/92854.

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

Council of Science Editors:

Bay M. A static semantics for labels in OCaml. [Thesis]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/92854

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

10. Li, Liyi. Symbolic semantics for CSP.

Degree: MS, 0112, 2014, University of Illinois – Urbana-Champaign

 Communicating Sequential Processes (CSP) is a well-known formal language for describing concurrent systems, for which a transition semantics has been given by Brookes, Hoare and… (more)

Subjects/Keywords: Communicating Sequential Processes (CSP); Process Algebra; Symbolic Semantics; Theorem Proving; Simulator

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, L. (2014). Symbolic semantics for CSP. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/50630

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

Li, Liyi. “Symbolic semantics for CSP.” 2014. Thesis, University of Illinois – Urbana-Champaign. Accessed August 20, 2019. http://hdl.handle.net/2142/50630.

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

MLA Handbook (7th Edition):

Li, Liyi. “Symbolic semantics for CSP.” 2014. Web. 20 Aug 2019.

Vancouver:

Li L. Symbolic semantics for CSP. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2014. [cited 2019 Aug 20]. Available from: http://hdl.handle.net/2142/50630.

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

Council of Science Editors:

Li L. Symbolic semantics for CSP. [Thesis]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/50630

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

11. Mansky, William. Specifying and verifying program transformations with PTRANS.

Degree: PhD, 0112, 2014, University of Illinois – Urbana-Champaign

 Software developers, compiler designers, and formal methods researchers all stand to benefit from improved tools for compiler design and verification. Program correctness for compiled languages… (more)

Subjects/Keywords: compiler correctness; control flow graphs; temporal logic; rewriting; graph transformation; interactive theorem proving; operational semantics; concurrency; relaxed memory models; Satisfiability Modulo Theories (SMT) solvers

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mansky, W. (2014). Specifying and verifying program transformations with PTRANS. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/49385

Chicago Manual of Style (16th Edition):

Mansky, William. “Specifying and verifying program transformations with PTRANS.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed August 20, 2019. http://hdl.handle.net/2142/49385.

MLA Handbook (7th Edition):

Mansky, William. “Specifying and verifying program transformations with PTRANS.” 2014. Web. 20 Aug 2019.

Vancouver:

Mansky W. Specifying and verifying program transformations with PTRANS. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2019 Aug 20]. Available from: http://hdl.handle.net/2142/49385.

Council of Science Editors:

Mansky W. Specifying and verifying program transformations with PTRANS. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/49385

.