Tesis sobre el tema "Checkley"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 50 mejores tesis para su investigación sobre el tema "Checkley".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore tesis sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
Checkley, Stephen [Verfasser]. "Engineering Tuneable Gene Circuits in Yeast / Stephen Checkley". Munich : GRIN Verlag, 2015. http://d-nb.info/1097425436/34.
Texto completoBahtiyar, Muhammed Yasin. "Software Architecture Checker". Thesis, Växjö University, School of Mathematics and Systems Engineering, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:vxu:diva-2294.
Texto completoBy the increasing needs of software industry, software systems became more complex constructions than ever before. As a result of increasing complexity in software systems, functional decomposition of these systems gains the status of the most important aspect in the software development process. Dividing problems to sub-problems and producing specific solutions for divided parts makes it easier to solve the main problem.
Component Based Software Engineering is a way of developing software systems that consists of logically or functionally decomposed components which integrated to each other by the help of well-defined interfaces. CBSE relies on architectural design of a software system.
Planning phase and implementation of a software project may differ time to time. Because of the complexity of software systems, solving specific problems may affect the architecture of the whole system.
In spite of sophisticated software engineering processes and CASE tools there is still a large gap between the planned and implemented architecture of software systems. Finding deviations from architecture in source code is a non-trivial task requiring tool support.
Since, matching operation of designed software architecture and implemented software architecture needs to check design documents against implementation code. This manual checking operation is nearly impossible for major software systems. Software Architecture Checker provides a great approach to check the architecture of any software system.
This bachelor thesis examines the approach behind the Software Architecture Checker.
Bubeník, Martin. "RaspberryPI kamerový checker". Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2019. http://www.nusl.cz/ntk/nusl-402129.
Texto completoKojovic, Ivana. "An automatic protocol composition checker". Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for telematikk, 2012. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-19105.
Texto completoGhribi, Brahim. "A model checker for LOTOS". Thesis, University of Ottawa (Canada), 1992. http://hdl.handle.net/10393/7536.
Texto completoHedin, Rasmus. "Spell checker in CET Designer". Thesis, Linköpings universitet, Institutionen för datavetenskap, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-131642.
Texto completoViktorsson, Arvid y Illya Kyrychenko. "Spell checker for a Java Application". Thesis, Karlstads universitet, Institutionen för matematik och datavetenskap (from 2013), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-78054.
Texto completoYoo, Joonhyuk. "Harnessing checker hierarchy for reliable microprocessors". College Park, Md.: University of Maryland, 2007. http://hdl.handle.net/1903/7688.
Texto completoThesis research directed by: Dept. of Electrical and Computer Engineering. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
Gerber, Erick D. B. "A model checker for the LF system". Thesis, Stellenbosch : Stellenbosch University, 2007. http://hdl.handle.net/10019.1/19597.
Texto completoENGLISH ABSTRACT: Computer aided veri cation techniques, such as model checking, can be used to improve the reliability of software. Model checking is an algorithmic approach to illustrate the correctness of temporal logic speci cations in the formal description of hardware and software systems. In contrast to traditional testing tools, model checking relies on an exhaustive search of all the possible con gurations that these systems may exhibit. Traditionally model checking is applied to abstract or high level designs of software. However, often interpreting or translating these abstract designs to implementations introduce subtle errors. In recent years one trend in model checking has been to apply the model checking algorithm directly to the implementations instead. This thesis is concerned with building an e cient model checker for a small concurrent langauge developed at the University of Stellenbosch. This special purpose langauge, LF, is aimed at developement of small embedded systems. The design of the language was carefully considered to promote safe programming practices. Furthermore, the language and its runtime support system was designed to allow directly model checking LF programs. To achieve this, the model checker extends the existing runtime support infrastructure to generate the state space of an executing LF program.
AFRIKAANSE OPSOMMING: Rekenaar gebaseerde program toetsing, soos modeltoetsing, kan gebruik word om die betroubaarheid van sagteware te verbeter. Model toetsing is 'n algoritmiese benadering om die korrektheid van temporale logika spesi kasies in die beskrywing van harde- of sagteware te bewys. Anders as met tradisionlee program toetsing, benodig modeltoetsing 'n volledige ondersoek van al die moontlike toestande waarin so 'n beskrywing homself kan bevind. Model toetsing word meestal op abstrakte modelle van sagteware of die ontwerp toegepas. Indien die ontwerp of model aan al die spesi kasies voldoen word die abstrakte model gewoontlik vertaal na 'n implementasie. Die vertalings proses word gewoontlik met die hand gedoen en laat ruimte om nuwe foute, en selfs foute wat uitgeskakel in die model of ontwerp is te veroorsaak. Deesdae, is 'n gewilde benadering tot modeltoetsing om di e tegnieke direk op die implementasie toe te pas, en sodoende die ekstra moeite van model konstruksie en vertaling uit te skakel. Hierdie tesis handel oor die ontwerp, implementasie en toetsing van 'n e ektiewe modeltoetser vir 'n klein gelyklopende taal, LF, wat by die Universiteit van Stellenbosch ontwikkel is. Die enkeldoelige taal, LF, is gemik op die veilige ontwikkeling van ingebedde sagteware. Die taal is ontwerp om veilige programmerings praktyke aan te moedig. Verder is die taal en die onderliggende bedryfstelsel so ontwerp om 'n model toetser te akkomodeer. Om die LF programme direk te kan toets, is die model toetser 'n integrale deel van die bedryfstelsel sodat dit die program kan aandryf om alle moontlike toestande te besoek.
Hoyos, Jacob. "PLPrepare: A Grammar Checker for Challenging Cases". Digital Commons @ East Tennessee State University, 2021. https://dc.etsu.edu/etd/3898.
Texto completoEriksson, Marcus. "A CLP(FD)-based model checker for CTL". Thesis, Linköping University, Department of Computer and Information Science, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-109.
Texto completoModel checking is a formal verification method where one tries to prove or disprove properties of a formal system. Typical systems one might want to prove properties within are network protocols and digital circuits. Typical properties to check for are safety (nothing bad ever happens) and liveness (something good eventually happens).
This thesis describes an implementation of a sound and complete model checker for Computation Tree Logic (CTL) using Constraint Logic Programming over Finite Domains (CLP(FD)). The implementation described uses tabled resolution to remember earlier computations, is parameterised by choices of computation strategies and can with slight modification support different constraint domains. Soundness under negation is maintained through a restricted form of constructive negation.
The computation process amounts to a fixpoint search, where a fixpoint is reached when no more extension operations has any effect. As results show, the choice of strategies does influence the efficiency of the computation. Soundness and completeness are of course independent of the choice of strategies. Strategies include how to choose the extension operation for the next step and whether to perform global or local rule instantiations, resulting in bottom-up or top-down computations respectively.
Thiruvillamalai, Varadarajan. "A type-checker for real-time Object-Z". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp04/mq23526.pdf.
Texto completoAl-Mahmood, Saiyid Jami Islah Ahmad. "A distributed design rule checker for VLSI layouts". Thesis, This resource online, 1990. http://scholar.lib.vt.edu/theses/available/etd-11012008-063423/.
Texto completoAzmy, Noran. "A Machine-Checked Proof of Correctness of Pastry". Thesis, Université de Lorraine, 2016. http://www.theses.fr/2016LORR0277/document.
Texto completoA distributed hash table (DHT) is a peer-to-peer network that offers the function of a classic hash table, but where different key-value pairs are stored at different nodes on the network. Like a classic hash table, the main function provided by a DHT is key lookup, which retrieves the value stored at a given key. Examples of DHT protocols include Chord, Pastry, Kademlia and Tapestry. Such DHT protocols certain correctness and performance guarantees, but formal verification typically discovers border cases that violate those guarantees. In his PhD thesis, Tianxiang Lu reported correctness problems in published versions of Pastry and developed a model called {\LP}, for which he provided a partial proof of correct delivery of lookup messages assuming no node failure, mechanized in the {\TLA} Proof System. In analyzing Lu's proof, I discovered that it contained unproven assumptions, and found counterexamples to several of these assumptions. The contribution of this thesis is threefold. First, I present {\LPP}, a revised {\TLA} specification of {\LP}. Aside from needed bug fixes, {\LPP} contains new definitions that make the specification more modular and significantly improve proof automation. Second, I present a complete {\TLA} proof of correct delivery for {\LPP}. Third, I prove that the final step of the node join process of {\LP}/{\LPP} is not necessary to achieve consistency. In particular, I develop a new specification with a simpler node join process, which I denote by {\SLP}, and prove correct delivery of lookup messages for this new specification. The proof of correctness of {\SLP} is written by reusing the proof for {\LPP}, which represents a success story in proof reuse, especially for proofs of this size. Each of the two proofs amounts to over 32,000 proof steps; to my knowledge, they are currently the largest proofs written in the {\TLA} language, and---together with Lu's proof---the only examples of applying full theorem proving for the verification of DHT protocols
Azmy, Noran. "A Machine-Checked Proof of Correctness of Pastry". Electronic Thesis or Diss., Université de Lorraine, 2016. http://www.theses.fr/2016LORR0277.
Texto completoA distributed hash table (DHT) is a peer-to-peer network that offers the function of a classic hash table, but where different key-value pairs are stored at different nodes on the network. Like a classic hash table, the main function provided by a DHT is key lookup, which retrieves the value stored at a given key. Examples of DHT protocols include Chord, Pastry, Kademlia and Tapestry. Such DHT protocols certain correctness and performance guarantees, but formal verification typically discovers border cases that violate those guarantees. In his PhD thesis, Tianxiang Lu reported correctness problems in published versions of Pastry and developed a model called {\LP}, for which he provided a partial proof of correct delivery of lookup messages assuming no node failure, mechanized in the {\TLA} Proof System. In analyzing Lu's proof, I discovered that it contained unproven assumptions, and found counterexamples to several of these assumptions. The contribution of this thesis is threefold. First, I present {\LPP}, a revised {\TLA} specification of {\LP}. Aside from needed bug fixes, {\LPP} contains new definitions that make the specification more modular and significantly improve proof automation. Second, I present a complete {\TLA} proof of correct delivery for {\LPP}. Third, I prove that the final step of the node join process of {\LP}/{\LPP} is not necessary to achieve consistency. In particular, I develop a new specification with a simpler node join process, which I denote by {\SLP}, and prove correct delivery of lookup messages for this new specification. The proof of correctness of {\SLP} is written by reusing the proof for {\LPP}, which represents a success story in proof reuse, especially for proofs of this size. Each of the two proofs amounts to over 32,000 proof steps; to my knowledge, they are currently the largest proofs written in the {\TLA} language, and---together with Lu's proof---the only examples of applying full theorem proving for the verification of DHT protocols
Khorsandi, Aghai Majid. "Model Checking WOOL Parallel Library using SPIN Model Checker". Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-159177.
Texto completoYuen, Adrienne L. "Gallicisms: An analysis leading towards a prototype gallicisms checker". Thesis, University of Ottawa (Canada), 1994. http://hdl.handle.net/10393/10340.
Texto completoKim, Kwanghyun. "An interactive design rule checker for integrated circuit layout". Thesis, Virginia Polytechnic Institute and State University, 1985. http://hdl.handle.net/10919/50034.
Texto completoMaster of Science
incomplete_metadata
Neupane, Thakur. "STAMINA: Stochastic Approximate Model-Checker for Infinite-State Analysis". DigitalCommons@USU, 2019. https://digitalcommons.usu.edu/etd/7607.
Texto completoStratis, Athanasios. "Model-based Testing on Generated C Code". Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-28381.
Texto completoJohnson, Timothy E. "MOSSTAT An interactive static rule checker for MOS VLSI designs". Full text open access at:, 1986. http://content.ohsu.edu/u?/etd,109.
Texto completoSexton, John A. "Detecting errors in software using a parameter checker : an analysis /". Online version of thesis, 1989. http://hdl.handle.net/1850/10585.
Texto completoKleymann, Thomas. "Hoare logic and VDM : machine-checked soundness and completeness proofs". Thesis, University of Edinburgh, 1998. http://hdl.handle.net/1842/387.
Texto completoKopas, Robert George. "The design and implementation of a specification language type checker". Thesis, Monterey, California. Naval Postgraduate School, 1989. http://hdl.handle.net/10945/25822.
Texto completoUnver, Evren R. (Evren Rifki). "Implementation of a design rule checker for silicon wafer fabrication". Thesis, Massachusetts Institute of Technology, 1994. http://hdl.handle.net/1721.1/35387.
Texto completoIncludes bibliographical references (leaves 90-92).
by Evren R. Ünver.
M.Eng.
Nelson, Andrew P. "Funqual: User-Defined, Statically-Checked Call Graph Constraints in C++". DigitalCommons@CalPoly, 2018. https://digitalcommons.calpoly.edu/theses/1848.
Texto completoDeitle, Scott Edward. "[Un]checked Emergence: infusing the human element into algorithmic design". Thesis, Montana State University, 2008. http://etd.lib.montana.edu/etd/2008/deitle/DeitleS0508.pdf.
Texto completoEsen, Zafer. "Extension of the ELDARICA C model checker with heap memory". Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-397812.
Texto completoBanda, Gourinath y John P. Gallagher. "Constraint-based abstraction of a model checker for infinite state systems". Universität Potsdam, 2010. http://opus.kobv.de/ubp/volltexte/2010/4151/.
Texto completoJohansson, Emil. "Granskning av Solibri Model Checker - En Svenskanpassning : Jämförelse av två egenkontrollsystem". Thesis, Uppsala universitet, Byggteknik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-209768.
Texto completoMarkovic, Filip. "Automated Test Generation for Structured Text Language using UPPAAL Model Checker". Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-28412.
Texto completoHernández, Puertas Tamara. "Corrective Feedback in the EFL Classroom: Grammar Checker vs. Teacher’s Feedback". Doctoral thesis, Universitat Jaume I, 2022. http://dx.doi.org/10.6035/14110.2022.149225.
Texto completoPrograma de Doctorat en Llengües Aplicades, Literatura i Traducció
Pereira, Vinícius. "Uma abordagem para representação de resultados formais na UML". Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-26092017-160607/.
Texto completoUML is a graphical notation used for modeling object-oriented software systems in different domains in computer science. Being simple to use, compared to other modeling techniques, UML is widespread among software developers, both in academia and industry. Among its advantages are: (i) the visual representation of the relationships between classes and entities, as when using diagrams, UML facilitates understanding and visualization of relationships within the modeled system; (ii) readability and usability without having to read the system code, since a developer can understand which parts of the code are redundant or reusable; and (iii) a planning tool, helping to define what needs to be done before the implementation actually begins, as well as being able to produce code and reduce development time. However, the UML also has disadvantages, such as: (i) ambiguity between different UML elements due to overlapping diagrams; and (ii) lack of clear semantics, which generally causes the semantics of the programming language to be adopted. To mitigate these disadvantages, researchers seek to assign a formal semantics to the UML. This type of semantics is found in formal models, where the modeled system is free of ambiguity and has a clear and precise semantics. On the other hand, formal models are not simple to create and understand by developers. The degree of formalism knowledge required to use such a model is high, which makes their use less widespread, compared to UML non-formal graphical notation. Despite the researchers efforts, in general the techniques that formalize the UML semantics has a problem that is forgotten: although using the UML to model the system, the final artifact of these techniques is a formal trace. Considering the common knowledge of a software developer, this trace makes it difficult to analyze the problems encountered by model checkers and to correct them in the UML model. In order to assist the developer in understanding the formal results (the trace above), this thesis presents an approach based on Model-driven Architecture (MDA) capable of representing the information of the formal results in the UML model. Through UML model transformations, these representations, set using the approach, help the developer to visualize the execution flow of the model checker within the UML model. Thus, we believe that the advantages obtained by formalizing the UML semantics may be more widespread and used by developers, especially in industry.
Martins, Alexandre Locci. "Teste e verificação formal do comportamento excepcional de programas Java". Universidade de São Paulo, 2014. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-11082014-150106/.
Texto completoSoftware developed in modern languages, such as Java, commonly present structures of exception handling. These structures, when exercised, may affect the software behavior. Despite these two characteristics, the main verification techniques, software testing and formal verification and the tools related to them, tend to neglect the exceptional behavior. The nonexistent specification of software exceptional behaviors at the design level, and, the subsequent implementation of exception handling based on the judgment of each programmer, are some factors that lead to this neglect. These factors result in the non-consideration of the expressive parts of the code in verification terms and, consequently, the impossibility of errors detection concerning either the exception treatment structures or the code structures linked to them. Taking this fact into consideration, we propose a technique based on the model checking process, which automates the process of exercising exceptional paths to address this problem. This allows the observation of the software behavior when an exception occurs. With this technique, we intend to support the application of the same error detection techniques for program normal behavior paths to the paths that represent the software exceptional behavior. Therefore, using the proposed technique, we aim to increase the software development quality.
Filipovikj, Predrag. "Connecting a Design Framework for Service-oriented Systems with UPPAAL model-checker". Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-23137.
Texto completoZaza, Nosheen. "Evaluating the Accuracy of Annotations in the Loci 3.0 Pluggable Type Checker". Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-195827.
Texto completoRocha, Herbert Oliveira. "Verificação e comprovação de erros em códigos C usando bounded model checker". Universidade Federal do Amazonas, 2011. http://tede.ufam.edu.br/handle/tede/2965.
Texto completoCAPES - Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
The use of computer-based systems in several domains has increased significantly over the last years, one of the main challenges in software development of these systems is to ensure the correctness and reliability of these. So that software verification now plays an important role in ensuring the overall product quality, aimed mainly the characteristics of predictability and reliability. In the context of software verification, with respect to the use of model checking technique, Bounded Model Checkers have already been applied to discover subtle errors in actual systems projects, contributing effectively in this verification process. The value of the counterexample and safety properties generated by Bounded Model Checkers to create test case and to debug these systems is widely recognized. When a Bounded Model Checking (BMC) finds an error it produces a counterexample. Thus, the value of counterexamples to debug software systems is widely recognized in the state-of-the-practice. However, BMCs often produce counterexamples that are either large or difficult to be understood and manipulated mainly because of both the software size and the values chosen by the respective solver. In this work we aim to demonstrate and analyze the use of formal methods (through using the model checking technique) in the process of developing programs in C language, exploring the features already provided by the model checking as the counterexample and the identification and verification of safety properties. In view of this we present two approaches: (i) we describe a method to integrate the bounded model checker ESBMC with the CUnit framework. This method aims to extract the safety properties generated by ESBMC to generate automatically test cases using the rich set of assertions provided by the CUnit framework and (ii) a method aims to automate the collection and manipulation of counterexamples in order to instantiate the analised C program for proving the root cause of the identified error. Such methods may be seen as a complementary technique for the verification performed by BMCs. We show the effectiveness of our proposed method over publicly available benchmarks of C programs.
A utilização de sistemas baseados em computador em diversos domínios aumentou significativamente nos últimos anos. Um dos principais desafios no desenvolvimento de software de sistemas críticos é a garantia da sua correção e confiabilidade. Desta forma, a verificação de software exerce um papel importante para assegurar a qualidade geral do produto, visando principalmente características como previsibilidade e confiabilidade. No contexto de verificação de software, os Bounded Model Checkers estão sendo utilizados para descobrir erros sutis em projetos de sistemas de software atuais, contribuindo eficazmente neste processo de verificação. O valor dos contra-exemplos e propriedades de segurança gerados pelo Bounded Model Checkers para criar casos de testes e para a depuração de sistemas é amplamente reconhecido. Quando um Bounded Model Checking (BMC) encontra um erro ele produz um contra-exemplo. Assim, o valor dos contra-exemplos para depuração de software é amplamente reconhecido no estado da prática. Entretanto, os BMCs frequentemente produzem contra-exemplos que são grandes ou difíceis de entender ou manipular, principalmente devido ao tamanho do software e valores escolhidos pelo solucionador de satisfabilidade. Neste trabalho visamos demonstrar e analisar o uso de método formal (através da técnica model checking) no processo de desenvolvimento de programas na linguagem C, explorando as características já providas pelo model checking como o contra-exemplo e a identificação e verificação de propriedades de segurança. Em face disto apresentamos duas abordagens: (i) descrevemos um método para integrar o Bounded Model Checker ESBMC como o framework de teste unitário CUnit, este método visa extrair as propriedades geradas pelo ESBMC para gerar automaticamente casos de teste usando o rico conjunto de assertivas providas pelo framework CUnit e (ii) um método que visa automatizar a coleta e manipulação dos contra-exemplos, de modo a instanciar o programa C analisado, para comprovar a causa raiz do erro identificado. Tais métodos podem ser vistos como um método complementar para a verificação efetuada pelos BMCs. Demonstramos a eficácia dos métodos propostos sobre benchmarks públicos de código C.
Leitner, Florian. "Evaluation of the Matlab Simulink Design Verifier versus the model checker SPIN". [S.l. : s.n.], 2008. http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-61257.
Texto completoAzmy, Noran [Verfasser] y Christoph [Akademischer Betreuer] Weidenbach. "A machine-checked proof of correctness of Pastry / Noran Azmy ; Betreuer: Christoph Weidenbach". Saarbrücken : Saarländische Universitäts- und Landesbibliothek, 2017. http://d-nb.info/112307061X/34.
Texto completoBoulé, Marc. "Assertion-checker synthesis for hardware verification, in-circuit debugging and on-line monitoring". Thesis, McGill University, 2008. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=18754.
Texto completoLa production de circuits exempts d'erreurs est d'une importance capitale dans le domaine des semiconducteurs. Avec l'augmentation constante de la complexité des circuits numériques, la vérification matérielle basée sur les assertions devient indispensable. Les assertions modélisent le bon fonctionnement d'un circuit, et sont spécifiées à l'aide d'un langage faisant appel à la logique temporelle. En vérification dynamique, la simulation est utilisée afin d'analyser le comportement d'un circuit. Cependant, les temps de simulation deviennent trop longs pour de gros circuits et par conséquent, ces derniers sont souvent émulés de façon matérielle. Étant donné la présence d'opérateurs de logique temporelle de haut niveau, les assertions ne sont pas directement implantables de façon matérielle. Cette thèse présente les méthodes et les algorithmes nécessaires pour générer des circuits vérificateurs efficaces à partir des assertions. Ces vérificateurs se branchent au circuit à tester afin d'y observer les signaux, permettant ainsi de déceler un mauvais fonctionnement. Dans cet ouvrage, une série d'algorithmes ainsi qu'un modèle basé sur les automates finis sont développés et utilisés comme représentation intermédiaire pour les assertions. L'implémentation du vaste éventail d'opérateurs se fait aussi grâce à des règles de réécriture. En créant des circuits vérificateurs, les assertions peuvent dès lors être utilisés dans l'émulation matérielle et les accélérateurs de simulation. Les vérificateurs sont déjà fort utiles lors de la vérification préfabrication. Ces circuits peuvent aussi être utilisés lors de la vérification de circuits manufacturés où les problèmes de cadençage sont les plus réalistes. L'utilisation des vérificateurs est aussi applicable au-delà de la vérification et du déverminage post-fabrication, et peut servir pour la conception de circuits de haut niveau. Un ensemble d'extensi
Breitner, Joachim [Verfasser]. "Lazy Evaluation: From natural semantics to a machine-checked compiler transformation / Joachim Breitner". Karlsruhe : KIT Scientific Publishing, 2016. http://www.ksp.kit.edu.
Texto completoMetz, Gale Lynn. "The units of measure consistency checker for the entity-relationship-attribute requirements model". Thesis, Kansas State University, 1986. http://hdl.handle.net/2097/9941.
Texto completoWelmers, Laura Hazel. "The implementation of an input/output consistency checker for a requirements specification document". Thesis, Kansas State University, 1985. http://hdl.handle.net/2097/9889.
Texto completoVictor, Nyström. "En utredande jämförelse av programvaror vid BIM-samordning". Thesis, Örebro universitet, Institutionen för naturvetenskap och teknik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:oru:diva-69681.
Texto completoBIM is a phrase that has been raised increasingly frequent in the construction industry in recent years. The term has different meanings depending on who is asked. BIM tools is something that over the years also has increased on the market. The tools have different use depending on the user. Bim projects use so-called coordination tools for including control of various disciplines models where the choice of software is different, depending on functionality and users. This thesis addresses two software programs that can be used in BIM coordination. Through a case study, the author investigated which of the softwares Autodesk Navisworks Manage 2015 and Solibri Model Checker 9.5 is best for Grontmij AB in Eskilstuna to their needs and circumstances.
Yazdani, Najafabadi HamidReza. "Contract Programming Checker : A Study for Making an Automated Test Tool Using a Parser". Thesis, Uppsala University, Department of Information Technology, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-108026.
Texto completoThanks to computer software development, the communication industry hasevolved a lot during the last few years. Software and hardware integration made itpossible to exploit the best out of available equipments.
One of the important issues in software development process is to avoid bugs ordetect them in the early stage of development phase. Experiments have shown thatmost of the bugs are usually coming from the small fraction of the code. If this part ofthe code can be detected in advance then it is possible to benefit the cost of softwareproduction in great amount of time and money. Development teams have to makesure that they deliver a verified code to next team and that is why they obliged to usea concept called “contract programming”. It means expecting each module which isworking with other modules to respect to some kind of contract. As long as thecontract is respected in all module interactions, valid output will be guaranteed.
Several problems will remain in this approach. First issue is to make sure allnecessary contracts have been embedded to the code. On the other hand, contractsare memory and time consuming to check so try doing over protection results inweaker performance.
Considering the scalability problem, there is an urgent need for an automatic toolwhich is capable of checking against all possible defects to tell the programmer exactlywhere the contract is needed without performing any under or over protection.
This thesis tries to address this problem by generating a parser using UNIX tools,Lex (lexical analyzer) and Yacc (parser generator), to detect or worn about thepossible cause of defects. General built-in functions with different algorithms have alsobeen implemented in C language to perform different level of code analysis. Theoutcome of this thesis is a parser which fulfills three different requirements.
Firstly, checking all protected required places to check if they have been protectedby their proper contracts.
Secondly, notifying the extra contracts in places where they are not needed. It isdone by parser which analyzes the calling graph of different functions to verify if thecontracts are actually needed.
The last but not least requirement is to find the least protection required areas. Itmeans places where protection should be kept even if all internal computations areguaranteed to be correct. This facility will be used when the code wants to bedelivered to other teams and the internal integration of the code is already verified.
The tool is also capable of performing statistical analysis to give an exact percentageof protection in each function block and the software unit as a whole.
The Developed tool has successfully passed all of the exhaustive tests for furnishingthese requirements.
Stenh, Fredrik. "Extending a Real-Time Model-Checker to a Test-Case Generation Tool Using libCoverage". Thesis, Uppsala University, Department of Information Technology, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-89281.
Texto completoUPPAAL is a model-checker developed by the Department of Information Technology at Uppsala University in Sweden together with Aalborg University inDenmark. UPPAAL can be used to model, simulate, and verify timed automata. It has been used in many case studies since the first release in 1995.
libCoverage is a library developed at Uppsala University which can be used togenerate test-cases for real-time systems described as networks of timed automata. The test-cases are generated based upon a given coverage criteria, where the coverage criteria is specified by a parameterized observer automaton. The library is designed to extend model-checking tools, such as UPPAAL or SPIN.
The aim of this thesis is to extend UPPAAL 4.0 with libCoverage. For this purpose the grammar of the property file was extended to support libCoverage specific queries, and a modified reachability algorithm was presented which supports coverage exploration. We also extended each state with information about its current coverage, and implemented a wrapper which makes it possible for libCoverage to fetch information from UPPAAL about the system of timed automata.
In conclusion, we show that UPPAAL 4.0 can be extended with libCoverage tosupport test-case generation.
Doczkal, Christian [Verfasser] y Gert [Akademischer Betreuer] Smolka. "A machine-checked constructive metatheory of computation tree logic / Christian Doczkal. Betreuer: Gert Smolka". Saarbrücken : Saarländische Universitäts- und Landesbibliothek, 2016. http://d-nb.info/1097263258/34.
Texto completoSherwany, Amanj. "The Design, Implementation and Evaluation of a Pluggable Type Checker for Thread-Locality in Java". Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-155786.
Texto completoMesa-Martinez, Francisco J. "Optimistic-checker tandem processor design : exploiting design complexity to expose new opportunities for processor optimization /". Diss., Digital Dissertations Database. Restricted to UC campuses, 2007. http://uclibs.org/PID/11984.
Texto completoCohen, Jonathan E. W. (Jonathan Ephraim Weis) 1976. "Safety at what price? : setting anti-terrorist policies for checked luggage on US domestic aircraft". Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/36099.
Texto completoIncludes bibliographical references (leaves 45-46).
In this thesis, we considered the costs and benefits of implementing Positive Passenger Bag Match (PPBM) - an anti-terrorist measure to keep bombs out of checked luggage - on US domestic passenger flights. We constructed a stochastic model for comparing the cost-effectiveness of three alternative approaches to PPBM: no PPBML implementation; a PPBM implementation that is applied to 5% of passengers; and a full (100%) implementation of PPBM. We made ranges of estimates concerning the level of terrorist risk, the costs of PPBM operation, the consequences of successful terrorist bombings, and the anti-terrorist effectiveness of both the partial and full PPBM implementations. Calculations showed that there were circumstances under which each policy was the most cost-effective of the three. Of the three options, not implementing PPBM at all was the most cost-effective approach for the largest percentage of the scenarios considered. We found that 5% PPBM captured the next largest portion of the scenarios, and was generally the optimal strategy when annual PPBMI operation costs were low, when 5% PPBM anti-terrorist effectiveness was high, and when the consequences of successful bombings were severe. We found 100%(. PPBM to be the optimal strategy for most scenarios which involved highly costly terrorist bombings, a high level of terrorist risk, and a 100% PPBM policy that provided much added security over 5% PPBM.
by Jonathan E.W. Cohen.
S.M.