Dissertationen zum Thema „Computer safety“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit Top-50 Dissertationen für die Forschung zum Thema "Computer safety" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Sehen Sie die Dissertationen für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.
Simpson, Andrew C. „Safety through security“. Thesis, University of Oxford, 1996. http://ora.ox.ac.uk/objects/uuid:4a690347-46af-42a4-91fe-170e492a9dd1.
Der volle Inhalt der QuelleConmy, Philippa Mary. „Safety analysis of computer resource management software“. Thesis, University of York, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.428494.
Der volle Inhalt der QuelleAn, Hong. „Computer-aided applications in process plant safety“. Thesis, Loughborough University, 2010. https://dspace.lboro.ac.uk/2134/6418.
Der volle Inhalt der QuelleWang, Yuan-Fang. „Computer Vision Analysis for Vehicular Safety Applications“. International Foundation for Telemetering, 2015. http://hdl.handle.net/10150/596451.
Der volle Inhalt der QuelleIn this paper, we present our research on using computer-vision analysis for vehicular safety applications. Our research has potential applications for both autonomous vehicles and connected vehicles. In particular, for connected vehicles, we propose three image analysis algorithms that enhance the quality of a vehicle's on-board video before inter-vehicular information exchange takes place. For autonomous vehicles, we are investigating a visual analysis scheme for collision avoidance during back up and an algorithm for automated 3D map building. These algorithms are relevant to the telemetering domain as they involve determining the relative pose between a vehicle and other vehicles on the road, or between a vehicle and its 3D driving environment, or between a vehicle and obstacles surrounding the vehicle.
Reyad, Passant. „Application of computer vision techniques in safety diagnosis and evaluation of safety treatments“. Thesis, University of British Columbia, 2016. http://hdl.handle.net/2429/59701.
Der volle Inhalt der QuelleApplied Science, Faculty of
Graduate
Pumfrey, David John. „The principled design of computer system safety analyses“. Thesis, University of York, 1999. http://etheses.whiterose.ac.uk/9797/.
Der volle Inhalt der QuelleAkritidis, Periklis. „Practical memory safety for C“. Thesis, University of Cambridge, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.609600.
Der volle Inhalt der QuelleFaulkner, Alastair. „Data integrity : an often-ignored aspect of safety systems : executive summary“. Thesis, University of Warwick, 2004. http://wrap.warwick.ac.uk/1212/.
Der volle Inhalt der QuelleDheedan, Amer Abdaladeem. „Distributed on-line safety monitor based on safety assessment model and multi-agent system“. Thesis, University of Hull, 2012. http://hydra.hull.ac.uk/resources/hull:6065.
Der volle Inhalt der QuelleGraydon, Iain R. „Comprehension of 500 safety words : a computer-based methodology“. Thesis, Aston University, 1986. http://publications.aston.ac.uk/12307/.
Der volle Inhalt der QuelleRoycroft, Steven Michael. „Computer aided method for system safety and reliability assessments“. Thesis, Monterey, Calif. : Naval Postgraduate School, 2008. http://edocs.nps.edu/npspubs/scholarly/theses/2008/Sept/08Sep%5FRoycroft.pdf.
Der volle Inhalt der QuelleThesis Advisor(s): Rhoades, Mark M. "September 2008." Description based on title screen as viewed on November 4, 2008.. Includes bibliographical references (p. 75). Also available in print.
Al-Qora'n, Lamis Farah. „SAFE-FLOW : a systematic approach for safety analysis of clinical workflows“. Thesis, University of Hull, 2015. http://hydra.hull.ac.uk/resources/hull:13064.
Der volle Inhalt der QuelleEvans, David Elliot 1971. „Policy-directed code safety“. Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/86424.
Der volle Inhalt der QuelleRoethke, Ed. „Integrating computer-based safety training in a risk control center“. Online version, 1998. http://www.uwstout.edu/lib/thesis/1998/1998roethkee.pdf.
Der volle Inhalt der QuelleWang, Alexander Ning-Yuan. „Air safety--the last decade“. Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/42727.
Der volle Inhalt der QuelleIncludes bibliographical references (leaf 42).
by Alexander Ning-Yuan Wang.
M.Eng.
Twyman, Andrew R. (Andrew Robert) 1977. „Flexible code safety for Win32“. Thesis, Massachusetts Institute of Technology, 1999. http://hdl.handle.net/1721.1/80132.
Der volle Inhalt der QuelleIncludes bibliographical references (p. 90-93).
by Andrew R. Twyman.
S.B.and M.Eng.
Higgins, Mary Katherine. „Airline safety : a comparative analysis“. Thesis, Massachusetts Institute of Technology, 1987. http://hdl.handle.net/1721.1/14941.
Der volle Inhalt der QuelleMICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING.
Bibliography: leaves 59-60.
by Mary Katherine Higgins.
M.S.
Gaissmaier, Miriam. „Better Safe than Sorry : Boosting Workplace Safety with Interactive Textiles“. Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-257492.
Der volle Inhalt der QuelleTrots olika säkerhetsbestämmelser och förfaranden förmlir arbetsolyckor ett betydande problem i den globala processindustrin såväl som den svenska stålindustrin. För att ta itu med personlig säkerhet och säkerhetskultur, ett bärbart varningssystem baserade på Internet of Things (IoT)-teknologi prototyperades och testades med stålarbetare i iterativa workshops enligt Constructive Design Research-metoden. Resultat visar att interaktiva textillappar som bärs på skyddsutrustningen är ett enkelt sätt att överföra personliga varningar med ljus. En annan viktig designfaktor är att möjliggöra kommunikation mellan arbetaren, kollegor och kontrollrummet. Den visuella designen kan påverka acceptansen av patchen positivt, men lägger bara till minimalt värde för säkerhetskulturen. Den föreliggande studien bidrar till fältforskningen genom att närma sig arbetsplatsens säkerhet och kultur med nya, innovativa teknologier för IoToch e-textilier.
Autey, Jarvis. „Before and after traffic safety evaluations using computer vision techniques“. Thesis, University of British Columbia, 2012. http://hdl.handle.net/2429/43598.
Der volle Inhalt der QuelleCho, Gyuchoon. „Real Time Driver Safety System“. TopSCHOLAR®, 2009. http://digitalcommons.wku.edu/theses/63.
Der volle Inhalt der QuelleDolginova, Ekaterina 1977. „Safety verification for automated vehicle maneuvers“. Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/47573.
Der volle Inhalt der QuelleIncludes bibliographical references (p. 83-85).
by Ekanterina Dolginova.
S.B.and M.Eng.
Osvald, Leo. „Lightweight Programming Abstractions for Increased Safety and Performance“. Thesis, Purdue University, 2018. http://pqdtopen.proquest.com/#viewpdf?dispub=10808010.
Der volle Inhalt der QuelleIn high-level programming languages, programmers do not need to worry about certain implementation details that compilers or interpreters do behind the scenes. However, this oftentimes results in some loss; in the former case, it is the inability to precisely communicate programmer’s intentions to a compiler that compromises safety, and in the latter case, it is the loss of performance because an interpreter needs to do extra work at runtime. Modern languages tend to address this problem differently, albeit rarely without serious limitations. In this dissertation, we develop lightweight programming abstractions whose implementation is practical in multi-paradigm high-level languages such as Scala and C++. The main idea of this work is exploitation of the type system to guide both the code generation (for performance) and type checking (for safety), so that more efficient specialized code is produced or more compiler errors are raised, respectively. This is done by encoding properties of the data as well as data layout, and employing metaprogramming techniques such as staging and template instantiation. We make five main scientific contributions. First, we formalize second-class values with stack-bounded lifetimes as an extension of simply-typed λ calculus, as well as its generalization to polymorphic type systems such as F<:, and calculi with path-dependent types described in the Dependent Object Types (DOT) family; we further generalize the binary first- vs second-class distinction to an arbitrary type lattice—or, more generally, a privilege lattice—then show that abstract type members naturally enable privilege parametricity. Second, we propose a model of checked exceptions based on second-class values, which unlike monads, do not suffer from well-established shortcomings of requiring users to rewrite their code in monadic style throughout. Third, we develop a memory model with data views, which decouple the presentation/interface of a data structure from its layout/storage, and offer not only performance gains through code specialization but also increased safety due to a finer grained control of references to the underlying storage (similar to ownership type systems). Fourth, we design lexically scoped borrowed references with Rust’s semantics, including no mutable aliasing, but in a flow-insensitive setting using second-class values. Fifth, we empirically show within a realistic subset of Scala (MiniScala) that performance gains enabled by stack in place of heap allocation, which may be significant according to previous studies, can be guaranteed via second-class values; in fact, the usage of the more expensive heap is reduced to O(1) in the majority of the benchmarks ported from Scala Native and the Computer Languages Benchmarks Game. Finally, all of these findings are backed by artifacts: an extension of the Scala language with type-checking rules for second-class values and multiple case studies, data views as a library-based framework in C++/Scala along with an evaluation pipeline involving microbenchmarks, an implementation of Rust-like borrowed references as a Scala library, and a modified MiniScala’s type-checker and memory allocation scheme, as well as accordingly ported and annotated benchmarks.
Ranjbaran, Abdolrasoul. „A computer program for the stress analysis of reinforced concrete structures“. Thesis, University of Manchester, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.240977.
Der volle Inhalt der QuelleBusse, Daniela Karin. „Cognitive error analysis in accident and incident investigation in safety-critical domains“. Thesis, University of Glasgow, 2002. http://theses.gla.ac.uk/3954/.
Der volle Inhalt der QuelleParmar, Jayesh C. „A method for computer-aided hazard identification of process plants“. Thesis, Loughborough University, 1986. https://dspace.lboro.ac.uk/2134/7279.
Der volle Inhalt der QuelleParker, David James. „Multi-objective optimisation of safety-critical hierarchical systems“. Thesis, University of Hull, 2010. http://hydra.hull.ac.uk/resources/hull:3465.
Der volle Inhalt der QuelleSharvia, Septavera. „Integrated application of compositional and behavioural safety analysis“. Thesis, University of Hull, 2011. http://hydra.hull.ac.uk/resources/hull:4473.
Der volle Inhalt der QuelleIsafiade, Omowunmi Elizabeth. „Ubiquitous intelligence for smart cities: a public safety approach“. Doctoral thesis, University of Cape Town, 2017. http://hdl.handle.net/11427/25319.
Der volle Inhalt der QuelleMarriott, Derek Garron. „Analysis of safety-critical parallel software systems“. Thesis, University of Sheffield, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.388710.
Der volle Inhalt der QuelleLiebenwein, Lucas. „Contract-based safety verification for autonomous driving“. Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/120366.
Der volle Inhalt der QuelleThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 77-83).
The safe, successful deployment of autonomous systems under real-world conditions, in part, hinges upon providing rigorous performance and safety guarantees. This thesis considers the problem of establishing and verifying the safety of autonomous systems. To this end, we present a novel framework for the synthesis of safety constraints for autonomous systems, so-called safety contracts, that can be applied to and used by a wide set of real-world systems by acting as a design requirement for the controller implementation of the system. The contracts consider a large variety of road models, guarantee that the controlled system will remain safe with respect to probabilistic models of traffic behavior, and ensure that it will follow the rules of the road. We generate contracts using reachability analysis in a reach-avoid problem under consideration of dynamic obstacles, i.e., other traffic participants. Contracts are then derived directly from the reachable sets. By decomposing large road networks into local road geometries and defining assume-guarantee contracts between local geometries, we enable computational tractability over large spatial domains. To efficiently account for the behavior of other traffic participants, we iteratively alternate between falsification to generate new traffic scenarios that violate the safety contract and reachable set computation to update the safety contract. These counterexamples to collision-free behavior are found by solving a gradient-based trajectory optimization problem. We demonstrate the practical effectiveness of the proposed methods in a set of experiments involving the Manhattan road network as well as interacting multi-car traffic scenarios.
by Lucas Liebenwein.
S.M.
Gil, Ronald M. Eng Massachusetts Institute of Technology. „The undefined quest for full memory safety“. Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/119551.
Der volle Inhalt der QuelleThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 59-64).
In this thesis, we explore full memory safety and the various intricacies involved. We analyze existing memory safety techniques in both hardware and software and their many different goals. This task involves determining the limits of the protections guaranteed by these different protection systems, regardless of whether they were explicitly or implicitly stated. It is demonstrated that the common software technique of protecting only allocation bounds does not provide nearly enough of a barrier for attackers. Then, we go beyond particular schemes and examine the limitations of languages, C in particular. We discover many corner cases and ambiguities that prevent even the best possible protection system from providing full memory safety in the context of the C language specification. We also collect some results for the prevalence of these issues, present approaches to further analyze them, and consider how they might extend into other languages or systems.
by Ronald Gil.
M. Eng.
Livadas, Carolos. „Formal verification of safety-critical hybrid systems“. Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/42817.
Der volle Inhalt der QuelleIncludes bibliographical references (p. 181-185).
This thesis investigates how the formal modeling and verification techniques of computer science can be used for the analysis of hybrid systems [7,14,22,37] - systems involving both discrete and continuous behavior. The motivation behind such research lies in the inherent similarity of the hierarchical and decentralized control strategies of hybrid systems and the communication and operation protocols used for distributed systems in computer science. As a case study, the thesis focuses on the development of techniques that use hybrid I/O automata [29,30] to model and analyze automated vehicle transportation systems and, in particular, their various protection subsystems - control systems that are used to ensure that the physical plant at hand does not violate its various safety requirements. The thesis is split into two major parts. In the first part, we develop an abstract model of a physical plant and its various protection subsystems - also referred to as protectors. The specialization of this abstract model results in the specification of a particular automated transportation system. Moreover, the proof of correctness of the abstract model leads to simple correctness proofs of the protector implementations for particular specializations of the abstract model. In this framework, the composition of independent protectors is straightforward - their composition guarantees the conjunction of the safety properties guaranteed by the individual protectors. In fact, it is shown that under certain conditions composition holds for dependent protectors also. In the second part, we specialize the aforementioned abstract model to simplified versions of the personal rapid transit system (PRT 200TM) under development at Raytheon Corporation. We examine overspeed and collision protection for a set of vehicles traveling on straight tracks, on binary merges, and on a directed graph of tracks involving binary merges and diverges. In each case, the protectors sample the state of the physical plant and take protective actions to guarantee that the physical plant does not reach hazardous states. The proofs of correctness of such protectors involve specializing the abstract protector to the physical plant at hand and proving that the suggested protector implementations are correct. This is done by defining simulations among the states of the protector implementations and their abstract counterparts.
by Carolos Livadas.
M.Eng.
Azevedo, Luís Pedro da Silva. „Scalable allocation of safety integrity levels in automotive systems“. Thesis, University of Hull, 2015. http://hydra.hull.ac.uk/resources/hull:13618.
Der volle Inhalt der QuellePampin-Garcia, R. „Fusion power : safety and environmental analysis using integrated, three-dimensional computer modelling“. Thesis, University of Birmingham, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.542395.
Der volle Inhalt der QuelleCreely, Karen Sarah. „Communication of hazard and risk information using computer multimedia safety data sheets“. Thesis, University of Aberdeen, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.440055.
Der volle Inhalt der QuelleMoore, Albert W. „A computer-based training course for assessing material safety data sheet comprehension“. Thesis, This resource online, 1994. http://scholar.lib.vt.edu/theses/available/etd-06232009-063332/.
Der volle Inhalt der QuelleFernandes, Dias Claudio. „Driver’s Safety Analyzer: Sobriety, Drowsiness, Tiredness, and Focus“. Youngstown State University / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1587477829716502.
Der volle Inhalt der QuelleOzdemir, Kadir. „Verifying the safety properties of concurrent systems via simultaneous reachability“. Thesis, University of Ottawa (Canada), 1995. http://hdl.handle.net/10393/10294.
Der volle Inhalt der QuelleBasir, Nurlida. „Safety cases for the formal verification of automatically generated code“. Thesis, University of Southampton, 2010. https://eprints.soton.ac.uk/160073/.
Der volle Inhalt der QuelleDavis, Eli Bristol. „Fast, compatible, complete memory safety For C programs“. Thesis, Massachusetts Institute of Technology, 2016. http://hdl.handle.net/1721.1/112860.
Der volle Inhalt der QuelleCataloged from PDF version of thesis.
Includes bibliographical references (pages 95-97).
The lack of memory safety in C/C++ programs is one of, if not the, most persistent and costly sources of program exploits. Attacks based on memory corruption can range from the reading of private data to a complete hostile takeover of a process. While many solutions to this problem have been proposed, it is as of yet unsolved-as old memory corruption attacks are rendered obsolete, new attacks continually spring up. This lack of success is largely due to the trade-offs that memory safety solutions make between completeness, compatibility, and overhead. There no a single solution with all three properties, and a solution must have all three in order to once-and-for-all solve the lack of memory safety in C programs: If a solution is incomplete, attackers will find a workaround. Unless it is backwards compatible and low-overhead, it will not be deployed in production. My goal for this thesis was to take an existing system which is close to having all three properties, and add the missing property. I chose to work with SoftboundCETS an LLVM pass which is already complete and backwards compatible, but has high runtime overhead. In this thesis, I take SoftboundCETS and heavily optimize its runtimes, reducing its total overhead by half. I split the original pass into two separate passes (one to mark which instructions were to be instrumented and the second to do the actual instrumentation) and then insert several optimization passes between them. I test my results on selected benchmarks from SPEC2000 and SPEC2006, and create a virtual machine image which allows my results to be reliably reproduced. Lastly, I propose a number of further optimizations which would allow Softbound-CETS to achieve low enough overhead to be used in a mid-performance production system.
by Eli Bristol Davis.
M. Eng.
Janiuk, Ludvig, und Johan Sjölén. „Probabilistic Least-violating Control Strategy Synthesis with Safety Rules“. Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-229867.
Der volle Inhalt der QuelleVi undersöker automatisk kontrollstrategisyntes (automatic control strategy synthesis) av diskreta robotsystem där målet för roboten är att färdas från en region till en annan medan den följer en mängd säkerhetsregler i en miljö med probabilistiskt osäkra egenskaper. Detta är en uppföljning av arbete gjort av Jana Tumová et al. Vi utvidgar deras arbete genom att modifiera strategisyntesalgoritmen så att den kan hantera probabilistiska situationer. Vårt första bidrag är ett sätt att modellera probabilistiska situationer i en karta genom en så kallad "markov decision process" med en specifik struktur som vi kallar för "Ghost States" (spöktillstånd). Vi bidrar även med ett sätt att konstruera en produktautomat som är analog till originalarbetets produktautomat. På vår produktautomat kan en probabilistisk variant av Dijkstras algoritm köras för att framställa en plan som är "least-violating" (bryter mot säkerhetsreglerna minst). Resultatet är en syntesalgorithm som fungerar som originalet men som även kan hantera stokastiska osäkerheter. Syntesalgoritmen skulle till exempel kunna användas i de fall där ovissa väderlekar eller beteendet av externa aktörer kan modelleras som stokastiska variabler.
Wu, James 1975. „A comparison of programming languages for real-time, safety-critical programming /“. Thesis, McGill University, 1999. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=30772.
Der volle Inhalt der QuelleThis paper explores the language characteristics that can impact the safety and reliability of the software produced. The goal is to provide a set of criteria that can be used for the selection of an appropriate language for real-time, safety-critical development. It proposes a set of characteristics that can affect the suitability of a language to such development, and compares a selection of common programming languages, including Ada, C, C++ and Java, against this framework.
Georgakopoulos, Vassilis. „Food safety training : a model HACCP instructional technique“. Thesis, Manchester Metropolitan University, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.340452.
Der volle Inhalt der QuelleGill, Janet A. „Safety analysis of heterogeneous-multiprocessor control system software“. Thesis, Monterey, California : Naval Postgraduate School, 1990. http://handle.dtic.mil/100.2/ADA231859.
Der volle Inhalt der QuelleThesis Advisor(s): Shimeall, Timothy J. Second Reader: Hefner, Kim A. S. "December 1990." Description based on title screen as viewed on March 31, 2010. DTIC Identifier(s): Computer Program Reliability, System Safety. Author(s) subject terms: Software Safety, Petri Net, Fault Tree, Software Engineering, Integrated System Analysis. Includes bibliographical references (p. 47-51). Also available in print.
Seotsanyana, Motlatsi. „Formal specification and verification of safety interlock systems : a comparative case study /“. Thesis, Link to the online version, 2007. http://hdl.handle.net/10019/710.
Der volle Inhalt der QuelleSajjad, Imran. „Autonomous Highway Systems Safety and Security“. DigitalCommons@USU, 2017. https://digitalcommons.usu.edu/etd/5696.
Der volle Inhalt der QuellePajjuri, Srinivas Reddy. „Computer model to simulate truck accidents on exit ramps“. Thesis, This resource online, 1993. http://scholar.lib.vt.edu/theses/available/etd-08182009-040509/.
Der volle Inhalt der QuellePratt, Norman Derek. „Pragmatic application of formal methods to safety critical systems“. Thesis, University of Surrey, 1996. http://epubs.surrey.ac.uk/843228/.
Der volle Inhalt der QuelleKamolpornwijit, Witchakorn. „P-TAXI : enforcing memory safety with programmable tagged architecture“. Thesis, Massachusetts Institute of Technology, 2016. http://hdl.handle.net/1721.1/105996.
Der volle Inhalt der QuelleThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 104-112).
Buffer overflow is a well-known problem that remains a threat to software security. With the advancement of code-reuse attacks and return-oriented programming (ROP), it becomes problematic to protect a program from being compromised. Several defenses have been developed in an attempt to defeat code-reuse attacks. However, there is still no solution that provides complete protection with low overhead. In this thesis, we improved TAXI, a ROP defense technique that utilizes a tagged architecture to prevent memory violations. Inspired by Programmable Unit for Metadata Processing (PUMP), we modified TAXI so that enforcement policies can be programmed by user-level code and called it P-TAXI (Programmable TAXI). We demonstrated that, by using P-TAXI, we were able to enforce memory safety policies, including return address protection, stack garbage collection, and memory compartmentalization. In addition, we showed that P-TAXI can be used for debugging and taint tracking.
by Witchakorn Kamolpornwijit.
M. Eng.
Trafford, Paul Joseph. „The use of formal methods for safety-critical systems“. Thesis, Kingston University, 1997. http://eprints.kingston.ac.uk/20609/.
Der volle Inhalt der Quelle