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:(Formal languages). Showing records 1 – 30 of 174 total matches.

[1] [2] [3] [4] [5] [6]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


University of Debrecen

1. Angyal, Dávid. On permutation languages .

Degree: DE – Informatikai Kar, 2014, University of Debrecen

 In this thesis we investigate some interesting properties of the family of permutation languages and its subclasses. Permutation grammars are context-free grammars extended with special… (more)

Subjects/Keywords: formal languages; permutation languages; parsing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Angyal, D. (2014). On permutation languages . (Thesis). University of Debrecen. Retrieved from http://hdl.handle.net/2437/191126

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

Angyal, Dávid. “On permutation languages .” 2014. Thesis, University of Debrecen. Accessed October 30, 2020. http://hdl.handle.net/2437/191126.

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

MLA Handbook (7th Edition):

Angyal, Dávid. “On permutation languages .” 2014. Web. 30 Oct 2020.

Vancouver:

Angyal D. On permutation languages . [Internet] [Thesis]. University of Debrecen; 2014. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/2437/191126.

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

Council of Science Editors:

Angyal D. On permutation languages . [Thesis]. University of Debrecen; 2014. Available from: http://hdl.handle.net/2437/191126

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


Victoria University of Wellington

2. Mackay, Julian. Ownership and Immutability in Coq.

Degree: 2013, Victoria University of Wellington

 A significant issue in modern programming languages is unsafe aliasing. Modern type systems have attempted to address this in two prominent ways; immutability and ownership,… (more)

Subjects/Keywords: Programming languages; Formal systems; Java

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mackay, J. (2013). Ownership and Immutability in Coq. (Masters Thesis). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/8682

Chicago Manual of Style (16th Edition):

Mackay, Julian. “Ownership and Immutability in Coq.” 2013. Masters Thesis, Victoria University of Wellington. Accessed October 30, 2020. http://hdl.handle.net/10063/8682.

MLA Handbook (7th Edition):

Mackay, Julian. “Ownership and Immutability in Coq.” 2013. Web. 30 Oct 2020.

Vancouver:

Mackay J. Ownership and Immutability in Coq. [Internet] [Masters thesis]. Victoria University of Wellington; 2013. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/10063/8682.

Council of Science Editors:

Mackay J. Ownership and Immutability in Coq. [Masters Thesis]. Victoria University of Wellington; 2013. Available from: http://hdl.handle.net/10063/8682


University of Johannesburg

3. Ehlers, Elizabeth Marie. A hierarchy of random context grammars and automata.

Degree: 2014, University of Johannesburg

Ph.D. (Computer Science)

Traditionally a formal language can be characterized in two ways: by a generative device (a grammar) and an acceptive device (an automaton).… (more)

Subjects/Keywords: Machine theory; Formal languages; Artificial intelligence

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ehlers, E. M. (2014). A hierarchy of random context grammars and automata. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/10004

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

Ehlers, Elizabeth Marie. “A hierarchy of random context grammars and automata.” 2014. Thesis, University of Johannesburg. Accessed October 30, 2020. http://hdl.handle.net/10210/10004.

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

MLA Handbook (7th Edition):

Ehlers, Elizabeth Marie. “A hierarchy of random context grammars and automata.” 2014. Web. 30 Oct 2020.

Vancouver:

Ehlers EM. A hierarchy of random context grammars and automata. [Internet] [Thesis]. University of Johannesburg; 2014. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/10210/10004.

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

Council of Science Editors:

Ehlers EM. A hierarchy of random context grammars and automata. [Thesis]. University of Johannesburg; 2014. Available from: http://hdl.handle.net/10210/10004

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


University of St Andrews

4. Bennett, Daniel. On plausible counterexamples to Lehnert's conjecture.

Degree: PhD, 2018, University of St Andrews

 A group whose co-word problem is a context free language is called coCF. Lehnert's conjecture states that a group G is coCF if and only… (more)

Subjects/Keywords: 512; QA174.2B4; Formal languages; Group theory; Semigroups

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bennett, D. (2018). On plausible counterexamples to Lehnert's conjecture. (Doctoral Dissertation). University of St Andrews. Retrieved from http://hdl.handle.net/10023/15631

Chicago Manual of Style (16th Edition):

Bennett, Daniel. “On plausible counterexamples to Lehnert's conjecture.” 2018. Doctoral Dissertation, University of St Andrews. Accessed October 30, 2020. http://hdl.handle.net/10023/15631.

MLA Handbook (7th Edition):

Bennett, Daniel. “On plausible counterexamples to Lehnert's conjecture.” 2018. Web. 30 Oct 2020.

Vancouver:

Bennett D. On plausible counterexamples to Lehnert's conjecture. [Internet] [Doctoral dissertation]. University of St Andrews; 2018. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/10023/15631.

Council of Science Editors:

Bennett D. On plausible counterexamples to Lehnert's conjecture. [Doctoral Dissertation]. University of St Andrews; 2018. Available from: http://hdl.handle.net/10023/15631


University of Illinois – Urbana-Champaign

5. Katelman, Michael. A meta-language for functional verification.

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

 This dissertation perceives a similarity between two activities: that of coordinating the search for simulation traces toward reaching verification closure, and that of coordinating the… (more)

Subjects/Keywords: Programming Languages; Formal Methods; Hardware Verification

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Katelman, M. (2012). A meta-language for functional verification. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/29614

Chicago Manual of Style (16th Edition):

Katelman, Michael. “A meta-language for functional verification.” 2012. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed October 30, 2020. http://hdl.handle.net/2142/29614.

MLA Handbook (7th Edition):

Katelman, Michael. “A meta-language for functional verification.” 2012. Web. 30 Oct 2020.

Vancouver:

Katelman M. A meta-language for functional verification. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2012. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/2142/29614.

Council of Science Editors:

Katelman M. A meta-language for functional verification. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2012. Available from: http://hdl.handle.net/2142/29614


Victoria University of Wellington

6. Mackay, Julian. Decidable Subtyping for Path Dependent Types.

Degree: 2020, Victoria University of Wellington

 Path dependent types form a central component of the Scala programming language. Coupled with other expressive type forms, path dependent types provide for a diverse… (more)

Subjects/Keywords: Programming Languages; Formal Logics; Semantics; Functional Programming Languages; Object oriented Programming Languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mackay, J. (2020). Decidable Subtyping for Path Dependent Types. (Doctoral Dissertation). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/9081

Chicago Manual of Style (16th Edition):

Mackay, Julian. “Decidable Subtyping for Path Dependent Types.” 2020. Doctoral Dissertation, Victoria University of Wellington. Accessed October 30, 2020. http://hdl.handle.net/10063/9081.

MLA Handbook (7th Edition):

Mackay, Julian. “Decidable Subtyping for Path Dependent Types.” 2020. Web. 30 Oct 2020.

Vancouver:

Mackay J. Decidable Subtyping for Path Dependent Types. [Internet] [Doctoral dissertation]. Victoria University of Wellington; 2020. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/10063/9081.

Council of Science Editors:

Mackay J. Decidable Subtyping for Path Dependent Types. [Doctoral Dissertation]. Victoria University of Wellington; 2020. Available from: http://hdl.handle.net/10063/9081

7. M.P. Bianchi. DESCRIPTIONAL COMPLEXITY OF CLASSICAL AND QUANTUM UNARY AUTOMATA.

Degree: 2013, Università degli Studi di Milano

 In this thesis, we study some problems on classical and quantum one-way finite state automata working on a unary input alphabet. The central issue of… (more)

Subjects/Keywords: formal languages; finite state automata; descriptional complexity; quantum automata; unary languages; Settore INF/01 - Informatica

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bianchi, M. (2013). DESCRIPTIONAL COMPLEXITY OF CLASSICAL AND QUANTUM UNARY AUTOMATA. (Thesis). Università degli Studi di Milano. Retrieved from http://hdl.handle.net/2434/217566

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

Bianchi, M.P.. “DESCRIPTIONAL COMPLEXITY OF CLASSICAL AND QUANTUM UNARY AUTOMATA.” 2013. Thesis, Università degli Studi di Milano. Accessed October 30, 2020. http://hdl.handle.net/2434/217566.

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

MLA Handbook (7th Edition):

Bianchi, M.P.. “DESCRIPTIONAL COMPLEXITY OF CLASSICAL AND QUANTUM UNARY AUTOMATA.” 2013. Web. 30 Oct 2020.

Vancouver:

Bianchi M. DESCRIPTIONAL COMPLEXITY OF CLASSICAL AND QUANTUM UNARY AUTOMATA. [Internet] [Thesis]. Università degli Studi di Milano; 2013. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/2434/217566.

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

Council of Science Editors:

Bianchi M. DESCRIPTIONAL COMPLEXITY OF CLASSICAL AND QUANTUM UNARY AUTOMATA. [Thesis]. Università degli Studi di Milano; 2013. Available from: http://hdl.handle.net/2434/217566

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


Tampere University

8. Cojocaru, Liliana. Advanced Studies on the Complexity of Formal Languages .

Degree: 2016, Tampere University

 Tutkimuksia formaalien kielten laskennallisesta vaativuudesta Laskennan monimutkaisuudella tarkoitetaan niiden resurssien määrää, jotka tarvitaan tietyn laskentatehtävän ratkaisemiseen. Laskennassa tarvittavia resursseja ovat aika (laskenta-askelten lukumäärä), muistitila, käytettävän… (more)

Subjects/Keywords: monimutkaisuus ; formaalit kielet ; laskentaresurssit ; complexity ; formal languages ; computational resources

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cojocaru, L. (2016). Advanced Studies on the Complexity of Formal Languages . (Doctoral Dissertation). Tampere University. Retrieved from https://trepo.tuni.fi/handle/10024/99577

Chicago Manual of Style (16th Edition):

Cojocaru, Liliana. “Advanced Studies on the Complexity of Formal Languages .” 2016. Doctoral Dissertation, Tampere University. Accessed October 30, 2020. https://trepo.tuni.fi/handle/10024/99577.

MLA Handbook (7th Edition):

Cojocaru, Liliana. “Advanced Studies on the Complexity of Formal Languages .” 2016. Web. 30 Oct 2020.

Vancouver:

Cojocaru L. Advanced Studies on the Complexity of Formal Languages . [Internet] [Doctoral dissertation]. Tampere University; 2016. [cited 2020 Oct 30]. Available from: https://trepo.tuni.fi/handle/10024/99577.

Council of Science Editors:

Cojocaru L. Advanced Studies on the Complexity of Formal Languages . [Doctoral Dissertation]. Tampere University; 2016. Available from: https://trepo.tuni.fi/handle/10024/99577


Vanderbilt University

9. Balasubramanian, Daniel Allen. Behavioral Semantics of Modeling Languages: A Pragmatic Approach.

Degree: PhD, Computer Science, 2011, Vanderbilt University

 Domain-specific modeling languages (DSMLs) are specialized languages tailored with concepts and features of a particular domain. The abstractions offered by DSMLs allow designers of software… (more)

Subjects/Keywords: formal methods; model-based development; Domain-specific languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Balasubramanian, D. A. (2011). Behavioral Semantics of Modeling Languages: A Pragmatic Approach. (Doctoral Dissertation). Vanderbilt University. Retrieved from http://hdl.handle.net/1803/12061

Chicago Manual of Style (16th Edition):

Balasubramanian, Daniel Allen. “Behavioral Semantics of Modeling Languages: A Pragmatic Approach.” 2011. Doctoral Dissertation, Vanderbilt University. Accessed October 30, 2020. http://hdl.handle.net/1803/12061.

MLA Handbook (7th Edition):

Balasubramanian, Daniel Allen. “Behavioral Semantics of Modeling Languages: A Pragmatic Approach.” 2011. Web. 30 Oct 2020.

Vancouver:

Balasubramanian DA. Behavioral Semantics of Modeling Languages: A Pragmatic Approach. [Internet] [Doctoral dissertation]. Vanderbilt University; 2011. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/1803/12061.

Council of Science Editors:

Balasubramanian DA. Behavioral Semantics of Modeling Languages: A Pragmatic Approach. [Doctoral Dissertation]. Vanderbilt University; 2011. Available from: http://hdl.handle.net/1803/12061


Stellenbosch University

10. Mallya, Aurelia. Argument realization, causation and event semantics in Kiwoso.

Degree: DPhil, African Languages, 2016, Stellenbosch University

 ENGLISH ABSTRACT: This study investigates the properties of change of state and change of location/position verbs in relation to argument realization, (anti-)causative alternation, and event… (more)

Subjects/Keywords: Causative (Linguistics); Kiwoso  – Semantics; Formal languages  – Semantics; Argumentation; UCTD

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mallya, A. (2016). Argument realization, causation and event semantics in Kiwoso. (Thesis). Stellenbosch University. Retrieved from http://hdl.handle.net/10019.1/100201

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

Mallya, Aurelia. “Argument realization, causation and event semantics in Kiwoso.” 2016. Thesis, Stellenbosch University. Accessed October 30, 2020. http://hdl.handle.net/10019.1/100201.

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

MLA Handbook (7th Edition):

Mallya, Aurelia. “Argument realization, causation and event semantics in Kiwoso.” 2016. Web. 30 Oct 2020.

Vancouver:

Mallya A. Argument realization, causation and event semantics in Kiwoso. [Internet] [Thesis]. Stellenbosch University; 2016. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/10019.1/100201.

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

Council of Science Editors:

Mallya A. Argument realization, causation and event semantics in Kiwoso. [Thesis]. Stellenbosch University; 2016. Available from: http://hdl.handle.net/10019.1/100201

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


Texas A&M University

11. Kocak, Dilber. Growth of Algebras and Codes.

Degree: PhD, Mathematics, 2016, Texas A&M University

 This dissertation is devoted to the study of the growth of algebras and formal languages. It consists of three parts. The first part is devoted… (more)

Subjects/Keywords: growth of finitely presented algebras; growth of formal languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kocak, D. (2016). Growth of Algebras and Codes. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/157861

Chicago Manual of Style (16th Edition):

Kocak, Dilber. “Growth of Algebras and Codes.” 2016. Doctoral Dissertation, Texas A&M University. Accessed October 30, 2020. http://hdl.handle.net/1969.1/157861.

MLA Handbook (7th Edition):

Kocak, Dilber. “Growth of Algebras and Codes.” 2016. Web. 30 Oct 2020.

Vancouver:

Kocak D. Growth of Algebras and Codes. [Internet] [Doctoral dissertation]. Texas A&M University; 2016. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/1969.1/157861.

Council of Science Editors:

Kocak D. Growth of Algebras and Codes. [Doctoral Dissertation]. Texas A&M University; 2016. Available from: http://hdl.handle.net/1969.1/157861


University of Waterloo

12. Bandali, Amin. A Comprehensive Study of Declarative Modelling Languages.

Degree: 2020, University of Waterloo

 Declarative behavioural modelling is a powerful modelling paradigm that enables users to model system functionality abstractly and formally. An abstract model is a concise and… (more)

Subjects/Keywords: formal methods; model checking; declarative modelling; declarative modelling languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bandali, A. (2020). A Comprehensive Study of Declarative Modelling Languages. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/16059

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

Bandali, Amin. “A Comprehensive Study of Declarative Modelling Languages.” 2020. Thesis, University of Waterloo. Accessed October 30, 2020. http://hdl.handle.net/10012/16059.

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

MLA Handbook (7th Edition):

Bandali, Amin. “A Comprehensive Study of Declarative Modelling Languages.” 2020. Web. 30 Oct 2020.

Vancouver:

Bandali A. A Comprehensive Study of Declarative Modelling Languages. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/10012/16059.

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

Council of Science Editors:

Bandali A. A Comprehensive Study of Declarative Modelling Languages. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/16059

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


University of Waterloo

13. Arteca, Ellen. Formal Semantics and Mechanized Soundness Proof for Fast Gradually Typed JavaScript.

Degree: 2018, University of Waterloo

 As dynamic scripting languages are increasingly used in industry in large-scale projects, a need has arisen for more some of the convenient features of statically… (more)

Subjects/Keywords: Formal semantics; Gradual typing; JavaScript; Soundness proof; Mechanization; Programming languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Arteca, E. (2018). Formal Semantics and Mechanized Soundness Proof for Fast Gradually Typed JavaScript. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13697

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

Arteca, Ellen. “Formal Semantics and Mechanized Soundness Proof for Fast Gradually Typed JavaScript.” 2018. Thesis, University of Waterloo. Accessed October 30, 2020. http://hdl.handle.net/10012/13697.

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

MLA Handbook (7th Edition):

Arteca, Ellen. “Formal Semantics and Mechanized Soundness Proof for Fast Gradually Typed JavaScript.” 2018. Web. 30 Oct 2020.

Vancouver:

Arteca E. Formal Semantics and Mechanized Soundness Proof for Fast Gradually Typed JavaScript. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/10012/13697.

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

Council of Science Editors:

Arteca E. Formal Semantics and Mechanized Soundness Proof for Fast Gradually Typed JavaScript. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13697

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


University of Waterloo

14. Rajasekaran, Aayush. Using Automata Theory to Solve Problems in Additive Number Theory.

Degree: 2018, University of Waterloo

 Additive number theory is the study of the additive properties of integers. Perhaps the best-known theorem is Lagrange’s result that every natural number is the… (more)

Subjects/Keywords: Automata Theory; Number Theory; Formal languages; Automated proofs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rajasekaran, A. (2018). Using Automata Theory to Solve Problems in Additive Number Theory. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13202

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

Rajasekaran, Aayush. “Using Automata Theory to Solve Problems in Additive Number Theory.” 2018. Thesis, University of Waterloo. Accessed October 30, 2020. http://hdl.handle.net/10012/13202.

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

MLA Handbook (7th Edition):

Rajasekaran, Aayush. “Using Automata Theory to Solve Problems in Additive Number Theory.” 2018. Web. 30 Oct 2020.

Vancouver:

Rajasekaran A. Using Automata Theory to Solve Problems in Additive Number Theory. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/10012/13202.

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

Council of Science Editors:

Rajasekaran A. Using Automata Theory to Solve Problems in Additive Number Theory. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13202

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


Universidade Nova

15. Toninho, Bernardo Parente Coutinho Fernandes. A Logic and tool for local reasoning about security protocols.

Degree: 2009, Universidade Nova

Trabalho apresentado no âmbito do Mestrado em Engenharia Informática, como requisito parcial para obtenção do grau de Mestre em Engenharia Informática

This thesis tackles the… (more)

Subjects/Keywords: Protocol analysis; Mathematical logic and formal languages; Spatial logics; Model-checking

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Toninho, B. P. C. F. (2009). A Logic and tool for local reasoning about security protocols. (Thesis). Universidade Nova. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/2307

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

Toninho, Bernardo Parente Coutinho Fernandes. “A Logic and tool for local reasoning about security protocols.” 2009. Thesis, Universidade Nova. Accessed October 30, 2020. http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/2307.

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

MLA Handbook (7th Edition):

Toninho, Bernardo Parente Coutinho Fernandes. “A Logic and tool for local reasoning about security protocols.” 2009. Web. 30 Oct 2020.

Vancouver:

Toninho BPCF. A Logic and tool for local reasoning about security protocols. [Internet] [Thesis]. Universidade Nova; 2009. [cited 2020 Oct 30]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/2307.

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

Council of Science Editors:

Toninho BPCF. A Logic and tool for local reasoning about security protocols. [Thesis]. Universidade Nova; 2009. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/2307

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


Vrije Universiteit Amsterdam

16. Bonzanni, N. Towards Executable Biology .

Degree: 2012, Vrije Universiteit Amsterdam

Subjects/Keywords: computational biology formal languages modelling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bonzanni, N. (2012). Towards Executable Biology . (Doctoral Dissertation). Vrije Universiteit Amsterdam. Retrieved from http://hdl.handle.net/1871/38586

Chicago Manual of Style (16th Edition):

Bonzanni, N. “Towards Executable Biology .” 2012. Doctoral Dissertation, Vrije Universiteit Amsterdam. Accessed October 30, 2020. http://hdl.handle.net/1871/38586.

MLA Handbook (7th Edition):

Bonzanni, N. “Towards Executable Biology .” 2012. Web. 30 Oct 2020.

Vancouver:

Bonzanni N. Towards Executable Biology . [Internet] [Doctoral dissertation]. Vrije Universiteit Amsterdam; 2012. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/1871/38586.

Council of Science Editors:

Bonzanni N. Towards Executable Biology . [Doctoral Dissertation]. Vrije Universiteit Amsterdam; 2012. Available from: http://hdl.handle.net/1871/38586


University of St Andrews

17. Hoffmann, Ruth. On dots in boxes, or permutation pattern classes and regular languages.

Degree: PhD, 2015, University of St Andrews

 This thesis investigates permutation pattern classes in a language theoretic context. Specifically we explored the regularity of sets of permutations under the rank encoding. We… (more)

Subjects/Keywords: 005.7; QA76.9M35H7; Computer science – Mathematics; Formal languages; Permutations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hoffmann, R. (2015). On dots in boxes, or permutation pattern classes and regular languages. (Doctoral Dissertation). University of St Andrews. Retrieved from http://hdl.handle.net/10023/7034

Chicago Manual of Style (16th Edition):

Hoffmann, Ruth. “On dots in boxes, or permutation pattern classes and regular languages.” 2015. Doctoral Dissertation, University of St Andrews. Accessed October 30, 2020. http://hdl.handle.net/10023/7034.

MLA Handbook (7th Edition):

Hoffmann, Ruth. “On dots in boxes, or permutation pattern classes and regular languages.” 2015. Web. 30 Oct 2020.

Vancouver:

Hoffmann R. On dots in boxes, or permutation pattern classes and regular languages. [Internet] [Doctoral dissertation]. University of St Andrews; 2015. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/10023/7034.

Council of Science Editors:

Hoffmann R. On dots in boxes, or permutation pattern classes and regular languages. [Doctoral Dissertation]. University of St Andrews; 2015. Available from: http://hdl.handle.net/10023/7034


Hong Kong University of Science and Technology

18. Ho, Man Chi. A survey of Greibach normal form : transformation & analysis.

Degree: 2006, Hong Kong University of Science and Technology

 Context-free grammar transformations have been explored over the past 30 years or so - before the birth of the first personal computer! The idea of… (more)

Subjects/Keywords: Formal languages ; Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ho, M. C. (2006). A survey of Greibach normal form : transformation & analysis. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-5823 ; https://doi.org/10.14711/thesis-b924399 ; http://repository.ust.hk/ir/bitstream/1783.1-5823/1/th_redirect.html

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

Ho, Man Chi. “A survey of Greibach normal form : transformation & analysis.” 2006. Thesis, Hong Kong University of Science and Technology. Accessed October 30, 2020. http://repository.ust.hk/ir/Record/1783.1-5823 ; https://doi.org/10.14711/thesis-b924399 ; http://repository.ust.hk/ir/bitstream/1783.1-5823/1/th_redirect.html.

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

MLA Handbook (7th Edition):

Ho, Man Chi. “A survey of Greibach normal form : transformation & analysis.” 2006. Web. 30 Oct 2020.

Vancouver:

Ho MC. A survey of Greibach normal form : transformation & analysis. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2006. [cited 2020 Oct 30]. Available from: http://repository.ust.hk/ir/Record/1783.1-5823 ; https://doi.org/10.14711/thesis-b924399 ; http://repository.ust.hk/ir/bitstream/1783.1-5823/1/th_redirect.html.

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

Council of Science Editors:

Ho MC. A survey of Greibach normal form : transformation & analysis. [Thesis]. Hong Kong University of Science and Technology; 2006. Available from: http://repository.ust.hk/ir/Record/1783.1-5823 ; https://doi.org/10.14711/thesis-b924399 ; http://repository.ust.hk/ir/bitstream/1783.1-5823/1/th_redirect.html

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


University of Toronto

19. Kincaid, Zachary. Parallel Proofs for Parallel Programs.

Degree: PhD, 2016, University of Toronto

 This dissertation addresses the problem of automated reasoning about multi-threaded programs. Multi-threaded programs are notoriously prone to error, making them an attractive target for formal(more)

Subjects/Keywords: Concurrency; Formal methods; Program analysis; Programming languages; Software verification; 0984

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kincaid, Z. (2016). Parallel Proofs for Parallel Programs. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/76470

Chicago Manual of Style (16th Edition):

Kincaid, Zachary. “Parallel Proofs for Parallel Programs.” 2016. Doctoral Dissertation, University of Toronto. Accessed October 30, 2020. http://hdl.handle.net/1807/76470.

MLA Handbook (7th Edition):

Kincaid, Zachary. “Parallel Proofs for Parallel Programs.” 2016. Web. 30 Oct 2020.

Vancouver:

Kincaid Z. Parallel Proofs for Parallel Programs. [Internet] [Doctoral dissertation]. University of Toronto; 2016. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/1807/76470.

Council of Science Editors:

Kincaid Z. Parallel Proofs for Parallel Programs. [Doctoral Dissertation]. University of Toronto; 2016. Available from: http://hdl.handle.net/1807/76470


University of South Florida

20. Ray, Donald. Defining and Preventing Code-injection Attacks.

Degree: 2013, University of South Florida

 This thesis shows that existing definitions of code-injection attacks (e.g., SQL-injection attacks) are flawed. The flaws make it possible for attackers to circumvent existing mechanisms,… (more)

Subjects/Keywords: Algorithms; Formal definitions; Parsing; Programming languages; Security; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ray, D. (2013). Defining and Preventing Code-injection Attacks. (Thesis). University of South Florida. Retrieved from https://scholarcommons.usf.edu/etd/4566

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

Ray, Donald. “Defining and Preventing Code-injection Attacks.” 2013. Thesis, University of South Florida. Accessed October 30, 2020. https://scholarcommons.usf.edu/etd/4566.

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

MLA Handbook (7th Edition):

Ray, Donald. “Defining and Preventing Code-injection Attacks.” 2013. Web. 30 Oct 2020.

Vancouver:

Ray D. Defining and Preventing Code-injection Attacks. [Internet] [Thesis]. University of South Florida; 2013. [cited 2020 Oct 30]. Available from: https://scholarcommons.usf.edu/etd/4566.

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

Council of Science Editors:

Ray D. Defining and Preventing Code-injection Attacks. [Thesis]. University of South Florida; 2013. Available from: https://scholarcommons.usf.edu/etd/4566

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

21. Bonzanni, N. Towards Executable Biology.

Degree: 2012, VU University

Subjects/Keywords: computational biology formal languages modelling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bonzanni, N. (2012). Towards Executable Biology. (Doctoral Dissertation). VU University. Retrieved from https://research.vu.nl/en/publications/701a8316-f935-4569-bbc9-d1be02d82016 ; urn:nbn:nl:ui:31-1871/38586 ; 701a8316-f935-4569-bbc9-d1be02d82016 ; 1871/38586 ; urn:isbn:9789462031562 ; urn:nbn:nl:ui:31-1871/38586 ; https://research.vu.nl/en/publications/701a8316-f935-4569-bbc9-d1be02d82016

Chicago Manual of Style (16th Edition):

Bonzanni, N. “Towards Executable Biology.” 2012. Doctoral Dissertation, VU University. Accessed October 30, 2020. https://research.vu.nl/en/publications/701a8316-f935-4569-bbc9-d1be02d82016 ; urn:nbn:nl:ui:31-1871/38586 ; 701a8316-f935-4569-bbc9-d1be02d82016 ; 1871/38586 ; urn:isbn:9789462031562 ; urn:nbn:nl:ui:31-1871/38586 ; https://research.vu.nl/en/publications/701a8316-f935-4569-bbc9-d1be02d82016.

MLA Handbook (7th Edition):

Bonzanni, N. “Towards Executable Biology.” 2012. Web. 30 Oct 2020.

Vancouver:

Bonzanni N. Towards Executable Biology. [Internet] [Doctoral dissertation]. VU University; 2012. [cited 2020 Oct 30]. Available from: https://research.vu.nl/en/publications/701a8316-f935-4569-bbc9-d1be02d82016 ; urn:nbn:nl:ui:31-1871/38586 ; 701a8316-f935-4569-bbc9-d1be02d82016 ; 1871/38586 ; urn:isbn:9789462031562 ; urn:nbn:nl:ui:31-1871/38586 ; https://research.vu.nl/en/publications/701a8316-f935-4569-bbc9-d1be02d82016.

Council of Science Editors:

Bonzanni N. Towards Executable Biology. [Doctoral Dissertation]. VU University; 2012. Available from: https://research.vu.nl/en/publications/701a8316-f935-4569-bbc9-d1be02d82016 ; urn:nbn:nl:ui:31-1871/38586 ; 701a8316-f935-4569-bbc9-d1be02d82016 ; 1871/38586 ; urn:isbn:9789462031562 ; urn:nbn:nl:ui:31-1871/38586 ; https://research.vu.nl/en/publications/701a8316-f935-4569-bbc9-d1be02d82016


Universitat de Valencia

22. Cosme i Llópez, Enric. Some Contributions to the Algebraic Theory of Automata .

Degree: 2015, Universitat de Valencia

 En el present treball estudiarem els autòmats des d'una perspectiva tant algebraica com coalgebraica. Volem aprofitar la natura dual d'aquests objectes per a presentar un… (more)

Subjects/Keywords: semigroups; automata; formal languages; formations; congruences; monoid; duality

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cosme i Llópez, E. (2015). Some Contributions to the Algebraic Theory of Automata . (Doctoral Dissertation). Universitat de Valencia. Retrieved from http://hdl.handle.net/10550/47933

Chicago Manual of Style (16th Edition):

Cosme i Llópez, Enric. “Some Contributions to the Algebraic Theory of Automata .” 2015. Doctoral Dissertation, Universitat de Valencia. Accessed October 30, 2020. http://hdl.handle.net/10550/47933.

MLA Handbook (7th Edition):

Cosme i Llópez, Enric. “Some Contributions to the Algebraic Theory of Automata .” 2015. Web. 30 Oct 2020.

Vancouver:

Cosme i Llópez E. Some Contributions to the Algebraic Theory of Automata . [Internet] [Doctoral dissertation]. Universitat de Valencia; 2015. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/10550/47933.

Council of Science Editors:

Cosme i Llópez E. Some Contributions to the Algebraic Theory of Automata . [Doctoral Dissertation]. Universitat de Valencia; 2015. Available from: http://hdl.handle.net/10550/47933


Loughborough University

23. Caswell, Matthew J. A. The action semantics of object-oriented languages.

Degree: PhD, 1998, Loughborough University

 Action Semantics is a framework for defining the semantics of languages. It is intended to be accessible to a wider audience of Computer Scientists than… (more)

Subjects/Keywords: 005; Programming languages; Formal methods

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Caswell, M. J. A. (1998). The action semantics of object-oriented languages. (Doctoral Dissertation). Loughborough University. Retrieved from http://hdl.handle.net/2134/28283

Chicago Manual of Style (16th Edition):

Caswell, Matthew J A. “The action semantics of object-oriented languages.” 1998. Doctoral Dissertation, Loughborough University. Accessed October 30, 2020. http://hdl.handle.net/2134/28283.

MLA Handbook (7th Edition):

Caswell, Matthew J A. “The action semantics of object-oriented languages.” 1998. Web. 30 Oct 2020.

Vancouver:

Caswell MJA. The action semantics of object-oriented languages. [Internet] [Doctoral dissertation]. Loughborough University; 1998. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/2134/28283.

Council of Science Editors:

Caswell MJA. The action semantics of object-oriented languages. [Doctoral Dissertation]. Loughborough University; 1998. Available from: http://hdl.handle.net/2134/28283


University of Waterloo

24. Berzish, Murphy. A Software Toolchain for Physical System Description and Synthesis, and Applications to Microfluidic Design Automation.

Degree: 2016, University of Waterloo

 Microfluidic circuits are currently designed by hand, using a combination of the designer’s domain knowledge and educated intuition to determine unknown design parameters. As no… (more)

Subjects/Keywords: programming languages; microfluidics; design automation; constraint solvers; formal verification

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Berzish, M. (2016). A Software Toolchain for Physical System Description and Synthesis, and Applications to Microfluidic Design Automation. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10457

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

Berzish, Murphy. “A Software Toolchain for Physical System Description and Synthesis, and Applications to Microfluidic Design Automation.” 2016. Thesis, University of Waterloo. Accessed October 30, 2020. http://hdl.handle.net/10012/10457.

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

MLA Handbook (7th Edition):

Berzish, Murphy. “A Software Toolchain for Physical System Description and Synthesis, and Applications to Microfluidic Design Automation.” 2016. Web. 30 Oct 2020.

Vancouver:

Berzish M. A Software Toolchain for Physical System Description and Synthesis, and Applications to Microfluidic Design Automation. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/10012/10457.

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

Council of Science Editors:

Berzish M. A Software Toolchain for Physical System Description and Synthesis, and Applications to Microfluidic Design Automation. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/10457

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


University of Pennsylvania

25. Rand, Robert. Formally Verified Quantum Programming.

Degree: 2018, University of Pennsylvania

 The field of quantum mechanics predates computer science by at least ten years, the time between the publication of the Schrodinger equation and the Church-Turing… (more)

Subjects/Keywords: formal verification; programming languages; quantum computing; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rand, R. (2018). Formally Verified Quantum Programming. (Thesis). University of Pennsylvania. Retrieved from https://repository.upenn.edu/edissertations/3175

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

Rand, Robert. “Formally Verified Quantum Programming.” 2018. Thesis, University of Pennsylvania. Accessed October 30, 2020. https://repository.upenn.edu/edissertations/3175.

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

MLA Handbook (7th Edition):

Rand, Robert. “Formally Verified Quantum Programming.” 2018. Web. 30 Oct 2020.

Vancouver:

Rand R. Formally Verified Quantum Programming. [Internet] [Thesis]. University of Pennsylvania; 2018. [cited 2020 Oct 30]. Available from: https://repository.upenn.edu/edissertations/3175.

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

Council of Science Editors:

Rand R. Formally Verified Quantum Programming. [Thesis]. University of Pennsylvania; 2018. Available from: https://repository.upenn.edu/edissertations/3175

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


Princeton University

26. Savary Bélanger, Olivier. Verified Extraction for Coq .

Degree: PhD, 2019, Princeton University

 Interactive theorem provers allow for the development, in the same environment, of programs and of proofs about them. The programmatic portion of the development can… (more)

Subjects/Keywords: Compilers; Extraction; Formal software verification; Functional Languages; Program verification

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Savary Bélanger, O. (2019). Verified Extraction for Coq . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp01zw12z817f

Chicago Manual of Style (16th Edition):

Savary Bélanger, Olivier. “Verified Extraction for Coq .” 2019. Doctoral Dissertation, Princeton University. Accessed October 30, 2020. http://arks.princeton.edu/ark:/88435/dsp01zw12z817f.

MLA Handbook (7th Edition):

Savary Bélanger, Olivier. “Verified Extraction for Coq .” 2019. Web. 30 Oct 2020.

Vancouver:

Savary Bélanger O. Verified Extraction for Coq . [Internet] [Doctoral dissertation]. Princeton University; 2019. [cited 2020 Oct 30]. Available from: http://arks.princeton.edu/ark:/88435/dsp01zw12z817f.

Council of Science Editors:

Savary Bélanger O. Verified Extraction for Coq . [Doctoral Dissertation]. Princeton University; 2019. Available from: http://arks.princeton.edu/ark:/88435/dsp01zw12z817f


Princeton University

27. Cuellar, Santiago. Concurrent Permission Machine for modular proofs of optimizing compilers with shared memory concurrency.

Degree: PhD, 2020, Princeton University

 Optimizing compilers change a program based on a formal analysis of its code, and modern processors further rearrange the program order. It is hard to… (more)

Subjects/Keywords: Compilers; Concurrency; Formal methods; Machine-checked proofs; Programming Languages; Software safety

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cuellar, S. (2020). Concurrent Permission Machine for modular proofs of optimizing compilers with shared memory concurrency. (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp01qr46r378d

Chicago Manual of Style (16th Edition):

Cuellar, Santiago. “Concurrent Permission Machine for modular proofs of optimizing compilers with shared memory concurrency. ” 2020. Doctoral Dissertation, Princeton University. Accessed October 30, 2020. http://arks.princeton.edu/ark:/88435/dsp01qr46r378d.

MLA Handbook (7th Edition):

Cuellar, Santiago. “Concurrent Permission Machine for modular proofs of optimizing compilers with shared memory concurrency. ” 2020. Web. 30 Oct 2020.

Vancouver:

Cuellar S. Concurrent Permission Machine for modular proofs of optimizing compilers with shared memory concurrency. [Internet] [Doctoral dissertation]. Princeton University; 2020. [cited 2020 Oct 30]. Available from: http://arks.princeton.edu/ark:/88435/dsp01qr46r378d.

Council of Science Editors:

Cuellar S. Concurrent Permission Machine for modular proofs of optimizing compilers with shared memory concurrency. [Doctoral Dissertation]. Princeton University; 2020. Available from: http://arks.princeton.edu/ark:/88435/dsp01qr46r378d


California State University – Sacramento

28. George, Nixon Sunny. FOZCIL: a framework for converting formal specifications in Object-Z to design contracts in OO programming languages.

Degree: MS, Computer Science, 2010, California State University – Sacramento

Formal languages use mathematical notations to capture the software specifications precisely. Design by Contract is a technique used during software implementation to ensure that the… (more)

Subjects/Keywords: Formal methods; Design by contract; Formal languages; Z language

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

George, N. S. (2010). FOZCIL: a framework for converting formal specifications in Object-Z to design contracts in OO programming languages. (Masters Thesis). California State University – Sacramento. Retrieved from http://hdl.handle.net/10211.9/204

Chicago Manual of Style (16th Edition):

George, Nixon Sunny. “FOZCIL: a framework for converting formal specifications in Object-Z to design contracts in OO programming languages.” 2010. Masters Thesis, California State University – Sacramento. Accessed October 30, 2020. http://hdl.handle.net/10211.9/204.

MLA Handbook (7th Edition):

George, Nixon Sunny. “FOZCIL: a framework for converting formal specifications in Object-Z to design contracts in OO programming languages.” 2010. Web. 30 Oct 2020.

Vancouver:

George NS. FOZCIL: a framework for converting formal specifications in Object-Z to design contracts in OO programming languages. [Internet] [Masters thesis]. California State University – Sacramento; 2010. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/10211.9/204.

Council of Science Editors:

George NS. FOZCIL: a framework for converting formal specifications in Object-Z to design contracts in OO programming languages. [Masters Thesis]. California State University – Sacramento; 2010. Available from: http://hdl.handle.net/10211.9/204


University of Waterloo

29. Davies, Sylvie. Algebraic Approaches to State Complexity of Regular Operations.

Degree: 2019, University of Waterloo

 The state complexity of operations on regular languages is an active area of research in theoretical computer science. Through connections with algebra, particularly the theory… (more)

Subjects/Keywords: formal languages; regular languages; finite automata; abstract algebra; group theory; monoid theory; groups; monoids; automata; state complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Davies, S. (2019). Algebraic Approaches to State Complexity of Regular Operations. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/15203

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

Davies, Sylvie. “Algebraic Approaches to State Complexity of Regular Operations.” 2019. Thesis, University of Waterloo. Accessed October 30, 2020. http://hdl.handle.net/10012/15203.

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

MLA Handbook (7th Edition):

Davies, Sylvie. “Algebraic Approaches to State Complexity of Regular Operations.” 2019. Web. 30 Oct 2020.

Vancouver:

Davies S. Algebraic Approaches to State Complexity of Regular Operations. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/10012/15203.

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

Council of Science Editors:

Davies S. Algebraic Approaches to State Complexity of Regular Operations. [Thesis]. University of Waterloo; 2019. Available from: http://hdl.handle.net/10012/15203

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


University of Waterloo

30. Krawetz, Bryan. Monoids and the State Complexity of the Operation root(<i>L</i>).

Degree: 2004, University of Waterloo

 In this thesis, we cover the general topic of state complexity. In particular, we examine the bounds on the state complexity of some different representations… (more)

Subjects/Keywords: Computer Science; state complexity; monoids; formal languages; regular languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Krawetz, B. (2004). Monoids and the State Complexity of the Operation root(<i>L</i>). (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/1034

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

Krawetz, Bryan. “Monoids and the State Complexity of the Operation root(<i>L</i>).” 2004. Thesis, University of Waterloo. Accessed October 30, 2020. http://hdl.handle.net/10012/1034.

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

MLA Handbook (7th Edition):

Krawetz, Bryan. “Monoids and the State Complexity of the Operation root(<i>L</i>).” 2004. Web. 30 Oct 2020.

Vancouver:

Krawetz B. Monoids and the State Complexity of the Operation root(<i>L</i>). [Internet] [Thesis]. University of Waterloo; 2004. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/10012/1034.

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

Council of Science Editors:

Krawetz B. Monoids and the State Complexity of the Operation root(<i>L</i>). [Thesis]. University of Waterloo; 2004. Available from: http://hdl.handle.net/10012/1034

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

[1] [2] [3] [4] [5] [6]

.