Este trabalho examina modalidades intertextuais em quatro peças de Marina Carr - Low in the Dark (1989), The Mai (1994), By the Bog of Cats (1998) e Ariel (2002) -, tendo por objetivo mostrar que a obra da dramaturga, embora organicamente integrada na tradição dramatúrgica irlandesa, exibe um ponto de tensão entre o desejo de preservação de aspectos tradicionais do teatro irlandês e a rebeldia que se traduz na subversão de velhas fórmulas. Esses dois pólos entre os quais se situam as peças da dramaturga revelam-se através da paródia, da alusão, do travestimento e da reescritura, por um lado, e, por outro, através da mistura dos gêneros. As peças selecionadas evidenciam a trajetória percorrida por Marina Carr na medida em que ao mesmo tempo em que se afirmam como locais, lidam com temas que ultrapassam as fronteiras do nacional. / This thesis examines modes of intertextuality in four plays by Marina Carr - Low in the Dark (1989), The Mai (1994), By the Bog of Cats (1998) and Ariel (2002) -, and aims at demonstrating that her theatre production, although organically integrated into the Irish drama tradition, presents a point of tension between the wish to cling to traditional features of Irish theatre and the rebellion against them. These two poles between which the playwright\'s work can be defined are revealed, on the one hand, through intertextual forms such as parody, allusion, travesty and rewriting and, on the other, by the mixture of genres. The chosen plays show evidence of Marina Carr\'s trajectory insofar as they present marks of Irishness and at the same time deal with themes that are not restricted to national problems.

Submitted by Cláudia Bueno (claudiamoura18@gmail.com) on 2015-10-22T18:45:49Z No. of bitstreams: 2 Dissertação - Patrícia Oliveira Santos Mateus - 2015.pdf: 10497789 bytes, checksum: aa23397e22ee294cca332e3c28f8a23f (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2015-10-23T10:37:59Z (GMT) No. of bitstreams: 2 Dissertação - Patrícia Oliveira Santos Mateus - 2015.pdf: 10497789 bytes, checksum: aa23397e22ee294cca332e3c28f8a23f (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Made available in DSpace on 2015-10-23T10:37:59Z (GMT). No. of bitstreams: 2 Dissertação - Patrícia Oliveira Santos Mateus - 2015.pdf: 10497789 bytes, checksum: aa23397e22ee294cca332e3c28f8a23f (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Previous issue date: 2015-04-24 / The writing of texts, in many school contexts, is still an activity that daunts our students. However, we must try to know and use our language in a better way in all demanded social practices. For this reason, we decided to investigate the Teacher's mediation in the process of textual production and rewriting. So, our research has as its object the mediations and interventions made by a Brazilian Portuguese language Teacher in the process of production and rewriting of texts done by her students. In that sense, our main objective is to find out if these mediations have any positive contribution to such process. We defend a socially situated literacy practice and we emphasize that the development of the textual conscience and also the writing domain facilitate the construction of more participative people in a textualized society where they live. We also support writing as a process and not as an isolated act, and, like every progress, it has influence on the individual's upbringing. In regard to the theorical basis, we based this study in many authors, mainly in Mikhail Bakhtin and his concepts related with dialogism, enunciation, speech, intertextuality and responsivity. About the methodology, we chose field research, with a qualitative character, in which we did a case study. We chose a basic education public school. Then we introduced our project and after the consent, we deepened in the research world through interviews, field note and also analysing the mediations made by the Teacher in each textual production offered. Our research was performed during the first semester of 2014 and it involved mediations made in three different moments. / A escrita de textos, ainda, em muitos contextos escolares, é uma atividade que assombra nossos alunos. Porém, temos de buscar conhecer e usar melhor nossa língua em todas as práticas sociais demandadas. Por esse motivo, optamos por investigar a mediação do professor no processo de produção e refacção textual. Assim, nossa pesquisa tem como objeto as mediações-intervenções feitas por uma professora de língua portuguesa no processo de produção e refacção de textos de seus alunos. Nesse sentido, temos como principal objetivo identificar se essas mediações contribuem positivamente para tal processo. Defendemos uma prática de letramento socialmente situada e enfatizamos que o desenvolvimento da consciência de texto e do domínio da escrita facilita a construção de sujeitos mais participantes da sociedade textualizada em que vivem. Ainda, nos posicionamos, a favor da escrita como um processo, e não como um ato isolado, que, como todo processo, influencia na formação dos sujeitos. Em relação aos fundamentos teóricos, nos embasamos em vários autores, sobremaneira em Mikhail Bakhtin e seus conceitos de dialogismo, enunciação, discurso, intertextualidade e responsividade. Quanto à metodologia, optamos pela pesquisa de campo, de caráter qualitativo, tendo realizado um estudo de caso. Escolhemos uma escola pública do ensino básico, apresentamos o projeto e, após consentimento, mergulhamos no mundo da pesquisa, fazendo uso de entrevistas, notas de campo e analisando as mediações feitas pela professora a cada proposta de produção textual. Nossa pesquisa foi realizada durante o primeiro semestre de 2014 e abarcou mediações feitas em três momentos diferentes.

FundaÃÃo Cearense de Apoio ao Desenvolvimento Cientifico e TecnolÃgico / A presente dissertaÃÃo examina a construÃÃo do espaÃo em duas narrativas: o romance Howards End (1910), de E. M. Forster, e o filme Retorno a Howards End (1992), dirigido por James Ivory. Nossa hipÃtese à de que a narrativa fÃlmica serve-se de elementos espaciais para tecer comentÃrios sobre o gÃnero ao qual pertence: os filmes de heranÃa; e, assim, reformula a discussÃo inicial a que essas narrativas estavam atreladas. Desse modo, a funÃÃo do espaÃo no filme difere daquela empregada no romance. Trata-se, portanto, de uma estratÃgia tradutÃria que coloca o texto de Ivory em diÃlogo com a sua Ãpoca, apesar de buscar recriar o perÃodo eduardiano na tela. Para demonstrar a nossa interpretaÃÃo, examinamos primeiramente o espaÃo no romance de Forster. ConcluÃmos que, nesse texto, a construÃÃo do espaÃo apresenta as seguintes funÃÃes: discutir simbolicamente a complexidade dos gÃneros masculino e feminino, o modo arbitrÃrio com que a questÃo era percebida no inÃcio do sÃculo XX, e a representaÃÃo da casa como local de refÃgio contra o sentimento de fragmentaÃÃo na sociedade; os espaÃos externos funcionam como cenÃrio no qual refletem-se as profundas transformaÃÃes trazidas pela modernidade no inÃcio do sÃculo passado. No filme, por outro lado, o espaÃo faz uso da estÃtica da exposiÃÃo, uma caracterÃstica tÃpica dos filmes de heranÃa, para redimensionar a discussÃo sobre a identidade inglesa. Se, em seu inÃcio, o discurso do gÃnero em questÃo procurava resgatar o ideÃrio imperialista britÃnico, o filme de Ivory desconstrÃi tal noÃÃo e aponta para a impossibilidade deste retorno. Nosso trabalho ampara-se em conceitos oriundos dos Estudos Descritivos de traduÃÃo, partindo da teoria dos polissistemas de Even-Zohar (1990), o conceito de reescritura de Lefevere (2007), e em estudos que enfocam a narrativa cinematogrÃfica, como Vanoye & Goliot-LÃtà (1994), Aumont (1995), Silva (2007) e Gaudreault & Jost (2009). / This dissertation examines the construction of space in two narratives: the novel Howards End (1910), by E. M. Forster, and the homonymous film (1992), directed by James Ivory. Our hypothesis is that the film makes use of spatial elements to comment on the film genre itself: the heritage films; and so, it reformulates the initial discourse with which such narratives were related to. Thereby, the function of space in the film is different from that function used in the novel. It is, therefore, a translation strategy which places Ivoryâs text in a dialectical relation with its own time, although it tries to recreate Edwardian period on screen. In order to demonstrate our interpretation, we firstly examined the space in the novel. We concluded that, in this text, the space has the following functions: to symbolically discuss the complexity of male and female genres, showing the arbitrary way by which this question was seen at the beginning of the 20th century, and the representation of the house as a place of refuge from the feeling of fragmentation in society; exterior places function as sceneries in which the deep changes brought by modernity are reflected. In the film, however, space is used to construct the aesthetics of display, a typical characteristic of heritage films, to modify the notions on English identity commonly related to these narratives. If, at the beginning, heritage films discourse attempted to redeem British imperialistic position, Ivoryâs film deconstructs such attempt and indicates its impossibility. Our work is based on concepts from Descriptive Translation Studies, from polysystem theory by Even-Zohar (1990), Lefevereâs concept of rewriting, and on studies that deal with film narratives such as Vanoye & Goliot-LÃtà (1994), Aumont (1995), Silva (2007) and Gaudreault & Jost (2009).

The main argument of this thesis is that the rewriters of the story of the Guantánamo Bay Detainee Library, namely journalists and filmmakers, engage differently with primary source material about the detention facility; what they omit and include in their narratives varies and depends largely on their pre-established ideologies. In the field of translation studies, this thesis contributes a new case study; it considers the problematic interplay between law, libraries, and multilingual information access in detention facilities. My research also demonstrates the challenges of examining a library that belongs to a highly controversial military system. In the first chapter I review previous studies of detainee libraries, and I introduce the concepts of rewriting, power, patronage, and ideology. In the second chapter I evaluate how reading material is unevenly distributed across nineteen language groups in the Guantánamo Bay Detainee Library. In the third chapter I reflect on the ways in which news articles written by civilian and military journalists about the Guantánamo Bay Detainee Library are rooted in disparate ideologies. In the fourth chapter I parse the story of the Guantánamo Bay Detainee Library as it is told through the fictitious lens of the film Camp X-Ray (2014). In the fifth and final chapter I summarize the logistical challenges of studying the Guantánamo Bay Detainee Library from afar and imagine what future might await its books.

The goal of this paper is to present a methodology for rewriting outdated software systems. We developed this method based on a work assignment from the company SSAB AB, where we were tasked with rewriting one of their outdated systems to fit modern standards. This paper discusses the reasons for rewriting outdated systems, and the steps of planning, analysing source code, the rewriting procedure, documenting the rewritten code, and evaluating it. By using the method we developed, we were able to produce a satisfactory rewritten application for SSAB, and believe that it can be reused for similar purposes in the future.

Memory corruption continues to plague modern software systems, as it has for decades. With the emergence of code-reuse attacks which take advantage of these vulnerabilities like Return- Oriented Programming (ROP) or non-control data attacks like Data-Oriented programming (DOP), defenses against these are growing thin. These attacks, and more advanced variations of them, are becoming more difficult to detect and to mitigate. In this arms race, it is critical to not only develop mitigation techniques, but also ways we can effectively deploy those techniques. In this work, we present rave - a framework which takes common design features of defenses against memory corruption and code-reuse and puts them in a real-world setting. Rave consists of two components: librave, the library responsible for static binary analysis and instrumentation, and CRIU-rave, an extended version of the battle-tested process migration tool available for Linux. In our prototype of this framework, we have shown that these tools can be used to rewrite live applications, like NGINX, with enough randomization to disrupt memory corruption attacks. This work is supported in part by ONR under grant N00014-18-1-2022 and NAVSEA/NEEC/NSWC Dahlgren under grant N00174-20-1-0009. / Master of Science / Memory corruption attacks continue to be a concrete threat against modern computer systems. Malicious actors can take advantage of related vulnerabilities to carry out more advance, hard-to-detect attacks which give them control of the target or leak critical information. Many works have been developed to defend against these sophisticated attacks and their triggers (memory corruption), but many struggle to be adopted into the real-world for reasons such as instability or difficulty in deployment. In this work, we introduce rave, a framework which seeks to address issues of stability and deployment by designing a way for defenders to coordinate and apply mitigation techniques in a real-world setting.

We present a generic proof methodology to automatically prove correctness of design transformations introduced at the Register-Transfer Level (RTL) to achieve lower power dissipation in hardware systems. We also introduce a new algorithm to reduce switching activity power dissipation in microprocessors. We further apply our technique in a completely different domain of dynamic power management of Systems-on-Chip (SoCs). We demonstrate our methodology on real-life circuits. In this thesis, we address the dual problem of transforming hardware systems at higher levels of abstraction to achieve lower power dissipation, and a reliable way to verify the correctness of the afore-mentioned transformations. The thesis is in three parts. The first part introduces Instruction-driven Slicing, a new algorithm to automatically introduce RTL/System level annotations in microprocessors to achieve lower switching power dissipation. The second part introduces Dedicated Rewriting, a rewriting based generic proof methodology to automatically prove correctness of such high-level transformations for lowering power dissipation. The third part implements dedicated rewriting in the context of dynamically managing power dissipation of mobile and hand-held devices. We first present instruction-driven slicing, a new technique for annotating microprocessor descriptions at the Register Transfer Level in order to achieve lower power dissipation. Our technique automatically annotates existing RTL code to optimize the circuit for lowering power dissipated by switching activity. Our technique can be applied at the architectural level as well, achieving similar power gains. We first demonstrate our technique on architectural and RTL models of a 32-bit OpenRISC pipelined processor (OR1200), showing power gains for the SPEC2000 benchmarks. These annotations achieve reduction in power dissipation by changing the logic of the design. We further extend our technique to an out-of-order superscalar core and demonstrate power gains for the same SPEC2000 benchmarks on architectural and RTL models of PUMA, a fixed point out-of-order PowerPC microprocessor. We next present dedicated rewriting, a novel technique to automatically prove the correctness of low power transformations in hardware systems described at the Register Transfer Level. We guarantee the correctness of any low power transformation by providing a functional equivalence proof of the hardware design before and after the transformation. Dedicated rewriting is a highly automated deductive verification technique specially honed for proving correctness of low power transformations. We provide a notion of equivalence and establish the equivalence proof within our dedicated rewriting system. We demonstrate our technique on a non-trivial case study. We show equivalence of a Verilog RTL implementation of a Viterbi decoder, a component of the DRM System-On-Chip (SoC), before and after the application of multiple low power transformations. We next apply dedicated rewriting to a broader context of holistic power management of SoCs. This in turn creates a self-checking system and will automatically flag conflicting constraints or rules. Our system will manage power constraint rules using dedicated rewriting specially honed for dynamic power management of SoC designs. Together, this provides a common platform and representation to seamlessly cooperate between hardware and software constraints to achieve maximum platform power optimization dynamically during execution. We demonstrate our technique in multiple contexts on an SoC design of the state-of-the-art next generation Intel smartphone platform. Finally, we give a proof of instruction-driven slicing. We first prove that the annotations automatically introduced in the OR1200 processor preserve the original functionality of the machine using the ACL2 theorem prover. Then we establish the same proof within our dedicated rewriting system, and discuss the merits of such a technique and a framework. In the context of today's shrinking hardware and mobile internet devices, lowering power dissipation is a key problem. Verifying the correctness of transformations which achieve that is usually a time-consuming affair. Automatic and reliable methods of verification that are easy to use are extremely important. In this thesis we have presented one such transformation, and a generic framework to prove correctness of that and similar transformations. Our methodology is constructed in a manner that easily and seamlessly fits into the design cycle of creating complicated hardware systems. Our technique is also general enough to be applied in a completely different context of dynamic power management of mobile and hand-held devices. / text

Thesis (MSc (Mathematical Sciences))--University of Stellenbosch, 2008. / Context-free grammars are well-studied and well-behaved in terms of decidability, but many real-world problems cannot be described with context-free grammars. Grammars with regulated rewriting are grammars with mechanisms to regulate the applications of rules, so that certain derivations are avoided. Thus, with context-free rules and regulated rewriting mechanisms, one can often generate languages that are not context-free. In this thesis we study grammars with regulated rewriting mechanisms. We consider problems in which context-free grammars are insufficient and in which more descriptive grammars are required. We compare bag context grammars with other well-known classes of grammars with regulated rewriting mechanisms. We also discuss the relation between bag context grammars and recognizing devices such as counter automata and Petri net automata. We show that regular bag context grammars can generate any recursively enumerable language. We reformulate the pumping lemma for random permitting context languages with context-free rules, as introduced by Ewert and Van der Walt, by using the concept of a string homomorphism. We conclude the thesis with decidability and complexity properties of grammars with regulated rewriting.

Dieser Bericht präsentiert RACR-NET, eine Schnittstelle der Referenzattributgrammatik-gesteuerten Graphersetzungsbibliothek RACR für C#. RACR-NET ermöglicht die Nutzung der deklarativen, dynamischen Sprachspezifikations-, Instanziierungs- und Auswertungsmeachanismen der RACR Scheme-Bibliothek in der objektorientierten Programmierung. Dies umfasst insbesondere die automatische inkrementelle Auswertung attributbasierter semantischer Analysen und somit das automatische Cachen parametrisierter Funktionsmethoden. Graphersetzungen entsprechen hierbei Zustandsänderungen von Objektinstanzen und der Invalidierung abgeleiteter Berechnungen. Schwerpunkt dieses Berichts ist die objektorientierte Programmierschnittstelle von RACR-NET, dessen praktische Anwendung und Implementierung. Der Bericht ist ein Referenzhandbuch für RACR-NET Anwender und Entwickler.

S'assurer qu'un programme informatique se comporte bien, surtout dans des applications critiques (santé, transport, énergie, communications, etc.) est de plus en plus important car les ordinateurs et programmes informatiques sont de plus en plus omniprésents, voir essentiel au bon fonctionnement de la société. Mais comment vérifier qu'un programme se comporte comme prévu, quand les informations qu'il prend en entrée sont de très grande taille, voire de taille non bornée a priori ? Pour exprimer avec exactitude ce qu'est le comportement d'un programme, il est d'abord nécessaire d'utiliser un langage logique formel. Cependant, comme l'a montré Gödel dans, dans tout système formel suffisamment riche pour faire de l'arithmétique, il y a des formules valides qui ne peuvent pas être prouvées. Donc il n'y a pas de programme qui puisse décider si toute propriété est vraie ou fausse. Cependant, il est possible d'écrire un programme qui puisse vérifier la correction d'une preuve. Ce travail utilisera justement un tel programme, Coq, pour formellement vérifier la correction d'un certain programme. Dans cette thèse, nous expliquons le développement d'une nouvelle version de Rainbow, plus rapide et plus sûre, basée sur le mécanisme d'extraction de Coq. La version précédente de Rainbow vérifiait un certificat en deux étapes. Premièrement, elle utilisait un programme OCaml non certifié pour traduire un fichier CPF en un script Coq, en utilisant la bibliothèque Coq sur la théorie de la réécriture et la terminaison appelée CoLoR. Deuxièmement, elle appelait Coq pour vérifier la correction du script ainsi généré. Cette approche est intéressante car elle fournit un moyen de réutiliser dans Coq des preuves de terminaison générée par des outils extérieurs à Coq. C'est également l'approche suivie par CiME3. Mais cette approche a aussi plusieurs désavantages. Premièrement, comme dans Coq les fonctions sont interprétées, les calculs sont beaucoup plus lents qu'avec un langage où les programmes sont compilés vers du code binaire exécutable. Deuxièmement, la traduction de CPF dans Coq peut être erronée et conduire au rejet de certificats valides ou à l'acceptation de certificats invalides. Pour résoudre ce deuxième problème, il est nécessaire de définir et prouver formellement la correction de la fonction vérifiant si un certificat est valide ou non. Et pour résoudre le premier problème, il est nécessaire de compiler cette fonction vers du code binaire exécutable. Cette thèse montre comment résoudre ces deux problèmes en utilisant l'assistant à la preuve Coq et son mécanisme d'extraction vers le langage de programmation OCaml. En effet, les structures de données et fonctions définies dans Coq peuvent être traduits dans OCaml et compilées en code binaire exécutable par le compilateur OCaml. Une approche similaire est suivie par CeTA en utilisant l'assistant à la preuve Isabelle et le langage Haskell. / Making sure that a computer program behaves as expected, especially in critical applications (health, transport, energy, communications, etc.), is more and more important, all the more so since computer programs become more and more ubiquitous and essential to the functioning of modern societies. But how to check that a program behaves as expected, in particular when the range of its inputs is very large or potentially infinite? In this work, we explain the development of a new, faster and formally proved version of Rainbow based on the extraction mechanism of Coq. The previous version of Rainbow verified a CPF le in two steps. First, it used a non-certified OCaml program to translate a CPF file into a Coq script, using the Coq libraries on rewriting theory and termination CoLoR and Coccinelle. Second, it called Coq to check the correctness of the script. This approach is interesting for it provides a way to reuse in Coq termination proofs generated by external tools. This is also the approach followed by CiME3. However, it suffers from a number of deficiencies. First, because in Coq functions are interpreted, computation is much slower than with programs written in a standard programming language and compiled into binary code. Second, because the translation from CPF to Coq is not certified, it may contain errors and either lead to the rejection of valid certificates, or to the acceptance of wrong certificates. To solve the latter problem, one needs to define and formally prove the correctness of a function checking whether a certificate is valid or not. To solve the former problem, one needs to compile this function to binary code. The present work shows how to solve these two problems by using the proof assistant Coq and its extraction mechanism to the programming language OCaml. Indeed, data structures and functions de fined in Coq can be translated to OCaml and then compiled to binary code by using the OCaml compiler. A similar approach was first initiated in CeTA using the Isabelle proof assistant.