Due to the significant limitations of static analysis and the dynamic nature of pointers in weakly typed programming languages like C and C++, the points-to sets obtained at compile time are quite conservative. Most static pointer analysis methods trade the precision for the analysis speed. The methods that perform the analysis in a reasonable amount of time are often context and/or flow insensitive. Other methods that are context, flow, and field sensitive have to perform the whole program inter-procedural analysis, and do not scale with respect to the program size. A large class of problems involving optimizations such as instruction prefetching, control and data speculation, redundant load/store instructions removal, instruction scheduling, and memory disambiguation suffer due to the imprecise and conservative points-to sets computed statically. One could possibly live without optimizations, but in domains involving memory security and safety, lack of the precise points-to sets can jeopardize the security and safety. In particular, the lack of dynamic points-to sets drastically reduce the ability to reason about a program's memory access behavior, and thus illegal memory accesses can go unchecked leading to bugs as well as security holes. On the other hand, the points-to sets can be very useful for other domains such as the heap shape analysis and garbage collection. The knowledge of precise points-to sets is therefore becoming very important, but has received little attention so far beyond a few studies, which have shown that the pointers exhibit very interesting behaviors during execution. How to track such behaviors dynamically and benefit from them is the topic covered by this research. In this work, we propose a technique to compute the precise points-to sets through dynamic pointer tracking. First, the compiler performs the pointer analysis to obtain the static points-to sets. Then, the compiler analyzes the program, and inserts the necessary instructions to refine the points-to sets. At runtime, the inserted instructions automatically update the points-to sets. Dynamic pointer tracking in software can be expensive and can be a barrier to the practicality of such methods. Several optimizations including removal of redundant update, post-loop update, special pattern driven update removal, pointer initialization update removal, update propagation, invariant removal, and on demand update optimization are proposed. Our experimental results demonstrate that our mechanism is able to compute the points-to sets dynamically with tolerable overheads. Finally, the memory protection and garbage collection work are presented as the consumers of dynamic pointer tracking to illustrate its importance. In particular, it is shown how different memory properties can be easily tracked using the dynamic points-to sets opening newer possibilities.

This dissertation is intended to serve as a thorough examination of a particular debate between Lho pa Thugs rje dpal and Rong ston Shakya rgyal mtshan (1367-1449). According to the colophon of this medieval Tibetan debate record, which also appears to be the only currently surviving medieval Tibetan debate record in Tibetan literature, this debate took place in Sa skya and was recorded by both debaters' disciples without bias. The date of this debate was sometime between 1388 and 1393 during Rong ston's first visit to the Gtsang area.

Ο Επαγωγικός Λογικός Προγραμματισμός (Inductive Logic Programming ή, σε συντομογραφία ILP) είναι ο ερευνητικός τομέας της Τεχνητής Νοημοσύνης (Artificial Intelligence) που δραστηριοποιείται στη τομή των γνωστικών περιοχών της Μάθησης Μηχανής (Machine Learning) και του Λογικού Προγραμματισμού (Logic Programming).Ο όρος επαγωγικός εκφράζει την ιδέα του συλλογισμού από το επί μέρους στο γενικό. Μέσω της επαγωγικής μάθησης μηχανής ο Επαγωγικός Λογικός Προγραμματισμός επιτυγχάνει το στόχο του που είναι η δημιουργία εργαλείων και η ανάπτυξη τεχνικών για την εξαγωγή υποθέσεων από παρατηρήσεις (παραδείγματα) και η σύνθεση-απόκτηση νέας γνώσης από εμπειρικές παρατηρήσεις. Σε αντίθεση με της περισσότερες άλλες προσεγγίσεις της επαγωγικής μάθησης ο Επαγωγικός Λογικός Προγραμματισμός ενδιαφέρεται για της ιδιότητες του συμπερασμού με κανόνες για την σύγκλιση αλγορίθμων και για την υπολογιστική πολυπλοκότητα των διαδικασιών. Ο Επαγωγικός Λογικός Προγραμματισμός ασχολείται με την ανάπτυξη τεχνικών και εργαλείων για την σχεσιακή ανάλυση δεδομένων. Εφαρμόζεται απευθείας σε δεδομένα πολλαπλών συσχετισμών για την ανακάλυψη προτύπων. Τα πρότυπα που ανακαλύπτονται από τα συστήματα στον Επαγωγικό Λογικό Προγραμματισμό προκύπτουν από κάποιο γνωστό θεωρητικό υπόβαθρο και θετικά και αρνητικά παραδείγματα και εκφράζονται ως λογικά προγράμματα. Ο Επαγωγικός Λογικός Προγραμματισμός έχει χρησιμοποιηθεί εκτεταμένα σε προβλήματα που αφορούν τη μοριακή βιολογία, την βιοχημεία και την χημεία. Ο Επαγωγικός Λογικός Προγραμματισμός διαφοροποιείται από τις άλλες μορφές Μάθησης Μηχανής, αφ’ ενός μεν λόγω της χρήσης μιας εκφραστικής γλώσσας αναπαράστασης και αφ’ ετέρου από τη δυνατότητά του να χρησιμοποιεί τη γνώση υποβάθρου. Έχουν αναπτυχθεί διάφορες μηχανισμούς υλοποίησης του ILP, εκ των οποίων η πιο πρόσφατη είναι η Progol, που βασίζεται σε ένα διερμηνέα της Prolog ο οποίος συνοδεύεται από έναν αλγόριθμο Αντίστροφης Συνεπαγωγής (Inverse Entailment). Η Progol κατασκευάζει νέες προτάσεις με τη γενίκευση των παραδειγμάτων που περιέχονται στη βάση δεδομένων που της δίνεται. Η θεωρία του Επαγωγικού Λογικού Προγραμματισμού εγγυάται ότι η Progol θα διεξάγει μια αποδεκτή αναζήτηση στο διάστημα των γενικεύσεων, βρίσκοντας το ελάχιστο σύνολο προτάσεων, από το οποίο όλα τα παραδείγματα μπορούν να προκύψουν. Σε αυτή την εργασία θα αναπτυχθούν αναλυτικά η θεωρία και οι κανόνες του Επαγωγικού Λογικού Προγραμματισμού, τα είδη των προβλημάτων που επιλύονται μέσω του Επαγωγικού Λογικού Προγραμματισμού, οι μέθοδοι που ακολουθούνται καθώς και ο τρόπος με τον οποίο αναπτύσσονται οι εφαρμογές του Επαγωγικού Λογικού Προγραμματισμού. Θα δοθούν επίσης παραδείγματα κατάλληλα για την κατανόηση των γνώσεων αυτών από ένα ακροατήριο που διαθέτει βασικές γνώσεις Λογικής και Λογικού Προγραμματισμού. / Inductive Logic Programming is a research area of Artificial Intelligence that operates in the intersection of cognitive areas of Machine Learning and Logic Programming. Through inductive machine learning, Inductive Logic Programming‟s objective is creating tools and developing techniques to extract new knowledge composing a background one and empirical observations (examples). Some methods are employed, the best known of which is the reverse implication, the reverse resolution and the inverse implication. Based on Inductive Logic Programming, some systems have been developed for knowledge production. The most widely used system is Progol, which uses an input of examples and background knowledge, whichε is stated in a kind of grammar compatible to that the programming language Prolog, and generates procedures in the same language that illustrate these examples. Other systems are FOIL, MOBAL, GOLEM and LINUS. There is also Cigol which is a programming language based on the theory of Inductive Logic Programming. These systems are used in many applications. The most important is the area of pharmacology, such as predictive toxicology, the provision of rheumatic disease and the design of drugs for Alzheimer's. Applications can also be found in programming, linguistics and games like chess.

Submitted by Aelson Maciera (aelsoncm@terra.com.br) on 2017-08-25T18:53:26Z No. of bitstreams: 1 DissGP.pdf: 3104844 bytes, checksum: 2e20a531a8e46327359fb4eacc9adf50 (MD5) / Approved for entry into archive by Ronildo Prado (bco.producao.intelectual@gmail.com) on 2018-01-24T12:17:05Z (GMT) No. of bitstreams: 1 DissGP.pdf: 3104844 bytes, checksum: 2e20a531a8e46327359fb4eacc9adf50 (MD5) / Approved for entry into archive by Ronildo Prado (bco.producao.intelectual@gmail.com) on 2018-01-24T12:18:07Z (GMT) No. of bitstreams: 1 DissGP.pdf: 3104844 bytes, checksum: 2e20a531a8e46327359fb4eacc9adf50 (MD5) / Made available in DSpace on 2018-01-24T12:21:46Z (GMT). No. of bitstreams: 1 DissGP.pdf: 3104844 bytes, checksum: 2e20a531a8e46327359fb4eacc9adf50 (MD5) Previous issue date: 2017-05-05 / Não recebi financiamento / The purpose of this work is to propose a method that allow to bring the fundamentals of mathematical logic to high school through the use of set theory, however making the whole approach of the subject through diagrams, making it possible to avoid, for the demonstrations and understanding necessary to the development of the subject, the rigors of writing used in mathematical logic, which, in a first contact, tend to discourage the interest of beginning students. / O objetivo deste trabalho é propor um método que permita levar os fundamentos da lógica matemática para o ensino médio por meio da utilização da teoria dos conjuntos, porém fazendo todo a aproximação do assunto utilizando diagramas, tornando possível evitar assim, para as demonstrações e o entendimento necessários ao desenvolvimento do assunto, os rigores da escrita utilizada na lógica matemática, que, em um primeiro contato, podem desestimular o interesse dos alunos iniciantes

The subject of this dissertation is an analysis of the use of verbal tenses in Czech subordinate clauses. This analysis is based on the notions of relative and absolute tenses and on the distinction between content and adjunct clauses. We test the hypothesis about the connection of relative and absolute tense with the type of a subordinated clause (content and adjunct) and propose a revised version of the views presented in Czech grammars, monographs and articles based on a detailed analysis of the data from the Czech National Corpus. The syntactic and semantic criteria for the classification of dependent clauses into content and adjunct classes are studied together with the conditions for the application of relative or absolute tense. The great amount of data exploited from the Czech National Corpus support the idea that beside the expected forms of tense (relative in content clauses, absolute in adjunct clauses) there exists some shifting of the presupposed forms of verbal tenses. The explanation of these shifts is presented in this dissertation as a new contribution to the study of the interplay between Czech morphology and syntax. Key Words: subordinate content clause, relative tense, absolute tense, factual predicate, indirect speech

This thesis investigates an exclamative construction very used by the native speakers of Brazilian Portuguese, but under-researched, namely, the Free Small Clauses (FSCs), juxtaposition of a predicate and its subject, in that order, without any verb or morphological specification for tense on the surface, as in the following construction Bonita a sua roupa Your Clothes are beautiful , for example. The main goal of this study is to answer the following question: what is the internal structure of the FSCs of Brazilian Portuguese? In order to answer this question, at first, this work establishes what are the syntactic-semantic restrictions which govern the constitutive elements of this kind of constructions, describing the contexts in which the predicate and the subject can act. For the analysis of FSCs, we took as the theoretical assumptions the generative enterprise in its minimalist model (cf. CHOMSKY, 2000 et passim), as well as the notion of predication and phase extension as delimited in Den Dikken (2006, 2007). To answer the question put before, i.e., what is the internal structure of FSCs, we did several tests to understand what would be the internal composition of this type of structure and what is the structural position of its elements. What we could conclude in the end of this work is that the FSCs are root TPs, that is, one TP phase. Differently of Chomsky (2000), who admits that only CP and v*P can be strong phases, this thesis bring some evidences from Brazilian Portuguese in favor of the idea that TP would also be a phase. / Conselho Nacional de Desenvolvimento Científico e Tecnológico / Esta tese investiga uma construção exclamativa muito usada pelos falantes do português brasileiro, mas pouco estudada, nomeadamente, as Small Clauses Livres (SCLs), a justaposição de um predicado e seu sujeito, nessa ordem, sem nenhum verbo nem nenhuma informação de tempo na superfície, como na construção Bonita a sua roupa, por exemplo. O principal objetivo deste estudo é responder a seguinte questão: qual a estrutura interna das SCLs do Português Brasileiro? Para tal investigação, o presente trabalho, num primeiro momento, estabelece quais são as restrições sintático-semânticas que regem os elementos constitutivos desse tipo de construção, descrevendo os contextos em que o predicado e o sujeito podem atuar. Para a análise das SCLs, tomamos como embasamento teórico os pressupostos da Teoria Gerativa no seu modelo minimalista (cf. CHOMSKY, 2000 e seqüência), bem como a noção de predicação e extensão de fase de Den Dikken (2006, 2007). A fim de desvendar qual a estrutura interna das SCLs, fizemos diversos testes no sentido de entender qual seria a composição interna desse tipo de estrutura e qual a posição estrutural de seus elementos. O que esta pesquisa conclui é que as SCLs são TPs raízes, ou seja, uma fase TP, desse modo, diferentemente de Chomsky (2000), que admite apenas CP e v*P como uma fase forte, esta tese traz evidências a favor da idéia TP também seria uma fase.

This thesis presents an extension to Hyperledger Fabric, a private blockchain system, allowing historic transactions to be pruned without peer coordination. The feature is facilitated via pruning predicate functions, provided along any smart contracts a given system is desired to host. An evaluation of the extension demonstrates its impact, in terms of memory saved, for a specific asset delivery use case. It is concluded that the gains of pruning historic transactions from blockchain systems could yield significantly reduced storage requirements for some categories of applications, especially such with low transaction interdependency. It is also suggested that the deterministic consensus algorithms used by Hyperledger Fabric makes the transaction histories it may maintain not strictly required, meaning that the particular set of transactions that must survive pruning depend on what properties a blockchain is expected to maintain.

Magister Legum - LLM

Cette thèse vise à traiter les verbes composés en japonais et les verbes préverbés en polonais comme faisant partie des constructions verbales à prédicat complexe. D’abord, la notion de la formation des mots et, par conséquent, la notion de « mot », sont examinées par les analyses entre les mots (ortho)graphiques et prosodiques ; le problème d’espace entre les mots et différents systèmes d’accentuation sont pris en compte. D’une part, l’analyse des verbes composés japonais remonte jusqu’aux deux premières grammaires au XVIIe siècle, celle de Rodriguez et de Collado, dont la première propose la dichotomie entre les verbes composés à « mode de l’action » et à « particule ». Ensuite suivent les analyses des verbes composés contemporains, avec un accent particulier sur un certain nombre de couples de verbes transitifs et intransitifs en second élément du composé. D’autre part, la typologie des constructions préverbales de la langue polonaise est examinée. Enfin, à travers la comparaison multilingue du Petit prince de Saint-Exupéry entre l’original et deux traductions japonaises et deux polonaises, une typologie des constructions verbales à prédicat complexe est proposée, ce qui fait écho au choix de notre langue de rédaction, le français servant de pivot afin d’examiner diverses constructions verbales de nos langues de comparaison, le japonais et le polonais : composition verbale et construction converbale pour le premier et préverbation et construction infinitivale à semi-auxiliaire pour le second. / This thesis seeks to analyse Japanese compound verbs and Polish prefixed verbs as a part of complex predicate verbal constructions. First, the notion of word-formation and consequently that of word are examined by analyses between (ortho)graphic and prosodical words, which include problems of word space and several accentual systems. Next, this analysis of compound verbs goes back to 17th century with the first two Japanese grammars by Rodriguez and Collado, respectively, where the former proposes a dichotomy between manner of action and particle verbal compounds. Then follows an analysis of contemporary Japanese compound verbs, with particular emphasis on some pairs of transitive and intransitive verbs in the second element of compound. Contrastingly, a typology of verbal prefix constructions in Polish is considered and reviewed. Finally, through a multilingual comparison of The Little Prince, by Saint-Exupéry, using two translations in each of Japanese and Polish, a typology of complex predicate verbal constructions is put forward which corresponds with the language, French, in which this thesis is written and which serves as a pivot for the examination of various verbal constructions of the languages for comparison, Japanese and Polish: verbal compounding and converbal construction for the former, verbal prefixation and infinitival auxiliary construction for the latter.

This study focuses on examining the security implications of money laundering and countermeasures, with reference to South Africa. The purpose of this study was to establish the following: <ul> <li> What is the extent, and what are the security implications of money laundering in South Africa;</li> <li> whether the current money laundering countermeasures in South Africa were effectively implemented from 1994 up to the end of 2006;</li> <li> if South Africa could implement better money laundering controls when compared to the G7/8 countries; and</li> <li> what the factors were that influenced money laundering in South Africa, compared to the G7/8 countries</li> </ul> This study also examined the validity of the following assumptions: <ul> <li>That there are still shortcomings in the practical application of money laundering countermeasures in South Africa, despite these countermeasures being based on the legislative measures adopted by the G7/8 countries; and</li> <li> money laundering promotes crime and corruption in South Africa.</li> </ul> An analysis of the South African anti-money laundering legislation indicated that South Africa had legislatively adopted all of the Financial Action Task Force money laundering recommendations. It was found that despite the strong legislative framework to combat money laundering in South Africa, these efforts were undermined by a lack of capacity; poor coordination that led to a large volume of reports being filed without a corresponding track record of successful prosecutions; and the failure to adopt advances in information technology. This led to a lack of effectively and efficiently translating the anti-money laundering legislation into practice in South Africa. / Dissertation (M(Security Studies))--University of Pretoria, 2008. / Political Sciences / unrestricted