This study shows how the official death-declaring of bodies in 20th century Sweden became inextricably linked to the modulation of a population’s health through transplantations. In its critical examination of the terms of possibility to declare a body as dead in the latter half of 20th century Sweden the study not only relates to medicinal humanities and studies in contemporary biopolitics but, more broadly, the diverse field of Queer Death Studies. With its interdisciplinarity, the study approaches Swedish official governmental material in a genealogical manner and aims not only to show how bodies historically became declared as dead but, more importantly, to shed light on hidden points of intersections within western biopolitics. While the study reveals several distinctive trajectories—e.g. death-entry from self-evident to dissolved to eventualized—it also highlights biopolitical tactics in attempts to reach desirable outcomes and circumvent obstacles such as the public. Among these, it exposes an ambiguous right to declare bodies as dead with its possibility to produce exceptions from the judicial system—exceptions brought forth through a truth-telling of bodies bare life in tandem with an extraction of previously unattainable organs. Thus, the study suggests that to further understand contemporary governing, and not risking an intensification of it, Agamben’s approach towards hidden intersections between juridico-institutional and biopolitical needs to be extended to encompass a third vector of truth-telling.

[pt] Referenciando-se no método estruturalista-genético de Lucien Goldmann, a tese toma por objeto as ordens do poder, sob a aparência de normas jurídicas, em regimes de exceção, propondo, para além da teoria do direito, uma teoria geral do não-direito. Para esse fim, revisita a crítica dos juristas da social-democracia alemã (Ernst Fraenkel e Franz Neumann) à legalidade nazi e os aspectos jurídicos e políticos envolvidos na implantação dessa ordem. Como auxílio comparativo, a tese percorre historicamente um rol de golpes de Estado pelo mundo, comparando-os com a validade de noções teóricas de Carl Schmitt, e estabelecendo uma categorização própria de certos regimes de exceção, nomeados pelo autor de ditaduras capitalistas reacionárias. Ao final, há uma crítica do julgamento da ADPF 153 pelo STF e uma interpretação da ordem legal da ditadura militar brasileira como sendo um Estado de não-direito ausente de constituição jurídica. / [en] Referring to Lucien Goldmann s structuralist-genetic method, the dissertation takes as its object the orders of power, under the guise of legal norms, in exception regimes, proposing, in addition to the theory of law, a general theory of non-law. To this end, it revisits the critique of the German social democracy jurists (Ernst Fraenkel and Franz Neumann) on Nazi legality and the legal and political aspects involved in the implementation of this order. As a comparative aid, the research historically runs a list of coups d état around the world, comparing them with the validity of Carl Schmitt s theoretical notions, and establishing a proper categorization of certain exception regimes, named by the author of reactionary capitalist dictatorships. In the end, there is a critique of the brazilian Supreme Courts s judgment of ADPF n153 and an interpretation of the legal order of the Brazilian military dictatorship as a state of non-law absent from legal constitution.

M arrived in Sweden as a hopeful and aspiring adolescent minor in 2015. By 2022, he instead finds himself living on the streets as a drug addict, homeless, with his residency permit rejected and his asylum application declined. This thesis analyzes his situation through a theory of Performativity and Affect, foremost leaning on Judith Butler, Lauren Berlant, and Sara Ahmed. It scrutinizes the role of the imagined Refugee Figure that M came to represent. It is produced through a set of interviews while following Lee Ann Fujii’s method of Relational Interviewing. While the role for M is being outlawed to the exterior of Global Politics, without the ability to appear, he is consequently never valued as a matter of consideration. May other routes have been possible? The Refugee Figure is here contrasted to alternative figurative identities, such as the builder or even the desperado, that more naturally are associated with an ability to act and to be seen. Ultimately, the thesis reads precarious mobility as an expression of political will, agency, and a voice with one’s feet.

Formal characterization of the memory used by a program is an important basis for security analyses, compositional verification, and identification of noninterference. However, soundly proving memory usage requires operating on the assembly level due to the semantic gap between high-level languages and the code that processors actually execute. Automated methods, such as model checking, would not be able to handle many interesting functions due to the undecidability of memory usage. Fully-interactive methods do not scale well either. Sound control flow recovery (CFR) is also important for binary decompilation, verification, patching, and security analysis. It lifts raw unstructured data into a form that allows reasoning over behavior and semantics. However, doing so requires interpreting the behavior of the program when indirect or dynamic control flow exists, creating a recursive dependency. This dissertation tackles the first property with two contributions that perform proof generation combined with interactive theorem proving in a semi-automated manner: an untrusted tool extracts as much information as it can from the functions under test and then generates all the necessary proofs to be completed in a theorem prover. The first, Floyd-style approach still requires significant manual effort but provides good flexibility and ensures no paths are analyzed more than once. In contrast, the second, Hoare-style approach sacrifices some flexibility and avoidance of repeated path evaluation in order to achieve much greater automation. However, neither approach can handle the dynamic control flow caused by indirect branching. The second property is handled by the second set of contributions of this dissertation. These two contributions provide fully-automated methods of recovering control flow from binaries even in the presence of indirect branching. When such dynamic control flow cannot be overapproximatively resolved, it is clearly noted in the resultant output. In the first approach to control flow recovery, a structured memory representation allows for general analysis of control flow in the presence of indirection, gaining scalability by utilizing context-free function analysis. It supports various aliasing conditions via the usage of nondeterminism, with multiple output states potentially being produced from a given input state. The second approach adds function context and abstract interpretation-inspired modeling of the C++ exception handling (EH) application binary interface (ABI), allowing for the discovery of previously-unknown paths while maintaining or increasing automation. / Doctor of Philosophy / Modern computer programs are so complicated that individual humans cannot manually check all but the smallest programs to make sure they are correct and secure. This is even worse if you want to reduce the trusted computing base (TCB), the stuff that you have to assume is working right in order to say a program will execute correctly. The TCB includes your computer itself, but also whatever tools were used to take the programs written by programmers and transform them into a form suitable for running on a computer. Such tools are often called compilers. One method of reducing the TCB is to examine the lowest-level representation of that program, the assembly or even machine code that is actually run by your computer. This poses unique challenges, because operating on such a low level means you do not have a lot of the structure that a more abstract, higher-level representation provides. Also, sometimes you want to formally state things about a program's behavior; that is, say things about what it does with a high degree of confidence based on mathematical principles. You may also want to verify that one or more of those statements are true. If you want to be detailed about that behavior, you may need to know all of the chunks, or regions, in random-access memory (RAM) that are used by that program. RAM, henceforth referred to as just ``memory'', is your computer's first place of storage for the information used by running programs. This is distinct from long-term storage devices like hard disk drives (HDDs) or solid-state drives (SSDs), which programs do not normally have direct access to. Unfortunately, there is no one single approach that can automatically determine with absolute certainty for all cases the exact regions of memory that are read or written. This is called undecidability, and means that you need to approximate those memory regions a lot of the time if you want to have a significant degree of automation. An underapproximation, an approach that only gives you some of the regions, is not useful for formal statements as it might miss out on some behavior; it is unsound. This means that you need an overapproximation, an approach that is guaranteed to give you at least the regions read or written. Therefore, the first contribution of this dissertation is a preliminary approach to such an overapproximation. This approach is based on the work of Robert L. Floyd, focusing on the direct control flow (where the steps of a program go) in an individual function (structured program component). It still requires a lot of user effort, including having to manually specify the regions in memory that were possibly used and do a lot of work to prove that those regions are (overapproximatively) correct, so our tests were limited in scope. The second contribution automated a lot of the manual work done for the first approach. It is based on the work of Charles Antony Richard Hoare, who developed a verification approach focusing on the syntax (the textual form) of programs. This contribution produces what we call formal memory usage certificates (FMUCs), which are formal statements that the regions of memory they describe are the only ones possibly affected by the functions under test. These statements also come with proofs, which for our work are like scripts used to verify that the things the FMUCs assert about the corresponding functions can be shown to be true given the assumptions our FMUCs have. Sometimes those proofs are incomplete, though, such as when there is a loop (repeated bit of code) in a function under test or one function calls (executes) another. In those cases, a user has to finish the proof, in the first case by weakening (removing information from) the FMUC's statements about the loop and in the second by composing, or combining, the FMUCs of the two functions. Additionally, this second approach cannot handle dynamic control flow. Such control flow occurs when the low-level instructions a program uses to move to another place in that program do not have a pre-stored location to go to. Instead, that location is supplied as the program is running. This is opposed to direct control flow, where the place to go to is hard-coded into the program when it is compiled. The tool also cannot not deal with aliasing, which is when different state parts (value-holding components) of a program contain the same value and that value is used as the numeric address or identifier of a location in memory. Specifically, it cannot deal with potential aliasing, when there is not enough information available to determine if the state parts alias or not. Because of that, we had to add extra assumptions to the FMUCs that limited them to those cases where ambiguous memory-referencing state parts referred to separate memory locations. Finally, it specifically requires assembly as input; you cannot directly supply a binary to it. This is also true of the first contribution. Because of this, we were able to test on more functions than before, but not a lot more. Not being able to deal with dynamic control flow is a big problem, as almost all programs use it. For example, when a function reaches its end, it has to figure out where to return to based on the current state of the program (in the previous contribution, this was done manually). This means that control flow recovery (CFR) is very important for many applications, including decompilation (converting a program back into a higher-level form), patching (updating a program in place without modifying the original code and recompiling it), and low-level analysis or verification in general. However, as you may have noticed from earlier in this paragraph, in order to deal with such dynamic control flow you need to figure out what the possible destinations are for the individual control flow transfers. That can require knowing where you came from in the program, which means that analysis of dynamic control flow requires context (in this context, information previously obtained in the program). Even worse, it is another undecidable problem that requires overapproximation. To soundly recover control flow, we developed Hoare graphs (HGs), the third contribution of this dissertation. HGs use memory models that take the form of forests, or collections of tree data structures. A single tree represents a region in memory that may have multiple symbolic references, or abstract representations of a value. The children of the tree represent regions used in the program that are enclosed within their parent tree elements. Now, instead of assuming that all ambiguous memory regions are separate, we can use them under various aliasing conditions. We have also implemented support for some forms of dynamic control flow. Those that are not supported are clearly marked in the resultant HG. No user interaction is required even when loops are present thanks to a methodology that automatically reduces the amount of information present at a re-executed instruction until the information stabilizes. Function composition is also automatic now thanks to a method that treats each function as its own context in a safe and automated way, reducing memory consumption of our tool and allowing larger programs to be examined. In the process we did lose the ability to deal with recursion (functions that call themselves or call other functions that call back to the original), though. Lastly, we provided the ability to directly load binaries into the tool, no external disassembly (converting machine code into human-readable instructions) needed. This all allowed much greater testing than before, with applications to multiple programs and program libraries. The fourth and final contribution of this dissertation iterates on the HG work by narrowing focus to the concept of exceptional control flow. Specifically, it models the kind of exception handling used by C++ programs. This is important as, if you want to explore a program's behavior, you need to know all the places it goes to. If you use a tool that does not model exception handling, you may end up missing paths of execution caused by unwinding. This is when an exception is thrown and propagates up through the program's current stack of function calls, potentially reaching programmer-supplied handling for that exception. Despite this, commonplace tools for static, low-level program analysis do not model such unwinding. The control flow graph (CFG) produced by our exception-aware tool are called exceptional interprocedural control flow graphs (EICFGs). These provide information about the exceptions being thrown and what paths they take in the program when they are thrown. Additional improvements are a better methodology for handling dynamic control flow as well adding back in support for recursion. All told, this allowed us to explore even more programs than ever before.

Undantagsbestämmelsen i Skollagen (2010), även kallad pysparagrafen, ger lärare möjlighet att undanta vissa delar av ett betygskriterium vid en betygssättning. Den ska tillämpas när en elev, trots stöd, inte kan uppnå ett mål i ämnet på grund av en funktionsnedsättning. Syftet med uppsatsen är att undersöka lärares erfarenheter och uppfattningar om undantagsbestämmelsen. Min undersökningsfråga för min studie är följande:   -Vilka teman framträder ur intervju med lärarna gällande undantagsbestämmelsen i relation till bedömning och betygssättning av elevers kunskaper?   Jag genomförde en kvalitativ intervjustudie och sedan tolkades resultaten utifrån ett dilemmaperspektiv. Materialet har bearbetats och analyserats genom tematisk analys.  Resultaten visar att lärarna upplever undantagsbestämmelsen som nödvändig för att uppnå en likvärdig betygsättning. Intervjuerna visar att undantagsbestämmelsen är känd hos lärarna men de upplever att det inte är alltid den lättaste uppgiften att omsätta den i praktiken för att det är många faktorer som måste tas i beaktan.   Resultatet visar även att lärarna upplever undantagsbestämmelsen som otydlig, vilket ger ett stort tolkningsutrymme vid dess användning. Lärarna uttrycker att det är samtidigt en svårighet att avgöra vad en funktionsnedsättning är och bedöma vad det är i en elevs funktionsnedsättning som gör att eleven inte når målen i ett ämne. Resultatet visar på att lärarna är i behov av utbildning och fortbildning om både undantagsbestämmelsen och de olika funktionsnedsättningar som finns, för att tillämpa den på ett rättvist och korrekt sätt. Det framgår även i resultatet att det finns önskemål om att det ska vara ett krav på dokumentation vid tillämpningen av den, för att underlätta för elever i exempelvis stadieövergångar eller bytet av en lärare. / The exception provision in Swedish education law gives teachers the possibility to exempt certain parts of the assessment criteria when setting grades. It is used when a student, despite having received support, cannot reach a goal in the subject as a result of a functional impairment. The purpose of this paper is to investigate teachers’ experience and understanding of the exception provision. My study concerns the following research question:  Which themes arise from interviews with teachers regarding the relationship between the exception provision and the assessment and grading of students’ knowledge?  I performed a qualitative interview study and analyzed the results from a dilemma perspective. The material has been processed and analyzed through a thematical analysis.  The results show that teachers’ experience the exception provision as a necessary tool in achieving fair and equal grading. The interviews show that teachers know about the exception provision but that it is not always easy to use the provision in practice because there are many factors that must be considered at the same time.    The result also shows that teachers’ experience the provision as unclear, which leads to a broad interpretation of the provision when it is used. Teachers lift that it is both difficult to understand what is meant by functional impairment and difficult to assess how this functional impairment prevents the student from reaching the subject’s learning goals. The result shows that teachers need further education in both the exception provision and different functional impairments to apply the provision in the correct way. The results even show that there is a desire that documentation should be required when the provision is used to support handovers to new teachers and new grade levels.

專利權具有獨占性，對一國產業發展具有重要影響，為了平衡該權利，各國專利法在給予發明人專利權的同時也加諸某些限制，以我國為例，於專利法第五十七條第一項列舉專利權效力所不及之情形有：(一)為研究、教學或試驗，實施其發明，而無營利行為者。此即所謂之「實驗例外」 (experimental use exception)條款。 實驗例外條款在各國司法實務運作上，最常被引起爭論者向來集中在處方藥市場中專利藥廠與學名藥廠間之競爭議題。因為學名藥廠為了能夠盡早進入市場，不免須在專利期間屆滿前實施原廠專利進行必要之研究、試驗，以符合各國對於藥物上市管理法令之要求。 雖然我國專利法與其他國家一樣也有試驗例外條款，但其中要件嚴格限定為「非營利行為」，從比較法之方式分析，該規定係受美國普通法之影響。美國普通法關於試驗例外係採取嚴格路線，必須行為人之試驗係出於非營利目的，單純追求真相、探求知識理論，或為滿足好奇心，才可主張普通法上之實驗例外，即始係不具營利色彩之公家機關、學術單位從事之試驗，只要背後具有實質的商業目的亦不得主張試驗例外。如此造成要成功適用試驗例外是愈來愈不可能。 國際間對於試驗例外之立法，除美國外，尚存在許多形式值得我國借鏡，以歐洲共同體專利規則草案(Proposal for a Council Regulation on a Community Patent)為例，其區分「私人且非商業性目的之行為」，以及「為試驗目的之行為」，後者要求必須係針對系爭專利技術本身所進行之試驗始非專利權效力所及，若係將該專利技術作為研究工具之用，仍非法之所許。這種區分方法不僅層次分明、無觀念上混淆之虞，判斷上也較具有可預測性。 美國於1984年通過Hatch-Waxman 法案鼓勵學名藥之發展，對於為滿足主管機關關於醫藥品上市要求之試驗，在專利法271(e)(1)明文規定排除在專利權效力之外，即所謂之「Bolar例外」。我國於九十四年二月五日亦增訂藥事法第四十條之二第五項：「新藥專利權不及於藥商申請查驗登記前所進行之研究、教學或試驗」關於Bolar例外之規定。惟或因立法匆促，致法條要件不符合實際狀況，例如限定「申請查驗登記前」之行為，實際上藥廠於提出查驗登記之申請後，往往在主管機關之要求下須進行其他試驗，這些行為均在立法者原欲保護之範圍內，僅因立法用語之不當，造成實務運用之困擾。 筆者最後從法律及商業管理觀點著眼，對國內立法提出下列修法建議，作為本研究之最終成果： 壹、對於專利法第五十七條第一項第一款修法之建議 一、刪除「教學」之行為態樣 二、刪除「而無營利行為」之要件 三、增列關於研究工具之專利則無本條之適用 四、放寬適用範圍為符合主管機關法規要求而實施他人專利亦有實驗例外之適用。 贰、對於藥事法修法之建議 一、刪除「申請查驗登記前」之要件，改以行為目的來限定範圍，即「為通過藥品查驗登記所進行之研究或試驗」，始有本款之適用。 二、明定「物品專利」及「方法專利」均有本條之適用

This paper discusses if Margin of Appreciation is compatible with the idea of universal human rights. Through the case of Negative freedom of association in Sweden, it studies the phenomenon that Giorgio Agamben has called the State of exception. The questions that are discussed and answered are 1) How does the rights theories of Jack Donnelly and Ronald Dworkin relate to Margin of appreciation, and 2) How has Margin of appreciation been applied in cases concerning the negative freedom of association in Sweden, in the European court for human rights. These questions and answers are then used in the discussion on how Margin of appreciation affects the concept of universal human rights. / Denna uppsats diskuterar frågan om Margin of Appreciation är förenligt med tanken om universella mänskliga rättigheter. Genom studier av den negativa föreningsfriheten i Sverige, så undersöks doktrinen Margin of appreciation och hur den förhåller sig till tanken om universella rättigheter. Frågorna som diskuteras och besvaras är 1) hur förhåller sig Jack Donnellys respektive Ronald Dworkins rättighetsteorier till Margin of appreciation, samt 2) Hur har Margin of appreciation tolkats i europadomstolens i fall gällande den negativa föreningsfriheten i Sverige. Dessa frågor tas till hjälp i diskussionen kring hur Margin of appreciation påverkar tanken om universella mänskliga rättigheter.

Many patent law dilemmas arise from a failure to understand technologies as embedded in broader social, economic and political realities and to contextually analyze these legal phenomena. This narrowness leads to poor legal development, of which the modern medical exception from patentability is one example. Judges have difficulty interpreting it, patentees do not understand its purpose and it does not protect the important medical technologies to which the public would like access. This thesis applies a legal pluralist analysis to examine the emergence of the medical methods exception in order to understand why it was created and legislated. It starts by examining the origins of the exception in the caselaw, and the informal, concurrent norm established by the emerging medical profession in the early 20th century. It then proceeds to examine why the medical profession might have sought and enforced a norm prohibiting its members from patenting, and concludes that this arose from the need of the medical profession to distance itself from the patent law. As a result, professionalizing physicians established an internal normative order that mimicked and in many cases replaced the effect of the formal law. The thesis then proceeds to examine how the form of the informal norm evolved in the period between WWI and WWII, finding that the profession’s norm transformed and broke down concurrently with its efforts to achieve external legitimacy through legislation. That breakdown arose from factors which included growing labour mobility, greater understanding of the benefits of patents, and a growing role of science and industry in medicine that threatened the profession’s access to valuable medical innovation. The thesis concludes with a study of a current case (Myriad Genetics) that applies the thesis’ theoretical framework to a present dispute over the role the law should play in regulating genetic diagnostic tests.

[pt] Tratamento de erros em aplicações móveis sensíveis ao contexto não é uma tarefa trivial devido às características peculiares destes sistemas, como mobilidade, comunicação assíncrona e aumento de imprevisibilidade. Mecanismos convencionais de tratamento de exceções não podem ser utilizados por vários motivos. Primeiro, a propagação de erros deve considerar as mudanças contextuais que ocorrem constantemente nestes sistemas. Segundo, as atividades de recuperação de erros e a estratégia de tratamento de exceções também precisam freqüentemente ser selecionadas de acordo com as informações de contexto. Terceiro, a própria caracterização de uma exceção pode depender do contexto dos dispositivos envolvidos. Embora vários middlewares orientados a contexto ofereçam suporte ao desenvolvimento de aplicações móveis, estes sistemas raramente fornecem suporte adequado ao tratamento de exceções. Este trabalho realiza uma análise das soluções existentes para tratamento de exceções, considerando os requisitos de sensibilidade ao contexto. Além disso, são propostos um modelo para tratamento de exceções sensível ao contexto e um mecanismo implementado a partir de MoCA (Mobile Collaboration Architecture). MoCA é um middleware publish-subscribe que oferece suporte ao desenvolvimento de aplicações móveis colaborativas através da incorporação de serviços de contexto. Finalmente, este trabalho avalia o mecanismo de exceções proposto através de sua utilização em alguns protótipos de aplicações colaborativas desenvolvidas a partir de MoCA. Através do mecanismo, foram implementadas diferentes estratégias de tratamento de exceções que consideram as informações de contexto das aplicações. / [en] Context-sensitive exception handling on mobile systems is not a trivial task due to their intrinsic characteristics: mobility, asynchrony and increased unpredictability. Conventional mechanisms of exception handling can not be used for many reasons. First, error propagation needs considering the contextual changes that often occur in these systems. Second, error recovery and exception handling strategies also frequently need to be selected according to contextual information. Third, the characterization of an exception may depend on the contextual situation of involved devices. Even though there are now several context-oriented middleware systems that provide support for the development of mobile applications, they rarely provide explicit and adequate features for contextsensitive exception handling. This work presents an analysis of existing exception handling mechanisms, which to some extent consider the context-awareness requirements. Besides, it proposes a general model for context-sensitive exception handling and a supporting mechanism implemented using the MoCA (Mobile Collaboration Architecture) infrastructure. MoCA is a publish-subscribe middleware supporting the development of collaborative mobile applications by incorporating explicit services to empower software agents with contextsensitiveness. Finally, this paper reports our experience in implementing contextaware exception handling strategies in some prototype collaborative applications built with the MoCA system.

O mecanismo de tratamento de exceções disponível em linguagens orientadas a objetos está sendo cada vez mais utilizado e representa cerca de 8% das linhas de código em programas escritos com linguagens de terceira geração, de acordo com algumas pesquisas. No entanto, este mecanismo está entre os menos compreendido pelos desenvolvedores e menos testado. A dificuldade de testar exceções aumenta na fase de teste de integração, porque exceções lançadas em um determinado nível e não tratadas podem subir na hierarquia de chamada. O uso de aspectos também pode introduzir novos tipos de defeitos, como por exemplo um adendo pode inserir lançamentos de exceções no programa sem que exista algum tratamento previsto para elas. Este trabalho apresenta uma proposta para testes de integração estrutural de fluxos de exceções de programas Java e AspectJ. Isto é feito propondo-se alterações na representação do fluxo de exceção no grafo de fluxo de controle integrado e propondo-se novos critérios baseados no fluxo de exceção. Além disso, essas propostas foram implementadas e geraram uma extensão da ferramenta chamada Ja-BUTi/AJ. Para avaliar a proposta deste trabalho, um estudo de caso e um experimento formal foram conduzidos. O estudo de caso teve como objetivo validar a extensão da JaBUTi/AJ desenvolvida e fazer uma avaliação inicial do custo de aplicação dos critérios propostos. O experimento formal realizou uma comparação entre as ferramentas JaBUTi/AJ e VITTAE no contexto do teste do fluxo de exceções. Ambos os estudos são apresentados e discutidos nesta dissertação / Exception handling mechanisms available in object-oriented languages have become increasingly used and account for about 8% of the lines of code in modern programs according to some empirical researches. Yet, this mechanism is among the least understood by programmers and the less tested. The difficulty of testing exceptions increases in the phase of integration testing (e.g. inter-class testing) because exceptions raised on a certain level and not handled can flow through the call hierarchy. Using aspects also cause other types of errors, e.g. an advice can insert exceptions not foreseen by the base program. This paper presents a proposal for structural integration testing of exception flows of Java and AspectJ programs. This is done by proposing changes to the classic control ow graph and by proposing new criteria based on the exception ow. Moreover, these proposals have been implemented in a tool named JaBUTi/AJ. To evaluate the proposal of this work, a case study and a formal experiment have been conducted. The case study had the objective of validating the JaBUTi/AJ extension developed and making a preliminary assessment of the cost to use the tool. The formal experiment made a comparison between the tools JaBUTi/AJ and VITTAE in the context of exception flow test. Both studies are presented and discussed in this dissertation