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:(Compilers Computer programs ). Showing records 1 – 30 of 100558 total matches.

[1] [2] [3] [4] [5] … [3352]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


Massey University

1. Niedzielski, David. Analysis and application of Fourier-Motzkin variable elimination to program optimization.

Degree: PhD, Computer Science, 2019, Massey University

 This thesis examines four of the most influential dependence analysis techniques in use by optimizing compilers: Fourier-Motzkin Variable Elimination, the Banerjee Bounds Test, the Omega… (more)

Subjects/Keywords: Compilers (Computer programs); Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Niedzielski, D. (2019). Analysis and application of Fourier-Motzkin variable elimination to program optimization. (Doctoral Dissertation). Massey University. Retrieved from http://hdl.handle.net/10179/15410

Chicago Manual of Style (16th Edition):

Niedzielski, David. “Analysis and application of Fourier-Motzkin variable elimination to program optimization.” 2019. Doctoral Dissertation, Massey University. Accessed October 27, 2020. http://hdl.handle.net/10179/15410.

MLA Handbook (7th Edition):

Niedzielski, David. “Analysis and application of Fourier-Motzkin variable elimination to program optimization.” 2019. Web. 27 Oct 2020.

Vancouver:

Niedzielski D. Analysis and application of Fourier-Motzkin variable elimination to program optimization. [Internet] [Doctoral dissertation]. Massey University; 2019. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/10179/15410.

Council of Science Editors:

Niedzielski D. Analysis and application of Fourier-Motzkin variable elimination to program optimization. [Doctoral Dissertation]. Massey University; 2019. Available from: http://hdl.handle.net/10179/15410


Oregon State University

2. Wilde, Doran K. From ALPHA to imperative code : a transformational compiler for an array based functional language.

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

 Practical parallel programming demands that the details of distributing data to processors and inter- processor communication be managed by the compiler. These tasks quickly become… (more)

Subjects/Keywords: Compilers (Computer programs)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wilde, D. K. (1995). From ALPHA to imperative code : a transformational compiler for an array based functional language. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/10309

Chicago Manual of Style (16th Edition):

Wilde, Doran K. “From ALPHA to imperative code : a transformational compiler for an array based functional language.” 1995. Doctoral Dissertation, Oregon State University. Accessed October 27, 2020. http://hdl.handle.net/1957/10309.

MLA Handbook (7th Edition):

Wilde, Doran K. “From ALPHA to imperative code : a transformational compiler for an array based functional language.” 1995. Web. 27 Oct 2020.

Vancouver:

Wilde DK. From ALPHA to imperative code : a transformational compiler for an array based functional language. [Internet] [Doctoral dissertation]. Oregon State University; 1995. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/1957/10309.

Council of Science Editors:

Wilde DK. From ALPHA to imperative code : a transformational compiler for an array based functional language. [Doctoral Dissertation]. Oregon State University; 1995. Available from: http://hdl.handle.net/1957/10309


Oregon State University

3. Venkatachalapathy, Savithri H. Porting GCC to X32V architecture.

Degree: MS, Electrical and Computer Engineering, 2004, Oregon State University

 This thesis work evaluates the need for a re-configurable cross compiler for the X32V processor architecture and discusses the process of developing a cross compiler… (more)

Subjects/Keywords: Compilers (Computer programs)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Venkatachalapathy, S. H. (2004). Porting GCC to X32V architecture. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/11792

Chicago Manual of Style (16th Edition):

Venkatachalapathy, Savithri H. “Porting GCC to X32V architecture.” 2004. Masters Thesis, Oregon State University. Accessed October 27, 2020. http://hdl.handle.net/1957/11792.

MLA Handbook (7th Edition):

Venkatachalapathy, Savithri H. “Porting GCC to X32V architecture.” 2004. Web. 27 Oct 2020.

Vancouver:

Venkatachalapathy SH. Porting GCC to X32V architecture. [Internet] [Masters thesis]. Oregon State University; 2004. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/1957/11792.

Council of Science Editors:

Venkatachalapathy SH. Porting GCC to X32V architecture. [Masters Thesis]. Oregon State University; 2004. Available from: http://hdl.handle.net/1957/11792


University of Alberta

4. Ng, Randy W. G. LexAGen – a lexical-analyzer generator.

Degree: MS, Department of Computing Science, 1988, University of Alberta

Subjects/Keywords: Compilers (Computer programs)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ng, R. W. G. (1988). LexAGen – a lexical-analyzer generator. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/n583xw82r

Chicago Manual of Style (16th Edition):

Ng, Randy W G. “LexAGen – a lexical-analyzer generator.” 1988. Masters Thesis, University of Alberta. Accessed October 27, 2020. https://era.library.ualberta.ca/files/n583xw82r.

MLA Handbook (7th Edition):

Ng, Randy W G. “LexAGen – a lexical-analyzer generator.” 1988. Web. 27 Oct 2020.

Vancouver:

Ng RWG. LexAGen – a lexical-analyzer generator. [Internet] [Masters thesis]. University of Alberta; 1988. [cited 2020 Oct 27]. Available from: https://era.library.ualberta.ca/files/n583xw82r.

Council of Science Editors:

Ng RWG. LexAGen – a lexical-analyzer generator. [Masters Thesis]. University of Alberta; 1988. Available from: https://era.library.ualberta.ca/files/n583xw82r


Oregon State University

5. Wilde, Doran K. A library for doing polyhedral operations.

Degree: MS, Computer Science, 1993, Oregon State University

 Polyhedra are geometric representations of linear systems of equations and inequalities. Since polyhedra are used to represent the iteration domains of nested loop programs, procedures… (more)

Subjects/Keywords: Compilers (Computer programs)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wilde, D. K. (1993). A library for doing polyhedral operations. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/37202

Chicago Manual of Style (16th Edition):

Wilde, Doran K. “A library for doing polyhedral operations.” 1993. Masters Thesis, Oregon State University. Accessed October 27, 2020. http://hdl.handle.net/1957/37202.

MLA Handbook (7th Edition):

Wilde, Doran K. “A library for doing polyhedral operations.” 1993. Web. 27 Oct 2020.

Vancouver:

Wilde DK. A library for doing polyhedral operations. [Internet] [Masters thesis]. Oregon State University; 1993. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/1957/37202.

Council of Science Editors:

Wilde DK. A library for doing polyhedral operations. [Masters Thesis]. Oregon State University; 1993. Available from: http://hdl.handle.net/1957/37202


University of Arizona

6. Walker, Kenneth William. The implementation of an optimizing compiler for Icon.

Degree: 1991, University of Arizona

 There are many optimizations that can be applied while translating Icon programs. These optimizations and the analyses needed to apply them are of interest for… (more)

Subjects/Keywords: Compilers (Computer programs)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Walker, K. W. (1991). The implementation of an optimizing compiler for Icon. (Doctoral Dissertation). University of Arizona. Retrieved from http://hdl.handle.net/10150/185599

Chicago Manual of Style (16th Edition):

Walker, Kenneth William. “The implementation of an optimizing compiler for Icon. ” 1991. Doctoral Dissertation, University of Arizona. Accessed October 27, 2020. http://hdl.handle.net/10150/185599.

MLA Handbook (7th Edition):

Walker, Kenneth William. “The implementation of an optimizing compiler for Icon. ” 1991. Web. 27 Oct 2020.

Vancouver:

Walker KW. The implementation of an optimizing compiler for Icon. [Internet] [Doctoral dissertation]. University of Arizona; 1991. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/10150/185599.

Council of Science Editors:

Walker KW. The implementation of an optimizing compiler for Icon. [Doctoral Dissertation]. University of Arizona; 1991. Available from: http://hdl.handle.net/10150/185599


Montana State University

7. Gullberg, Per Erik. Code generation and execution of a hypothetical machine.

Degree: MS, College of Engineering, 1995, Montana State University

Subjects/Keywords: Compilers (Computer programs)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gullberg, P. E. (1995). Code generation and execution of a hypothetical machine. (Masters Thesis). Montana State University. Retrieved from https://scholarworks.montana.edu/xmlui/handle/1/7347

Chicago Manual of Style (16th Edition):

Gullberg, Per Erik. “Code generation and execution of a hypothetical machine.” 1995. Masters Thesis, Montana State University. Accessed October 27, 2020. https://scholarworks.montana.edu/xmlui/handle/1/7347.

MLA Handbook (7th Edition):

Gullberg, Per Erik. “Code generation and execution of a hypothetical machine.” 1995. Web. 27 Oct 2020.

Vancouver:

Gullberg PE. Code generation and execution of a hypothetical machine. [Internet] [Masters thesis]. Montana State University; 1995. [cited 2020 Oct 27]. Available from: https://scholarworks.montana.edu/xmlui/handle/1/7347.

Council of Science Editors:

Gullberg PE. Code generation and execution of a hypothetical machine. [Masters Thesis]. Montana State University; 1995. Available from: https://scholarworks.montana.edu/xmlui/handle/1/7347


Simon Fraser University

8. Merks, Eduardus Antonius Theodorus. Compilation using multiple source-to-source stages.

Degree: 1987, Simon Fraser University

Subjects/Keywords: Compilers (Computer programs)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Merks, E. A. T. (1987). Compilation using multiple source-to-source stages. (Thesis). Simon Fraser University. Retrieved from http://summit.sfu.ca/item/5358

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

Merks, Eduardus Antonius Theodorus. “Compilation using multiple source-to-source stages.” 1987. Thesis, Simon Fraser University. Accessed October 27, 2020. http://summit.sfu.ca/item/5358.

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

MLA Handbook (7th Edition):

Merks, Eduardus Antonius Theodorus. “Compilation using multiple source-to-source stages.” 1987. Web. 27 Oct 2020.

Vancouver:

Merks EAT. Compilation using multiple source-to-source stages. [Internet] [Thesis]. Simon Fraser University; 1987. [cited 2020 Oct 27]. Available from: http://summit.sfu.ca/item/5358.

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

Council of Science Editors:

Merks EAT. Compilation using multiple source-to-source stages. [Thesis]. Simon Fraser University; 1987. Available from: http://summit.sfu.ca/item/5358

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


Columbia University

9. Petsios, Theofilos. Compiler-assisted Adaptive Software Testing.

Degree: 2018, Columbia University

 Modern software is becoming increasingly complex and is plagued with vulnerabilities that are constantly exploited by attackers. The vast numbers of bugs found in security-critical… (more)

Subjects/Keywords: Computer science; Compilers (Computer programs); Computer software – Testing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Petsios, T. (2018). Compiler-assisted Adaptive Software Testing. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D8M05NGN

Chicago Manual of Style (16th Edition):

Petsios, Theofilos. “Compiler-assisted Adaptive Software Testing.” 2018. Doctoral Dissertation, Columbia University. Accessed October 27, 2020. https://doi.org/10.7916/D8M05NGN.

MLA Handbook (7th Edition):

Petsios, Theofilos. “Compiler-assisted Adaptive Software Testing.” 2018. Web. 27 Oct 2020.

Vancouver:

Petsios T. Compiler-assisted Adaptive Software Testing. [Internet] [Doctoral dissertation]. Columbia University; 2018. [cited 2020 Oct 27]. Available from: https://doi.org/10.7916/D8M05NGN.

Council of Science Editors:

Petsios T. Compiler-assisted Adaptive Software Testing. [Doctoral Dissertation]. Columbia University; 2018. Available from: https://doi.org/10.7916/D8M05NGN


Universidade Federal de Mato Grosso do Sul

10. Silva, Lucas da Costa. Algoritmos para escalonamento de instruções e alocação de registradores na infraestrutura LLVM .

Degree: 2013, Universidade Federal de Mato Grosso do Sul

 O objetivo deste trabalho _e apresentar uma proposta integrada para Escalonamento de Instruções e Alocação de Registradores baseada em Isomorfismo de Subgrafos implementada no compilador… (more)

Subjects/Keywords: Compiladores (Programas de Computador); Algorítmos Computacionais; Compilers (Computer Programs); Computer Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Silva, L. d. C. (2013). Algoritmos para escalonamento de instruções e alocação de registradores na infraestrutura LLVM . (Thesis). Universidade Federal de Mato Grosso do Sul. Retrieved from http://repositorio.cbc.ufms.br:8080/jspui/handle/123456789/2209

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

Silva, Lucas da Costa. “Algoritmos para escalonamento de instruções e alocação de registradores na infraestrutura LLVM .” 2013. Thesis, Universidade Federal de Mato Grosso do Sul. Accessed October 27, 2020. http://repositorio.cbc.ufms.br:8080/jspui/handle/123456789/2209.

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

MLA Handbook (7th Edition):

Silva, Lucas da Costa. “Algoritmos para escalonamento de instruções e alocação de registradores na infraestrutura LLVM .” 2013. Web. 27 Oct 2020.

Vancouver:

Silva LdC. Algoritmos para escalonamento de instruções e alocação de registradores na infraestrutura LLVM . [Internet] [Thesis]. Universidade Federal de Mato Grosso do Sul; 2013. [cited 2020 Oct 27]. Available from: http://repositorio.cbc.ufms.br:8080/jspui/handle/123456789/2209.

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

Council of Science Editors:

Silva LdC. Algoritmos para escalonamento de instruções e alocação de registradores na infraestrutura LLVM . [Thesis]. Universidade Federal de Mato Grosso do Sul; 2013. Available from: http://repositorio.cbc.ufms.br:8080/jspui/handle/123456789/2209

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


University of Delaware

11. Park, Eun Jung. Automatic selection of compiler optimizations using program characterization and machine learning.

Degree: PhD, University of Delaware, Department of Computer and Information Sciences, 2015, University of Delaware

 It has been shown that machine-learning driven optimizations often outperform bundled optimizations or human-constructed heuristics in selecting suitable optimizations for particular classes of applications. In… (more)

Subjects/Keywords: Program transformation (Computer programming); Optimizing compilers.; Computer programs.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Park, E. J. (2015). Automatic selection of compiler optimizations using program characterization and machine learning. (Doctoral Dissertation). University of Delaware. Retrieved from http://udspace.udel.edu/handle/19716/17000

Chicago Manual of Style (16th Edition):

Park, Eun Jung. “Automatic selection of compiler optimizations using program characterization and machine learning.” 2015. Doctoral Dissertation, University of Delaware. Accessed October 27, 2020. http://udspace.udel.edu/handle/19716/17000.

MLA Handbook (7th Edition):

Park, Eun Jung. “Automatic selection of compiler optimizations using program characterization and machine learning.” 2015. Web. 27 Oct 2020.

Vancouver:

Park EJ. Automatic selection of compiler optimizations using program characterization and machine learning. [Internet] [Doctoral dissertation]. University of Delaware; 2015. [cited 2020 Oct 27]. Available from: http://udspace.udel.edu/handle/19716/17000.

Council of Science Editors:

Park EJ. Automatic selection of compiler optimizations using program characterization and machine learning. [Doctoral Dissertation]. University of Delaware; 2015. Available from: http://udspace.udel.edu/handle/19716/17000


University of Adelaide

12. Biglari-Abhari, Morteza. Performance improvement through predicated execution in VLIW machines / Morteza Biglari-Abhari.

Degree: 2000, University of Adelaide

Investigates techniques to achieve performance improvement in Very Long Instruction Word machines through predicated execution. Advisors/Committee Members: Dept. of Electrical and Electronic Engineering (school).

Subjects/Keywords: Compilers (Computer programs); Computer architecture

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Biglari-Abhari, M. (2000). Performance improvement through predicated execution in VLIW machines / Morteza Biglari-Abhari. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/19730

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

Biglari-Abhari, Morteza. “Performance improvement through predicated execution in VLIW machines / Morteza Biglari-Abhari.” 2000. Thesis, University of Adelaide. Accessed October 27, 2020. http://hdl.handle.net/2440/19730.

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

MLA Handbook (7th Edition):

Biglari-Abhari, Morteza. “Performance improvement through predicated execution in VLIW machines / Morteza Biglari-Abhari.” 2000. Web. 27 Oct 2020.

Vancouver:

Biglari-Abhari M. Performance improvement through predicated execution in VLIW machines / Morteza Biglari-Abhari. [Internet] [Thesis]. University of Adelaide; 2000. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/2440/19730.

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

Council of Science Editors:

Biglari-Abhari M. Performance improvement through predicated execution in VLIW machines / Morteza Biglari-Abhari. [Thesis]. University of Adelaide; 2000. Available from: http://hdl.handle.net/2440/19730

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


University of St Andrews

13. Junaidu, Sahalu B. A parallel functional language compiler for message-passing multicomputers.

Degree: PhD, 1998, University of St Andrews

 The research presented in this thesis is about the design and implementation of Naira, a parallel, parallelising compiler for a rich, purely functional programming language.… (more)

Subjects/Keywords: 005.4; QA76.76C65J9; Compilers (Computer Programs)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Junaidu, S. B. (1998). A parallel functional language compiler for message-passing multicomputers. (Doctoral Dissertation). University of St Andrews. Retrieved from http://hdl.handle.net/10023/13450

Chicago Manual of Style (16th Edition):

Junaidu, Sahalu B. “A parallel functional language compiler for message-passing multicomputers.” 1998. Doctoral Dissertation, University of St Andrews. Accessed October 27, 2020. http://hdl.handle.net/10023/13450.

MLA Handbook (7th Edition):

Junaidu, Sahalu B. “A parallel functional language compiler for message-passing multicomputers.” 1998. Web. 27 Oct 2020.

Vancouver:

Junaidu SB. A parallel functional language compiler for message-passing multicomputers. [Internet] [Doctoral dissertation]. University of St Andrews; 1998. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/10023/13450.

Council of Science Editors:

Junaidu SB. A parallel functional language compiler for message-passing multicomputers. [Doctoral Dissertation]. University of St Andrews; 1998. Available from: http://hdl.handle.net/10023/13450


University of Arizona

14. Wendt, Alan Lee. An optimizing code generator generator.

Degree: 1989, University of Arizona

 This dissertation describes a system that constructs efficient, retargetable code generators and optimizers. chop reads nonprocedural descriptions of a computer's instruction set and of a… (more)

Subjects/Keywords: Code generators.; Compilers (Computer programs)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wendt, A. L. (1989). An optimizing code generator generator. (Doctoral Dissertation). University of Arizona. Retrieved from http://hdl.handle.net/10150/184771

Chicago Manual of Style (16th Edition):

Wendt, Alan Lee. “An optimizing code generator generator. ” 1989. Doctoral Dissertation, University of Arizona. Accessed October 27, 2020. http://hdl.handle.net/10150/184771.

MLA Handbook (7th Edition):

Wendt, Alan Lee. “An optimizing code generator generator. ” 1989. Web. 27 Oct 2020.

Vancouver:

Wendt AL. An optimizing code generator generator. [Internet] [Doctoral dissertation]. University of Arizona; 1989. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/10150/184771.

Council of Science Editors:

Wendt AL. An optimizing code generator generator. [Doctoral Dissertation]. University of Arizona; 1989. Available from: http://hdl.handle.net/10150/184771

15. Menendez, David, 1977-. Practical formal techniques and tools for developing LLVM’s peephole optimizations.

Degree: PhD, Computer Science, 2018, Rutgers University

 Modern compilers perform extensive transformation of code in order to optimize run- ning time and binary code size. These occur in multiple passes, including translations… (more)

Subjects/Keywords: Compilers (Computer programs)

computer processors. Modern compilers are large, sophisticated systems translating source code… …behavior among the compiled programs indicate that one or more of the compilers did not preserve… …of trust for the programs compiled with them. Compilers can be more challenging to prove… …compute factorials written in C and compiled to LLVM IR 23 2.2. Two C programs that mask bits… …Introduction Compilers are essential tools for software development, providing a bridge between… 

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

Menendez, David, 1. (2018). Practical formal techniques and tools for developing LLVM’s peephole optimizations. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/56059/

Chicago Manual of Style (16th Edition):

Menendez, David, 1977-. “Practical formal techniques and tools for developing LLVM’s peephole optimizations.” 2018. Doctoral Dissertation, Rutgers University. Accessed October 27, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/56059/.

MLA Handbook (7th Edition):

Menendez, David, 1977-. “Practical formal techniques and tools for developing LLVM’s peephole optimizations.” 2018. Web. 27 Oct 2020.

Vancouver:

Menendez, David 1. Practical formal techniques and tools for developing LLVM’s peephole optimizations. [Internet] [Doctoral dissertation]. Rutgers University; 2018. [cited 2020 Oct 27]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/56059/.

Council of Science Editors:

Menendez, David 1. Practical formal techniques and tools for developing LLVM’s peephole optimizations. [Doctoral Dissertation]. Rutgers University; 2018. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/56059/


Macquarie University

16. Roberts, Matthew. Compiled generics for functional programming languages.

Degree: 2011, Macquarie University

"This dissertation is presented for the degree of Doctor of Philosophy".

"March 2011"

Bibliography: pages 183-190.

1. Introduction  – 2. Generic functions  – 3. Encoding… (more)

Subjects/Keywords: Functional programming languages; Functional programming (Computer science); Computer architecture; Compilers (Computer programs); Language compilers; Functional programming; Programming languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Roberts, M. (2011). Compiled generics for functional programming languages. (Doctoral Dissertation). Macquarie University. Retrieved from http://hdl.handle.net/1959.14/337819

Chicago Manual of Style (16th Edition):

Roberts, Matthew. “Compiled generics for functional programming languages.” 2011. Doctoral Dissertation, Macquarie University. Accessed October 27, 2020. http://hdl.handle.net/1959.14/337819.

MLA Handbook (7th Edition):

Roberts, Matthew. “Compiled generics for functional programming languages.” 2011. Web. 27 Oct 2020.

Vancouver:

Roberts M. Compiled generics for functional programming languages. [Internet] [Doctoral dissertation]. Macquarie University; 2011. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/1959.14/337819.

Council of Science Editors:

Roberts M. Compiled generics for functional programming languages. [Doctoral Dissertation]. Macquarie University; 2011. Available from: http://hdl.handle.net/1959.14/337819


University of British Columbia

17. Lu, Jing. Semi-automatic protocol implementation using an Estelle-C compiler, LAPB and RTS protocols as examples.

Degree: MS- MSc, Computer Science, 1990, University of British Columbia

 Formal Description Techniques allow for the use of automated tools during the specification and development of communication protocols. Estelle is a standardized formal description technique… (more)

Subjects/Keywords: Computer network protocols; Compilers (Computer programs)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lu, J. (1990). Semi-automatic protocol implementation using an Estelle-C compiler, LAPB and RTS protocols as examples. (Masters Thesis). University of British Columbia. Retrieved from http://hdl.handle.net/2429/29419

Chicago Manual of Style (16th Edition):

Lu, Jing. “Semi-automatic protocol implementation using an Estelle-C compiler, LAPB and RTS protocols as examples.” 1990. Masters Thesis, University of British Columbia. Accessed October 27, 2020. http://hdl.handle.net/2429/29419.

MLA Handbook (7th Edition):

Lu, Jing. “Semi-automatic protocol implementation using an Estelle-C compiler, LAPB and RTS protocols as examples.” 1990. Web. 27 Oct 2020.

Vancouver:

Lu J. Semi-automatic protocol implementation using an Estelle-C compiler, LAPB and RTS protocols as examples. [Internet] [Masters thesis]. University of British Columbia; 1990. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/2429/29419.

Council of Science Editors:

Lu J. Semi-automatic protocol implementation using an Estelle-C compiler, LAPB and RTS protocols as examples. [Masters Thesis]. University of British Columbia; 1990. Available from: http://hdl.handle.net/2429/29419


University of Texas – Austin

18. McGuire, Tommy Marcus. Correct implementation of network protocols.

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

 A number of issues combine to make network protocol development signif- icantly more difficult than other areas of computer programming: problems with time, concurrency, and… (more)

Subjects/Keywords: Computer network protocols; Compilers (Computer programs)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

McGuire, T. M. (2004). Correct implementation of network protocols. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/1140

Chicago Manual of Style (16th Edition):

McGuire, Tommy Marcus. “Correct implementation of network protocols.” 2004. Doctoral Dissertation, University of Texas – Austin. Accessed October 27, 2020. http://hdl.handle.net/2152/1140.

MLA Handbook (7th Edition):

McGuire, Tommy Marcus. “Correct implementation of network protocols.” 2004. Web. 27 Oct 2020.

Vancouver:

McGuire TM. Correct implementation of network protocols. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2004. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/2152/1140.

Council of Science Editors:

McGuire TM. Correct implementation of network protocols. [Doctoral Dissertation]. University of Texas – Austin; 2004. Available from: http://hdl.handle.net/2152/1140

19. Tseng, Francis, 1976-. Braids: out-of-order performance with almost in-order complexity: Out-of-order performance with almost in-order complexity.

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

 There is still much performance to be gained by out-of-order processors with wider issue widths. However, traditional methods of increasing issue width do not scale;… (more)

Subjects/Keywords: Computer architecture; Compilers (Computer programs)

…Corporation, Advanced Micro Devices, Cray, and HAL Computer Systems for providing me with summer… …chapter characterizes the usage of values of programs and provides insight into how the program… …provided. Braids found in programs are then characterized. 2.1 Motivation A program is an… …all the programs in the SPEC CPU2000 benchmark suite compiled for the Alpha ISA. Figure 2.1… …plots the distribution of the dynamic fanout of values produced in the benchmark programs. The… 

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

Tseng, Francis, 1. (2007). Braids: out-of-order performance with almost in-order complexity: Out-of-order performance with almost in-order complexity. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/3710

Chicago Manual of Style (16th Edition):

Tseng, Francis, 1976-. “Braids: out-of-order performance with almost in-order complexity: Out-of-order performance with almost in-order complexity.” 2007. Doctoral Dissertation, University of Texas – Austin. Accessed October 27, 2020. http://hdl.handle.net/2152/3710.

MLA Handbook (7th Edition):

Tseng, Francis, 1976-. “Braids: out-of-order performance with almost in-order complexity: Out-of-order performance with almost in-order complexity.” 2007. Web. 27 Oct 2020.

Vancouver:

Tseng, Francis 1. Braids: out-of-order performance with almost in-order complexity: Out-of-order performance with almost in-order complexity. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2007. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/2152/3710.

Council of Science Editors:

Tseng, Francis 1. Braids: out-of-order performance with almost in-order complexity: Out-of-order performance with almost in-order complexity. [Doctoral Dissertation]. University of Texas – Austin; 2007. Available from: http://hdl.handle.net/2152/3710


Indian Institute of Science

20. Prasad, Ashwin. Automatic Compilation Of MATLAB Programs For Synergistic Execution On Heterogeneous Processors.

Degree: MSc Engg, Faculty of Engineering, 2014, Indian Institute of Science

 MATLAB is an array language, initially popular for rapid prototyping, but is now being in-creasingly used to develop production code for numerical and scientific applications.… (more)

Subjects/Keywords: Compilers (Computer Programs); MATLAB (Computer Program); MEGHA (Compiler); Parallel Processors; Heterogeneous Processors; MATLAB Programs - Compilation; MATLAB Program; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Prasad, A. (2014). Automatic Compilation Of MATLAB Programs For Synergistic Execution On Heterogeneous Processors. (Masters Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/2312

Chicago Manual of Style (16th Edition):

Prasad, Ashwin. “Automatic Compilation Of MATLAB Programs For Synergistic Execution On Heterogeneous Processors.” 2014. Masters Thesis, Indian Institute of Science. Accessed October 27, 2020. http://etd.iisc.ac.in/handle/2005/2312.

MLA Handbook (7th Edition):

Prasad, Ashwin. “Automatic Compilation Of MATLAB Programs For Synergistic Execution On Heterogeneous Processors.” 2014. Web. 27 Oct 2020.

Vancouver:

Prasad A. Automatic Compilation Of MATLAB Programs For Synergistic Execution On Heterogeneous Processors. [Internet] [Masters thesis]. Indian Institute of Science; 2014. [cited 2020 Oct 27]. Available from: http://etd.iisc.ac.in/handle/2005/2312.

Council of Science Editors:

Prasad A. Automatic Compilation Of MATLAB Programs For Synergistic Execution On Heterogeneous Processors. [Masters Thesis]. Indian Institute of Science; 2014. Available from: http://etd.iisc.ac.in/handle/2005/2312


Colorado State University

21. Stone, Andrew. Automatic determination of may/must set usage in data-flow analysis.

Degree: MS(M.S.), Computer Science, 2009, Colorado State University

 Data-flow analysis is a common technique for gathering program information for use in performance improving transformations such as register allocation, deadcode elimination, common subexpression elimination,… (more)

Subjects/Keywords: Data flow computing; Compilers (Computer programs)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Stone, A. (2009). Automatic determination of may/must set usage in data-flow analysis. (Masters Thesis). Colorado State University. Retrieved from http://hdl.handle.net/10217/37716

Chicago Manual of Style (16th Edition):

Stone, Andrew. “Automatic determination of may/must set usage in data-flow analysis.” 2009. Masters Thesis, Colorado State University. Accessed October 27, 2020. http://hdl.handle.net/10217/37716.

MLA Handbook (7th Edition):

Stone, Andrew. “Automatic determination of may/must set usage in data-flow analysis.” 2009. Web. 27 Oct 2020.

Vancouver:

Stone A. Automatic determination of may/must set usage in data-flow analysis. [Internet] [Masters thesis]. Colorado State University; 2009. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/10217/37716.

Council of Science Editors:

Stone A. Automatic determination of may/must set usage in data-flow analysis. [Masters Thesis]. Colorado State University; 2009. Available from: http://hdl.handle.net/10217/37716


Michigan State University

22. Fang, Xing. Inserting fences to guarantee sequential consistency.

Degree: MS, Department of Computer Science and Engineering, 2002, Michigan State University

Subjects/Keywords: Compiling (Electronic computers); Compilers (Computer programs)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fang, X. (2002). Inserting fences to guarantee sequential consistency. (Masters Thesis). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:31340

Chicago Manual of Style (16th Edition):

Fang, Xing. “Inserting fences to guarantee sequential consistency.” 2002. Masters Thesis, Michigan State University. Accessed October 27, 2020. http://etd.lib.msu.edu/islandora/object/etd:31340.

MLA Handbook (7th Edition):

Fang, Xing. “Inserting fences to guarantee sequential consistency.” 2002. Web. 27 Oct 2020.

Vancouver:

Fang X. Inserting fences to guarantee sequential consistency. [Internet] [Masters thesis]. Michigan State University; 2002. [cited 2020 Oct 27]. Available from: http://etd.lib.msu.edu/islandora/object/etd:31340.

Council of Science Editors:

Fang X. Inserting fences to guarantee sequential consistency. [Masters Thesis]. Michigan State University; 2002. Available from: http://etd.lib.msu.edu/islandora/object/etd:31340


University of Lund

23. Cedersjö, Gustav. Efficient Software Implementation of Stream Programs.

Degree: 2017, University of Lund

 The way we use computers and mobile phones today requires large amounts of processing of data streams. Examples include digital signal processing for wireless transmission,… (more)

Subjects/Keywords: Computer and Information Science; stream programs; dataflow with firing; Kahn processes; compilers; actor machine

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cedersjö, G. (2017). Efficient Software Implementation of Stream Programs. (Doctoral Dissertation). University of Lund. Retrieved from https://lup.lub.lu.se/record/e0b715e7-a602-4644-b077-109b26498330 ; https://portal.research.lu.se/ws/files/25151313/dis.pdf

Chicago Manual of Style (16th Edition):

Cedersjö, Gustav. “Efficient Software Implementation of Stream Programs.” 2017. Doctoral Dissertation, University of Lund. Accessed October 27, 2020. https://lup.lub.lu.se/record/e0b715e7-a602-4644-b077-109b26498330 ; https://portal.research.lu.se/ws/files/25151313/dis.pdf.

MLA Handbook (7th Edition):

Cedersjö, Gustav. “Efficient Software Implementation of Stream Programs.” 2017. Web. 27 Oct 2020.

Vancouver:

Cedersjö G. Efficient Software Implementation of Stream Programs. [Internet] [Doctoral dissertation]. University of Lund; 2017. [cited 2020 Oct 27]. Available from: https://lup.lub.lu.se/record/e0b715e7-a602-4644-b077-109b26498330 ; https://portal.research.lu.se/ws/files/25151313/dis.pdf.

Council of Science Editors:

Cedersjö G. Efficient Software Implementation of Stream Programs. [Doctoral Dissertation]. University of Lund; 2017. Available from: https://lup.lub.lu.se/record/e0b715e7-a602-4644-b077-109b26498330 ; https://portal.research.lu.se/ws/files/25151313/dis.pdf


Northeastern University

24. Kalra, Charu. Design and evaluation of register allocation on GPUs.

Degree: MS, Department of Electrical and Computer Engineering, 2016, Northeastern University

 The rapid adoption of Graphics Processing Unit (GPU) computing has led to the development of workloads which can leverage the massive parallelism offered by GPUs.… (more)

Subjects/Keywords: compilers; GPUs; LLVM; OpenCL; optimization; register allocation; Parallel processing (Electronic computers); Registers (Computers); Evaluation; Graphics processing units; Compilers (Computer programs); Parallel programming (Computer science); Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kalra, C. (2016). Design and evaluation of register allocation on GPUs. (Masters Thesis). Northeastern University. Retrieved from http://hdl.handle.net/2047/D20213898

Chicago Manual of Style (16th Edition):

Kalra, Charu. “Design and evaluation of register allocation on GPUs.” 2016. Masters Thesis, Northeastern University. Accessed October 27, 2020. http://hdl.handle.net/2047/D20213898.

MLA Handbook (7th Edition):

Kalra, Charu. “Design and evaluation of register allocation on GPUs.” 2016. Web. 27 Oct 2020.

Vancouver:

Kalra C. Design and evaluation of register allocation on GPUs. [Internet] [Masters thesis]. Northeastern University; 2016. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/2047/D20213898.

Council of Science Editors:

Kalra C. Design and evaluation of register allocation on GPUs. [Masters Thesis]. Northeastern University; 2016. Available from: http://hdl.handle.net/2047/D20213898


Northeastern University

25. Yaddav, Vishesh. RacketScript: a Racket to JavaScript compiler.

Degree: MS, Computer Science Program, 2016, Northeastern University

 We present RacketScript, a Racket-to-JavaScript compiler that incorporates features and data structures from both Racket and JavaScript, enabling RacketScript programs to interoperate with libraries from… (more)

Subjects/Keywords: JavaScript; programming languages; web; Compilers (Computer programs); Racket (Computer program language); JavaScript (Computer program language); Programming languages (Electronic computers); Semantics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yaddav, V. (2016). RacketScript: a Racket to JavaScript compiler. (Masters Thesis). Northeastern University. Retrieved from http://hdl.handle.net/2047/D20235622

Chicago Manual of Style (16th Edition):

Yaddav, Vishesh. “RacketScript: a Racket to JavaScript compiler.” 2016. Masters Thesis, Northeastern University. Accessed October 27, 2020. http://hdl.handle.net/2047/D20235622.

MLA Handbook (7th Edition):

Yaddav, Vishesh. “RacketScript: a Racket to JavaScript compiler.” 2016. Web. 27 Oct 2020.

Vancouver:

Yaddav V. RacketScript: a Racket to JavaScript compiler. [Internet] [Masters thesis]. Northeastern University; 2016. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/2047/D20235622.

Council of Science Editors:

Yaddav V. RacketScript: a Racket to JavaScript compiler. [Masters Thesis]. Northeastern University; 2016. Available from: http://hdl.handle.net/2047/D20235622


Northeastern University

26. St-Amour, Vincent. How to generate actionable advice about performance problems.

Degree: PhD, Computer Science Program, 2015, Northeastern University

 Performance engineering is an important activity regardless of application domain, as critical for server software as for mobile applications. This activity, however, demands advanced, specialized… (more)

Subjects/Keywords: feature-specific profiling; optimization coaching; performance tooling; Computer systems; Evaluation; Compilers (Computer programs); Design; Optimizing compilers; Design; Performance standards; System design; Software engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

St-Amour, V. (2015). How to generate actionable advice about performance problems. (Doctoral Dissertation). Northeastern University. Retrieved from http://hdl.handle.net/2047/D20194212

Chicago Manual of Style (16th Edition):

St-Amour, Vincent. “How to generate actionable advice about performance problems.” 2015. Doctoral Dissertation, Northeastern University. Accessed October 27, 2020. http://hdl.handle.net/2047/D20194212.

MLA Handbook (7th Edition):

St-Amour, Vincent. “How to generate actionable advice about performance problems.” 2015. Web. 27 Oct 2020.

Vancouver:

St-Amour V. How to generate actionable advice about performance problems. [Internet] [Doctoral dissertation]. Northeastern University; 2015. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/2047/D20194212.

Council of Science Editors:

St-Amour V. How to generate actionable advice about performance problems. [Doctoral Dissertation]. Northeastern University; 2015. Available from: http://hdl.handle.net/2047/D20194212


California State University – Northridge

27. Herschderfer, Allan. Comp. gen : a language definition system.

Degree: MS, Computer Science, 1977, California State University – Northridge

 A compiler generator is a system which accepts the formal description of a computer language and produces a compiler capable of translating sentences in the… (more)

Subjects/Keywords: Compilers (Computer programs); Dissertations, Academic  – CSUN  – Computer Science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Herschderfer, A. (1977). Comp. gen : a language definition system. (Masters Thesis). California State University – Northridge. Retrieved from http://hdl.handle.net/10211.3/118523

Chicago Manual of Style (16th Edition):

Herschderfer, Allan. “Comp. gen : a language definition system.” 1977. Masters Thesis, California State University – Northridge. Accessed October 27, 2020. http://hdl.handle.net/10211.3/118523.

MLA Handbook (7th Edition):

Herschderfer, Allan. “Comp. gen : a language definition system.” 1977. Web. 27 Oct 2020.

Vancouver:

Herschderfer A. Comp. gen : a language definition system. [Internet] [Masters thesis]. California State University – Northridge; 1977. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/10211.3/118523.

Council of Science Editors:

Herschderfer A. Comp. gen : a language definition system. [Masters Thesis]. California State University – Northridge; 1977. Available from: http://hdl.handle.net/10211.3/118523


California State University – Northridge

28. Ba, DahRenn. Minipas : a comprehensive error-checking compiler for Pascal.

Degree: MS, Computer Science, 1985, California State University – Northridge

 The system described in this report is a comprehensive error-checking compiler for a subset of Pascal called Minipas. It is designed for students with limited… (more)

Subjects/Keywords: Compilers (Computer programs); Dissertations, Academic  – CSUN  – Computer Science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ba, D. (1985). Minipas : a comprehensive error-checking compiler for Pascal. (Masters Thesis). California State University – Northridge. Retrieved from http://hdl.handle.net/10211.3/129489

Chicago Manual of Style (16th Edition):

Ba, DahRenn. “Minipas : a comprehensive error-checking compiler for Pascal.” 1985. Masters Thesis, California State University – Northridge. Accessed October 27, 2020. http://hdl.handle.net/10211.3/129489.

MLA Handbook (7th Edition):

Ba, DahRenn. “Minipas : a comprehensive error-checking compiler for Pascal.” 1985. Web. 27 Oct 2020.

Vancouver:

Ba D. Minipas : a comprehensive error-checking compiler for Pascal. [Internet] [Masters thesis]. California State University – Northridge; 1985. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/10211.3/129489.

Council of Science Editors:

Ba D. Minipas : a comprehensive error-checking compiler for Pascal. [Masters Thesis]. California State University – Northridge; 1985. Available from: http://hdl.handle.net/10211.3/129489


University of Johannesburg

29. Dopler, Tristan Didier. Code optimisation using discrete optimisation techniques.

Degree: 2008, University of Johannesburg

The topic for this dissertation is the optimisation of computer programs, as they are being compiled, using discrete optimisation techniques. The techniques introduced aim to… (more)

Subjects/Keywords: combinatorial optimization; compilers (computer programs); computer architecture; scheduling(mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dopler, T. D. (2008). Code optimisation using discrete optimisation techniques. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/492

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

Dopler, Tristan Didier. “Code optimisation using discrete optimisation techniques.” 2008. Thesis, University of Johannesburg. Accessed October 27, 2020. http://hdl.handle.net/10210/492.

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

MLA Handbook (7th Edition):

Dopler, Tristan Didier. “Code optimisation using discrete optimisation techniques.” 2008. Web. 27 Oct 2020.

Vancouver:

Dopler TD. Code optimisation using discrete optimisation techniques. [Internet] [Thesis]. University of Johannesburg; 2008. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/10210/492.

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

Council of Science Editors:

Dopler TD. Code optimisation using discrete optimisation techniques. [Thesis]. University of Johannesburg; 2008. Available from: http://hdl.handle.net/10210/492

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


University of New South Wales

30. Cai, Qiong. Profile-guided redundancy elimination.

Degree: Computer Science & Engineering, 2006, University of New South Wales

 Program optimisations analyse and transform the programs suchthat better performance results can be achieved. Classical optimisationsmainly use the static properties of the programs to analyse… (more)

Subjects/Keywords: Compilers (Computer programs); Systems programming (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cai, Q. (2006). Profile-guided redundancy elimination. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/25156 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:1020/SOURCE01?view=true

Chicago Manual of Style (16th Edition):

Cai, Qiong. “Profile-guided redundancy elimination.” 2006. Doctoral Dissertation, University of New South Wales. Accessed October 27, 2020. http://handle.unsw.edu.au/1959.4/25156 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:1020/SOURCE01?view=true.

MLA Handbook (7th Edition):

Cai, Qiong. “Profile-guided redundancy elimination.” 2006. Web. 27 Oct 2020.

Vancouver:

Cai Q. Profile-guided redundancy elimination. [Internet] [Doctoral dissertation]. University of New South Wales; 2006. [cited 2020 Oct 27]. Available from: http://handle.unsw.edu.au/1959.4/25156 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:1020/SOURCE01?view=true.

Council of Science Editors:

Cai Q. Profile-guided redundancy elimination. [Doctoral Dissertation]. University of New South Wales; 2006. Available from: http://handle.unsw.edu.au/1959.4/25156 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:1020/SOURCE01?view=true

[1] [2] [3] [4] [5] … [3352]

.