subject:(Data types)

1. Pavaux, Alice. Inductive, Functional and Non-Linear Types in Ludics : Types inductifs, fonctionnels et non-linéaires en ludique.

Degree: Docteur es, Informatique, 2017, Sorbonne Paris Cité

URL: http://www.theses.fr/2017USPCD092

►

Cette thèse est consacrée à une exploration des types de la ludique. S’inscrivant dans un contexte marqué par la correspondance de Curry–Howard, la ludique est… (more)

▼

Cette thèse est consacrée à une exploration des types de la ludique. S’inscrivant dans un contexte marqué par la correspondance de Curry–Howard, la ludique est un cadre permettant d’étudier l’aspect dynamique de la logique et de la programmation. Les objets de base, appelés desseins, sont des preuves infinitaires non-typées qui peuvent également être vues comme des stratégies sous l’angle de la sémantique des jeux, et un type ou comportement est un ensemble de desseins se conduisant de la même manière du point de vue de l’interaction. On s’intéresse aux propriétés interactives des comportements. Notre attention se porte en particulier sur les comportements représentant les types de données et de fonctions, et sur les comportements non-linéaires qui permettent la duplication d’objets. Un nouveau résultat de complétude interne pour les unions infinies dévoile la structure des types de données inductifs. Grâce à une analyse des chemins visitables,c’est-à-dire des possibles traces d’exécution, on prouve que les comportements inductifs et fonctionnels sont réguliers, ouvrant la voie pour une caractérisation de MALL en ludique. On montre également qu’un comportement fonctionnel est pur, une propriété garantissant la sûreté du typage, si et seulement si ce n’est pas un type de fonctions prenant des fonctions en argument. Enfin, on pose les bases d’une étude précise de la non-linéarité en ludique en retrouvant une forme de complétude interne et en discutant des chemins visitables.

This thesis investigates the types of ludics. Within the context of the Curry–Howard correspondence,l udics is a framework in which the dynamic aspects of both logic and programming can be studied. The basic objects, called designs, are untyped infinitary proofs that can also beseen as strategies from the perspective of game semantics, and a type or behaviour is a set of designs well-behaved with respect to interaction. We are interested in observing the interactive properties of behaviours. Our attention is particularly focused on behaviours representing the types of data and functions, and on non-linear behaviours which allow the duplication of objects. A new internal completeness result for infinite unions unveils the structure of inductive data types. Thanks to an analysis of the visitable paths, i.e., the possible execution traces, we prove that inductive and functional behaviours are regular, paving the way for a characterisation of MALL in ludics. We also show that a functional behaviour is pure, a property ensuring the safety of typing, if and only if it is not a type of functions taking functions as argument. Finally,we set the bases for a precise study of non-linearity in ludics by recovering a form of internal completeness and discussing the visitable paths.

Advisors/Committee Members: Fouqueré, Christophe (thesis director).

Subjects/Keywords: Types de données inductifs; Inductive data types

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Pavaux, A. (2017). Inductive, Functional and Non-Linear Types in Ludics : Types inductifs, fonctionnels et non-linéaires en ludique. (Doctoral Dissertation). Sorbonne Paris Cité. Retrieved from http://www.theses.fr/2017USPCD092

Chicago Manual of Style (16^th Edition):

Pavaux, Alice. “Inductive, Functional and Non-Linear Types in Ludics : Types inductifs, fonctionnels et non-linéaires en ludique.” 2017. Doctoral Dissertation, Sorbonne Paris Cité. Accessed April 21, 2021. http://www.theses.fr/2017USPCD092.

MLA Handbook (7^th Edition):

Pavaux, Alice. “Inductive, Functional and Non-Linear Types in Ludics : Types inductifs, fonctionnels et non-linéaires en ludique.” 2017. Web. 21 Apr 2021.

Vancouver:

Pavaux A. Inductive, Functional and Non-Linear Types in Ludics : Types inductifs, fonctionnels et non-linéaires en ludique. [Internet] [Doctoral dissertation]. Sorbonne Paris Cité; 2017. [cited 2021 Apr 21]. Available from: http://www.theses.fr/2017USPCD092.

Council of Science Editors:

Pavaux A. Inductive, Functional and Non-Linear Types in Ludics : Types inductifs, fonctionnels et non-linéaires en ludique. [Doctoral Dissertation]. Sorbonne Paris Cité; 2017. Available from: http://www.theses.fr/2017USPCD092

Mississippi State University

2. chadha, vineet. Semantics-based change-merging of abstract data types.

Degree: MS, Computer Science, 2002, Mississippi State University

URL: http://sun.library.msstate.edu/ETD-db/theses/available/etd-03272002-120619/ ;

► Maintaining any software is difficult. Whenever an evolutionary change is made to the base version of a program and the new version of the program… (more)

Subjects/Keywords: abstract data types; semantics-based

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

chadha, v. (2002). Semantics-based change-merging of abstract data types. (Masters Thesis). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-03272002-120619/ ;

Chicago Manual of Style (16^th Edition):

chadha, vineet. “Semantics-based change-merging of abstract data types.” 2002. Masters Thesis, Mississippi State University. Accessed April 21, 2021. http://sun.library.msstate.edu/ETD-db/theses/available/etd-03272002-120619/ ;.

MLA Handbook (7^th Edition):

chadha, vineet. “Semantics-based change-merging of abstract data types.” 2002. Web. 21 Apr 2021.

Vancouver:

chadha v. Semantics-based change-merging of abstract data types. [Internet] [Masters thesis]. Mississippi State University; 2002. [cited 2021 Apr 21]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-03272002-120619/ ;.

Council of Science Editors:

chadha v. Semantics-based change-merging of abstract data types. [Masters Thesis]. Mississippi State University; 2002. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-03272002-120619/ ;

Oregon State University

3. Al-Mulhem, Muhammed Saleh. DataLab, a graphical system for specifying and synthesizing abstract data types.

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

URL: http://hdl.handle.net/1957/38227

► Formal methods using text to specify abstract data types (ADTs) are powerful, but they require great effort and a high level of expertise. Visual programming… (more)

Subjects/Keywords: Abstract data types (Computer science)

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Al-Mulhem, M. S. (1989). DataLab, a graphical system for specifying and synthesizing abstract data types. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/38227

Chicago Manual of Style (16^th Edition):

Al-Mulhem, Muhammed Saleh. “DataLab, a graphical system for specifying and synthesizing abstract data types.” 1989. Doctoral Dissertation, Oregon State University. Accessed April 21, 2021. http://hdl.handle.net/1957/38227.

MLA Handbook (7^th Edition):

Al-Mulhem, Muhammed Saleh. “DataLab, a graphical system for specifying and synthesizing abstract data types.” 1989. Web. 21 Apr 2021.

Vancouver:

Al-Mulhem MS. DataLab, a graphical system for specifying and synthesizing abstract data types. [Internet] [Doctoral dissertation]. Oregon State University; 1989. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/1957/38227.

Council of Science Editors:

Al-Mulhem MS. DataLab, a graphical system for specifying and synthesizing abstract data types. [Doctoral Dissertation]. Oregon State University; 1989. Available from: http://hdl.handle.net/1957/38227

4. Campbell, Lahcen I. A cause for consilience: Utilizing multiple genomic data types to resolve problematic nodes within Arthropoda and Ecdysozoa.

Degree: 2012, RIAN

URL: http://eprints.maynoothuniversity.ie/3987/

► A major turning point in the study of metazoan evolution was the recognition of the existence of the Ecdysozoa in 1997. This is a group… (more)

▼ A major turning point in the study of metazoan evolution was the recognition of the existence of the Ecdysozoa in 1997. This is a group of eight animal phyla (Nematoda, Nematomorpha, Loricifera, Kinorhyncha, Priapulida, Tardigrada, Onychophora and Arthropoda). Ecdysozoa is the most specious clade of animals to ever exist and the relationships among its eight phyla are still heatedly debated. Similarly also the relationships among the three sub-phyla (Chelicerata, Pancrustacea and Myriapoda) within the most important ecdysozoan phylum (the Arthropoda) are still debated. Indeed, the two major problems in ecdysozoan phylogeny refer to the relationships of Myriapoda within Arthropoda, and of Tardigrada within Ecdysozoa. Difficulties in ecdysozoan relationships resides in lineages characterized by rapid, deep divergences and subsequently long periods of divergent evolution. Phylogenetic signal to resolve the relationships of these lineages is diluted, increasing the likelihood of recovery of phylogenetic artifacts. In an attempt to resolve the relationships within Ecdysozoa, consilience of three independent phylogenetic data sets was investigated. EST and rRNA and microRNA (miRNA) data were sampled across all major ecdysozoan phyla. In particular, a major contribution of this thesis is the first time sequencing of miRNAs for all the panarthropod phyla. MicroRNAs are genome regulatory elements that recently emerged as a source of useful phylogenetic data (Sempere et al. 2006) because of their low homoplasy levels. The considered data sets were analysed under phylogenetic methods and models, implemented to minimize the occurrence of phylogenetic reconstruction artifacts to understand the evolution of Ecdysozoa. Analyses of independent data types recovered well supported and corroborating evidence for the monophyly of Panarthropoda (Arthropoda, Onychophora and Tardigrada), a sister group relationships between Myriapoda and Pancrustacea within Arthropoda, and the paraphyly of Cycloneuralia (Nematoda, Nematomorpha, Loricifera, Kinorhyncha and Priapulida). !

Subjects/Keywords: Biology; genomic data types; problematic nodes; Arthropoda; Ecdysozoa

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Campbell, L. I. (2012). A cause for consilience: Utilizing multiple genomic data types to resolve problematic nodes within Arthropoda and Ecdysozoa. (Thesis). RIAN. Retrieved from http://eprints.maynoothuniversity.ie/3987/

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

Chicago Manual of Style (16^th Edition):

Campbell, Lahcen I. “A cause for consilience: Utilizing multiple genomic data types to resolve problematic nodes within Arthropoda and Ecdysozoa.” 2012. Thesis, RIAN. Accessed April 21, 2021. http://eprints.maynoothuniversity.ie/3987/.

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

MLA Handbook (7^th Edition):

Campbell, Lahcen I. “A cause for consilience: Utilizing multiple genomic data types to resolve problematic nodes within Arthropoda and Ecdysozoa.” 2012. Web. 21 Apr 2021.

Vancouver:

Campbell LI. A cause for consilience: Utilizing multiple genomic data types to resolve problematic nodes within Arthropoda and Ecdysozoa. [Internet] [Thesis]. RIAN; 2012. [cited 2021 Apr 21]. Available from: http://eprints.maynoothuniversity.ie/3987/.

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

Council of Science Editors:

Campbell LI. A cause for consilience: Utilizing multiple genomic data types to resolve problematic nodes within Arthropoda and Ecdysozoa. [Thesis]. RIAN; 2012. Available from: http://eprints.maynoothuniversity.ie/3987/

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

Delft University of Technology

5. van Wijk, Bryan (author). Partitionable Decentralized Topic Key Management.

Degree: 2019, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:55b9fe42-0eb9-42a8-9bf0-b1ee5d70d6fa

►

In a military environment, tactical networks enable information sharing between all the different entities in the field. In this environment, multiple groups of people from… (more)

▼

In a military environment, tactical networks enable information sharing between all the different entities in the field. In this environment, multiple groups of people from different organizations, and with different goals and policies have to share information. The information has to be shared without the risk of leaking information to unauthorized entities. Cryptography algorithms are used to encrypt information with a key to remain in control of when, where and to whom it is shared. All information is encrypted based on the concept of content-based encryption. In this unreliable environment, the cryptographic keys used to secure the data have to be available to continue collecting and processing information. A key management architecture should be in place, to facilitate the generation and distribution of these keys. The purpose of this key management architecture is to provide the entities in the field with specific keys such that information access policies can be enforced. The challenge here is that in tactical networks, network partitionings are expected to happen. Therefore, the same keys have to be redundantly available at multiple locations to prevent a single point of failure. In a connected network, the keys can constantly be synchronized between these locations. However, the problem of key de-synchronization occurs if the network is split for some time, keys are changed on both sides, and then the network is recombined. This leads to possible conflicting keys because synchronization was temporarily not possible. The key management architecture must be able to handle such conflicts and reintegrate them as necessary. In this thesis, we present a decentralized key management architecture with a solution for the key de-synchronization problem. We propose to use Conflict-free replicated data types, to store the keys at multiple locations and prevent conflicts. Conflict-free replicated data types is a concept to store and replicate data across multiple instances. This data type is characterized by the possibility to update the data in all instances independently, and concurrently, without coordination between the instances. Additionally, three approaches for the coordination of key creation are proposed with different levels of consistency and availability. The architecture and the three approaches are compared in experiments to evaluate the differences and prove the feasibility of the designs.

Computer Science | Cyber Security

Advisors/Committee Members: van der Lubbe, Jan (mentor), Quillinan, Thomas (mentor), Bjorkqvist, Mathias (mentor), Weber, Jos (graduation committee), Delft University of Technology (degree granting institution).

Subjects/Keywords: Key Management; Conflict-free replicated data types; Partition Tolerance

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

van Wijk, B. (. (2019). Partitionable Decentralized Topic Key Management. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:55b9fe42-0eb9-42a8-9bf0-b1ee5d70d6fa

Chicago Manual of Style (16^th Edition):

van Wijk, Bryan (author). “Partitionable Decentralized Topic Key Management.” 2019. Masters Thesis, Delft University of Technology. Accessed April 21, 2021. http://resolver.tudelft.nl/uuid:55b9fe42-0eb9-42a8-9bf0-b1ee5d70d6fa.

MLA Handbook (7^th Edition):

van Wijk, Bryan (author). “Partitionable Decentralized Topic Key Management.” 2019. Web. 21 Apr 2021.

Vancouver:

van Wijk B(. Partitionable Decentralized Topic Key Management. [Internet] [Masters thesis]. Delft University of Technology; 2019. [cited 2021 Apr 21]. Available from: http://resolver.tudelft.nl/uuid:55b9fe42-0eb9-42a8-9bf0-b1ee5d70d6fa.

Council of Science Editors:

van Wijk B(. Partitionable Decentralized Topic Key Management. [Masters Thesis]. Delft University of Technology; 2019. Available from: http://resolver.tudelft.nl/uuid:55b9fe42-0eb9-42a8-9bf0-b1ee5d70d6fa

University of Minnesota

6. Pham, Hung Tuan. Verification of Recursive Data Types using abstractions.

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

URL: http://hdl.handle.net/11299/163020

► Reasoning about functions that operate over algebraic data types is an important problem for a large variety of applications. One application of particular interest is… (more)

▼ Reasoning about functions that operate over algebraic data types is an important problem for a large variety of applications. One application of particular interest is network applications that manipulate or reason about complex message structures, such as XML messages. In this dissertation, we present a decision procedure for reasoning about algebraic data types using abstractions that are provided by catamorphisms: fold functions that map instances of algebraic data types into values in a decidable domain. We show that the procedure is sound and complete for a class of monotonic catamorphisms. Our work extends a previous decision procedure that unrolls catamorphism functions until a solution is found. We propose the categories of monotonic catamorphisms and associative-commutative catamorphisms, which we argue provide a better formal foundation than previous categorizations of catamorphisms. We use monotonic catamorphisms to address an incompleteness in the previous unrolling algorithm (and associated proof), and then use these notions to address two open problems from previous work: (1) we provide a bound on the number of unrollings necessary for completeness, showing that it is exponentially small with respect to formula size for associative-commutative catamorphisms, and (2) we demonstrate that associative-commutative catamorphisms can be combined within a formula whilst preserving completeness. Our combination results extend the set of problems that can be reasoned about using the catamorphism-based approach. In addition, we generalize certain kinds of catamorphism functions to support additional parameters. This extension, called parameterized associative-commutative catamorphisms subsumes the associative-commutative class, widens the set of functions that are known to be decidable, and makes several practically important functions (such as forall, exists, and member) over elements of algebraic data types straightforward to express. We also describe an implementation of the approach, called RADA, which accepts formulas in an extended version of the SMT-Lib2 syntax. The procedure is quite general and is central to the reasoning infrastructure for Guardol, a domain-specific language for reasoning about network guards.

Subjects/Keywords: Algebraic data types; Catamorphisms; Decision procedure; SMT solvers; Verification

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Pham, H. T. (2014). Verification of Recursive Data Types using abstractions. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/163020

Chicago Manual of Style (16^th Edition):

Pham, Hung Tuan. “Verification of Recursive Data Types using abstractions.” 2014. Doctoral Dissertation, University of Minnesota. Accessed April 21, 2021. http://hdl.handle.net/11299/163020.

MLA Handbook (7^th Edition):

Pham, Hung Tuan. “Verification of Recursive Data Types using abstractions.” 2014. Web. 21 Apr 2021.

Vancouver:

Pham HT. Verification of Recursive Data Types using abstractions. [Internet] [Doctoral dissertation]. University of Minnesota; 2014. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/11299/163020.

Council of Science Editors:

Pham HT. Verification of Recursive Data Types using abstractions. [Doctoral Dissertation]. University of Minnesota; 2014. Available from: http://hdl.handle.net/11299/163020

7. Campbell, Lahcen I. A cause for consilience: Utilizing multiple genomic data types to resolve problematic nodes within Arthropoda and Ecdysozoa.

Degree: 2012, RIAN

URL: http://mural.maynoothuniversity.ie/3987/

► A major turning point in the study of metazoan evolution was the recognition of the existence of the Ecdysozoa in 1997. This is a group… (more)

▼ A major turning point in the study of metazoan evolution was the recognition of the existence of the Ecdysozoa in 1997. This is a group of eight animal phyla (Nematoda, Nematomorpha, Loricifera, Kinorhyncha, Priapulida, Tardigrada, Onychophora and Arthropoda). Ecdysozoa is the most specious clade of animals to ever exist and the relationships among its eight phyla are still heatedly debated. Similarly also the relationships among the three sub-phyla (Chelicerata, Pancrustacea and Myriapoda) within the most important ecdysozoan phylum (the Arthropoda) are still debated. Indeed, the two major problems in ecdysozoan phylogeny refer to the relationships of Myriapoda within Arthropoda, and of Tardigrada within Ecdysozoa. Difficulties in ecdysozoan relationships resides in lineages characterized by rapid, deep divergences and subsequently long periods of divergent evolution. Phylogenetic signal to resolve the relationships of these lineages is diluted, increasing the likelihood of recovery of phylogenetic artifacts. In an attempt to resolve the relationships within Ecdysozoa, consilience of three independent phylogenetic data sets was investigated. EST and rRNA and microRNA (miRNA) data were sampled across all major ecdysozoan phyla. In particular, a major contribution of this thesis is the first time sequencing of miRNAs for all the panarthropod phyla. MicroRNAs are genome regulatory elements that recently emerged as a source of useful phylogenetic data (Sempere et al. 2006) because of their low homoplasy levels. The considered data sets were analysed under phylogenetic methods and models, implemented to minimize the occurrence of phylogenetic reconstruction artifacts to understand the evolution of Ecdysozoa. Analyses of independent data types recovered well supported and corroborating evidence for the monophyly of Panarthropoda (Arthropoda, Onychophora and Tardigrada), a sister group relationships between Myriapoda and Pancrustacea within Arthropoda, and the paraphyly of Cycloneuralia (Nematoda, Nematomorpha, Loricifera, Kinorhyncha and Priapulida). !

Subjects/Keywords: Biology; genomic data types; problematic nodes; Arthropoda; Ecdysozoa

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Campbell, L. I. (2012). A cause for consilience: Utilizing multiple genomic data types to resolve problematic nodes within Arthropoda and Ecdysozoa. (Thesis). RIAN. Retrieved from http://mural.maynoothuniversity.ie/3987/

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

Chicago Manual of Style (16^th Edition):

Campbell, Lahcen I. “A cause for consilience: Utilizing multiple genomic data types to resolve problematic nodes within Arthropoda and Ecdysozoa.” 2012. Thesis, RIAN. Accessed April 21, 2021. http://mural.maynoothuniversity.ie/3987/.

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

MLA Handbook (7^th Edition):

Campbell, Lahcen I. “A cause for consilience: Utilizing multiple genomic data types to resolve problematic nodes within Arthropoda and Ecdysozoa.” 2012. Web. 21 Apr 2021.

Vancouver:

Campbell LI. A cause for consilience: Utilizing multiple genomic data types to resolve problematic nodes within Arthropoda and Ecdysozoa. [Internet] [Thesis]. RIAN; 2012. [cited 2021 Apr 21]. Available from: http://mural.maynoothuniversity.ie/3987/.

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

Council of Science Editors:

Campbell LI. A cause for consilience: Utilizing multiple genomic data types to resolve problematic nodes within Arthropoda and Ecdysozoa. [Thesis]. RIAN; 2012. Available from: http://mural.maynoothuniversity.ie/3987/

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

University of St. Andrews

8. Tulley, Dominic H. The combinatorics of abstract container data types.

Degree: 1997, University of St. Andrews

URL: http://hdl.handle.net/10023/13472

► The study of abstract machines such as Turing machines, push down automata and finite state machines has played an important role in the advancement of… (more)

Subjects/Keywords: QA76.9A23T9; Abstract data types (Computer science)

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Tulley, D. H. (1997). The combinatorics of abstract container data types. (Doctoral Dissertation). University of St. Andrews. Retrieved from http://hdl.handle.net/10023/13472

Chicago Manual of Style (16^th Edition):

Tulley, Dominic H. “The combinatorics of abstract container data types.” 1997. Doctoral Dissertation, University of St. Andrews. Accessed April 21, 2021. http://hdl.handle.net/10023/13472.

MLA Handbook (7^th Edition):

Tulley, Dominic H. “The combinatorics of abstract container data types.” 1997. Web. 21 Apr 2021.

Vancouver:

Tulley DH. The combinatorics of abstract container data types. [Internet] [Doctoral dissertation]. University of St. Andrews; 1997. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/10023/13472.

Council of Science Editors:

Tulley DH. The combinatorics of abstract container data types. [Doctoral Dissertation]. University of St. Andrews; 1997. Available from: http://hdl.handle.net/10023/13472

University of Florida

9. Jin, Huafeng. Java Memory Model-Aware Model Checking.

Degree: PhD, Computer Engineering - Computer and Information Science and Engineering, 2012, University of Florida

URL: https://ufdc.ufl.edu/UFE0044100

► The Java memory model (JMM) determines whether an execution of a concurrent Java program is legal or not. For programs that are data race free,… (more)

Subjects/Keywords: Algorithms; Architectural models; Buffer storage; Compilers; Computer memory; Computer programming; Data lines; Data types; Java; Metadata; benign – checking – model

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Jin, H. (2012). Java Memory Model-Aware Model Checking. (Doctoral Dissertation). University of Florida. Retrieved from https://ufdc.ufl.edu/UFE0044100

Chicago Manual of Style (16^th Edition):

Jin, Huafeng. “Java Memory Model-Aware Model Checking.” 2012. Doctoral Dissertation, University of Florida. Accessed April 21, 2021. https://ufdc.ufl.edu/UFE0044100.

MLA Handbook (7^th Edition):

Jin, Huafeng. “Java Memory Model-Aware Model Checking.” 2012. Web. 21 Apr 2021.

Vancouver:

Jin H. Java Memory Model-Aware Model Checking. [Internet] [Doctoral dissertation]. University of Florida; 2012. [cited 2021 Apr 21]. Available from: https://ufdc.ufl.edu/UFE0044100.

Council of Science Editors:

Jin H. Java Memory Model-Aware Model Checking. [Doctoral Dissertation]. University of Florida; 2012. Available from: https://ufdc.ufl.edu/UFE0044100

10. Björk, Casper. A study of the effects of different contextual variables on sorting algorithms.

Degree: 2020, , Department of Software Engineering

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-20528

► Background: Computers use sorting algorithms to prepare data for search or insert operations, these operations can be a bottleneck for performance. Objectives: To evaluate… (more)

Subjects/Keywords: Sorting algorithms; Performance; Implementation languages; Data types; Sorterings algorithmer; Prestandard; Programmeringsspråk; Data typer; Software Engineering; Programvaruteknik

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Björk, C. (2020). A study of the effects of different contextual variables on sorting algorithms. (Thesis). , Department of Software Engineering. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:bth-20528

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

Chicago Manual of Style (16^th Edition):

Björk, Casper. “A study of the effects of different contextual variables on sorting algorithms.” 2020. Thesis, , Department of Software Engineering. Accessed April 21, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-20528.

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

MLA Handbook (7^th Edition):

Björk, Casper. “A study of the effects of different contextual variables on sorting algorithms.” 2020. Web. 21 Apr 2021.

Vancouver:

Björk C. A study of the effects of different contextual variables on sorting algorithms. [Internet] [Thesis]. , Department of Software Engineering; 2020. [cited 2021 Apr 21]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-20528.

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

Council of Science Editors:

Björk C. A study of the effects of different contextual variables on sorting algorithms. [Thesis]. , Department of Software Engineering; 2020. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-20528

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

Université de Lorraine

11. Ahmed-Nacer, Mehdi. Méthodologie d'évaluation pour les types de données répliqués : Evaluation methodology for replicated data types.

Degree: Docteur es, Informatique, 2015, Université de Lorraine

URL: http://www.theses.fr/2015LORR0039

►

Pour fournir une disponibilité permanente des données et réduire la latence réseau, les systèmes de partage de données se basent sur la réplication optimiste. Dans… (more)

▼

Pour fournir une disponibilité permanente des données et réduire la latence réseau, les systèmes de partage de données se basent sur la réplication optimiste. Dans ce paradigme, il existe plusieurs copies de l'objet partagé dite répliques stockées sur des sites. Ces répliques peuvent être modifiées librement et à tout moment. Les modifications sont exécutées en local puis propagées aux autres sites pour y être appliquées. Les algorithmes de réplication optimiste sont chargés de gérer les modifications parallèles. L'objectif de cette thèse est de proposer une méthodologie d'évaluation pour les algorithmes de réplication optimiste. Le contexte de notre étude est l'édition collaborative. Nous allons concevoir pour cela un outil d'évaluation qui intègre un mécanisme de génération de corpus et un simulateur d'édition collaborative. À travers cet outil, nous allons dérouler plusieurs expériences sur deux types de corpus: synchrone et asynchrone. Dans le cas d'une édition collaborative synchrone, nous évaluerons les performances des différents algorithmes de réplication sur différents critères tels que le temps d'exécution, l'occupation mémoire, la taille des messages, etc. Nous proposerons ensuite quelques améliorations. En plus, dans le cas d'une édition collaborative asynchrone, lorsque deux répliques se synchronisent, les conflits sont plus nombreux à apparaître. Le système peut bloquer la fusion des modifications jusqu'à ce que l'utilisateur résolut les conflits. Pour réduire le nombre de ces conflits et l'effort des utilisateurs, nous proposerons une métrique d'évaluation et nous évaluerons les différents algorithmes sur cette métrique. Nous analyserons le résultat pour comprendre le comportement des utilisateurs et nous proposerons ensuite des algorithmes pour résoudre les conflits les plus important et réduire ainsi l'effort des développeurs. Enfin, nous proposerons une nouvelle architecture hybride basée sur deux types d'algorithmes de réplication. Contrairement aux architectures actuelles, l'architecture proposéeest simple, limite les ressources sur les dispositifs clients et ne nécessite pas de consensus entre les centres de données

To provide a high availability from any where, at any time, with low latency, data is optimistically replicated. This model allows any replica to apply updates locally, while the operations are later sent to all the others. In this way, all replicas eventually apply all updates, possibly even in different order. Optimistic replication algorithms are responsible for managing the concurrent modifications and ensure the consistency of the shared object. In this thesis, we present an evaluation methodology for optimistic replication algorithms. The context of our study is collaborative editing. We designed a tool that implements our methodology. This tool integrates a mechanism to generate a corpus and a simulator to simulate sessions of collaborative editing. Through this tool, we made several experiments on two different corpus: synchronous and asynchronous. In synchronous…

Advisors/Committee Members: Charoy, François (thesis director), Urso, Pascal (thesis director).

Subjects/Keywords: Réplication optimiste; Types de données répliqués; Méthodologie d'évaluation; Systèmes collaboratifs; Informatique en nuage; Optimistic replication; Replicated data types; Evaluation methodology; Collaborative systems; Cloud computing; 006.7; 004.678

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Ahmed-Nacer, M. (2015). Méthodologie d'évaluation pour les types de données répliqués : Evaluation methodology for replicated data types. (Doctoral Dissertation). Université de Lorraine. Retrieved from http://www.theses.fr/2015LORR0039

Chicago Manual of Style (16^th Edition):

Ahmed-Nacer, Mehdi. “Méthodologie d'évaluation pour les types de données répliqués : Evaluation methodology for replicated data types.” 2015. Doctoral Dissertation, Université de Lorraine. Accessed April 21, 2021. http://www.theses.fr/2015LORR0039.

MLA Handbook (7^th Edition):

Ahmed-Nacer, Mehdi. “Méthodologie d'évaluation pour les types de données répliqués : Evaluation methodology for replicated data types.” 2015. Web. 21 Apr 2021.

Vancouver:

Ahmed-Nacer M. Méthodologie d'évaluation pour les types de données répliqués : Evaluation methodology for replicated data types. [Internet] [Doctoral dissertation]. Université de Lorraine; 2015. [cited 2021 Apr 21]. Available from: http://www.theses.fr/2015LORR0039.

Council of Science Editors:

Ahmed-Nacer M. Méthodologie d'évaluation pour les types de données répliqués : Evaluation methodology for replicated data types. [Doctoral Dissertation]. Université de Lorraine; 2015. Available from: http://www.theses.fr/2015LORR0039

Brno University of Technology

12. Novák, Samuel Matyáš. Implementace součtového datového typu v C++: Implementation of Sum Data Type in C++.

Degree: 2020, Brno University of Technology

URL: http://hdl.handle.net/11012/191876

► This work concerns the implementation of a sum data type in C++. First, custom abstractions to handle sequences of values and types are proposed, which… (more)

Subjects/Keywords: šablonové metaprogramování; generické programování; generování kódu při kompilaci; datové struktury; součtové datové typy; algebraické datové typy; polymorfismus; template metaprogramming; generic programming; compile-time code generation; data structures; sum data types; algebraic data types; polymorphism

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Novák, S. M. (2020). Implementace součtového datového typu v C++: Implementation of Sum Data Type in C++. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/191876

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

Chicago Manual of Style (16^th Edition):

Novák, Samuel Matyáš. “Implementace součtového datového typu v C++: Implementation of Sum Data Type in C++.” 2020. Thesis, Brno University of Technology. Accessed April 21, 2021. http://hdl.handle.net/11012/191876.

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

MLA Handbook (7^th Edition):

Novák, Samuel Matyáš. “Implementace součtového datového typu v C++: Implementation of Sum Data Type in C++.” 2020. Web. 21 Apr 2021.

Vancouver:

Novák SM. Implementace součtového datového typu v C++: Implementation of Sum Data Type in C++. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/11012/191876.

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

Council of Science Editors:

Novák SM. Implementace součtového datového typu v C++: Implementation of Sum Data Type in C++. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/191876

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

Rhodes University

13. Tristram, Waide Barrington. Investigating tools and techniques for improving software performance on multiprocessor computer systems.

Degree: Faculty of Science, Computer Science, 2012, Rhodes University

URL: http://hdl.handle.net/10962/d1006651

►

The availability of modern commodity multicore processors and multiprocessor computer systems has resulted in the widespread adoption of parallel computers in a variety of environments,… (more)

▼

The availability of modern commodity multicore processors and multiprocessor computer systems has resulted in the widespread adoption of parallel computers in a variety of environments, ranging from the home to workstation and server environments in particular. Unfortunately, parallel programming is harder and requires more expertise than the traditional sequential programming model. The variety of tools and parallel programming models available to the programmer further complicates the issue. The primary goal of this research was to identify and describe a selection of parallel programming tools and techniques to aid novice parallel programmers in the process of developing efficient parallel C/C++ programs for the Linux platform. This was achieved by highlighting and describing the key concepts and hardware factors that affect parallel programming, providing a brief survey of commonly available software development tools and parallel programming models and libraries, and presenting structured approaches to software performance tuning and parallel programming. Finally, the performance of several parallel programming models and libraries was investigated, along with the programming effort required to implement solutions using the respective models. A quantitative research methodology was applied to the investigation of the performance and programming effort associated with the selected parallel programming models and libraries, which included automatic parallelisation by the compiler, Boost Threads, Cilk Plus, OpenMP, POSIX threads (Pthreads), and Threading Building Blocks (TBB). Additionally, the performance of the GNU C/C++ and Intel C/C++ compilers was examined. The results revealed that the choice of parallel programming model or library is dependent on the type of problem being solved and that there is no overall best choice for all classes of problem. However, the results also indicate that parallel programming models with higher levels of abstraction require less programming effort and provide similar performance compared to explicit threading models. The principle conclusion was that the problem analysis and parallel design are an important factor in the selection of the parallel programming model and tools, but that models with higher levels of abstractions, such as OpenMP and Threading Building Blocks, are favoured.

Subjects/Keywords: Multiprocessors; Multiprogramming (Electronic computers); Parallel programming (Computer science); Linux; Abstract data types (Computer science); Threads (Computer programs); Computer programming

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Tristram, W. B. (2012). Investigating tools and techniques for improving software performance on multiprocessor computer systems. (Thesis). Rhodes University. Retrieved from http://hdl.handle.net/10962/d1006651

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

Chicago Manual of Style (16^th Edition):

Tristram, Waide Barrington. “Investigating tools and techniques for improving software performance on multiprocessor computer systems.” 2012. Thesis, Rhodes University. Accessed April 21, 2021. http://hdl.handle.net/10962/d1006651.

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

MLA Handbook (7^th Edition):

Tristram, Waide Barrington. “Investigating tools and techniques for improving software performance on multiprocessor computer systems.” 2012. Web. 21 Apr 2021.

Vancouver:

Tristram WB. Investigating tools and techniques for improving software performance on multiprocessor computer systems. [Internet] [Thesis]. Rhodes University; 2012. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/10962/d1006651.

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

Council of Science Editors:

Tristram WB. Investigating tools and techniques for improving software performance on multiprocessor computer systems. [Thesis]. Rhodes University; 2012. Available from: http://hdl.handle.net/10962/d1006651

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

University of Florida

14. McPeek, Tyler F. American Voice Types Towards a Vocal Typology for American English.

Degree: PhD, Linguistics, 2013, University of Florida

URL: https://ufdc.ufl.edu/UFE0045383

► Individual voices are not uniformly similar to others, even when factoring out speakercharacteristics such as sex, age, dialect, and so on. Some speakers sharecommon features… (more)

Subjects/Keywords: Databases; Experimentation; Linguistics; Listening; Phonetics; Signals; Singing; Spoken communication; Voice data; Voice quality; identification – speaker – types – typology – vocal – voice

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

McPeek, T. F. (2013). American Voice Types Towards a Vocal Typology for American English. (Doctoral Dissertation). University of Florida. Retrieved from https://ufdc.ufl.edu/UFE0045383

Chicago Manual of Style (16^th Edition):

McPeek, Tyler F. “American Voice Types Towards a Vocal Typology for American English.” 2013. Doctoral Dissertation, University of Florida. Accessed April 21, 2021. https://ufdc.ufl.edu/UFE0045383.

MLA Handbook (7^th Edition):

McPeek, Tyler F. “American Voice Types Towards a Vocal Typology for American English.” 2013. Web. 21 Apr 2021.

Vancouver:

McPeek TF. American Voice Types Towards a Vocal Typology for American English. [Internet] [Doctoral dissertation]. University of Florida; 2013. [cited 2021 Apr 21]. Available from: https://ufdc.ufl.edu/UFE0045383.

Council of Science Editors:

McPeek TF. American Voice Types Towards a Vocal Typology for American English. [Doctoral Dissertation]. University of Florida; 2013. Available from: https://ufdc.ufl.edu/UFE0045383

Texas Tech University

15. Lukito, Herman. Computability over abstract structures.

Degree: 1990, Texas Tech University

URL: http://hdl.handle.net/2346/19044

Subjects/Keywords: Abstract data types (Computer science); Computable functions

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Lukito, H. (1990). Computability over abstract structures. (Thesis). Texas Tech University. Retrieved from http://hdl.handle.net/2346/19044

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

Chicago Manual of Style (16^th Edition):

Lukito, Herman. “Computability over abstract structures.” 1990. Thesis, Texas Tech University. Accessed April 21, 2021. http://hdl.handle.net/2346/19044.

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

MLA Handbook (7^th Edition):

Lukito, Herman. “Computability over abstract structures.” 1990. Web. 21 Apr 2021.

Vancouver:

Lukito H. Computability over abstract structures. [Internet] [Thesis]. Texas Tech University; 1990. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/2346/19044.

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

Council of Science Editors:

Lukito H. Computability over abstract structures. [Thesis]. Texas Tech University; 1990. Available from: http://hdl.handle.net/2346/19044

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

University of Johannesburg

16. Olivier, Martin Stephanus. Die ondersteuning van abstrakte datatipes en toestelle in 'n programmeertaal.

Degree: 2014, University of Johannesburg

URL: http://hdl.handle.net/10210/9878

M.Sc. (Computer Science)

Please refer to full text to view abstract

Subjects/Keywords: Abstract data types (Computer science); Programming languages (Electronic computers); Data structures (Computer science)

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Olivier, M. S. (2014). Die ondersteuning van abstrakte datatipes en toestelle in 'n programmeertaal. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/9878

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

Chicago Manual of Style (16^th Edition):

Olivier, Martin Stephanus. “Die ondersteuning van abstrakte datatipes en toestelle in 'n programmeertaal.” 2014. Thesis, University of Johannesburg. Accessed April 21, 2021. http://hdl.handle.net/10210/9878.

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

MLA Handbook (7^th Edition):

Olivier, Martin Stephanus. “Die ondersteuning van abstrakte datatipes en toestelle in 'n programmeertaal.” 2014. Web. 21 Apr 2021.

Vancouver:

Olivier MS. Die ondersteuning van abstrakte datatipes en toestelle in 'n programmeertaal. [Internet] [Thesis]. University of Johannesburg; 2014. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/10210/9878.

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

Council of Science Editors:

Olivier MS. Die ondersteuning van abstrakte datatipes en toestelle in 'n programmeertaal. [Thesis]. University of Johannesburg; 2014. Available from: http://hdl.handle.net/10210/9878

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

University of Florida

17. Oladele, Jean-David G. ( Author, Primary ). Implementation of a parallel program, program generator.

Degree: 2002, University of Florida

URL: https://ufdc.ufl.edu/UFE0000583

Subjects/Keywords: Algorithms; Boxes; Capsules; Data models; Data types; Integers; Java; Linear programming; Pipelines; XML

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Oladele, Jean-David G. ( Author, P. ). (2002). Implementation of a parallel program, program generator. (Thesis). University of Florida. Retrieved from https://ufdc.ufl.edu/UFE0000583

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

Chicago Manual of Style (16^th Edition):

Oladele, Jean-David G. ( Author, Primary ). “Implementation of a parallel program, program generator.” 2002. Thesis, University of Florida. Accessed April 21, 2021. https://ufdc.ufl.edu/UFE0000583.

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

MLA Handbook (7^th Edition):

Oladele, Jean-David G. ( Author, Primary ). “Implementation of a parallel program, program generator.” 2002. Web. 21 Apr 2021.

Vancouver:

Oladele, Jean-David G. ( Author P). Implementation of a parallel program, program generator. [Internet] [Thesis]. University of Florida; 2002. [cited 2021 Apr 21]. Available from: https://ufdc.ufl.edu/UFE0000583.

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

Council of Science Editors:

Oladele, Jean-David G. ( Author P). Implementation of a parallel program, program generator. [Thesis]. University of Florida; 2002. Available from: https://ufdc.ufl.edu/UFE0000583

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

University of Florida

18. Dhar, Punyabrata. Complex Object Management with Binary Intelligent Compact Object Store (Bicos) for Main Memory and Files.

Degree: MS, Computer Engineering - Computer and Information Science and Engineering, 2014, University of Florida

URL: https://ufdc.ufl.edu/UFE0047266

► Present-day applications in the field of multimedia, geo-spatial and genomic technologies deal with large, complex, highly structured application objects of variable length. The existing file… (more)

Subjects/Keywords: Bytes; Compact stars; Computer technology; Data models; Data types; Database management systems; Databases; Engineering; Information technology; Mathematical vectors; bigdata – bigobjects – blob – complexobjects

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Dhar, P. (2014). Complex Object Management with Binary Intelligent Compact Object Store (Bicos) for Main Memory and Files. (Masters Thesis). University of Florida. Retrieved from https://ufdc.ufl.edu/UFE0047266

Chicago Manual of Style (16^th Edition):

Dhar, Punyabrata. “Complex Object Management with Binary Intelligent Compact Object Store (Bicos) for Main Memory and Files.” 2014. Masters Thesis, University of Florida. Accessed April 21, 2021. https://ufdc.ufl.edu/UFE0047266.

MLA Handbook (7^th Edition):

Dhar, Punyabrata. “Complex Object Management with Binary Intelligent Compact Object Store (Bicos) for Main Memory and Files.” 2014. Web. 21 Apr 2021.

Vancouver:

Dhar P. Complex Object Management with Binary Intelligent Compact Object Store (Bicos) for Main Memory and Files. [Internet] [Masters thesis]. University of Florida; 2014. [cited 2021 Apr 21]. Available from: https://ufdc.ufl.edu/UFE0047266.

Council of Science Editors:

Dhar P. Complex Object Management with Binary Intelligent Compact Object Store (Bicos) for Main Memory and Files. [Masters Thesis]. University of Florida; 2014. Available from: https://ufdc.ufl.edu/UFE0047266

University of Florida

19. Kanjilal, Virupaksha. Designing, Querying, Implementing, and Integrating Spatial Networks in Spatial Databases.

Degree: PhD, Computer Engineering - Computer and Information Science and Engineering, 2012, University of Florida

URL: https://ufdc.ufl.edu/UFE0044911

► Spatial networks like road networks, pipeline networks, transportation networks, and power network are being increasingly used in the fields of route planning, land use planning,… (more)

Subjects/Keywords: Boundary points; Crossovers; Data models; Data types; Databases; Geometry; Grammar; Oracles; Spatial models; Spatial points; database – gis – implement – network – querying – represent – spatial

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Kanjilal, V. (2012). Designing, Querying, Implementing, and Integrating Spatial Networks in Spatial Databases. (Doctoral Dissertation). University of Florida. Retrieved from https://ufdc.ufl.edu/UFE0044911

Chicago Manual of Style (16^th Edition):

Kanjilal, Virupaksha. “Designing, Querying, Implementing, and Integrating Spatial Networks in Spatial Databases.” 2012. Doctoral Dissertation, University of Florida. Accessed April 21, 2021. https://ufdc.ufl.edu/UFE0044911.

MLA Handbook (7^th Edition):

Kanjilal, Virupaksha. “Designing, Querying, Implementing, and Integrating Spatial Networks in Spatial Databases.” 2012. Web. 21 Apr 2021.

Vancouver:

Kanjilal V. Designing, Querying, Implementing, and Integrating Spatial Networks in Spatial Databases. [Internet] [Doctoral dissertation]. University of Florida; 2012. [cited 2021 Apr 21]. Available from: https://ufdc.ufl.edu/UFE0044911.

Council of Science Editors:

Kanjilal V. Designing, Querying, Implementing, and Integrating Spatial Networks in Spatial Databases. [Doctoral Dissertation]. University of Florida; 2012. Available from: https://ufdc.ufl.edu/UFE0044911

20. Passerino, Liliana Maria. Um sistema de tipos para uma linguagem de representacao estruturada de conhecimento.

Degree: 1992, Brazil

URL: http://hdl.handle.net/10183/26392

► A noção de tipo é intrínseca ao raciocínio humano, na medida que os seres humanos tendem a "classificar" os objetos segundo seu use e seu… (more)

▼ A noção de tipo é intrínseca ao raciocínio humano, na medida que os seres humanos tendem a "classificar" os objetos segundo seu use e seu comportamento como parte do processo de resolução de problemas. Tal classificação dos objetos implica numa abstração das características irrelevantes dos mesmos,permitindo dessa maneira uma simplificação importante da complexidade do universo de discurso Por outro lado, certos problemas são altamente complexos e requerem um tratamento diferenciado.Esses problemas exigem, para sua resolução, um grande conhecimento do universo de discurso. O ponto critico nesta situação é que o domínio do problema não é exato como poderia ser um domínio matemático. Pelo contrario, ele inclui geralmente aspectos ambíguos e pouco formais que dificultam seu entendimento. Tal domínio a chamado de senso comum e é objeto de estudo de uma linha da computação, a Inteligência Artificial (IA). Para [KRA 87], entre outros, as soluc6es pare muitos problemas de IA dependern mais da capacidade de adquirir e manipular conhecimento do que de algoritmos sofisticados. Por este motivo, existem na IA muitos tipos de linguagens que tentam, de di verses maneiras,facilitar a representação de conhecirnentos sobre universos de discurso de problemas particulares. São as chamadas Linguagens de Representação de Conhecimento. A noção de tipo e implícita nas linguagens de representação de conhecimento, uma vez que tal noção é natural no raciocínio humano e esta intimamente ligada ao conceito de abstração. Este trabalho visa explicitar a noção de tipo subjacente ao núcleo definido da linguagem RECON-II. Para isto, foi realizado um estudo semântico prévio para identificar os tipos semânticos da linguagem. A partir da noção semântica dos tipos foi possível definir a correspondente sintática e finalmente, descrever um Sistema de Tipos para RECON-II. Um Sistema de Tipos consiste numa Linguagem de Tipos (tipos básicos + construtores de tipos) e num Sistema de Dedução que relaciona as expresses da linguagem objeto (linguagem de programação com as expresses da linguagem de tipos. Para a primeira etapa realizada neste trabalho, a determinação da semântica da linguagem, foi utilizado o método algébrico. Nele toda expressão RECON-II é um termo de uma assinatura Z, de modo quo cada assinatura Z determina um conjunto de expressos RECON-UL Mas, por outro lado, uma assinatura também determina um conjunto de álgebras. Dessas álgebras-Z só um subconjunto significativo para as expressões RECON-II. As álgebras-Z significativas são aquelas que satisfazem a assinatura-Z mais um conjunto E de axiomas. A assinatura-Z junto como o conjunto E de axiomas constituem o quo se denomina Tipo Abstrato de Dados, T=CZ, E), e as álgebras-Z significativas são os chamados modelos-Z do tipo T. Assim, uma expressão RECON-II a e um elemento da álgebra de termos quo g uma Álgebra gerada a partir do E. Essa álgebra, 44 4-) conjunto das expressi5es_: RECON-II significativas, e o modelo inicial de tais expressões WOG 781 Dado um tipo abstrato T existe um único modelo… Advisors/Committee Members: Azeredo, Paulo Alberto de, Costa, Antonio Carlos da Rocha.

Subjects/Keywords: Linguagens : Programacao; Tipos abstratos : Dados; Representacao : Conhecimento; Semantica : Linguagens : Programacao; Types; Abstract data types; Types inference systems; Knowledege representation; Knowledege representation language; Algebric semantic

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Passerino, L. M. (1992). Um sistema de tipos para uma linguagem de representacao estruturada de conhecimento. (Masters Thesis). Brazil. Retrieved from http://hdl.handle.net/10183/26392

Chicago Manual of Style (16^th Edition):

Passerino, Liliana Maria. “Um sistema de tipos para uma linguagem de representacao estruturada de conhecimento.” 1992. Masters Thesis, Brazil. Accessed April 21, 2021. http://hdl.handle.net/10183/26392.

MLA Handbook (7^th Edition):

Passerino, Liliana Maria. “Um sistema de tipos para uma linguagem de representacao estruturada de conhecimento.” 1992. Web. 21 Apr 2021.

Vancouver:

Passerino LM. Um sistema de tipos para uma linguagem de representacao estruturada de conhecimento. [Internet] [Masters thesis]. Brazil; 1992. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/10183/26392.

Council of Science Editors:

Passerino LM. Um sistema de tipos para uma linguagem de representacao estruturada de conhecimento. [Masters Thesis]. Brazil; 1992. Available from: http://hdl.handle.net/10183/26392

21. Cristian Cosmoski Rangel de Abreu. Computação paralela para reduzir o tempo de resposta da mineração de dados agrícolas.

Degree: 2013, UNIVERSIDADE ESTADUAL DE PONTA GROSSA

URL: http://www.bicen-tede.uepg.br/tde_busca/arquivo.php?codArquivo=946

►

O objetivo deste trabalho foi investigar a utilização da computação paralela para reduzir o tempo de resposta da mineração de dados na agricultura. Para esse… (more)

▼

O objetivo deste trabalho foi investigar a utilização da computação paralela para reduzir o tempo de resposta da mineração de dados na agricultura. Para esse fim, uma ferramenta, chamada Fast Weka foi definida e implementada. Essa ferramenta permite executar algoritmos de mineração de dados e explorar o paralelismo em computadores multi-núcleos com uso de threads em sistemas distribuídos empregando redes peer-to-peer. A exploração do paralelismo ocorre por meio do paralelismo de dados inerente ao processo de validação cruzada (folds). A ferramenta foi avaliada por meio de experimentos de mineração de dados utilizando algoritmos de redes neurais artificiais aplicados em um conjunto de dados de tipos de coberturas florestais. A computação multi-thread e a computação em redes peer-to-peer permitiram reduzir o tempo de resposta das atividades de mineração de dados. Os melhores resultados foram obtidos quando empregados um número múltiplo de threads ou pares em relação ao número de folds da validação cruzada. Observou-se uma eficiência de 87% quando utilizadas 4 threads para 24 folds e 86% de eficiência, também, com 2 folds utilizando redes peer-to-peer co 11 pares.

The objective of this study was investigate the use of parallel computing to reduce the response time of data mining in agriculture. For this purpose, a tool, called Fast Weka been defined and implemented. This tool allows running data mining algorithms and explore parallelism in multi-core computers with the use of threads and distributed systems employing peer-to-peer networks. The exploration of parallelism occurs through the data parallelism inherent to the process of cross-validation (folds). The tool was evaluated through experiments using artificial neural networks data mining algorithms applied to a data set of forest cover types. The multi-thread computing and computing on peer-to-peer networks allowed to reduce the response time of data mining activities. The best results were achieved when employed a multiple number of threads or pairs in the number of folds of cross validation. It was observed and efficiency of 87% when used 4 threads to 24 folds and 86% efficiency also in peer-to-peer networks using 24 folds with 11 pairs.

Advisors/Committee Members: Maria Salete Marcon Gomes Vaz, Lourival Aparecido de Góis, Luciano José Senger.

Subjects/Keywords: mineração de dados; tipos de coberturas florestais; parallel computing; data mining; computação paralela; peer-to-peer; peer-to-peer; forest cover types; CIENCIA DA COMPUTACAO

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Abreu, C. C. R. d. (2013). Computação paralela para reduzir o tempo de resposta da mineração de dados agrícolas. (Thesis). UNIVERSIDADE ESTADUAL DE PONTA GROSSA. Retrieved from http://www.bicen-tede.uepg.br/tde_busca/arquivo.php?codArquivo=946

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

Chicago Manual of Style (16^th Edition):

Abreu, Cristian Cosmoski Rangel de. “Computação paralela para reduzir o tempo de resposta da mineração de dados agrícolas.” 2013. Thesis, UNIVERSIDADE ESTADUAL DE PONTA GROSSA. Accessed April 21, 2021. http://www.bicen-tede.uepg.br/tde_busca/arquivo.php?codArquivo=946.

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

MLA Handbook (7^th Edition):

Abreu, Cristian Cosmoski Rangel de. “Computação paralela para reduzir o tempo de resposta da mineração de dados agrícolas.” 2013. Web. 21 Apr 2021.

Vancouver:

Abreu CCRd. Computação paralela para reduzir o tempo de resposta da mineração de dados agrícolas. [Internet] [Thesis]. UNIVERSIDADE ESTADUAL DE PONTA GROSSA; 2013. [cited 2021 Apr 21]. Available from: http://www.bicen-tede.uepg.br/tde_busca/arquivo.php?codArquivo=946.

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

Council of Science Editors:

Abreu CCRd. Computação paralela para reduzir o tempo de resposta da mineração de dados agrícolas. [Thesis]. UNIVERSIDADE ESTADUAL DE PONTA GROSSA; 2013. Available from: http://www.bicen-tede.uepg.br/tde_busca/arquivo.php?codArquivo=946

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

Universidade Nova

22. Cabrita, Gonçalo Mendes. Non-uniform replication for replicated objects.

Degree: 2017, Universidade Nova

URL: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/21766

► A large number of web applications/services are supported by applications running in cloud computing infrastructures. Many of these application store their data in georeplicated key-value… (more)

Subjects/Keywords: Non-uniform Replication; Partial Replication; Replicated Data Types; Eventual Consistency; Key-Value Stores; Domínio/Área Científica::Engenharia e Tecnologia::Engenharia Eletrotécnica, Eletrónica e Informática

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Cabrita, G. M. (2017). Non-uniform replication for replicated objects. (Thesis). Universidade Nova. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/21766

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

Chicago Manual of Style (16^th Edition):

Cabrita, Gonçalo Mendes. “Non-uniform replication for replicated objects.” 2017. Thesis, Universidade Nova. Accessed April 21, 2021. http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/21766.

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

MLA Handbook (7^th Edition):

Cabrita, Gonçalo Mendes. “Non-uniform replication for replicated objects.” 2017. Web. 21 Apr 2021.

Vancouver:

Cabrita GM. Non-uniform replication for replicated objects. [Internet] [Thesis]. Universidade Nova; 2017. [cited 2021 Apr 21]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/21766.

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

Council of Science Editors:

Cabrita GM. Non-uniform replication for replicated objects. [Thesis]. Universidade Nova; 2017. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/21766

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

Stockholm University

23. Foxhage, Daniel. En forskningsöversikt om hur bisexuellasöks i samhällsvetenskaplig forskning.

Degree: Social Work, 2008, Stockholm University

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-26252

► A research review of 46 peer-reviewed articles with bisexuals as a target group was conducted with the objective to investigate methods of finding bisexual… (more)

Subjects/Keywords: bisexuality; bisexuals; sampling; sample types; sources of data; bisexualitet; bisexuella; urval; urvalstyper; datakällor

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Foxhage, D. (2008). En forskningsöversikt om hur bisexuellasöks i samhällsvetenskaplig forskning. (Thesis). Stockholm University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-26252

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

Chicago Manual of Style (16^th Edition):

Foxhage, Daniel. “En forskningsöversikt om hur bisexuellasöks i samhällsvetenskaplig forskning.” 2008. Thesis, Stockholm University. Accessed April 21, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-26252.

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

MLA Handbook (7^th Edition):

Foxhage, Daniel. “En forskningsöversikt om hur bisexuellasöks i samhällsvetenskaplig forskning.” 2008. Web. 21 Apr 2021.

Vancouver:

Foxhage D. En forskningsöversikt om hur bisexuellasöks i samhällsvetenskaplig forskning. [Internet] [Thesis]. Stockholm University; 2008. [cited 2021 Apr 21]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-26252.

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

Council of Science Editors:

Foxhage D. En forskningsöversikt om hur bisexuellasöks i samhällsvetenskaplig forskning. [Thesis]. Stockholm University; 2008. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-26252

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

KTH

24. Lindfors, Alexander. Avfallshantering: Mjukvara för hantering av information och tjänster : En fallstudie i SÖRAB-regionen.

Degree: Information and Communication Technology (ICT), 2017, KTH

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-209341

►

SÖRAB is a waste disposal firm that is operative in nine of the municipalities in Stockholm County, Sweden. Each municipality has their own separate… (more)

▼

SÖRAB is a waste disposal firm that is operative in nine of the municipalities in Stockholm County, Sweden. Each municipality has their own separate management of information and services. SÖRAB aspires to facilitate the process of finding and placing orders on waste disposal services for the residents in these municipalities. This thesis examines what should be done in order to centralize the municipalities’ waste disposal information into a shared portal. The main difficulties, concerning centralization, are that the municipalities use different underlying customer systems and have different practices in regulating waste disposal rates. After proposals for solutions for the identified problems are presented, an investigation into the most suited application type for the portal is conducted. This investigation focuses on a comparison between the two application types native mobile applications and mobile web applications. The usability of the portal is considered important. Hence different techniques, aiming to increase the usability of the graphical interface, are researched and presented. The identified problem areas, the application study and the usability aspects are the foundation for the development of a functional prototype of the portal. The result of the thesis is a prototype of a responsive web application. The prototype is implemented with the framework Angular. In order to facilitate potential future development, an architectural document describing the prototype is written. The thesis can be usable for future implementation projects. It presents a functioning methodology, gives insight in usability principles and compares pros and cons with different application types.

SÖRAB är ett avfallsbolag som är verksamt i nio av Stockholm läns kommuner. Varje kommun har separat hantering av information och tjänster. SÖRAB vill underlätta för kommuninvånarna att hitta och beställa tillgängliga avfallstjänster. Detta examensarbete undersöker vad som krävs för att centralisera kommunernas avfallsinformation i en gemensam portal. De stora svårigheterna kring centraliseringen ligger i att kommunerna använder olika bakomliggande kundsystem och tillämpar olika sätt att styra sina avfallstaxor. Efter att lösningsförslag för problemområdena presenteras, undersöks vilken typ av plattform som passar bäst för portalen. Denna undersökning jämför de två applikationstyperna nativa mobilapplikationer och mobila webbapplikationer. En viktig del för portalen anses vara dess användarvänlighet. I rapporten undersöks och presenteras därför olika tekniker som kan höja användarvänligheten i grafiska gränsnitt. De identifierade problemområdena, applikationsstudien och användarvänlighetaspekterna, blir underlag för att utveckla en funktionell prototyp av portalen. Examensarbetets resultat är en prototyp av en responsiv webbapplikation. Implementeringen sker med ramverket Angular. För att underlätta eventuellt fortsatt arbete, skrivs ett dokument som beskriver prototypens…

Subjects/Keywords: Web applications; usability; application types; software development; Angular; responsive design; wireframes; waste disposal management.; Webbapplikationer; användarvänlighet; applikationstyper; mjukvaruutveckling; Angular; responsiv design; wireframes; avfallshantering.; Computer and Information Sciences; Data- och informationsvetenskap

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Lindfors, A. (2017). Avfallshantering: Mjukvara för hantering av information och tjänster : En fallstudie i SÖRAB-regionen. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-209341

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

Chicago Manual of Style (16^th Edition):

Lindfors, Alexander. “Avfallshantering: Mjukvara för hantering av information och tjänster : En fallstudie i SÖRAB-regionen.” 2017. Thesis, KTH. Accessed April 21, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-209341.

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

MLA Handbook (7^th Edition):

Lindfors, Alexander. “Avfallshantering: Mjukvara för hantering av information och tjänster : En fallstudie i SÖRAB-regionen.” 2017. Web. 21 Apr 2021.

Vancouver:

Lindfors A. Avfallshantering: Mjukvara för hantering av information och tjänster : En fallstudie i SÖRAB-regionen. [Internet] [Thesis]. KTH; 2017. [cited 2021 Apr 21]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-209341.

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

Council of Science Editors:

Lindfors A. Avfallshantering: Mjukvara för hantering av information och tjänster : En fallstudie i SÖRAB-regionen. [Thesis]. KTH; 2017. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-209341

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

University of Victoria

25. Stuart, Gordon F. Classified models for software engineering.

Degree: Dept. of Computer Science, 2005, University of Victoria

URL: http://hdl.handle.net/1828/39

► In this dissertation it is shown that abstract data types (ADTs) can be specified by the Classified Model (CM) specification language - a first-order Horn… (more)

Subjects/Keywords: Abstract data types; Proof theory; Software engineering; Specification language; ADT

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Stuart, G. F. (2005). Classified models for software engineering. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/39

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

Chicago Manual of Style (16^th Edition):

Stuart, Gordon F. “Classified models for software engineering.” 2005. Thesis, University of Victoria. Accessed April 21, 2021. http://hdl.handle.net/1828/39.

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

MLA Handbook (7^th Edition):

Stuart, Gordon F. “Classified models for software engineering.” 2005. Web. 21 Apr 2021.

Vancouver:

Stuart GF. Classified models for software engineering. [Internet] [Thesis]. University of Victoria; 2005. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/1828/39.

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

Council of Science Editors:

Stuart GF. Classified models for software engineering. [Thesis]. University of Victoria; 2005. Available from: http://hdl.handle.net/1828/39

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

Brno University of Technology

26. Šabatka, Pavel. Tvorba úloh pro výuku předmětu: Praktické programování v C++: C++ programming examples for education.

Degree: 2019, Brno University of Technology

URL: http://hdl.handle.net/11012/2924

► The purpose of this thesis is implementation utilities for beginners in programming. These utilities could make passing subject BPPC easier. Theoretical part dissertates about programming… (more)

Subjects/Keywords: C/C++; programování; kurz BPPC; výuka; detekce úniku pamětových zdrojů; abstraktní datové typy; C/C++; programming; education; memory leak detection; abstract data types

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Šabatka, P. (2019). Tvorba úloh pro výuku předmětu: Praktické programování v C++: C++ programming examples for education. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/2924

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

Chicago Manual of Style (16^th Edition):

Šabatka, Pavel. “Tvorba úloh pro výuku předmětu: Praktické programování v C++: C++ programming examples for education.” 2019. Thesis, Brno University of Technology. Accessed April 21, 2021. http://hdl.handle.net/11012/2924.

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

MLA Handbook (7^th Edition):

Šabatka, Pavel. “Tvorba úloh pro výuku předmětu: Praktické programování v C++: C++ programming examples for education.” 2019. Web. 21 Apr 2021.

Vancouver:

Šabatka P. Tvorba úloh pro výuku předmětu: Praktické programování v C++: C++ programming examples for education. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/11012/2924.

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

Council of Science Editors:

Šabatka P. Tvorba úloh pro výuku předmětu: Praktické programování v C++: C++ programming examples for education. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/2924

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

Kansas State University

27. Hines, Timothy R. Conceptual object-oriented programming.

Degree: MS, Computing and Information Sciences, 1986, Kansas State University

URL: http://hdl.handle.net/2097/22075

Subjects/Keywords: Programming languages (Electronic computers); Abstract data types (Computer science); Masters theses

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Hines, T. R. (1986). Conceptual object-oriented programming. (Masters Thesis). Kansas State University. Retrieved from http://hdl.handle.net/2097/22075

Chicago Manual of Style (16^th Edition):

Hines, Timothy R. “Conceptual object-oriented programming.” 1986. Masters Thesis, Kansas State University. Accessed April 21, 2021. http://hdl.handle.net/2097/22075.

MLA Handbook (7^th Edition):

Hines, Timothy R. “Conceptual object-oriented programming.” 1986. Web. 21 Apr 2021.

Vancouver:

Hines TR. Conceptual object-oriented programming. [Internet] [Masters thesis]. Kansas State University; 1986. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/2097/22075.

Council of Science Editors:

Hines TR. Conceptual object-oriented programming. [Masters Thesis]. Kansas State University; 1986. Available from: http://hdl.handle.net/2097/22075

Kansas State University

28. Busack, Nancy Long. The intelligent data object and its data base interface.

Degree: 1985, Kansas State University

URL: http://hdl.handle.net/2097/9825

Subjects/Keywords: Abstract data types (Computer science); Electronic mail systems; Database management

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Busack, N. L. (1985). The intelligent data object and its data base interface. (Thesis). Kansas State University. Retrieved from http://hdl.handle.net/2097/9825

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

Chicago Manual of Style (16^th Edition):

Busack, Nancy Long. “The intelligent data object and its data base interface.” 1985. Thesis, Kansas State University. Accessed April 21, 2021. http://hdl.handle.net/2097/9825.

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

MLA Handbook (7^th Edition):

Busack, Nancy Long. “The intelligent data object and its data base interface.” 1985. Web. 21 Apr 2021.

Vancouver:

Busack NL. The intelligent data object and its data base interface. [Internet] [Thesis]. Kansas State University; 1985. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/2097/9825.

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

Council of Science Editors:

Busack NL. The intelligent data object and its data base interface. [Thesis]. Kansas State University; 1985. Available from: http://hdl.handle.net/2097/9825

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

Kansas State University

29. Chen, Jung-Juin. Simula prettyprinter using Pascal.

Degree: Department: Computer Science., 1986, Kansas State University

URL: http://hdl.handle.net/2097/9904

Subjects/Keywords: Programming languages (Electronic computers); Abstract data types (Computer science); SPP (Computer program)

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Chen, J. (1986). Simula prettyprinter using Pascal. (Thesis). Kansas State University. Retrieved from http://hdl.handle.net/2097/9904

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

Chicago Manual of Style (16^th Edition):

Chen, Jung-Juin. “Simula prettyprinter using Pascal.” 1986. Thesis, Kansas State University. Accessed April 21, 2021. http://hdl.handle.net/2097/9904.

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

MLA Handbook (7^th Edition):

Chen, Jung-Juin. “Simula prettyprinter using Pascal.” 1986. Web. 21 Apr 2021.

Vancouver:

Chen J. Simula prettyprinter using Pascal. [Internet] [Thesis]. Kansas State University; 1986. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/2097/9904.

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

Council of Science Editors:

Chen J. Simula prettyprinter using Pascal. [Thesis]. Kansas State University; 1986. Available from: http://hdl.handle.net/2097/9904

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

30. Gondelman, Léon. Un système de types pragmatique pour la vérification déductive des programmes : A Pragmatic Type System for Deductive Software Verification.

Degree: Docteur es, Informatique, 2016, Université Paris-Saclay (ComUE)

URL: http://www.theses.fr/2016SACLS583

►

Cette thèse se place dans le contexte de la vérification déductive des programmes et a pour objectif de formaliser un certain nombre de concepts qui… (more)

▼

Cette thèse se place dans le contexte de la vérification déductive des programmes et a pour objectif de formaliser un certain nombre de concepts qui sont mis en œuvre dans l'outil de vérification Why3.L'idée générale est d'explorer des solutions qu'une approche à base de systèmes de types peut apporter à la vérification. Nous commençons par nous intéresser à la notion du code fantôme, une technique implantée dans de nombreux outils de vérification modernes, qui consiste à donner à des éléments de la spécification les apparences d'un code opérationnel. L'utilisation correcte du code fantôme requiert maintes précautions puisqu'il ne doit jamais interférer avec le reste du code. Le premier chapitre est consacré à une formalisation du code fantôme, en illustrant comment un système de types avec effets en permet une utilisation à la fois correcte et expressive. Puis nous nous intéressons à la vérification des programmes manipulant des pointeurs. En présence d'aliasing, c'est-à-dire lorsque plusieurs pointeurs manipulés dans un programme dénotent une même case mémoire, la spécification et la vérification deviennent non triviales. Plutôt que de nous diriger vers des approches existantes qui abordent le problème d'aliasing dans toute sa complexité, mais sortent du cadre de la logique de Hoare, nous présentons un système de types avec effets et régions singletons qui permet d'effectuer un contrôle statique des alias avant même de générer les obligations de preuve. Bien que ce système de types nous limite à des pointeurs dont l'identité peut être connue statiquement, notre observation est qu'il convient à une grande majorité des programmes que l'on souhaite vérifier. Enfin, nous abordons les questions liées à la vérification de programmes conçus de façon modulaire. Concrètement, nous nous intéressons à une situation où il existe une barrière d'abstraction entre le code de l'utilisateur et celui des bibliothèques dont il dépend. Cela signifie que les bibliothèques fournissent à l'utilisateur une énumération de fonctions et de structures de données manipulées, sans révéler les détails de leur implémentation. Le code de l'utilisateur ne peut alors exploiter ces données qu'à travers un ensemble de fonctions fournies. Dans une telle situation, la vérification peut elle-même être modulaire. Du côté de l'utilisateur, la vérification ne doit alors s'appuyer que sur des invariants de type et des contrats de fonctions exposés par les bibliothèques. Du côté de ces dernières, la vérification doit garantir que la représentation concrète raffine correctement les entités exposées, c'est-à-dire en préservant les invariants de types et les contrats de fonctions. Dans le troisième chapitre nous explorons comment un système de types permettant le contrôle statique des alias peut être adapté à la vérification modulaire et le raffinement des structures de données.

This thesis is conducted in the framework of deductive software verification.is aims to formalize some concepts that are implemented in the verification tool Why3. The main idea is to…

Advisors/Committee Members: Filliâtre, Jean-Christophe (thesis director).

Subjects/Keywords: Vérification déductive des programmes; Why3; Raffinement de données; Système de types; Code fantôme; Deductive Software Verification; Why3; Data refinement; Type systems; Ghost code

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Gondelman, L. (2016). Un système de types pragmatique pour la vérification déductive des programmes : A Pragmatic Type System for Deductive Software Verification. (Doctoral Dissertation). Université Paris-Saclay (ComUE). Retrieved from http://www.theses.fr/2016SACLS583

Chicago Manual of Style (16^th Edition):

Gondelman, Léon. “Un système de types pragmatique pour la vérification déductive des programmes : A Pragmatic Type System for Deductive Software Verification.” 2016. Doctoral Dissertation, Université Paris-Saclay (ComUE). Accessed April 21, 2021. http://www.theses.fr/2016SACLS583.

MLA Handbook (7^th Edition):

Gondelman, Léon. “Un système de types pragmatique pour la vérification déductive des programmes : A Pragmatic Type System for Deductive Software Verification.” 2016. Web. 21 Apr 2021.

Vancouver:

Gondelman L. Un système de types pragmatique pour la vérification déductive des programmes : A Pragmatic Type System for Deductive Software Verification. [Internet] [Doctoral dissertation]. Université Paris-Saclay (ComUE); 2016. [cited 2021 Apr 21]. Available from: http://www.theses.fr/2016SACLS583.

Council of Science Editors:

Gondelman L. Un système de types pragmatique pour la vérification déductive des programmes : A Pragmatic Type System for Deductive Software Verification. [Doctoral Dissertation]. Université Paris-Saclay (ComUE); 2016. Available from: http://www.theses.fr/2016SACLS583

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations