Thèses : « Checkley »

1

Checkley, Stephen [Verfasser]. « Engineering Tuneable Gene Circuits in Yeast / Stephen Checkley ». Munich : GRIN Verlag, 2015. http://d-nb.info/1097425436/34.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

2

Bahtiyar, 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.

Texte intégral

Résumé :

By 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.

Styles APA, Harvard, Vancouver, ISO, etc.

3

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.

Texte intégral

Résumé :

The diploma thesis deals with the industrial inspection of correctly made connectors based on computer recognition, and the detection and recognition application is implemented in Python on the Raspberry Pi platform.The work uses empirically known OpenCV library for recognition. The work also deals with the selection of suitable hardware devices, which are a camera with a lens and an illuminator, from which is created one compact device together with the Raspberry Pi microcomputer. The compact device is further mounted on the designed mechanical structure under which is created inspection zone. Finally, Raspberry Pi has a web-based user interface to check the inspection and the interface to write the data to the database.

Styles APA, Harvard, Vancouver, ISO, etc.

4

Kojovic, 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.

Texte intégral

Résumé :

Formal analysis is widely used to prove security properties of the protocols. There are tools to check protocols in isolation, but in fact we use many protocols in parallel or even vertically stacked, e.g. running an application protocol (like login) over a secure channel (like TLS) and in general it is unclear if that is safe. There are several works that give sufficient conditions for parallel and vertical composition, but there exists no program to check whether these conditions are actually met by a given suite of protocols.The aim of the master thesis project is to implement a protocol composition checker and present it as a service for registering protocols and checking compatibility of the protocols among each other. In order to establish the checker, it is necessary to collect and integrate different conditions defined through the literature. Also, we will define a framework based on Alice and Bob notation, so the checker can examine protocols in an unambiguous manner.Further we will develop a library of widely-used protocols like TLS that are provenly compatible with each other and define a set of negative example proto- cols to test the checker.We want to implement the checker as an extension of the existing Open-Source Fixed-Point Model-Checker OFMC to easily integrate our composition checker with a existing verification procedure that support Alice and Bob notation.

Styles APA, Harvard, Vancouver, ISO, etc.

5

Ghribi, Brahim. « A model checker for LOTOS ». Thesis, University of Ottawa (Canada), 1992. http://hdl.handle.net/10393/7536.

Texte intégral

Résumé :

LOTOS (Language Of Temporal Ordering Specification) is a Formal Description Technique (FDT) based on the temporal ordering of observational behaviour. It was developed by ISO (International Organization for Standardization) for the specification of OSI (Open Systems Interconnections) services and protocols. CTL (Computation Tree Logic) is a branching-time temporal logic, which can be used to express properties of the system being designed. Efficient algorithms were reported in the literature which make it possible to check whether a given behaviour tree enjoys a property expressed in CTL. Such algorithms constitute what is commonly called "model checking". The topic of this thesis is the design and implementation of a model checker for LOTOS specifications called LMC (LOTOS Model Checker). LMC allows users to check whether a specification behaves correctly. To do so, LMC requires a graph model obtained by expanding the LOTOS specification symbolically, and a set of correctness properties describing the requirements behaviour of the system to be checked. These properties are expressed in the branching temporal logic CTL. We present an introduction to formal description techniques along with a review of some relevant existing work. We then present the technical framework of the branching temporal logic CTL, and discuss some important aspects such as correctness properties of concurrent systems and their classification. We discuss the algorithms used in our model checker together with their application to LOTOS. Finally, we use two examples to illustrate the validation methodology.

Styles APA, Harvard, Vancouver, ISO, etc.

6

Hedin, 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.

Texte intégral

Résumé :

A common feature of text input tools is spell checking. It exists in search engines, email clients and of course in word processors like Microsoft Word. By having a spell checker when you are typing you can be more efficient than if you had to check the spelling with a separate proofing tool. Spell checking is a common request by the users of the room planning software CET Designer which is developed by Configura. In this thesis Windows Spell Checking API is evaluated and compared to alternative spell checkers. A prototype of an integrated spell checker in CET Designer text tool is then implemented with Windows Spell Checking API.

Styles APA, Harvard, Vancouver, ISO, etc.

7

Viktorsson, Arvid, et 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.

Texte intégral

Résumé :

Many text-editor users depend on spellcheckers to correct their typographical errors. The absence of a spellchecker can create a negative experience for the user. In today's advanced technological environment spellchecking is an expected feature. 2Consiliate Business Solutions owns a Java application with a text-editor which does not have a spellchecker. This project aims to investigate and implement available techniques and algorithms for spellcheckers and automated word correction. During implementation, the techniques were tested for their performance and the best solutions were chosen for this project. All the techniques were gathered from earlier written literature on the topic and implemented in Java using default Java libraries. Analysis of the results proves that it is possible to create a complete spellchecker combining available techniques and that the quality of a spellchecker largely depends on a well defined dictionary.

Styles APA, Harvard, Vancouver, ISO, etc.

8

Yoo, Joonhyuk. « Harnessing checker hierarchy for reliable microprocessors ». College Park, Md. : University of Maryland, 2007. http://hdl.handle.net/1903/7688.

Texte intégral

Résumé :

Thesis (Ph. D.) -- University of Maryland, College Park, 2007.
Thesis 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.

Styles APA, Harvard, Vancouver, ISO, etc.

9

Gerber, Erick D. B. « A model checker for the LF system ». Thesis, Stellenbosch : Stellenbosch University, 2007. http://hdl.handle.net/10019.1/19597.

Texte intégral

Résumé :

Thesis (MSc)--University of Stellenbosch, 2007.
ENGLISH 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.

Styles APA, Harvard, Vancouver, ISO, etc.

10

Hoyos, Jacob. « PLPrepare : A Grammar Checker for Challenging Cases ». Digital Commons @ East Tennessee State University, 2021. https://dc.etsu.edu/etd/3898.

Texte intégral

Résumé :

This study investigates one of the Polish language’s most arbitrary cases: the genitive masculine inanimate singular. It collects and ranks several guidelines to help language learners discern its proper usage and also introduces a framework to provide detailed feedback regarding arbitrary cases. The study tests this framework by implementing and evaluating a hybrid grammar checker called PLPrepare. PLPrepare performs similarly to other grammar checkers and is able to detect genitive case usages and provide feedback based on a number of error classifications.

Styles APA, Harvard, Vancouver, ISO, etc.

11

Eriksson, 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.

Texte intégral

Résumé :

Model 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.

Styles APA, Harvard, Vancouver, ISO, etc.

12

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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

13

Al-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/.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

14

Azmy, Noran. « A Machine-Checked Proof of Correctness of Pastry ». Thesis, Université de Lorraine, 2016. http://www.theses.fr/2016LORR0277/document.

Texte intégral

Résumé :

Les réseaux pair-à-pair (P2P) constituent un modèle de plus en plus populaire pour la programmation d’applications Internet car ils favorisent la décentralisation, le passage à l’échelle, la tolérance aux pannes et l’auto-organisation. à la différence du modèle traditionnel client-serveur, un réseau P2P est un système réparti décentralisé dans lequel tous les nœuds interagissent directement entre eux et jouent à la fois les rôles de fournisseur et d’utilisateur de services et de ressources. Une table de hachage distribuée (DHT) est réalisée par un réseauP2P et offre les mêmes services qu’une table de hachage classique, hormis le fait que les différents couples (clef, valeur) sont stockés dans différents nœuds du réseau. La fonction principale d’une DHT est la recherche d’une valeur associée à une clef donnée. Parmi les protocoles réalisant une DHT on peut nommer Chord, Pastry, Kademlia et Tapestry. Ces protocoles promettent de garantir certaines propriétés de correction et de performance ; or, les tentatives de démontrer formellement de telles propriétés se heurtent invariablement à des cas limites dans lesquels certaines propriétés sont violées. Tian-xiang Lu a ainsi décrit des problèmes de correction dans des versions publiées de Pastry. Il a conçu un modèle, appelé LuPastry, pour lequel il a fourni une preuve partielle, mécanisée dans l’assistant à la preuve TLA+ Proof System, démontrant que les messages de recherche de clef sont acheminés au bon nœud du réseau dans le cas sans départ de nœuds. En analysant la preuve de Lu j’ai découvert qu’elle contenait beaucoup d’hypothèses pour lesquelles aucune preuve n’avait été fournie, et j’ai pu trouver des contre-exemples à plusieurs de ces hypothèses. La présente thèse apporte trois contributions. Premièrement, je présente LuPastry+, une spécification TLA+ revue de LuPastry. Au-delà des corrections nécessaires d’erreurs, LuPastry+ améliore LuPastry en introduisant de nouveaux opérateurs et définitions, conduisant à une spécification plus modulaire et isolant la complexité de raisonnement à des parties circonscrites de la preuve, contribuant ainsi à automatiser davantage la preuve. Deuxièmement, je présente une preuve TLA+ complète de l’acheminement correct dans LuPastry+. Enfin, je démontre que l’étape finale du processus d’intégration de nœuds dans LuPastry (et LuPastry+) n’est pas nécessaire pour garantir la cohérence du protocole. Concrètement, j’exhibe une nouvelle spécification avec un processus simplifié d’intégration de nœuds, que j’appelle Simplified LuPastry+, et je démontre qu’elle garantit le bon acheminement de messages de recherche de clefs. La preuve de correction pour Simplified LuPastry+ est obtenue en réutilisant la preuve pour LuPastry+, et ceci représente un bon succès pour la réutilisation de preuves, en particulier considérant la taille de ces preuves. Chacune des deux preuves requiert plus de 30000 étapes interactives ; à ma connaissance, ces preuves constituent les preuves les plus longues écrites dans le langage TLA+ à ce jour, et les seuls exemples d’application de preuves mécanisées de théorèmes pour la vérification de protocoles DHT
A 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

Styles APA, Harvard, Vancouver, ISO, etc.

15

Azmy, Noran. « A Machine-Checked Proof of Correctness of Pastry ». Electronic Thesis or Diss., Université de Lorraine, 2016. http://www.theses.fr/2016LORR0277.

Texte intégral

Résumé :

Les réseaux pair-à-pair (P2P) constituent un modèle de plus en plus populaire pour la programmation d’applications Internet car ils favorisent la décentralisation, le passage à l’échelle, la tolérance aux pannes et l’auto-organisation. à la différence du modèle traditionnel client-serveur, un réseau P2P est un système réparti décentralisé dans lequel tous les nœuds interagissent directement entre eux et jouent à la fois les rôles de fournisseur et d’utilisateur de services et de ressources. Une table de hachage distribuée (DHT) est réalisée par un réseauP2P et offre les mêmes services qu’une table de hachage classique, hormis le fait que les différents couples (clef, valeur) sont stockés dans différents nœuds du réseau. La fonction principale d’une DHT est la recherche d’une valeur associée à une clef donnée. Parmi les protocoles réalisant une DHT on peut nommer Chord, Pastry, Kademlia et Tapestry. Ces protocoles promettent de garantir certaines propriétés de correction et de performance ; or, les tentatives de démontrer formellement de telles propriétés se heurtent invariablement à des cas limites dans lesquels certaines propriétés sont violées. Tian-xiang Lu a ainsi décrit des problèmes de correction dans des versions publiées de Pastry. Il a conçu un modèle, appelé LuPastry, pour lequel il a fourni une preuve partielle, mécanisée dans l’assistant à la preuve TLA+ Proof System, démontrant que les messages de recherche de clef sont acheminés au bon nœud du réseau dans le cas sans départ de nœuds. En analysant la preuve de Lu j’ai découvert qu’elle contenait beaucoup d’hypothèses pour lesquelles aucune preuve n’avait été fournie, et j’ai pu trouver des contre-exemples à plusieurs de ces hypothèses. La présente thèse apporte trois contributions. Premièrement, je présente LuPastry+, une spécification TLA+ revue de LuPastry. Au-delà des corrections nécessaires d’erreurs, LuPastry+ améliore LuPastry en introduisant de nouveaux opérateurs et définitions, conduisant à une spécification plus modulaire et isolant la complexité de raisonnement à des parties circonscrites de la preuve, contribuant ainsi à automatiser davantage la preuve. Deuxièmement, je présente une preuve TLA+ complète de l’acheminement correct dans LuPastry+. Enfin, je démontre que l’étape finale du processus d’intégration de nœuds dans LuPastry (et LuPastry+) n’est pas nécessaire pour garantir la cohérence du protocole. Concrètement, j’exhibe une nouvelle spécification avec un processus simplifié d’intégration de nœuds, que j’appelle Simplified LuPastry+, et je démontre qu’elle garantit le bon acheminement de messages de recherche de clefs. La preuve de correction pour Simplified LuPastry+ est obtenue en réutilisant la preuve pour LuPastry+, et ceci représente un bon succès pour la réutilisation de preuves, en particulier considérant la taille de ces preuves. Chacune des deux preuves requiert plus de 30000 étapes interactives ; à ma connaissance, ces preuves constituent les preuves les plus longues écrites dans le langage TLA+ à ce jour, et les seuls exemples d’application de preuves mécanisées de théorèmes pour la vérification de protocoles DHT
A 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

Styles APA, Harvard, Vancouver, ISO, etc.

16

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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

17

Yuen, Adrienne L. « Gallicisms : An analysis leading towards a prototype gallicisms checker ». Thesis, University of Ottawa (Canada), 1994. http://hdl.handle.net/10393/10340.

Texte intégral

Résumé :

The anglicization of French has long been perceived as a major problem and much effort has been made both in France and in Canada to minimize its effects. The gallicization of English, though a problem of much smaller magnitude, has also been observed, particularly in areas such as Quebec where French is the dominant language. However, gallicization his received much less attention than anglicization. In fact, there seems to be little concern among Quebec's anglophones over the gallicization of English, which many do not perceive as being a problem. This lack of interest is not without potential consequences, for, as several linguists have noted, if the current trend towards "Frenglish" is not halted, the English of Quebec's anglo-phone minority may eventually become unintelligible to other English-speaking Canadians. This thesis studies gallicization and has two main objectives: to provide a theoretical and historical background to the phenomenon, and to create a prototype checker of gallicisms. The study includes: a discussion of interference, borrowing and gallicisms, including a definition of the term "gallicism"; a brief history of the English language in Canada with an emphasis on the various influences that have shaped Canadian English; a discussion of Quebec English and its distinguishing feature--gallicisms; a classification system of the different types of gallicism; a set of procedures for verifying suspected gallicisms; the results of an informal experiment where commercially-available tools were applied to a test document containing known gallicisms; a description of a prototype gallicisms checker.

Styles APA, Harvard, Vancouver, ISO, etc.

18

Kim, Kwanghyun. « An interactive design rule checker for integrated circuit layout ». Thesis, Virginia Polytechnic Institute and State University, 1985. http://hdl.handle.net/10919/50034.

Texte intégral

Résumé :

An implementation of an interactive design rule checker is described in this thesis. Corner-based design rule checking algorithm is used for the implementation. Due to the locality of checking mechanism of the corner-based algorithm, it is suitable for hierarchical and interactive local design rule checking. It also allows the various design rules to be specified very easily. Interactive operations are devised so that the design rule checker can be invoked from inside the layout editor. All the information about the violation, such as position, type of violation, and symbol definition name are provided in an interactive manner. In order to give full freedom to the user to choose the scope of checking, three options, "Flattening", "Unflattening" and "User-defined window" are implemented in creating the database to be checked. The "User-defined window" option allows hierarchical design rule checking on a design which contains global rectangles. Using these three options, very efficient hierarchical checking can be performed.
Master of Science
incomplete_metadata

Styles APA, Harvard, Vancouver, ISO, etc.

19

Neupane, Thakur. « STAMINA : Stochastic Approximate Model-Checker for Infinite-State Analysis ». DigitalCommons@USU, 2019. https://digitalcommons.usu.edu/etd/7607.

Texte intégral

Résumé :

Reliable operation of every day use computing system, from simple coffee machines to complex flight controller system in an aircraft, is necessary to save time, money, and in some cases lives. System testing can check for the presence of unwanted execution but cannot guarantee the absence of such. Probabilistic model checking techniques have demonstrated significant potential in verifying performance and reliability of various systems whose execution are defined with likelihood. However, its inability to scale limits its applicability in practice. This thesis presents a new model checker, STAMINA, with efficient and scalable model truncation for probabilistic verification. STAMINA uses a novel model reduction technique generating a finite state representations of large systems that are amenable to existing probabilistic model checking techniques. The proposed method is evaluated on several benchmark examples. Comparisons with another state-of-art tool demonstrates both accuracy and efficiency of the presented method.

Styles APA, Harvard, Vancouver, ISO, etc.

20

Stratis, 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.

Texte intégral

Résumé :

In this master thesis we investigated whether it is possible to use automatically generated C code from Function Block Diagram models as an input to the CPAchecker model checker in order to generate automated test cases. Function Block Diagram is a non-executable programming and modeling language. Consequently, we need to transform this language to an executable language that can be model checked. A tool that achieves this is the MITRAC tool, a proprietary development tool used in the embedded system domain, for engineering programmable logic controllers. The purpose of this research was to investigate to what extent the generated C code using MITRAC can be reused as an input to the CPAchecker tool for automated test case generation. In order to achieve this we needed to perform certain transformations steps on the existing code. In addition, necessary instrumentations were needed in order to trigger CPAtiger, an extension of CPAchecker which generates test cases, to achieve maximum condition coverage. We showed that by performing the required modifications it is feasible to reuse the generated C code as an input to CPAchecker tool. We also showed an approach for mapping the generated test cases with the actual Function Block Diagram. We performed mutation analysis in order to evaluate the quality of the generated test cases in terms of the number of injected faults they detect. Test case generation with CPAchecker could be improved in the future in terms of reducing the number of transformations and instrumentations that are currently needed. In order to achieve this we need to add to CPAchecker tool support for structures that are used in C, such as structs. Finally we can extend the type of logic coverage criteria we can use with CPAchecker by adding additional support of FQL language.

Styles APA, Harvard, Vancouver, ISO, etc.

21

Johnson, 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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

22

Sexton, John A. « Detecting errors in software using a parameter checker : an analysis / ». Online version of thesis, 1989. http://hdl.handle.net/1850/10585.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

23

Kleymann, Thomas. « Hoare logic and VDM : machine-checked soundness and completeness proofs ». Thesis, University of Edinburgh, 1998. http://hdl.handle.net/1842/387.

Texte intégral

Résumé :

Investigating soundness and completeness of verification calculi for imperative programming languages is a challenging task. Many incorrect results have been published in the past. We take advantage of the computer-aided proof tool LEGO to interactively establish soundness and completeness of both Hoare Logic and the operation decomposition rules of the Vienna Development Method (VDM) with respect to operational semantics. We deal with parameterless recursive procedures and local variables in the context of total correctness. As a case study, we use LEGO to verify the correctness of Quicksort in Hoare Logic. As our main contribution, we illuminate the rôle of auxiliary variables in Hoare Logic. They are required to relate the value of program variables in the final state with the value of program variables in the initial state. In our formalisation, we reflect their purpose by interpreting assertions as relations on states and a domain of auxiliary variables. Furthermore, we propose a new structural rule for adjusting auxiliary variables when strengthening preconditions and weakening postconditions. This rule is stronger than all previously suggested structural rules, including rules of adaptation. With the new treatment, we are able to show that, contrary to common belief, Hoare Logic subsumes VDM in that every derivation in VDM can be naturally embedded in Hoare Logic. Moreover, we establish completeness results uniformly as corollaries of Most General Formula theorems which remove the need to reason about arbitrary assertions.

Styles APA, Harvard, Vancouver, ISO, etc.

24

Kopas, 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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

25

Unver, 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.

Texte intégral

Résumé :

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994.
Includes bibliographical references (leaves 90-92).
by Evren R. Ünver.
M.Eng.

Styles APA, Harvard, Vancouver, ISO, etc.

26

Nelson, Andrew P. « Funqual : User-Defined, Statically-Checked Call Graph Constraints in C++ ». DigitalCommons@CalPoly, 2018. https://digitalcommons.calpoly.edu/theses/1848.

Texte intégral

Résumé :

Static analysis tools can aid programmers by reporting potential programming mistakes prior to the execution of a program. Funqual is a static analysis tool that reads C++17 code ``in the wild'' and checks that the function call graph follows a set of rules which can be defined by the user. This sort of analysis can help the programmer to avoid errors such as accidentally calling blocking functions in time-sensitive contexts or accidentally allocating memory in heap-sensitive environments. To accomplish this, we create a type system whereby functions can be given user-defined type qualifiers and where users can define their own restrictions on the call graph based on these type qualifiers. We demonstrate that this tool, when used with hand-crafted rules, can catch certain types of errors which commonly occur in the wild. We claim that this tool can be used in a production setting to catch certain kinds of errors in code before that code is even run.

Styles APA, Harvard, Vancouver, ISO, etc.

27

Deitle, 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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

28

Esen, 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.

Texte intégral

Résumé :

Model checking is a verification method which is used to detect bugs which would be extremely hard to detect using traditional testing, and ELDARICA is a state-of-the-art model checker which accepts a variety of formats as its input, including programs written in a fragment of the C language. This thesis aims to improve the C front-end of ELDARICA to a point where it can automatically model and verify C programs which contain pointers, heap memory interactions and structs, which are currently not supported. This work models the heap in a similar way to how it was done in JayHorn, a model checker for Java, by automatically finding quantified invariants which summarize the states of data structures that are on the heap. Support for structs is added by modeling them as algebraic data types, and limited support for stack pointers is added with some constraints on how they are declared and used. The initial experimental results are promising. The extended tool can now parse programs written in a larger fragment of the C language, with acceptable precision and performance in comparison to similar tools.

Styles APA, Harvard, Vancouver, ISO, etc.

29

Banda, Gourinath, et 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/.

Texte intégral

Résumé :

Abstract interpretation-based model checking provides an approach to verifying properties of infinite-state systems. In practice, most previous work on abstract model checking is either restricted to verifying universal properties, or develops special techniques for temporal logics such as modal transition systems or other dual transition systems. By contrast we apply completely standard techniques for constructing abstract interpretations to the abstraction of a CTL semantic function, without restricting the kind of properties that can be verified. Furthermore we show that this leads directly to implementation of abstract model checking algorithms for abstract domains based on constraints, making use of an SMT solver.

Styles APA, Harvard, Vancouver, ISO, etc.

30

Johansson, Emil. « Granskning av Solibri Model Checker - En Svenskanpassning : Jämförelse av två egenkontrollsystem ». Thesis, Uppsala universitet, Byggteknik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-209768.

Texte intégral

Résumé :

The building industry are currently going through a huge alteration. The introduction of BIM (Building Information Modeling). Which also implements a lot of new ways of solving problems that building modeling can cause. This report is written for Uppsala University in cooperation with Temagruppen in Uppsala. However, it contains a comparison between two different systems that checks building models. Temagruppen invested in a new Swedish adaptation of a software called Solibri Model Checker. This Software controlling the availability in building models, it also introduces a new way of interaction between different instances during a building project. The definition of the report is availability in public buildings. A building model has been designed in Revit, then imported to Solibri Model Checker who controls the availability and creates a report of certain design fault. Interviews are given to get a look into how the work with availability controls currently works at Temagurppuen. This results in a discussion of benefits and disadvantages of the two different methods. The result finally shows that certain work can be more effectively done with Solibri Model Checker. But availability contains more than just disabled impairment. Visual- and cognitive impairment can’t still be controlled by just a computer software.

Styles APA, Harvard, Vancouver, ISO, etc.

31

Markovic, 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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

32

Herná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.

Texte intégral

Résumé :

The aim of this doctoral thesis is to compare the feedback provided by the teacher to that obtained by the software called Grammar Checker on grammatical errors in the written production of English as a foreign language students. Traditionally, feedback has been considered as one of the three theoretical conditions for language learning (along with input and output) and, for this reason, extensive research has been carried out on who should provide it, when and the level of explicitness. However, there are far fewer studies that analyse the use of e-feedback programs as a complement or alternative to those offered by the teacher. Participants in our study were divided into two experimental groups and one control group, and three grammatical aspects that are usually susceptible to error in English students at B2 level were examined: prepositions, articles, and simple past-present/past perfect dichotomy. All participants had to write four essays. The first experimental group received feedback from the teacher and the second received it through the Grammar Checker program. The control group did not get feedback on the grammatical aspects of the analysis but on other linguistic forms not studied. The results obtained point, first of all, to the fact that the software did not mark grammatical errors in some cases. This means that students were unable to improve their written output in terms of linguistic accuracy after receiving feedback from the program. In contrast, students who received feedback from the teacher did improve, although the difference was not significant. Second, the two experimental groups outperformed the control group in the use of the grammatical forms under analysis. Thirdly, regardless of the feedback offered, the two groups showed improvement in the use of grammatical aspects in the long term, and finally, no differences in attitude towards the feedback received and its impact on the results were found in either of the experimental groups. Our results open up new lines for investigating corrective feedback in the English as a foreign language classroom, since more studies are needed that, on the one hand, influence the improvement of electronic feedback programs by making them more accurate and effective in the detection of errors. On the other hand, software such as Grammar Checker can be a complement to the daily practice of the foreign language teacher, helping in the first instance to correct common and recurring mistakes, even more so when our research has shown that attitudes towards this type of electronic feedback are positive and does not imply an intrusion into the classroom, thus helping in the acquisition of the English language.
Programa de Doctorat en Llengües Aplicades, Literatura i Traducció

Styles APA, Harvard, Vancouver, ISO, etc.

33

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/.

Texte intégral

Résumé :

A UML é uma notação gráfica utilizada na modelagem de sistemas orientados a objetos, em diferentes domínios da computação. Por ser simples de utilizar, em relação a outras formas de modelagem, a UML é amplamente difundida entre os desenvolvedores de software, tanto na academia quanto na indústria. Entre as suas vantagens, encontram-se: (i) a representação visual das relações entre classes e entidades, pois ao se utilizar de diagramas, a UML facilita o entendimento e a visualização das relações dentro do sistema modelado; (ii) a legibilidade e usabilidade, sem que seja necessário a leitura do código do sistema, uma vez que um desenvolvedor pode compreender quais partes do código são redundantes ou reutilizadas; e (iii) uma ferramenta de planejamento, ao auxiliar na definição do que deve ser feito, antes que a implementação comece de fato, além de poder produzir código e reduzir o tempo de desenvolvimento. Todavia, a UML possui desvantagens, tais como: (i) ambiguidade entre elementos UML diferentes, devido a sobreposição dos diagramas; e (ii) falta de uma semântica clara, o qual geralmente faz com que a semântica da linguagem de programação seja adotada. Para mitigar essas desvantagens, pesquisadores buscam atribuir uma semântica formal à UML. Esse tipo de semântica é encontrado em modelos formais, onde o sistema modelado é livre de ambiguidades e possui uma semântica clara e precisa. Por sua vez, os modelos formais não são simples de serem criados e compreendidos por desenvolvedores. O grau de conhecimento em formalismo necessário para utilizar tal modelo é alto, o que faz com que seu uso seja menos difundido, comparado com a notação gráfica não formal da UML. Apesar dos esforços dos pesquisadores, as técnicas de formalização semântica da UML apresentam, no geral, um problema pouco abordado: apesar de utilizar a UML para modelar o sistema, o artefato final dessas técnicas é um trace formal. Considerando o conhecimento comum de um desenvolvedor de software, esse trace dificulta a análise dos problemas, encontrados pelos model checkers, e a correção dos mesmos no modelo UML. Com o objetivo de auxiliar o desenvolvedor na compreensão dos resultados formais (o trace citado), esta tese de doutorado apresenta uma abordagem baseada em Model-driven Architecture (MDA) capaz de representar as informações dos resultados formais dentro de um modelo UML. Por meio de transformações do modelo UML, essas representações, definidas utilizando a abordagem, auxiliam o desenvolvedor a visualizar o fluxo de execução do model checker dentro do modelo UML. Assim, acredita-se que as vantagens obtidas pela formalização semântica da UML podem ser mais difundidas e utilizadas pelos desenvolvedores, principalmente na indústria.
UML 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.

Styles APA, Harvard, Vancouver, ISO, etc.

34

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/.

Texte intégral

Résumé :

Estruturas de tratamento de exceção são extremamente comuns em softwares desenvolvidos em linguagens modernas, como Java, e afetam de forma contundente o comportamento de um software quando exercitadas. Apesar destas duas características, as principais técnicas de verificação, teste de software e verificação formal, e as ferramentas a elas vinculadas, tendem a negligenciar o comportamento excepcional. Alguns dos fatores que levam a esta negligência são a não especificação do comportamento excepcional em termos de projeto e a consequente implementação das estruturas de tratamento com base no julgamento individual de cada programador. Isto resulta na não consideração de partes expressivas do código em termos de verificação e, consequentemente, a possibilidade de não serem detectados erros relativos tanto às próprias estruturas de tratamento quanto às estruturas de código vinculadas a estas. A fim de abordar este problema, propomos uma técnica, baseada em model checking, que automatiza o processo de exercício de caminhos excepcionais. Isto permite que seja observado o comportamento de um software quando da ocorrência de uma exceção. Pretendemos, com esta técnica, dar suporte para que seja aplicado aos caminhos que representam o comportamento excepcional de um software as mesmas técnicas de detecção de erros que são aplicadas aos caminhos que representam o comportamento normal e, com isso, agregar um aumento na qualidade do desenvolvimento de software.
Software 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.

Styles APA, Harvard, Vancouver, ISO, etc.

35

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.

Texte intégral

Résumé :

In the context of Service-Oriented Systems (SOS), services represent loosely coupled discrete units that can be created, invoked, composed and decomposed upon a client request. In such a setting, where complex systems are composed out of services based on the client request, ensuring the expected level of Quality-of-Service (QoS) becomes a difficult task. In systems built on service-oriented principles, the formal specification of both functional and extra-functional system behavior, service availability, compatibility and interoperability between different services and systems have become important issues. To be compliant with the new features, the REMES language has been extended towards SOS with new constructs that have been given formal semantics. In this thesis, we propose transformation rules, definitions and techniques for transforming these new constructs into Timed Automata (TA) counterparts to facilitate the formal analysis. Also, we present an extension to an existing REMES SOS IDE toolset for performing an automated transformation of the REMES SOS models into the TA framework suitable for the formal analysis with the UPPAAL model-checker. The contribution from our work is on two fronts: a) define transformation rules for all of the constructs specific for the REMES SOS modeling and b) prototype implementation of the transformation rules as an extension add-on to the already existing IDE for modeling SOS to perform the automated transformation. The benefit of performing an automated transformation of the REMES SOS models in TA is twofold. First, by automating the transformation process, the process of validation of the models becomes faster. Second, we considerably reduce the influence from the human factor in the entire process, and at the same time lower the risks of introducing errors into the systems in the phase of creating the formal model. Additional benefit from the automated process is that the SOS designer does not have to be a verification expert in order to be able to verify the modeled system.

Styles APA, Harvard, Vancouver, ISO, etc.

36

Zaza, 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.

Texte intégral

Résumé :

This thesis work investigates the accuracy of Loci, a static type checker in expressing thread-locality at compile time. To do this, we need to capture both thread-locality at runtime, and thread-locality expressed statically using Loci. We present the framework we built to find these measurements, describe the process of adding Loci annotations to two multi-threaded benchmarks, and measure the accuracy of expressed thread-locality using the developed framework. We found that Loci annotations could express a thread-locality rate of 99.9% in terms of object count for a small benchmark of 1436 LOC, using a total of 15 annotations, and a rate of 83.5% for a part of Xalan from the DaCapo benchmark suite, composed of more than 85,000 LOC, using 451 annotations. These results show that Loci can be used to capture a high-rate of thread-locality with a small annotation overhead.

Styles APA, Harvard, Vancouver, ISO, etc.

37

Rocha, 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.

Texte intégral

Résumé :

Made available in DSpace on 2015-04-11T14:03:20Z (GMT). No. of bitstreams: 1 HERBERT OLIVEIRA.pdf: 512075 bytes, checksum: acc5d05442df938abdfa025f9db23367 (MD5) Previous issue date: 2011-02-04
CAPES - 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.

Styles APA, Harvard, Vancouver, ISO, etc.

38

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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

39

Azmy, Noran [Verfasser], et 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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

40

Boulé, 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.

Texte intégral

Résumé :

Producing error-free circuits is of paramount importance in the semiconductor industry. Assertions are becoming an indispensable means of verifying the correctness of increasingly complex digital designs. Assertions model the proper behavior of a design, and are expressed in a high level language based on temporal logic. In dynamic verification, simulation is used to exercise a circuit in order to assess its behavior. For large designs, simulation times are often prohibitively excessive, and designs are instead emulated in hardware. Because of their high-level temporal operators, assertion statements do not lend themselves directly to hardware implementations such as emulation. This thesis introduces techniques and algorithms for generating resource-efficient circuit-level checkers from hardware assertion statements. These checkers are added to the source design, where they monitor the appropriate circuit signals to find faulty execution sequences. In this work, a finite automaton framework and a set of algorithms are developed and used extensively to create an intermediate representation of assertions. Implementing the large variety of temporal operators found in properties is also performed using specially designed rewrite rules. Checkers are circuit-level implementations of assertions, and thus allow assertions to be used in hardware emulation and simulation acceleration. The checkers are not only beneficial in pre-fabrication functional verification, but can also be used for debugging fabricated silicon, at speed, where timing issues are most prevalent. Using checkers beyond verification and silicon debug is also explored, by proposing the use of assertions and a checker generator to automate the design of certain types of circuits. A variety of enhancements are also introduced to improve the debugging process with assertion checkers. These enhancements range from additional observability and metric-reporting features, to behavioral modifications to the che
La 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

Styles APA, Harvard, Vancouver, ISO, etc.

41

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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

42

Metz, 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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

43

Welmers, 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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

44

Victor, 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.

Texte intégral

Résumé :

BIM är en fras som har tagits upp allt frekventare inom byggbranschen senaste åren. Uttrycket har olika innebörd beroende på vem som tillfrågas och dennes kunskap inom området. BIM-verktyg är något som med åren också har ökat på marknaden. Verktygen har olika användningsområden beroende på vilken aktör som ska utnyttja det. I BIM-projekt används såkallade samordningsverktyg för att bland annat kontrollera olika discipliners modeller där valet av programvara är avgörande beroende på funktionalitet och nyttjare. I detta arbete studerades två programvaror som kan användas vid BIM-samordning. Genom en fallstudie har det undersökts vilket utav programvarorna Autodesk Navisworks Manage 2015 och Solibri Model Checker 9.5 som passar bäst för Grontmij AB i Eskilstuna efter deras behov och förutsättningar. Efter en grundlig studie av båda programvarorna påvisar rapporten att den rekommenderade programvaran specifikt för Grontmij AB i Eskilstuna är Solibri Model Checker 9.5 i enlighet med företagets behov och förutsättningar.
BIM 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.

Styles APA, Harvard, Vancouver, ISO, etc.

45

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.

Texte intégral

Résumé :

Thanks 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.

Styles APA, Harvard, Vancouver, ISO, etc.

46

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.

Texte intégral

Résumé :

UPPAAL 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.

Styles APA, Harvard, Vancouver, ISO, etc.

47

Doczkal, Christian [Verfasser], et 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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

48

Sherwany, 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.

Texte intégral

Résumé :

This thesis presents a simple type system for expressing thread-locality in Java. Classes and types are annotated to express thread-locality and violations, where supposedly thread-local data may be shared between two or more threads, are detected at compile-time. The proposed system is an improvement over Loci, a minimal and modular type checker for expressing thread-locality in Java due to Wrigstad et al. The improved Loci system presented in this thesis only adds an additional metadata annotation, four in total. We implemented the system as a command line tool that can be plugged into the standard javac compiler and used it to evaluate our design on a number of benchmarks. We believe that Loci is compatible with how Java programs are written and that the improved system keeps the annotation overhead light while making it even simpler to treat a value as thread-local.

Styles APA, Harvard, Vancouver, ISO, etc.

49

Mesa-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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

50

Cohen, 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.

Texte intégral

Résumé :

Thesis (S.M.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2000.
Includes 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.

Styles APA, Harvard, Vancouver, ISO, etc.

Thèses sur le sujet « Checkley »

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres