Dissertations / Theses: 'Dynamic verification'

1

Ji, Ran. "Automatic Verification of Dynamic Data-Dependent Programs." Thesis, Uppsala University, Department of Information Technology, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-103021.

Full text

Abstract:

We present a new approach for automatic verification of data-dependent programs manipulating dynamic heaps. A heap is encoded by a graph where the nodes represent the cells, and the edges reflect the pointer structure between the cells of the heap. Each cell contains a set of variables which range over the natural numbers. Our method relies on standard backward reachability analysis, where the main idea is to use a simple set of predicates, called signatures, in order to represent bad sets of heaps. Examples of bad heaps are those which contain either garbage, lists which are not well-formed, or lists which are not sorted. We present the results for the case of programs with a single next-selector, and where variables may be compared for equality or inequality. This allows us to verify for instance that a program, like bubble sort or insertion sort, returns a list which is well-formed and sorted, or that the merging of two sorted lists is a new sorted list. We will report on the result of running a prototype based on the method on a number of programs.

APA, Harvard, Vancouver, ISO, and other styles

2

Yogendrakumar, Muthucumarasamy. "Dynamic soil-structure interaction : theory and verification." Thesis, University of British Columbia, 1988. http://hdl.handle.net/2429/29222.

Full text

Abstract:

A nonlinear effective stress method of analysis for determining the static and dynamic response of 2-D embankments and soil-structure interaction systems is presented. The method of analysis is incorporated in the computer program TARA-3. The constitutive model in TARA-3 is expressed as a sum of a shear stress model and a normal stress model. The behavior in shear is assumed to be nonlinear and hysteretic, exhibiting Masing behavior under unloading and reloading. The response of the soil to uniform all round pressure is assumed to nonlinearly elastic and dependent on the mean normal effective stresses. The porewater pressures required in the dynamic effective stress method of analysis are obtained by the Martin-Finn-Seed porewater pressure generation model modified to include the effect of initial static shear. During dynamic analysis, the effective stress regime and consequently the soil properties are modified for the effect of seismically induced porewater pressures. A very attractive feature of TARA-3 is that all the parameters required for an analysis may be obtained from conventional geotechnical engineering tests either in-situ or in laboratory. A novel feature of the program is that the dynamic analysis can be conducted starting from the static stress-strain condition which leads to accumulating permanent deformations in the direction of the smallest residual resistance to deformation. The program can also start the dynamic analysis from a zero stress-zero strain condition as is done conventionally in engineering practice. The program includes an energy transmitting base and lateral energy transmitting boundaries to simulate the radiation of energy which occurs in the field. The program predicts accelerations, porewater pressures, instantaneous dynamic deformations, permanent deformations due to the hysteretic stress-strain response, deformations due to gravity acting on the softening soil and deformations due to consolidation as the seismic porewater pressures dissipate. The capability of TARA-3 to model the response of soil structures and soil-structure interaction systems during earthquakes has been validated using data from simulated earthquake tests on a variety of centrifuged models conducted on the large geotechnical centrifuge at Cambridge University in the United Kingdom. The data base includes acceleration time histories, porewater pressure time histories and deformations at many locations within the models. The program was able to successfully simulate acceleration and porewater pressure time histories and residual deformations in the models. The validation program suggests that TARA-3 is an efficient and reliable program for the nonlinear effective stress analysis of many important problems in geotechnical engineering for which 2-D plane strain representation is adequate.
Applied Science, Faculty of
Civil Engineering, Department of
Graduate

APA, Harvard, Vancouver, ISO, and other styles

3

Becker, Basil, Holger Giese, Stefan Neumann, and System Analysis and Modeling Group. "Correct dynamic service-oriented architectures : modeling and compositional verification with dynamic collaborations." Universität Potsdam, 2009. http://opus.kobv.de/ubp/volltexte/2009/3047/.

Full text

Abstract:

Service-oriented modeling employs collaborations to capture the coordination of multiple roles in form of service contracts. In case of dynamic collaborations the roles may join and leave the collaboration at runtime and therefore complex structural dynamics can result, which makes it very hard to ensure their correct and safe operation. We present in this paper our approach for modeling and verifying such dynamic collaborations. Modeling is supported using a well-defined subset of UML class diagrams, behavioral rules for the structural dynamics, and UML state machines for the role behavior. To be also able to verify the resulting service-oriented systems, we extended our former results for the automated verification of systems with structural dynamics [7, 8] and developed a compositional reasoning scheme, which enables the reuse of verification results. We outline our approach using the example of autonomous vehicles that use such dynamic collaborations via ad-hoc networking to coordinate and optimize their joint behavior.
Bei der Modellierung Service-orientierter Systeme werden Kollaborationen verwendet, um die Koordination mehrerer Rollen durch Service-Verträge zu beschreiben. Dynamische Kollaborationen erlauben ein Hinzufügen und Entfernen von Rollen zur Kollaboration zur Laufzeit, wodurch eine komplexe strukturelle Dynamik entstehen kann. Die automatische Analyse service-orientierter Systeme wird durch diese erheblich erschwert. In dieser Arbeit stellen wir einen Ansatz zur Modellierung und Verifikation solcher dynamischer Kollaborationen vor. Eine spezielle Untermenge der UML ermöglicht die Modellierung, wobei Klassendiagramme, Verhaltensregeln für die strukturelle Dynamik und UML Zustandsdiagramme für das Verhalten der Rollen verwendet werden. Um die Verifikation der so modellierten service-orientierten Systeme zu ermöglichen, erweiterten wir unsere früheren Ergebnisse zur Verifikation von Systemen mit struktureller Dynamik [7,8] und entwickelten einen kompositionalen Verifikationsansatz. Der entwickelte Verifikationsansatz erlaubt es Ergebnisse wiederzuverwenden. Die entwickelten Techniken werden anhand autonomer Fahrzeuge, die dynamische Kollaborationen über ad-hoc Netzwerke zur Koordination und Optimierung ihres gemeinsamen Verhaltens nutzen, exemplarisch vorgestellt.

APA, Harvard, Vancouver, ISO, and other styles

4

Woo, Yan, and 胡昕. "A dynamic integrity verification scheme for tamper-resistancesoftware." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2005. http://hub.hku.hk/bib/B34740478.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Liu, Ying. "The role of dynamic features in speaker verification." Thesis, University of Birmingham, 2010. http://etheses.bham.ac.uk//id/eprint/596/.

Full text

Abstract:

The thesis presents study to explore the role of dynamic features in speaker verification. Based on the theory that dynamic information should contain important speaker information, modelling the dynamics should have the potential to improve the speaker verification performance. Experiments on TD-SV using segmental hidden Markov models (SHMMs) on the YOHO database show performance improvement. However there is no significant improvement for TI-SV from experiments on the Switchboard database, using segmental GMMs. Analysis of the TD-SV results confirms that the speech dynamics modeled by SHMMs contribute more to the SV accuracy. Analysis of the TI-SV results indicates that the lack of speech dynamic information is a feature of GMM systems. It seems that the priority of the maximum likelihood training algorithm is to model stationary regions, and the role of dynamic features in GMM system, is to ensure that the classification focuses on static regions rather than to model dynamics. Study on TI-SV was carried out using conventional GMMs. Without RASTA filtering, the `delta-only' system works best. However, after RASTA filtering, the `static-plus-delta' system performs best. The results suggest that the good performance of the `delta-only' system before RASTA is mainly due to the noise robustness of the delta parameters.

APA, Harvard, Vancouver, ISO, and other styles

6

Reichl, John Vincent. "Inverter Dynamic Electro-Thermal Simulation with Experimental Verification." Thesis, Virginia Tech, 2005. http://hdl.handle.net/10919/36100.

Full text

Abstract:

A full electro-thermal simulation of a three-phase space-vector-modulated (SVM) inverter is performed and validated with measurements. Electrical parameters are extracted over temperature for the insulated gate bipolar transistor (IGBT) and diode electro-thermal models. A thermal network methodology that includes thermal coupling between devices is applied to a six-pack module package containing multiple IGBT and diode chips. The electro-thermal device models and six-pack module thermal model are used to simulate SVM inverter operation at several power levels. Good agreement between model and measurement is obtained for steady state operation of the three-phase inverter. In addition, transient heating of a single IGBT in the six-pack module is modeled and validated, yielding good agreement.
Master of Science

APA, Harvard, Vancouver, ISO, and other styles

7

Woo, Yan. "A dynamic integrity verification scheme for tamper-resistance software." Click to view the E-thesis via HKUTO, 2005. http://sunzi.lib.hku.hk/hkuto/record/B34740478.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Ibrahim, Alaa E. "Scenario-based verification and validation of dynamic UML specifications." Morgantown, W. Va. : [West Virginia University Libraries], 2001. http://etd.wvu.edu/templates/showETD.cfm?recnum=1799.

Full text

Abstract:

Thesis (M.S.)--West Virginia University, 2001.
Title from document title page. Document formatted into pages; contains x, 143 p. : ill. (some col.). Vita. Includes abstract. Includes bibliographical references (p. 96-99).

APA, Harvard, Vancouver, ISO, and other styles

9

Neykova, Rumyana. "Multiparty session types for dynamic verification of distributed systems." Thesis, Imperial College London, 2016. http://hdl.handle.net/10044/1/45276.

Full text

Abstract:

In large-scale distributed systems, each application is realised through interactions among distributed components. To guarantee safe communication (no deadlocks and communication mismatches) we need programming languages and tools that structure, manage, and policy-check these interactions. Multiparty session types (MPST), a typing discipline for structured interactions between communicating processes, offers a promising approach. To date, however, session types applications have been limited to static verification, which is not always feasible and is often restrictive in terms of programming API and specifying policies. This thesis investigates the design and implementation of a runtime verification framework, ensuring conformance between programs and specifications. Specifications are written in Scribble, a protocol description language formally founded on MPST. The central idea of the approach is a dynamic monitor, which takes a form of a communicating finite state machine, automatically generated from Scribble specifications, and a communication runtime stipulating a message format. We extend and apply Scribble-based runtime verification in manifold ways. First, we implement a Python library, facilitated with session primitives and verification runtime. We integrate the library in a large cyber-infrastructure project for oceanography. Second, we examine multiple communication patterns, which reveal and motivate two novel extensions, asynchronous interrupts for verification of exception handling behaviours, and time constraints for enforcement of realtime protocols. Third, we apply the verification framework to actor programming by augmenting an actor library in Python with protocol annotations. For both implementations, measurements show Scribble-based dynamic checking delivers minimal overhead and allows expressive specifications. Finally, we explore a static analysis of Scribble specifications as to efficiently compute a safe global state from which a monitored system of interacting processes can be recovered after a failure. We provide an implementation of a verification framework for recovery in Erlang. Benchmarks show our recovery strategy outperforms a built-in static recovery strategy, in Erlang, on a number of use cases.

APA, Harvard, Vancouver, ISO, and other styles

10

Cheng, Xueqi. "Exploring Hybrid Dynamic and Static Techniques for Software Verification." Diss., Virginia Tech, 2010. http://hdl.handle.net/10919/26216.

Full text

Abstract:

With the growing importance of software on which human lives increasingly depend, the correctness requirement of the underlying software becomes especially critical. However, the increasing complexities and sizes of modern software systems pose special challenges on the effectiveness as well as efficiency of software verification. Two major obstacles include the quality of test generation in terms of error detection in software testing and the state space explosion problem in software formal verification (model checking). In this dissertation, we investigate several hybrid techniques that explore dynamic (with program execution), static (without program execution) as well as the synergies of multiple approaches in software verification from the perspectives of testing and model checking. For software testing, a new simulation-based internal variable range coverage metric is proposed with the goal of enhancing the error detection capability of the generated test data when applied as the target metric. For software model checking, we utilize various dynamic analysis methods, such as data mining, swarm intelligence (ant colony optimization), to extract useful high-level information from program execution data. Despite being incomplete, dynamic program execution can still help to uncover important program structure features and variable correlations. The extracted knowledge, such as invariants in different forms, promising control flows, etc., is then used to facilitate code-level program abstraction (under-approximation/over-approximation), and/or state space partition, which in turn improve the performance of property verification. In order to validate the effectiveness of the proposed hybrid approaches, a wide range of experiments on academic and real-world programs were designed and conducted, with results compared against the original as well as the relevant verification methods. Experimental results demonstrated the effectiveness of our methods in improving the quality as well as performance of software verification. For software testing, the newly proposed coverage metric constructed based on dynamic program execution data is able to improve the quality of test cases generated in terms of mutation killing â a widely applied measurement for error detection. For software model checking, the proposed hybrid techniques greatly take advantage of the complementary benefits from both dynamic and static approaches: the lightweight dynamic techniques provide flexibility in extracting valuable high-level information that can be used to guide the scope and the direction of static reasoning process. It consequently results in significant performance improvement in software model checking. On the other hand, the static techniques guarantee the completeness of the verification results, compensating the weakness of dynamic methods.
Ph. D.

APA, Harvard, Vancouver, ISO, and other styles

11

Schwab, Stefan [Verfasser], and S. [Akademischer Betreuer] Hohmann. "Guaranteed Verification of Dynamic Systems / Stefan Schwab ; Betreuer: S. Hohmann." Karlsruhe : KIT-Bibliothek, 2019. http://d-nb.info/1192373464/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Park, Taeshin 1966. "Formal verification and dynamic validation of logic-based control systems." Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/50358.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Fang, Bin. "Techniques for formal modelling and verification on dynamic memory allocators." Thesis, Sorbonne Paris Cité, 2018. http://www.theses.fr/2018USPCC093/document.

Full text

Abstract:

Cette thèse est une contribution à la spécification et à la vérification formelles des allocateurs de mémoire dynamiques séquentiels (SDMA, en abrégé), qui sont des composants clés des systèmes d'exploitation ou de certaines bibliothèques logiciel. Les SDMA gèrent la partie tas de la mémoire des processus. Leurs implémentations utilisent à la fois des structures de données complexes et des opérations de bas niveau. Cette thèse se concentre sur les SDMA qui utilisent des structures de données de type liste pour gérer les blocs du tas disponibles pour l'allocation (SDMA à liste).La première partie de la thèse montre comment obtenir des spécifications formelles de SDMA à liste en utilisant une approche basée sur le raffinement. La thèse définit une hiérarchie de modèles classés par la relation de raffinement qui capture une grande variété de techniques et de politiques employées par le implémentations réelles de SDMA. Cette hiérarchie forme une théorie algorithmique pour les SDMA à liste et pourrait être étendue avec d'autres politiques. Les spécifications formelles sont écrites en Event-B et les raffinements ont été prouvés en utilisant la plateforme Rodin. La thèse étudie diverses applications des spécifications formelles obtenues: le test basé sur des modèles, la génération de code et la vérification.La deuxième partie de la thèse définit une technique de vérification basée sur l'interprétation abstraite. Cette technique peut inférer des invariants précis des implémentations existantes de SDMA. Pour cela, la thèse définit un domaine abstrait dont les valeurs representent des ensembles d'états du SDMA. Le domaine abstrait est basé sur un fragment de la logique de séparation, appelé SLMA. Ce fragment capture les propriétés liées à la forme et au contenu des structures de données utilisées par le SDMA pour gérer le tas. Le domaine abstrait est défini comme un produit spécifique d'un domaine abstrait pour graphes du tas avec un domaine abstrait pour des sequences finies d'adresses mémoire. Pour obtenir des valueurs abstraites compactes, la thèse propose une organisation hiérarchique des valeurs abstraites: un premier niveau abstrait la liste de tous les blocs mémoire, alors qu'un second niveau ne sélectionne que les blocs disponibles pour l’allocation. La thèse définit les transformateurs des valeurs abstraites qui capturent la sémantique des instructions utilisées dans les implémentations des SDMA. Un prototype d'implémentation de ce domaine abstrait a été utilisé pour analyser des implémentations simples de SDMA
The first part of the thesis demonstrates how to obtain formal specifications of free-list SDMA using a refinement-based approach. The thesis defines a hierarchy of models ranked by the refinement relation that capture a large variety of techniques and policies employed by real-work SDMA. This hierarchy forms an algorithm theory for the free-list SDMA and could be extended with other policies. The formal specifications are written in Event-B and the refinements have been proved using the Rodin platform. The thesis investigates applications of the formal specifications obtained, such as model-based testing, code generation and verification.The second part of the thesis defines a technique for inferring precise invariants of existing implementations of SDMA based abstract interpretation. For this, the thesis defines an abstract domain representing sets of states of the SDMA. The abstract domain is based on a fragment of Separation Logic, called SLMA. This fragment captures properties related with the shape and the content of data structures used by the SDMA to manage the heap. The abstract domain is defined as a specific product of an abstract domain for heap shapes with an abstract domain for finite arrays of locations. To obtain compact elements of this abstract domain, the thesis proposes an hierarchical organisation of the abstract values: a first level abstracts the list of all chunks while a second level selects only the chunks available for allocation. The thesis defines transformers of the abstract values that soundly capture the semantics of statements used in SDMA implementations. A prototype implementation of this abstract domain has been used to analyse simple implementations of SDMA

APA, Harvard, Vancouver, ISO, and other styles

14

Sekiyama, Taro. "An Integrated Theory of Type-Based Static and Dynamic Verification." 京都大学 (Kyoto University), 2016. http://hdl.handle.net/2433/215690.

Full text

Abstract:

© 2015 Springer. http://dx.doi.org/10.1007/978-3-319-26529-2_11© 2015 ACM, Inc. http://doi.acm.org/10.1145/2676726.2676996
Kyoto University (京都大学)
0048
新制・課程博士
博士(情報学)
甲第19863号
情博第614号
新制||情||107(附属図書館)
32899
京都大学大学院情報学研究科通信情報システム専攻
(主査)教授五十嵐淳, 教授山本章博, 教授岡部寿男
学位規則第4条第1項該当

APA, Harvard, Vancouver, ISO, and other styles

15

Saeed, Farrakh, and Muhammad Saeed. "Systematic Review of Verification and Validation in Dynamic Programming Languages." Thesis, Blekinge Tekniska Högskola, Avdelningen för programvarusystem, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-3239.

Full text

Abstract:

The Verification and Validation provides support to improve the quality of the software. Verification and Validation ensures that the product is stable and developed according to the requirements of the end user. This thesis presents a systematic review of dynamic programming languages and verification & validation practices used for dynamic languages. This thesis presents results found in dynamic programming languages and verification & validation over the period of 1985 – 2008. The study is aimed to start from identification of dynamic aspects along with the differences between static and dynamic languages. Furthermore, this thesis is also intends to give overview of the verification and validation practices for dynamic languages. Moreover to validate the verification and validation results, a survey consisting of (i) interviews and (ii) online survey is conducted. After the analysis of systematic review, it has been found that dynamic languages are making progress in some of the areas like integration of common development framework, language enhancement, dynamic aspects etc. The Dynamic languages are lacking in providing a better performance than static languages. There are also some factors found in this study that can raise the popularity of dynamic languages in the industry. Based on the analysis of systematic review, interviews and online survey, it is concluded that there is no difference between the methodologies available for Verification and Validation. It is also revealed that dynamic languages provide support to maintain software quality with their characteristics and dynamic features. Moreover, they also support to test softwares developed with static language. It is concluded that test driven development should be adopted while working with the dynamic languages. Test driven development is supposed to be a mandatory part of dynamic languages.
Farrakh Saeed +46765597558

APA, Harvard, Vancouver, ISO, and other styles

16

Dunbäck, Otto, and Simon Gidlöf. "Verification of hybrid operation points." Thesis, Department of Electrical Engineering, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-19932.

Full text

Abstract:

This thesis is an approach to improve a two-mode hybrid electric vehicle, which is currently under development by GM, with respect to fuel consumption. The study is not only restricted to the specific two-mode HEV but also presents results regarding parallel as well as serial HEV’s. GM whishes to verify if the online-based controller in the prototype vehicle utilizes the most of the HEV ability and if there is more potential to lower the fuel consumption. The purpose is that the results and conclusions from this work are to be implemented in the controller to further improve the vehicle’s performance. To analyze the behavior of the two-mode HEV and to see where improvements can be made, models of its driveline and components are developed with a focuson losses and efficiency. The models are implemented in MATLAB together with an optimization algorithm based on Dynamic Programming. The models are validated against data retrieved from the prototype vehicle and various cases with different inputs is set up and optimized over the NEDC cycle. Compensation for cold starts and NOx emissions are also implemented in the final model. Deliberate simplifications are made regarding the modeling of the power split’s functionality due to the limited amount of time available for this thesis. The optimizations show that there is potential to lower the fuel consumptionfor the two-mode HEV. The results are further analyzed and the behavior of the engine, motors/generators and battery are compared with recorded data from a prototype vehicle and summarized to a list of suggestions to improve fuel economy.

APA, Harvard, Vancouver, ISO, and other styles

17

Martinez-Flores, Rene. "DAMAGE ASSESSMENT POTENTIAL OF A NOVEL SYSTEM IDENTIFICATION TECHNIQUE - EXPERIMENTAL VERIFICATION." Diss., Tucson, Arizona : University of Arizona, 2005. http://etd.library.arizona.edu/etd/GetFileServlet?file=file:///data1/pdf/etd/azu%5Fetd%5F1028%5F1%5Fm.pdf&type=application/pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Qu, Tong. "Dynamic signature verification system design using stroke based feature extraction algorithm." Thesis, University of Ottawa (Canada), 2004. http://hdl.handle.net/10393/26747.

Full text

Abstract:

Dynamic signature verification (DSV) uses the behavioral biometrics of a handwritten signature to confirm the identity of a computer user. This thesis presents a novel stroke-based algorithm for DSV. After individual strokes are identified, a significant stroke is discriminated by the maximum correlation with respect to the reference signatures. Between each pair of signatures, the local correlation comparisons are computed between portions of the pressure and velocity signals using segment alignment by elastic matching. Experimental results were obtained for signatures from 25 volunteers over a four-month period. The result shows that when adding stroke-based features into a non-stroke feature system, the accuracy of the signature verification has been greatly improved to False Reject Rate (FRR) of 6.67% and False Accept Rate (FAR) of 13.33%. The result shows that stroke based features are important features, contain robust dynamic information, and offer greater accuracy for dynamic signature verification, in comparison to results without using non-stroke based features.

APA, Harvard, Vancouver, ISO, and other styles

19

Aoyama, Tadayoshi, Kosuke Sekiyama, Yasuhisa Hasegawa, and Toshio Fukuda. "Experimental verification of 3D bipedal walking based on Passive Dynamic Autonomous Control." IEEE, 2009. http://hdl.handle.net/2237/13931.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Cugati, Sharath A. "Dynamic modeling, control, and verification for citrus variable-rate technology (VRT) fertilization." [Gainesville, Fla.] : University of Florida, 2006. http://purl.fcla.edu/fcla/etd/UFE0013489.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Neal, Stephen. "A language for the dynamic verification of design patterns in distributed computing." Thesis, University of Kent, 2001. https://kar.kent.ac.uk/13532/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Weiß, Benjamin [Verfasser], and P. H. [Akademischer Betreuer] Schmitt. "Deductive verification of object-oriented software : dynamic frames, dynamic logic and predicate abstraction / Benjamin Weiß ; Betreuer: P. H. Schmitt." Karlsruhe : KIT Scientific Publishing, 2011. http://d-nb.info/1184496897/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Blume, Christoph [Verfasser]. "Graph Automata and Their Application to the Verification of Dynamic Systems / Christoph Blume." München : Verlag Dr. Hut, 2014. http://d-nb.info/1064559980/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Becker, Basil, and Holger Giese. "Cyber-physical systems with dynamic structure : towards modeling and verification of inductive invariants." Universität Potsdam, 2012. http://opus.kobv.de/ubp/volltexte/2012/6243/.

Full text

Abstract:

Cyber-physical systems achieve sophisticated system behavior exploring the tight interconnection of physical coupling present in classical engineering systems and information technology based coupling. A particular challenging case are systems where these cyber-physical systems are formed ad hoc according to the specific local topology, the available networking capabilities, and the goals and constraints of the subsystems captured by the information processing part. In this paper we present a formalism that permits to model the sketched class of cyber-physical systems. The ad hoc formation of tightly coupled subsystems of arbitrary size are specified using a UML-based graph transformation system approach. Differential equations are employed to define the resulting tightly coupled behavior. Together, both form hybrid graph transformation systems where the graph transformation rules define the discrete steps where the topology or modes may change, while the differential equations capture the continuous behavior in between such discrete changes. In addition, we demonstrate that automated analysis techniques known for timed graph transformation systems for inductive invariants can be extended to also cover the hybrid case for an expressive case of hybrid models where the formed tightly coupled subsystems are restricted to smaller local networks.
Cyber-physical Systeme erzielen ihr ausgefeiltes Systemverhalten durch die enge Verschränkung von physikalischer Kopplung, wie sie in Systemen der klassichen Igenieurs-Disziplinen vorkommt, und der Kopplung durch Informationstechnologie. Eine besondere Herausforderung stellen in diesem Zusammenhang Systeme dar, die durch die spontane Vernetzung einzelner Cyber-Physical-Systeme entsprechend der lokalen, topologischen Gegebenheiten, verfügbarer Netzwerkfähigkeiten und der Anforderungen und Beschränkungen der Teilsysteme, die durch den informationsverabeitenden Teil vorgegeben sind, entstehen. In diesem Bericht stellen wir einen Formalismus vor, der die Modellierung der eingangs skizzierten Systeme erlaubt. Ein auf UML aufbauender Graph-Transformations-Ansatz wird genutzt, um die spontane Bildung eng kooperierender Teilsysteme beliebiger Größe zu spezifizieren. Differentialgleichungen beschreiben das kombinierte Verhalten auf physikalischer Ebene. In Kombination ergeben diese beiden Formalismen hybride Graph-Transformations-Systeme, in denen die Graph-Transformationen diskrete Schritte und die Differentialgleichungen das kontinuierliche, physikalische Verhalten des Systems beschreiben. Zusätzlich, präsentieren wir die Erweiterung einer automatischen Analysetechnik zur Verifikation induktiver Invarianten, die bereits für zeitbehaftete Systeme bekannt ist, auf den ausdrucksstärkeren Fall der hybriden Modelle.

APA, Harvard, Vancouver, ISO, and other styles

25

Schamai, Wladimir. "Model-Based Verification of Dynamic System Behavior against Requirements : Method, Language, and Tool." Doctoral thesis, Linköpings universitet, Institutionen för datavetenskap, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-98107.

Full text

Abstract:

Modeling and simulation of complex systems is at the heart of any modern engineering activity. Engineers strive to predict the behavior of the system under development in order to get answers to particular questions long before physical prototypes or the actual system are built and can be tested in real life. An important question is whether a particular system design fulfills or violates requirements that are imposed on the system under development. When developing complex systems, such as spacecraft, aircraft, cars, power plants, or any subsystem of such a system, this question becomes hard to answer simply because the systems are too complex for engineers to be able to create mental models of them. Nowadays it is common to use computer-supported modeling languages to describe complex physical and cyber-physical systems. The situation is different when it comes to describing requirements. Requirements are typically written in natural language. Unfortunately, natural languages fail at being unambiguous, in terms of both syntax and semantics. Automated processing of naturallanguage requirements is a challenging task which still is too difficult to accomplish via computer for this approach to be of significant use in requirements engineering or verification. This dissertation proposes a new approach to design verification using simulation models that include formalized requirements. The main contributions are a new method that is supported by a new language and tool, along with case studies. The method enables verification of system dynamic behavior designs against requirements using simulation models. In particular, it shows how natural-language requirements and scenarios are formalized. Moreover, it presents a framework for automating the composition of simulation models that are used for design verification, evaluation of verification results, and sharing of new knowledge inferred in verification sessions. A new language called ModelicaML was developed to support the new method. It enables requirement formalization and integrates UML and Modelica. The language and the developed algorithms for automation are implemented in a prototype that is based on Eclipse Papyrus UML, Acceleo, and Xtext for modeling, and OpenModelica tools for simulation. The prototype is used to illustrate the applicability of the new method to examples from industry. The case studies presented start with sets of natural-language requirements and show how they are translated into models. Then, designs and verification scenarios are modeled, and simulation models are composed and simulated automatically. The simulation results produced are then used to draw conclusions on requirement violations; this knowledge is shared using semantic web technology. This approach supports the development and dynamic verification of cyber-physical systems, including both hardware and software components. ModelicaML facilitates a holistic view of the system by enabling engineers to model and verify multi-domain system behavior using mathematical models and state-of-the-art simulation capabilities. Using this approach, requirement inconsistencies, incorrectness, or infeasibilities, as well as design errors, can be detected and avoided early on in system development. The artifacts created can be reused for product verification in later development stages.

APA, Harvard, Vancouver, ISO, and other styles

26

Tyagi, Neha. "Resilient TDMA-based Communication Algorithm for Dynamic Ad-hoc Networks and Formal Verification." Thesis, California State University, Long Beach, 2018. http://pqdtopen.proquest.com/#viewpdf?dispub=10752255.

Full text

Abstract:

In recent years, within the broad context of mobile communication systems, a significant research has been evolved in the study of wireless ad-hoc networks. Due to the self-organizing nature of these networks, efficient delivery of data packets to the mobile nodes, where the topology is neither pre-determined nor does the network have central control, many problems arise in order to ensure a persistent communication. Packet loss in a multi-hop network is a major concern for ad-hoc distributed networks based systems. MAC layer contention is much more severe in multihop ad hoc networks as compared to wireless LANs. To mitigate this problem, we present a distributed, TDMA and slotted ALOHA protocol based communication approach for mobile robots in ad-hoc networks. Our work focuses on real time communication in a dynamic network where nodes can leave and join the network anytime. In this thesis, we propose an algorithm to establish self-sustaining communication among nodes. In our system processes become aware of their surrounding using slotted ALOHA protocol. Our system ensures self-stability by detecting lost messages and reset the system to ALOHA. Subsequently the system initiates the communication process again.

Our work shows that with combined ALOHA and TDMA protocol, a resilient and robust communication is achievable, where the packet loss is minimum. Our work also shows that self sustaining distributed communication is possible with minimum transitions to the different communication states, such as ALOHA to TDMA. This thesis demonstrates a successful communication process among mobile robotic nodes using our proposed algorithm. In this thesis, we also define the safety, liveness, and fairness properties using linear time logic (LTL) to verify the correctness of the proposed algorithm. We have defined these properties for our algorithm. We then verify the system for these properties under error prone conditions such as message loss, along with this we also make sure that our algorithm follows a fair approach of resource allocation and never end in an undesirable state. We have modeled our communication algorithm using SPIN model checker. SPIN is based on PROMELA language and provides an extensive user interface to define the model and verify the properties using Formal Methods of Verification.

APA, Harvard, Vancouver, ISO, and other styles

27

Kook, Kyung Soo Soo. "Dynamic Model Based Novel Findings in Power Systems Analysis and Frequency Measurement Verification." Diss., Virginia Tech, 2007. http://hdl.handle.net/10919/27761.

Full text

Abstract:

This study selects several new advanced topics in power systems, and verifies their usefulness using the simulation. In the study on ratio of the equivalent reactance and resistance of the bulk power systems, the simulation results give us the more correct value of X/R of the bulk power system, which can explain why the active power compensation is also important in voltage flicker mitigation. In the application study of the Energy Storage System(ESS) to the wind power, the new model implementation of the ESS connected to the wind power is proposed, and the control effect of ESS to the intermittency of the wind power is verified. Also this study conducts the intensive simulations for clarifying the behavior of the wide-area power system frequency as well as the possibility of the on-line instability detection. In our POWER IT Laboratory, since 2003, the U.S. national frequency monitoring network (FNET) has been being continuously operated to monitor the wide-area power system frequency in the U.S. Using the measured frequency data, the event of the power system is triggered, and its location and scale are estimated. This study also looks for the possibility of using the simulation technologies to contribute the applications of FNET, finds similarity of the event detection orders between the frequency measurements and the simulations in the U.S. Eastern power grid, and develops the new methodology for estimating the event location based on the simulated N-1 contingencies using the frequency measurement. It has been pointed out that the simulation results can not represent the actual response of the power systems due to the inevitable limit of modeling power systems and different operating conditions of the systems at every second. However, in the circumstances that we need to test such an important infrastructure supplying the electric energy without taking any risk of it, the software based simulation will be the best solution to verify the new technologies in power system engineering and, for doing this, new models and better application of the simulation should be proposed. Conducting extensive simulation studies, this dissertation verified that the actual X/R ratio of the bulk power systems is much lower than what has been known as its typical value, showed the effectiveness of the ESS control to mitigate the intermittence of the wind power from the perspective of the power grid using the newly proposed simulation model of ESS connected to the wind power, and found many characteristics of the wide-area frequency wave propagation. Also the possibility of using the simulated responses of the power system for replacing the measured data could be confirmed and this is very promising to the future application of the simulation to the on-line analysis of the power systems based on the FNET measurements.
Ph. D.

APA, Harvard, Vancouver, ISO, and other styles

28

Kumeta, Masahiro. "Dynamic Regulation of Nuclear Architectures - Identification and Experimental Verification of Subcellular Scaffolding Proteins." 京都大学 (Kyoto University), 2010. http://hdl.handle.net/2433/120356.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Wessels, Tiaan. "Hidden Markov models for on-line signature verification." Thesis, Stellenbosch : Stellenbosch University, 2002. http://hdl.handle.net/10019.1/52876.

Full text

Abstract:

Thesis (MSc)--University of Stellenbosch, 2002.
ENGLISH ABSTRACT: The science of signature verification is concerned with identifying individuals by their handwritten signatures. It is assumed that the signature as such is a unique feature amongst individuals and the creation thereof requires a substantial amount of hidden information which makes it difficult for another individual to reproduce the signature. Modern technology has produced devices which are able to capture information about the signing process beyond what is visible to the naked eye. A dynamic signature verification system is concerned with utilizing not only visible, i.e. shape related information but also invisible, hidden dynamical characteristics of signatures. These signature characteristics need to be subjected to analysis and modelling in order to automate use of signatures as an identification metric. We investigate the applicability of hidden Markov models to the problem of modelling signature characteristics and test their ability to distinguish between authentic signatures and forgeries.
AFRIKAANSE OPSOMMING: Die wetenskap van handtekeningverifikasie is gemoeid met die identifisering van individue deur gebruik te maak van hulle persoonlike handtekening. Dit berus op die aanname dat 'n handtekening as sulks uniek is tot elke individu en die generering daarvan 'n genoeg mate van verskuilde inligting bevat om die duplisering daarvan moeilik te maak vir 'n ander individu. Moderne tegnologie het toestelle tevoorskyn gebring wat die opname van eienskappe van die handtekeningproses buite die bestek van visuele waarneming moontlik maak. Dinamiese handtekeningverifikasie is gemoeid met die gebruik nie alleen van die sigbare manefestering van 'n handtekening nie, maar ook van die verskuilde dinamiese inligting daarvan om dit sodoende 'n lewensvatbare tegniek vir die identifikasie van individue te maak. Hierdie sigbare en onsigbare eienskappe moet aan analise en modellering onderwerp word in die proses van outomatisering van persoonidentifikasie deur handtekeninge. Ons ondersoek die toepasbaarheid van verskuilde Markov-modelle tot die modelleringsprobleem van handtekeningkarakteristieke en toets die vermoë daarvan om te onderskei tussen egte en vervalste handtekeninge.

APA, Harvard, Vancouver, ISO, and other styles

30

Muraleedharan, Nair Jayakrishnan. "Signature Verification Model: A Long Term Memory Approach." Ohio University / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1427210243.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Lewis, Micah S. "Dynamic Dead Variable Analysis." Diss., CLICK HERE for online access, 2005. http://contentdm.lib.byu.edu/ETD/image/etd1000.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Mendoza, Cervantes Francisco [Verfasser]. "A Problem-Oriented Approach for Dynamic Verification of Heterogeneous Embedded Systems / Francisco Mendoza Cervantes." Karlsruhe : KIT Scientific Publishing, 2014. http://www.ksp.kit.edu.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Zhang, Fanjiong. "Design and Verification of SOPC FDP2009 and Research of Reconfigurable Applications." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-66724.

Full text

Abstract:

In recent years, reconfigurable devices are developing fast because of its flexibility and less development cost. But intrinsic shortcomings of reconfigurable devices, for example, high power, low speed, etc. induce difficulties in complex designs realizations. So people began to consider combination of ASIC (Application-Specific Integrated Circuit) and reconfigurable device on a single chip, which is SOPC (System on Programmable Chip). SOPC can not only decrease development risk and timing to market, but also be used in different applications, especially of products that keep varying, for example, communication and network products. Dynamically reconfiguration means reconfigurable device of the chip can be reconfigured repeatable, and performs different functions at different times. Compared with static reconfiguration, dynamic reconfiguration can use the reconfigurable device more thoroughly. It‟s a hot spot of research in the world, especially in reconfigurable computing. This paper mainly concludes my research work in reconfigurable SOPC in 3 major parts: hardware, software and application. The following works and innovations are completed: 1. SOPC hardware system architecture design and discussion. Helps to define the system architecture and design goals. The design of EBI controller which is used in the SOPC. The integration of the blocks in the system. 2. The building-up of the SOPC system-level verification and block-level verification environment. The set-up of the hardware-software co-simulation environment. The post-layout simulation and formal verification tasks. We propose an innovative automated regression system. The system helps to achieve the same simulation coverage (95%) and the total simulation time is reduced by approximately 30%. 3. SOPC software design, including the OS kernel porting, drivers design and application design. The design of the PowerPC initialization program and UART (Universal Asynchronous Receiver/Transmitter), reconfiguring communication driver programs. Writing the test-cases which are specialized for the system verification and hardware testing. 4. Being the co-designer of the novel bus macro based on the FDP reconfigurable logic core. And we realize the whole reconfigurable system based on this bus macro. 5. The reconfigurable application research based on Reconfigurable Logic Core. The reconfigurable image filter designed implemented on FDP300K Reconfigurable Logic Core device. Using self-design Reconfigurable Logic Core internal bus macro to implement the partial reconfigurable system. The test results showed that the reconfigurable filter has the feature of fast configuration speed and good output image quality.

APA, Harvard, Vancouver, ISO, and other styles

34

Singh, Gaurav. "Optimization and Verification Techniques for Hardware Synthesis from Concurrent Action-Oriented Specifications." Diss., Virginia Tech, 2008. http://hdl.handle.net/10919/28986.

Full text

Abstract:

This dissertation addresses the issues of high power consumption and verification associated with a novel hardware design methodology based on high-level synthesis using action-oriented specifications. High-level synthesis of hardware designs is the process of automatically converting high-level behavioral specifications of designs into their corresponding RTL (Register Transfer Level) descriptions. From a designer's perspective, writing high-level specifications of a design alleviates the burden of handling various scheduling and concurrency issues, which can be automatically handled by the high-level synthesis tool. In the recent past, EDA (Electronic Design Automation) industry has seen efforts by various vendors to make such synthesis process practical for generating efficient hardware designs. In most of these cases, the inputs to high-level synthesis tools are the control data-flow graphs (CDFGs) or hierarchical variants of those. These models sequentialize parts of the computation in the form of computation threads. In contrast, in the last couple of years, advances have been made in an alternative high-level hardware design methodology where the specifications are action-oriented rather than the composition of sequential threads. In this paradigm, a hardware design is described in terms of atomic actions and then synthesized into the RTL code. Action-oriented synthesis process inherently targets the reduction of area and latency of a hardware design. However, two important issues that have not been addressed adequately are (1) power optimizations during such synthesis and (2) verification of action-oriented specifications and synthesized power-minimized implementations of the designs. With the proliferation of power-hungry portable devices, ever shrinking geometries and increasing clock frequencies, power consumption of hardware designs has become a critical metric (besides area and latency) that should be taken into consideration while evaluating the viability and success of a synthesis process. In this work, we analyze the complexity of low-power problems associated with the action-oriented specification models, and propose algorithms and techniques for power optimization during the action-oriented synthesis process. Furthermore, verification of hardware designs generated from such models is required in order to verify the changes caused in their structures or behaviors as part of any used power minimization techniques. Verification of high-level action-oriented models is also important for ensuring the correctness of the designs early in the design cycle. In this work, we also propose various formal verification techniques that can be used for verifying desired correctness properties as well as behaviors of power-minimized action-oriented designs at high-level.
Ph. D.

APA, Harvard, Vancouver, ISO, and other styles

35

Amin, Majdi Talal. "Dynamic Modeling and Verification of an Energy-Efficient Greenhouse With an Aquaponic System Using TRNSYS." University of Dayton / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=dayton1450432214.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Doty, Austin. "Nonlinear Uncertainty Quantification, Sensitivity Analysis, and Uncertainty Propagation of a Dynamic Electrical Circuit." University of Dayton / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=dayton1355456642.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Cyriac, Aiswarya. "Verification of communicating recursive programs via split-width." Thesis, Cachan, Ecole normale supérieure, 2014. http://www.theses.fr/2014DENS0004/document.

Full text

Abstract:

Cette thèse développe des techniques à base d'automates pour la vérification formelle de systèmes physiquement distribués communiquant via des canaux fiables de tailles non bornées. Chaque machine peut exécuter localement plusieurs programmes récursifs (multi-threading). Un programme récursif peut également utiliser pour ses calculs locaux des structures de données non bornées, comme des files ou des piles. Ces systèmes, utilisés en pratique, sont si puissants que tous leurs problèmes de vérification deviennent indécidables. Nous introduisons et étudions un nouveau paramètre, appelé largeur de coupe (split-width), pour l'analyse de ces systèmes. Cette largeur de coupe est définie comme le nombre minimum de scissions nécessaires pour partitioner le graphe d'une exécution en parties sur lesquelles on pourra raisonner de manière indépendante. L'analyse est ainsi réalisée avec une approche diviser pour régner. Lorsqu'on se restreint à la classe des comportements ayant une largeur de coupe bornée par une constante, on obtient des procédures de décision optimales pour divers problèmes de vérification sur ces systèmes tels que l'accessibilité, l'inclusion, etc. ainsi que pour la satisfaisabilité et le model checking par rapport à divers formalismes comme la logique monadique du second ordre, la logique dynamique propositionnelle et des logiques temporelles. On montre aussi que les comportements d'un système ont une largeur de coupe bornée si et seulement si ils ont une largeur de clique bornée. Ainsi, grâce aux résultats de Courcelle sur les graphes de degré uniformément borné, la largeur de coupe est non seulement suffisante, mais aussi nécessaire pour obtenir la décidabilité du problème de satisfaisabilité d'une formule de la logique monadique du second ordre. Nous étudions ensuite l'existence de contrôleurs distribués génériques pour nos systèmes distribués. Nous proposons plusieurs contrôleurs, certains ayant un nombre fini d'états et d'autres étant déterministes, qui assurent que les comportements du système sont des graphes ayant une largeur de coupe bornée. Un système ainsi contrôlé de manière distribuée hérite des procédures de décision optimales pour les différents problèmes de vérification lorsque la largeur de coupe est bornée. Cette classe décidable de système généralise plusieurs sous-classes décidables étudiées précédemment
This thesis investigates automata-theoretic techniques for the verification of physically distributed machines communicating via unbounded reliable channels. Each of these machines may run several recursive programs (multi-threading). A recursive program may also use several unbounded stack and queue data-structures for its local-computation needs. Such real-world systems are so powerful that all verification problems become undecidable. We introduce and study a new parameter called split-width for the under-approximate analysis of such systems. Split-width is the minimum number of splits required in the behaviour graphs to obtain disjoint parts which can be reasoned about independently. Thus it provides a divide-and-conquer approach for their analysis. With the parameter split-width, we obtain optimal decision procedures for various verification problems on these systems like reachability, inclusion, etc. and also for satisfiability and model checking against various logical formalisms such as monadic second-order logic, propositional dynamic logic and temporal logics. It is shown that behaviours of a system have bounded split-width if and only if they have bounded clique-width. Thus, by Courcelle's results on uniformly bounded-degree graphs, split-width is not only sufficient but also necessary to get decidability for MSO satisfiability checking. We then study the feasibility of distributed controllers for our generic distributed systems. We propose several controllers, some finite state and some deterministic, which ensure that the behaviours of the system have bounded split-width. Such a distributedly controlled system yields decidability for the various verification problems by inheriting the optimal decision procedures for split-width. These also extend or complement many known decidable subclasses of systems studied previously

APA, Harvard, Vancouver, ISO, and other styles

38

Ulbrich, Mattias [Verfasser], and P. H. [Akademischer Betreuer] Schmitt. "Dynamic Logic for an Intermediate Language: Verification, Interaction and Refinement / Mattias Ulbrich. Betreuer: P. H. Schmitt." Karlsruhe : KIT-Bibliothek, 2013. http://d-nb.info/1052263569/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Mukumoto, Nobutaka. "Development of Four-dimensional Image-guided Radiotherapy: Accuracy Verification of Gimbal-based Dynamic Tumor-tracking Irradiation." Kyoto University, 2014. http://hdl.handle.net/2433/188651.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Livelli, Mark Andrew. "Providing flow parameters for approximate die design models and the improvement and verification of those models using CFD analysis /." Online version of thesis, 2010. http://hdl.handle.net/1850/12222.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Khasawneh, Mohammad Ali. "The Development and Verification of a New Accelerated Polishing Machine." University of Akron / OhioLINK, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=akron1214408821.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Sjöholm, Thomas. "The Needed Input Data for Accurate On-line Signature Verification : The relevance of pressure and pen inclination for on-line signature verification." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-177879.

Full text

Abstract:

Signatures have been used to authenticate documents and transactions for over 1500 years and are still being used today. In this project a method for verifying signatures written on a tablet has been developed and tested in order to test whether pressure information is vital for a well performing on-line signature verification systems. First a background study was conducted to learn about the state-of-the-art methods and what features several research systems used, then the method was developed. The method is a Dynamic Time Warp with 8 local features, 2 of them were pressure values or derived from pressure, and 1 global feature. The developed method was tested on SUSig visual corpus containing signatures from 94 persons. The Equal Error Rate (EER) when not using pressure was 5.39 % for random forgeries and 3.24 % for skilled forgeries. EER when using pressure was 5.19 % for random forgeries and 2.80 % for skilled forgeries. The background study concluded that pen inclination is not required for a well performing system. Considering the result of this project and the result of others, it seems that pressure information is not vital, but provide some valuable information that can be used to classify signatures more accurately.
Signaturer har blivit använda för att autentisera dokument och transaktioner i över 1500 år och används än idag. En metod för att testa signaturer skrivna på en digital platta har utvecklats för att testa huruvida tryckkänslighet och vinkeln på pennan är kritiskt för ett välpresterande on-line signature verification system. Först så genomfördes en bakgrundsstudie för att se hur andra moderna metoder gör och vad för features de använder för att sen utveckla metoden. Den använda metoden är en Dynamic Time Warp med 8 lokala features varav 2 är tyckkänslighet eller utvunna från tryckkänslighet samt en global feature. Metoden testades sedan på SUSig visual corpus som har signaturer från 94 personer. Equal Error Rate (EER) för de feature kombinationerna som inte använde tryckkänslighet blev 5.39 % för slumpmässiga signaturer och 3.24 % för förfalskningar. EER för kombinationer av features som innehåller tryckkänslighet blev 5.19 % för slumpmässiga signaturer och 2.80 % för förfalskningar. Givet resultatet av det här projektet samt andra projekt utforskade i bakgrundsstudien så verkar tryckkänslighet inte vara kritiskt men ger en del värdeful information för klassificera signaturer mer träffsäkert. Bakgrundsstudien gav att vinkeln på pennan inte var kritisk för att välpresterande system.

APA, Harvard, Vancouver, ISO, and other styles

43

Rein, Andre [Verfasser], Carsten [Akademischer Betreuer] Bormann, Carsten [Gutachter] Bormann, and Carsten [Gutachter] Rudolph. "DRIVE : Dynamic Runtime Integrity Verification and Evaluation / Andre Rein ; Gutachter: Carsten Bormann, Carsten Rudolph ; Betreuer: Carsten Bormann." Bremen : Staats- und Universitätsbibliothek Bremen, 2018. http://d-nb.info/1172879370/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

James, Jillian Melanie. "Development of a verification and validation framework for autonomous soft-docking of spacecraft with uncertain dynamic properties." Thesis, Massachusetts Institute of Technology, 2016. http://hdl.handle.net/1721.1/105561.

Full text

Abstract:

Thesis: S.M., Massachusetts Institute of Technology, Department of Aeronautics and Astronautics, 2016.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 125-128).
Although soft-docking in space has been demonstrated in the past, these missions have required detailed information about the target vehicle for success, and often relied on manual control during the final stages. Autonomous docking, however, shows the potential to greatly reduce operation costs while accomplishing complex scenarios. Unfortunately, unknown dynamics and changing parameters stress current attitude control systems for docking applications such as spacecraft servicing, debris capture, and space robotics operations. Adaptation for example may assist with vehicle control under such conditions, however requires careful validation. Since autonomous soft-docking has limited heritage when there are system uncertainties, risk reduction prior to operation becomes very important for mission success. In this thesis a verification and validation framework was developed for autonomous soft-docking of spacecraft under such uncertainties. The approach combines risk-management techniques, simulation, Monte Carlo analysis, diagnostic tools and experimentation in the micro-gravity environment of the International Space Station (ISS) to create a comprehensive risk-reduction strategy. Development methods are described to provide general guidelines for design of future soft-docking missions. Additionally, this thesis explores how such verification and validation methods may be used to assess how an adaptive controller can maintain attitude control authority when a spacecraft joins with an object with limited physical parameter information. The goal is to chart a path for controller validation via future spaceflight experimentation. The risk reduction framework and controller analyses and tests are based on working with the Synchronized Position Hold Engage Reorient Experimental Satellite (SPHERES) facility at MIT and on the ISS.
by Jillian Melanie James.
S.M.

APA, Harvard, Vancouver, ISO, and other styles

45

Cyriac, Aiswarya, and Aiswarya Cyriac. "Verification of communicating recursive programs via split-width." Phd thesis, École normale supérieure de Cachan - ENS Cachan, 2014. http://tel.archives-ouvertes.fr/tel-01015561.

Full text

Abstract:

This thesis investigates automata-theoretic techniques for the verification of physically distributed machines communicating via unbounded reliable channels. Each of these machines may run several recursive programs (multi-threading). A recursive program may also use several unbounded stack and queue data-structures for its local-computation needs. Such real-world systems are so powerful that all verification problems become undecidable. We introduce and study a new parameter called split-width for the under-approximate analysis of such systems. Split-width is the minimum number of splits required in the behaviour graphs to obtain disjoint parts which can be reasoned about independently. Thus it provides a divide-and-conquer approach for their analysis. With the parameter split-width, we obtain optimal decision procedures for various verification problems on these systems like reachability, inclusion, etc. and also for satisfiability and model checking against various logical formalisms such as monadic second-order logic, propositional dynamic logic and temporal logics. It is shown that behaviours of a system have bounded split-width if and only if they have bounded clique-width. Thus, by Courcelle's results on uniformly bounded-degree graphs, split-width is not only sufficient but also necessary to get decidability for MSO satisfiability checking. We then study the feasibility of distributed controllers for our generic distributed systems. We propose several controllers, some finite state and some deterministic, which ensure that the behaviours of the system have bounded split-width. Such a distributedly controlled system yields decidability for the various verification problems by inheriting the optimal decision procedures for split-width. These also extend or complement many known decidable subclasses of systems studied previously.

APA, Harvard, Vancouver, ISO, and other styles

46

Van, der Westhuizen Anriette. "The verification of seat effective amplitude transmissibility (SEAT) value as a reliable metric to evaluate dynamic seat comfort." Thesis, Stellenbosch : University of Stellenbosch, 2004. http://hdl.handle.net/10019.1/16453.

Full text

Abstract:

Thesis (MScIng)--University of Stellenbosch, 2004.
ENGLISH ABSTRACT: A rough road vibration stimulus was reconstructed on a shaker platform to assess the dynamic comfort of seven seats by six human subjects. The virtual seat method was combined with a paired comparison procedure to assess subjective dynamic seat comfort. The psychometric method of constants, 1-up-1-down Levitt procedure and a 2-up-1-down Levitt procedure were compared experimentally to find the most accurate and efficient paired comparison scheme. A two-track interleaved, 2-up-1-down Levitt procedure was used for the subjective dynamic seat comfort assessment. SEAT value is an objective metric and has been widely used to determine seat vibration isolation efficiency. There was an excellent correlation (R2 = 0.97) between the subjective ratings and estimated SEAT values on the seat top when the values are averaged over the six subjects. This study suggests that the SEAT values, estimated from averaged seat top transmissibility of six carefully selected subjects, could be used to select the best seat for a specific road vibration input.
AFRIKAANSE OPSOMMING: Ses persone het deelgeneem aan ‘n eksperiment, om die dinamiese ritgemak van sewe stoele te karakteriseer. ‘n Rowwe padvibrasie is vir die doel op ‘n skudplatform geherkonstrueer. Subjektiewe ritgemak is bepaal deur die virtuelestoel metode met ‘n gepaarde, vergelykingstoets te kombineer. Die psigometriese metode van konstantes, die 1-op-1-af Levitt procedure en die 2-op- 1-af Levitt procedure is vergelyk om die mees effektiewe en akkurate vergelykingstoets te vind. ‘n Tweebaan, vervlegde , 2-op-1-af Levitt prosedure het die beste resultate gelewer en is gekies vir die subjektiewe evaluasie van dinamiese ritgemak. SEAT-waarde is ‘n objektiewe maatstaf, wat gebruik word om te bepaal hoe effektief ‘n stoel die insittende van voertuigvibrasie isoleer. Daar was ‘n uitstekende korrelasie (R2 = 0.97) tussen subjektiewe dinamiese ritgemakevaluesies en SEAT-waardes in die vertikale rigting op die stoelkussing as die gemiddelde oor die ses persone bereken word. Uit die resultate van hierdie studie blyk dit dat SEAT-waardes, wat bereken is vanaf die gemiddelde sitplektransmissie van die ses persone, wat verteenwoordigend van die teikenbevolking is, gebruik kan word om die beste stoel vir ‘n spesifieke vibrasieinset te kies.

APA, Harvard, Vancouver, ISO, and other styles

47

Samant, Gajanan Balkrishna. "Verification of the "Energy Accumulation in Waves Travelling through a Checkerboard Dielectric Material Structure in Space-time" Using Spice Simulations." Digital WPI, 2009. https://digitalcommons.wpi.edu/etd-theses/1210.

Full text

Abstract:

"Recently, there has been some good interest in the field of Dynamic Materials, also referred to as Spatio-Temporal Composites. These materials have been theoretically attributed to show ability to switch their electromagnetic properties in time, as contrast to the spatial variations shown by regular materials of non-dynamic nature, existing naturally. Though there is no exhibition of dynamic material in nature yet, there are suggestions for its synthesis. This paper follows the idea of using standard lossless transmission line model approximating a material substance. Such a material though not truly homogeneous, could be made to vary its properties in time. The aim of this work is to test this idea for its functional efficiency in comparison to analytical results obtained from earlier works on the subject. We make use of Spice simulation for this. An important aspect of this work is to facilitate the dynamic operations in a static environment. Almost all the simulators available today like Spice, ADS, etc intrinsically provide no ability for parameter variations in time. Nonetheless, we make use of certain popular tricks to implement circuits imitating the dynamic circuit components we need. Such implementations are separately tested to demonstrate their success in providing us with the dynamic environment we desire. Finally, within the limitations of the computing capabilities, we could successfully show an agreement between the results obtained and the existing theory. "

APA, Harvard, Vancouver, ISO, and other styles

48

"Dynamic Assertion-Based Verification for SystemC." Thesis, 2011. http://hdl.handle.net/1911/70465.

Full text

Abstract:

SystemC has emerged as a de facto standard modeling language for hardware and embedded systems. However, the current standard does not provide support for temporal specifications. Specifically, SystemC lacks a mechanism for sampling the state of the model at different types of temporal resolutions, for observing the internal state of modules, and for integrating monitors efficiently into the model's execution. This work presents a novel framework for specifying and efficiently monitoring temporal assertions of SystemC models that removes these restrictions. This work introduces new specification language primitives that (1) expose the inner state of the SystemC kernel in a principled way, (2) allow for very fine control over the temporal resolution, and (3) allow sampling at arbitrary locations in the user code. An efficient modular monitoring framework presented here allows the integration of monitors into the execution of the model, while at the same time incurring low overhead and allowing for easy adoption. Instrumentation of the user code is automated using Aspect-Oriented Programming techniques, thereby allowing the integration of user-code-level sample points into the monitoring framework. While most related approaches optimize the size of the monitors, this work focuses on minimizing the runtime overhead of the monitors. Different encoding configurations are identified and evaluated empirically using monitors synthesized from a large benchmark of random and pattern temporal specifications. The framework and approaches described in this dissertation allow the adoption of assertion-based verification for SystemC models written using various levels of abstraction, from system level to register-transfer level. An advantage of this work is that many existing specification languages call be adopted to use the specification primitives described here, and the framework can easily be integrated into existing implementations of SystemC.

APA, Harvard, Vancouver, ISO, and other styles

49

Lin, You-Siang, and 林友祥. "CAST: Automatic and Dynamic Software Verification Tool." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/80729325448601596058.

Full text

Abstract:

碩士
國立交通大學
資訊科學與工程研究所
97
Software testing is an essential part of software engineering for ensuring software quality. Furthermore, automatically verifying properties in programs is a long-time goal in software testing. In recent years, combining concrete and symbolic execution (concolic testing) becomes a well-known approach for branch testing and many researches indicate that the approach can combine with universal checks to find bugs. In this paper, we present the CAST specification language which can describe various kinds of specification for checking security properties of C programs (from another point of view, we can take this as a hack attack to attain test cases close to exploit) based on concolic testing with universal checks. CAST, an automatic and dynamic software verification tool, is mainly composed of pattern matching, universal check and data flow analysis such that we can make universal checks more flexible and complex than that general concolic testing uses.

APA, Harvard, Vancouver, ISO, and other styles

50

Yang, Chung-tsuan, and 楊昌軒. "Dynamic Biometric Verification for Smart Card Owners." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/12313936079370405126.

Full text

Abstract:

碩士
國立中正大學
電機工程所
96
Smart cards integrated with biometrics are going to be used in widespread application and will gradually affect our daily lives. Unfortunately, traditional identification system has the security shortcoming, transmitting the biological features between the card reader and the biometric card. It enables to have the opportunity to obtain the registration biological features, then counterfeit identity, but the biological features do not look like the password to be possible to change at will, so will create the massive loss. This thesis proposed an identification method to verify the smart card owner. This method mainly obtains the dynamic user features by the reader end, which is card controlled, and authorizes characteristics on card. The system resists the replay attack.

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic 'Dynamic verification'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles