Search

Goblint is a source code analysis tool for C programs. It is based on abstract interpretation, and aims for a sound analysis. For loop representation and analysis, Goblint currently performs a simple CIL transformation to the input C code and can be refined by choosing one of two different abstract array domains. These domains are quite imprecise, as all elements of an array are represented by either one or three abstract values, depending on the domain used. In other known static analyzers, the analysis of loops is made more precise by treating the first k iterations of the loop separately from the following ones. This transformation is known as loop unrolling. In general, the larger the k, the more precise the analysis, and the longer it takes to perform. The goal of this thesis is to design and implement a limited unrolling of loops of the analyzed program, and an abstract domain for arrays that can express precise information for the values at the first k index of the array. Together, those modifications optimize the precision of the analysis results that Goblint produces at loops. The approach proposed is powerful enough to transform all types of loops supported in C programs, even complex structures like nested loops. It also handles complete initialization of arrays and updates after initialization. The overhead of the analysis for real-world programs (about 50%) after integration into Goblint is also reported.

In this thesis, we try to bridge the gap between which program transformations are possible at source-level and which are possible at binary-level. While binaries are typically seen as opaque artifacts, our binary recompiler Egalito (ASPLOS 2020) enables users to parse and modify stripped binaries on existing systems. Our technique of binary recompilation is not robust to errors in disassembly, but with an accurate analysis, provides near-zero transformation overhead. We wrote several demonstration security tools with Egalito, including code randomization, control-flow integrity, retpoline insertion, and a fuzzing backend. We also wrote Nibbler (ACSAC 2019, DTRAP 2020), which detects unused code and removes it. Many of these features, including Nibbler, can be combined with other defenses resulting in multiplicatively stronger or more effective hardening. Enabled by our recompiler, an overriding theme of this thesis is our focus on deployable software transformation. Egalito has been tested by collaborators across tens of thousands of Debian programs and libraries. We coined this term egalitarian in the context of binary security. Simply put, an egalitarian analysis or security mechanism is one that can operate on itself (and is usually more deployable as a result). As one demonstration of this idea, we created a strong, deployable defense against code reuse attacks. Shuffler (OSDI 2016) randomizes function addresses, moving functions periodically every few milliseconds. This makes an attacker's job extremely difficult, especially if they are located across a network (which necessitates ping time) -- JIT-ROP attacks take 2.3 to 378 seconds to complete. Shuffler is egalitarian and defends its own code and target code simultaneously; Shuffler actually shuffles itself. We hope our deployable, egalitarian binary defenses will allow others to improve upon state-of-the-art and paint binaries as far more malleable than they have been in the past.

In der analogen Welt lassen sich klare Grenzen zwischen der Übertragung und der Überlassung der Nutzung einer Sache beschreiben. Das internationale Steuerrecht knüpft an diese Grenzen an, etwa in den Vorschriften über Quellensteuern auf Entgelte für Nutzungsüberlassungen. Während das Nutzungsentgelt im Schuldnerstaat belastet wird, trifft das Erwerbsentgelt diese Belastung nicht. In der digitalen Welt fällt es schwer, zwischen Übertragung und bloßer Nutzungsüberlassung beliebig zu teilbarer und vervielfältigbarer immaterieller Werte zu unterscheiden. Hinzu kommt die Frage, ob Eigenschaftserweiterungen, als Dienstleistung oder Rechteüberlassung zu qualifizieren sind. Die Arbeit von Frau Kloß widmet sich diesen Kernfragen der Besteuerung grenzüberschreitender digitaler Geschäftsmodelle. Sie strukturiert bestehende Anknüpfungsmerkmale und Verteilungsregeln im nationalen und internationalen Steuerrecht und diskutiert exemplarisch einige bedeutsame Anwendungsfälle im geltenden Recht. Dort endet ihre Arbeit aber nicht, sondern sie greift, meinungsstark, darüber hinaus aktuelle rechtspolitische Diskussionen auf. Wer den Einstieg in diese höchst praxisrelevante Problematik sucht, liest diese im 2. Halbjahr 2019 enstandene Masterarbeit mit großem Gewinn.

Moonbit is a hybrid work comprised of experimental poetry and a critical theory of the poetics and politics of computer code. It offers an extended intellectual and creative engagement with the affordances of computer software through multiple readings and re-writings of a singular text, the source code of the Apollo 11 Guidance Computer or the “AGC.” Moonbit re-marks and remixes the code that made space travel possible. Half of this book is erasure poetry that uses the AGC code as the source text, building on the premise that code can speak beyond its functional purpose. When we think about the 1960s U.S. space program and obscure scientific computer code, we might not first think about the Watts riots, Shakespeare, Winnie the Pooh, T.S. Eliot, or scatological jokes. Yet these cultural references and influences along with many more are scattered throughout the body of the code that powered the compact digital computer that successfully guided astronauts to the Moon and back and in July of 1969. Moonbit unravels and rewrites the many embedded cultural references that were braided together within the language resources of mid-century computer code. Moonbit also provides a gentle, non-expert introduction to the text of the AGC code, to digital poetics, and to critical code studies. Outlining a capacious interpretive practice, Moonbit takes up all manner of imaginative decodings and recodings of this code. It introduces some of the major existing approaches to the study of code and culture while provide multiple readings of the source code along with an explanation and theorization of the way in which the code works, as both a computational and a cultural text.

This special issue of the Journal of Creative Writing Studies centers on how creative writing changes when writers actively engage computers as nonhuman collaborators in “creative making.” Using examples from McGurl’s The Program Era, Emily Dickinson, and the crowdsourced “translation” of Melville’s classic into Emoji Dick, Berens suggests that creative writing methods have long been procedural and technologic. There are many forms of creative making. This special issue features creative writers that • Write code to output novels • Redefine how we think of writing’s “container” • Demonstrate aspects of the digital-first, multimodal writing classroom • Modify or remix existing artworks Berens supplies three modes to preview the issue’s 11 essays: a word cloud of the 45 most frequently occurring words, thematic clusters, and narrative descriptions of each essay. These modes of reading prompt consideration of tradeoffs we make between speed and precision when we read in online environments. A note on open access publishing, and suggestions for further reading about the role of electronic literature in creative writing studies, conclude the essay.

A Critical Code Studies discussion of Nick Montfort's poetry generators, including Taroko Gorge and ppg256

Cyberpoésies d'engagement qui renonce l'injustice de pays soi-disant Pouvoirs Mondiaux.

The block that I am teaching on Birkbeck, University of London's MA in Critical and Cultural Studies in 2018-2019. This wide-ranging block focuses on a series of important topics examining the convergence of technology, subjectivity and cultural theory. By examining technological, political, and cultural change, we will consider how 20th and 21st century theory has interpreted the relationship between the human and the technologically saturated contemporary world. This interdisciplinary module forms links with history, science, and philosophy while maintaining a firm focus on cultural theory. The diverse range of topics will encourage students over the five-week course to debate and explore increasingly poignant ontological and epistemic issues of the present and future world.

Lettre à Union Africaine est un poème numérique qui exprime la philosophie de la supranégritude. Il dénonce le joue de blâmer les Colons au lieu de diriger bien les citoyens.

Text in English ; Abstract: English and Turkish Includes bibliographical references (leaves 110-112) x, 112 leaves In this study, automatic comment generation for Java methods is described. It is sufficient that the codes conform to the syntax rules of the Java programming language, and it is not expected to be runnable. In order to generate comments, source code is examined syntactically. At this stage, only the method signature and its return type is needed. By working on open source Java projects, different templates have been developed for diffirerent method types. Using the compiled information which is the result of the examining source code that is currently being developed, the most suitable template is chosen and texts are created. These texts explain the aim of the method. Created texts are added to source code as a comment. Bu çalışmada, kaynak kodlara metot seviyesinde yorum ekleme işinin otomatikleştirilmesi anlatılmaktadır. Kodların, Java programlama dilinin sözdizim kurallar ona uygun olması yeterli olup, çalışabilir durumda olması beklenmemektedir. Yorum üretmek için kaynak kod biçimsel açıdan incelenir. Bu aşamada ilgili metodun sadece imzasına ve geri döndürdüğü veri tipine ihtiyaç duyulur. Ancak kaynak kodlu Java projeleri üzerinde yapılan çalışmayla farklı metot türleri için farklı şablonlar geliştirilmiştir. Yazılımcın geliştirdiği kodun incelenmesi sonucu derlenen bilgi ile bu şablonlardan en uygun olanı seçilir ve metinler oluşturulur. Bu metinler metodun amacını açıklar. Oluşturulan metinler yorum olarak kaynak koda eklenmektedir. Syntax, Grammar and AST Definition and Utilization Code Conventions for Java Aims and Benefits Literature Survey Approach Analysis of Methods Culling the methods Extraction of components in method signature Tokenizing the components by CamelCase and snake case notations Simplifying the data types POS tagging the words Analysis of EUnits Identifying the EUnits Extraction of EUnits Extracting the Ending EUnits Extracting the Void Return EUnits Extracting the Same Action Sequence EUnits Extracting the Data Facilitator EUnits Extracting the Controlling EUnits Comment Templates Summary templates Important statement templates Effects on comments POS tags Method return types Parameters Comment Examples Evaluation Conclusion

Every code text is informed by stylistic decisions that impact how the text is interpreted and understood. While software developers have long discussed concerns of style in regards to writing code, scholars of computation would benefit from a rhetorical approach to style, an approach that links style to substance and sees style as situated and audience-specific. In this essay, several stylistic variations of code written for the ‘FizzBuzz’ hiring test are examined in order to demonstrate the significance of stylistic choice in code composition. The range of approaches coders might take to communicate a preferred method of accomplishing a given task in code indicates that rhetorical style performs an important role in how code is accessed and comprehended by human and nonhuman audiences alike. Accordingly, software critics need to attend more closely to the ways that coders employ rhetorical style in order to induce particular types of rhetorical action through their code texts and practices.

Scholars of, or interested in, rhetoric have an opportunity to build upon the emerging body of work from the fields of software studies and critical code studies in order to explore the potential for meaning-making made possible through code and its expression(s). Over the last decade, rhetoric has significantly expanded to incorporate image, sound, video, and game play into its domain, especially in regards to rhetorical acts facilitated by computers. However, there has been relatively little scrutiny of the rhetorical value and agency of the procedural structures on which these acts are constructed. In order to draw attention to how code works rhetorically, this article examines three Oulipian “cybertexts,” works that a) are more interested in the “potential” texts they can create than the importance of any particular outcomes, and b) demonstrate their underlying mechanisms as integral components of their expression. There are several key observations for rhetoricians to be gained from these examinations, and the most notable is the capacity for action made possible through their composition in code and through their expressive performances. Each cybertext conveys meaning through its potential to induce change in human and technological audiences through the code and natural languages that comprise it.

Consider a network of nodes that are deployed to monitor a common phenomenon. In many cases, the network nodes need to estimate the common phenomenon from \\\\\\\\noisy" observations they make. Although each node can independently obtain the estimate from its own observations, it can obtain a better estimate by communicating with the other nodes and by exploiting the interdependence between the observations at di erent nodes in estimation. In this dissertation, we study such a collaborative estimation problem in which a network of nodes, each indirectly observing an underlying source through \\\\\\\\noisy" measurements, communicate with each other in order to form better estimates of the underlying source.Two primary constraints, complexity and communication, should be taken into account in the design of collaborative estimation algorithms. Although it is referableto have both low complexity and low communication, the limits on the estimation error performance can be studied by relaxing either or both of these constraints. In particular, signal processing and machine learning based approaches tend to focus on developing low complexity collaborative estimation algorithms with less strict attention to communication, while information theory focuses on characterizing the fundamental tradeo between communication rate and estimate performance, with less attention to complexity. Reconciling complexity with communications, modern practical coding theory can aid the design of collaborative estimation algorithms with low-complexity and low-communication.In this dissertation, we apply tools from aforementioned areas of study to develop collaborative estimation algorithms with low-complexity, low-communication and lowcomplexity/low-communication, and evaluate the estimation error performances.

En aquest projecte es desenvoluparà ServEngine, un framework per al desenvolupament de serveis de portals, comunitats virtuals i sistemes de comerç electrònic basat en el patró MVC i, com s'elegirà més endavant després d'un procés d'anàlisi i comparació, utilitzant Struts com a base de desenvolupament. En este proyecto se desarrollará ServEngine, un framework para el desarrollo de servicios de portales, comunidades virtuales y sistemas de comercio electrónico basado en el patrón MVC y, como se elegirá más adelante después de un proceso de análisis y comparación, utilizando Struts como base de desarrollo. In this project we will develop ServEngine, a framework for developing portal services, virtual communities and e-commerce systems based on the MVC pattern and using Struts as the basis of development, chosen later after a process of analysis and comparison.

This project was an exploratory study of techniques for predicting future change coupling among a program's source code les. Two source code les are change coupled if programmers edit them together frequently, and separately infrequently. Speci cally, this project investigated the predictive power of three approaches: mining of software change logs, software similarity detection, and software proximity detection.Software mining extracts patterns from source code databases, that is, version control systems containing source code and change histories. This project explored whether identi cation of past change coupling among source code les can predict future change coupling among those les. Software similarity detection nds les that contain similar, alias cloned, code. This project explored whether identi cation of similar code among source code les can predict future change coupling among those les. Finally, software proximity detection nds les that reference each other heavily. This project explored whether identi cation of proximity among source code les can predict future change coupling among those les.This project performed the study applied a software miner (created speci cally for this project), three preexisting similarity detectors, and two proximity detectors (created speci cally for this project) to four large open source code databases at multiple points in time. It determined that software mining generally generated the best predictions of the three approaches, followed by similarity detection, followed by proximity detection.Excessive source code change coupling can be a serious maintenance problem. So the prediction of future change coupling is an important challenge in software engineering. The results of this project shed light on the abilities of the three approaches, both in the absolute and relative senses, to predict change coupling. So the results of this project hold promise for decreasing program maintenance costs.

Aquest estudi permet tenir una visió de les possibilitats reals dels generadors de codi, les seves característiques més destacades i les seves mancances. Finalment s'inclou una proposta de millora per incorporar als generadors de codi. Este estudio permite tener una visión de las posibilidades reales de los generadores de código, sus características más destacadas y sus carencias. Finalmente se incluye una propuesta de mejora por incorporar en los generadores de código. This study provides a view of the real possibilities of code generators, their most outstanding characteristics and their deficiencies. Lastly, a proposal is included for incorporating improvements in code generators.

Aquest projecte està enfocat a determinar l'estat actual de les principals eines de generació automàtica de codi que existeixen, analitzant les característiques principals de cada eina determinar-ne les funcionalitats. Este proyecto está enfocado a determinar el estado actual de las principales herramientas de generación automática de código que existen, analizando las características principales de cada herramienta determinar las funcionalidades. This project focuses on establishing the current state of the principal existing tools for automatic generation of code, analyzing the main characteristics of each tool to determine their functions.

Identification of source code authorship can be a useful tool in the areas of security and forensic investigation by helping to create corroborating evidence that may send a suspected cyber terrorist, hacker, or malicious code writer to jail. When applied to academia, it can also prove a useful tool for professors who suspect students of academic dishonesty, plagiarism, or modification of source code related to programming assignments. The purpose of this dissertation is to determine whether or not cross-entropy approaches to source code authorship analysis will succeed in predicting the correct author of a given piece of source code. If so, this work will try to identify factors that affect the accuracy of the algorithm, how programmer experience determines accuracy, and whether a cross-entropy approach performs better than some known source code authorship approaches. The approach taken in the research effort will manufacture a corpus of source code writings from various authors based on the same system descriptions and varying system descriptions, from which benchmarks of different approaches can be measured.

La distribution quantique de clés est une technique cryptographique permettant l'échange de clés secrètes dont la confidentialité est garantie par les lois de la mécanique quantique. Le comportement particulier des particules élémentaires est exploité. En effet, en mécanique quantique, toute mesure sur l'état d'une particule modifie irrémédiablement cet état. En jouant sur cette propriété, deux parties, souvent appelées Alice et Bob, peuvent encoder une clé secrète dans des porteurs quantiques tels que des photons uniques. Toute tentative d'espionnage demande à l'espion, Eve, une mesure de l'état du photon qui transmet un bit de clé et donc se traduit par une perturbation de l'état. Alice et Bob peuvent alors se rendre compte de la présence d'Eve par un nombre inhabituel d'erreurs de transmission.L'information échangée par la distribution quantique n'est pas directement utilisable mais doit être d'abord traitée. Les erreurs de transmissions, qu'elles soient dues à un espion ou simplement à du bruit dans le canal de communication, doivent être corrigées grâce à une technique appelée réconciliation. Ensuite, la connaissance partielle d'un espion qui n'aurait perturbé qu'une partie des porteurs doit être supprimée de la clé finale grâce à une technique dite d'amplification de confidentialité.Cette thèse s'inscrit dans le contexte de la distribution quantique de clé où les porteurs sont des états continus de la lumière. En particulier, une partie importante de ce travail est consacrée au traitement de l'information continue échangée par un protocole particulier de distribution quantique de clés, où les porteurs sont des états cohérents de la lumière. La nature continue de cette information implique des aménagements particuliers des techniques de réconciliation, qui ont surtout été développées pour traiter l'information binaire. Nous proposons une technique dite de réconciliation en tranches qui permet de traiter efficacement l'information continue. L'ensemble des techniques développées a été utilisé en collaboration avec l'Institut d'Optique à Orsay, France, pour produire la première expérience de distribution quantique de clés au moyen d'états cohérents de la lumière modulés continuement.D'autres aspects importants sont également traités dans cette thèse, tels que la mise en perspective de la distribution quantique de clés dans un contexte cryptographique, la spécification d'un protocole complet, la création de nouvelles techniques d'amplification de confidentialité plus rapides à mettre en œuvre ou l'étude théorique et pratique d'algorithmes alternatifs de réconciliation.Enfin, nous étudions la sécurité du protocole à états cohérents en établissant son équivalence à un protocole de purification d'intrication. Sans entrer dans les détails, cette équivalence, formelle, permet de valider la robustesse du protocole contre tout type d'espionnage, même le plus compliqué possible, permis par les lois de la mécanique quantique. En particulier, nous généralisons l'algorithme de réconciliation en tranches pour le transformer en un protocole de purification et nous établissons ainsi un protocole de distribution quantique sûr contre toute stratégie d'espionnage.Quantum key distribution is a cryptographic technique, which allows to exchange secret keys whose confidentiality is guaranteed by the laws of quantum mechanics. The strange behavior of elementary particles is exploited. In quantum mechnics, any measurement of the state of a particle irreversibly modifies this state. By taking advantage of this property, two parties, often called Alice and bob, can encode a secret key into quatum information carriers such as single photons. Any attempt at eavesdropping requires the spy, Eve, to measure the state of the photon and thus to perturb this state. Alice and Bob can then be aware of Eve's presence by a unusually high number of transmission errors.The information exchanged by quantum key distribution is not directly usable but must first be processed. Transmission errors, whether they are caused by an eavesdropper or simply by noise in the transmission channel, must be corrected with a technique called reconciliation. Then, the partial knowledge of an eavesdropper, who would perturb only a fraction of the carriers, must be wiped out from the final key thanks to a technique called privacy amplification.The context of this thesis is the quantum key distribution with continuous states of light as carriers. An important part of this work deals with the processing of continuous information exchanged by a particular protocol, where the carriers are coherent states of light. The continuous nature of information in this case implies peculiar changes to the reconciliation techniques, which have mostly been developed to process binary information. We propose a technique called sliced error correction, which allows to efficiently process continuous information. The set of the developed techniques was used in collaboration with the Institut d'Optique, Orsay, France, to set up the first experiment of quantum key distribution with continuously-modulated coherent states of light.Other important aspects are also treated in this thesis, such as placing quantum key distribution in the context of a cryptosystem, the specification of a complete protocol, the creation of new techniques for faster privacy amplification or the theoretical and practical study of alternate reconciliation algorithms.Finally, we study the security of the coherent state protocol by analyzing its equivalence with an entanglement purification protocol. Without going into the details, this formal equivalence allows to validate the robustness of the protocol against any kind of eavesdropping, even the most intricate one allowed by the laws of quantum mechanics. In particular, we generalize the sliced error correction algorithm so as to transform it into a purification protocol and we thus establish a quantum key distribution protocol secure against any eavesdropping strategy., Doctorat en sciences appliquées, info:eu-repo/semantics/nonPublished

Laplace, Georges [1980], “Le ‘Lien’ comme mesure de l’information dans un tableau de contingence,” Dialektikê. Cahiers de typologie analytique, 7, pp. 1-15, issn: 1169-0046.