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 14 of 14 for “"rewriting logic"”.

  1. Security models in rewriting logic for cryptographic protocols and browsers

    This dissertation tackles crucial issues of web browser security. Web browsers are now a central part of the trusted code base of any end-user computer system, as more and more usage shifts to services provided by web sites that are accessed through those browsers. Towards this goal we identify …

    uiuc Repository record for Security models in rewriting logic for cryptographic protocols and browsers (opens in a new tab)

  2. A meta-language for functional verification

    … way over hardware description languages using rewriting logic, and subsequently a more richly featured software tool for Verilog designs, implemented as an embedded domain-specific language in Haskell, is described and used to demonstrate the novelty of the programming language and to conduct …

    uiuc Repository record for A meta-language for functional verification (opens in a new tab)

  3. A rewriting approach to concurrent programming language design and semantics

    … to define programming languages based on rewriting, which allows to easily design and test language extensions, and to specify and analyze safety and adequacy of program executions. To this aim, this dissertation describes the K framework, an executable semantic framework inspired from …

    uiuc Repository record for A rewriting approach to concurrent programming language design and semantics (opens in a new tab)

  4. Formal patterns for medical device safety

    … (i) we formally define them in the Maude rewriting logic framework; (ii) we show their correctness by rigorously proving the required properties based on their rewriting logic specification; and (iii) we also show practicality of each pattern with execution, model checking, and emulation.

    uiuc Repository record for Formal patterns for medical device safety (opens in a new tab)

  5. Rewriting-based formal modeling, analysis and implementation of real-time distributed services

    … for distributed software services, based on rewriting logic, the Maude system, and the theory of Orc, with the overall goal of improving the reliability of Internet software. The dissertation focuses on the formal specification and analysis of two fundamentally important aspects of Internet …

    uiuc Repository record for Rewriting-based formal modeling, analysis and implementation of real-time distributed services (opens in a new tab)

  6. A modular rewriting approach to language design, evolution and analysis

    … that takes advantage of the strengths of rewriting logic and term rewriting techniques. Although currently specific to K, parts of this module system are also aimed at other formalisms, with the goal of providing a reuse mechanism for different forms of modular semantics in the future. …

    uiuc Repository record for A modular rewriting approach to language design, evolution and analysis (opens in a new tab)

  7. Symbolic reachability analysis for rewrite theories

    … reasoning for reachability properties of rewriting logic specifications, a major research goal in the current state of the art. In particular, this work develops deductive techniques for reasoning symbolically about specifications with initial model semantics, including: (i) new …

    uiuc Repository record for Symbolic reachability analysis for rewrite theories (opens in a new tab)

  8. Rewriting-based model checking methods

    … be verified are typically expressed as temporal logic formulas, while the system itself is formally specified as a certain system specification language, such as computational logics and conventional programming languages. Rewriting logic is a highly expressive computational logic for effectively …

    uiuc Repository record for Rewriting-based model checking methods (opens in a new tab)

  9. Extending the language and applications of Maude-NPA through rewriting semantics

    … for verifying cryptographic protocols. Based on rewriting logic, Maude-NPA performs backward symbolic model checking on the unbounded session model, considering user defined signature and a wide range of equational theories. In this way, various properties, including secrecy, authentication and …

    uiuc Repository record for Extending the language and applications of Maude-NPA through rewriting semantics (opens in a new tab)

  10. Nelson Oppen combination as a rewrite theory

    … adapted for an order-sorted setting as a rewriting logic theory. We implement this algorithm in the Maude System and instantiate it with the theories of real and integer matrices to demonstrate its use in automated theorem proving, and with hereditarily finite sets with reals to show its …

    uiuc Repository record for Nelson Oppen combination as a rewrite theory (opens in a new tab)

  11. Rewriting-based symbolic methods for distributed system verification

    … system complexity increases, new methods and logics are needed to scale up to the complexity of practical systems without sacrificing logical precision and ease of specification. To that end, the goal of this research project is to develop rewriting-based symbolic analysis methods that (1) can …

    uiuc Repository record for Rewriting-based symbolic methods for distributed system verification (opens in a new tab)

  12. Learning based programming

    … and inference. It also features a First Order Logic inspired syntax for expressing constraints between independently trained classifiers. LBJ has already been used successfully in a variety of Natural Language Processing tasks. We evaluate LBJ with both a comprehensive questionnaire and case …

    uiuc Repository record for Learning based programming (opens in a new tab)

  13. A verification framework suitable for proving large language translations

    Previously, researchers established some frameworks, such as Morpheus, to specify a compiler translation in a small language and prove the semantic preservation property of the translation in the language under the assumption of sequential consistency. Based on the Morpheus specification language, …

    uiuc Repository record for A verification framework suitable for proving large language translations (opens in a new tab)

  14. Maude-PSL: a new input language for Maude-NPA

    DSpace SAF Submission Ingestion Package generated from Vireo submission #8115 on 2015-07-22 at 10:34:04

    uiuc Repository record for Maude-PSL: a new input language for Maude-NPA (opens in a new tab)