Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 24 for “"Formal methods (Computer science)"”.

  1. Learning symbolic abstractions from system execution traces

    <p>This dissertation shows that symbolic abstractions for a system can be inferred from a set of system execution traces using a combination of Boolean satisfiability and program synthesis. In addition, the degree of completeness of an inferred abstraction can be evaluated by employing equivalence …

    oxford Repository record for Learning symbolic abstractions from system execution traces (opens in a new tab)

  2. Abstractions and formal verification of max-plus linear systems

    … mentioned above are reachability analysis and formal verification, respectively assessing whether the dynamics of the underlying system eventually reaches a particular set and satisfies the intended specifications or requirements. The state-of-the-art approaches to tackle these problems employ …

    oxford Repository record for Abstractions and formal verification of max-plus linear systems (opens in a new tab)

  3. Liveness analysis, modeling, and simulation of blockchain consensus algorithms' ability to tolerate malicious miners

    … consensus algorithm design. This analysis uses formal methods and techniques and is applied to two exemplary consensus algorithms: lightweight mining (LWM) and byzantine fault-tolerant Raft (Tangaroa). Our analysis reveals the liveness of the given consensus algorithm and its ability to protect …

    utc Repository record for Liveness analysis, modeling, and simulation of blockchain consensus algorithms' ability to tolerate malicious miners (opens in a new tab)

  4. Exploiting replication in automated program verification

    … be successfully subject to exhaustive formal verification, provided the components can be classified into a few types. It therefore addresses an instance of the state explosion problem: a finite-state model of a system can be much larger than a high-level description of this system. …

    texas Repository record for Exploiting replication in automated program verification (opens in a new tab)

  5. Aggregation of a heterogeneous population of solar panels: verification and control

    … second part of this dissertation we introduce formal methods, a suite of techniques to model complex systems as mathematical entities and to outline tight requirements about such systems. In particular we rely on the formal abstraction technique, which translates a stochastic system into a …

    oxford Repository record for Aggregation of a heterogeneous population of solar panels: verification and control (opens in a new tab)

  6. Semantic model driven engineering

    … key contributions of this thesis are firstly a formal language for reasoning about se- mantic interoperability in terms of data models. In addition a formal grammar is provided on which metadata registries can be built guaranteeing consistency of models. A modelling language for metadata …

    oxford Repository record for Semantic model driven engineering (opens in a new tab)

  7. Automatic verification and strategy synthesis for zero-sum and equilibria properties of concurrent stochastic games

    … ranging from economics to biology. In computer science, where they also found a fertile soil, game-theoretic ideas and solutions have been used in AI, network protocols and verification, to name but a few. This thesis sets itself in that context by presenting a framework for verifying …

    oxford Repository record for Automatic verification and strategy synthesis for zero-sum and equilibria properties of concurrent stochastic games (opens in a new tab)

  8. Formal verification of dynamical models via neural synthesis

    … complex systems that are ubiquitous across science and engineering. Complexity and nonlinearity in these systems result in a lack of analytical solutions and challenging, or even intractable, analysis in view of safety-critical applications. Effective methodologies for the verification of …

    oxford Repository record for Formal verification of dynamical models via neural synthesis (opens in a new tab)

  9. Symbolic techniques for parameterised verification

    … is important because a wide range of real-world computer systems are parameterised in nature, and it is challenging because most relevant properties of parameterised systems are undecidable in general.</p> <p>In this thesis, we study automated verification approaches using automata-based symbolic …

    oxford Repository record for Symbolic techniques for parameterised verification (opens in a new tab)

  10. Combining advanced formal hardware verification techniques

    This dissertation combines formal verification techniques in an attempt to reduce the human effort required to verify large systems formally. One method to reduce the human effort required by formal verification is to modify general-purpose theorem proving techniques to increase the number of lemma …

    texas Repository record for Combining advanced formal hardware verification techniques (opens in a new tab)

  11. Efficient and effective symbolic model checking

    … model checking. We give a technique to scale formal verification to a large grid of processors that demonstrates marked superiority over existing approaches. The contributions of this dissertation are in improving the capacity of symbolic model checking approaches to formal verification, in …

    texas Repository record for Efficient and effective symbolic model checking (opens in a new tab)

  12. Generalization, lemma generation, and induction in ACL2

    Formal verification is becoming a critical tool for designing software and hardware today. Rising complexity, along with software's pervasiveness in the global economy have meant that errors are becoming more difficult to find and more costly to fix. Among the formal verification tools available …

    texas Repository record for Generalization, lemma generation, and induction in ACL2 (opens in a new tab)

  13. Safe and certified reinforcement learning with logical constraints

    … for this limitation is the lack of a systematic formal approach to specify requirements as tasks (or learning constraints), and to provide guarantees with respect to these requirements and constraints, during and after learning. This work addresses these issues by proposing a general method that …

    oxford Repository record for Safe and certified reinforcement learning with logical constraints (opens in a new tab)

  14. High level static analysis of system descriptions for taming verification complexity

    … time-consuming and resource intensive. Formal verification of system behavior is critical to the design cycle due to its ability to isolate subtle flaws and provide high quality assurance. However, its computational intractability limits applicability in practice, rendering the …

    texas Repository record for High level static analysis of system descriptions for taming verification complexity (opens in a new tab)

  15. Application of formal modelling to mitigate metadata driven privacy violation

    … approach to data ownership, together with formal models of data. access, to aid in the protection of data subjects’ privacy so as to mitigate inference-driven identity exposures from metadata collection?”<br><br>Thus, our contributions are as follows. First, we explicitly outline our …

    oxford Repository record for Application of formal modelling to mitigate metadata driven privacy violation (opens in a new tab)

  16. A formal refinement framework for the systems modeling language

    … engineering applications. At present, the semi-formal SysML, which is widely utilised for the design of complex heterogeneous systems, lacks integration with other more formal approaches. In this thesis, we describe how Communicating Sequential Processes (CSP) and its associated refinement …

    oxford Repository record for A formal refinement framework for the systems modeling language (opens in a new tab)

  17. Improving scalability of exploratory model checking

    … reliability, it becomes exceedingly important to formally verify certain properties of these systems. If done naïvely, verifying a system can easily require exponentially more work than running it, in order to account for all possible executions. However, there are often symmetries or other …

    oxford Repository record for Improving scalability of exploratory model checking (opens in a new tab)

  18. Towards formal verification of Bayesian inference in probabilistic programming via guaranteed bounds

    … scientific fields, from the social and medical sciences to physics and machine learning. In probabilistic programming, such models are specified as computer programs: a flexible yet precise representation that allows for automated analysis. Such probabilistic programs can express both randomized …

    oxford Repository record for Towards formal verification of Bayesian inference in probabilistic programming via guaranteed bounds (opens in a new tab)

  19. Semantic tableaux program

    … thereby proving or disproving a conclusion. Formal methods used in developing and verifying software and hardware are mathematically based techniques for describing and reasoning about system properties. Such formal methods provide frameworks within which people specify, develop, and verify …

    csusb Repository record for Semantic tableaux program (opens in a new tab)

  20. Semantic tableaux program

    … thereby proving or disproving a conclusion. Formal methods used in developing and verifying software and hardware are mathematically based techniques for describing and reasoning about system properties. Such formal methods provide frameworks within which people specify, develop, and verify …

    csusb-retro Repository record for Semantic tableaux program (opens in a new tab)

Page 1 of 2