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 “"Kleene Algebra"”.
-
Extensions of (Concurrent) Kleene Algebra
Radboud University, 24 oktober 2022
-
Extensions Of Kleene Algebra For Program Verification
Kleene algebra (KA) is an algebraic system that captures completely the laws of equivalence for regular expressions. It is also useful for reasoning about a multitude of computationally interesting structures. Of central interest in KA is a "star" operation that typically describes some kind of …
-
Two variants of Kleene Algebra and their applications
Kleene Algebra (KA) is an equational system celebrated for its decidability andcompleteness with respect to regular language equalities. Because of the desirable properties of Kleene Algebra, numerous extensions were developed to reason about network system [45, 48, 60], concurrent programs [38, …
-
Algebraic Verification of Probabilistic and Concurrent Systems
This thesis provides an algebraic modelling and verification of probabilistic concurrent systems in the style of Kleene algebra. Without concurrency, it is shown that the equational theory of continuous probabilistic Kleene algebra is complete with respect to an automata model under standard …
-
On the Modelling, Analysis, and Mitigation of Distributed Covert Channels
… this thesis proposes Communicating Concurrent Kleene Algebra (C²KA) which is an extension to the algebraic model of concurrent Kleene algebra (CKA) first presented by Hoare et al. C²KA is used to capture and study the behaviour of agents, and description logic is used to capture and study the …
-
GUARDED NETKAT: SOUNDNESS, PARTIAL-COMPLETENESS, DECIDABILITY
The equational theory of Kleene Algebra with Tests (KAT) provides an algebraic framework to manipulate uninterpreted programs along with a PSPACE-complete procedure for deciding program equivalence. One of the most successful applications of the KAT theory is found in NetKAT, which instantiates the …
-
TYPES OF ALGEBRAIC STRUCTURES IN PROOF ASSISTANT SYSTEMS
… the scope for our research to study types of algebraic structures in proof systems. From the result of the survey, we establish our focus to contribute to the Agda standard library. Universal algebra studies structures by abstracting out the specific definitions and properties of algebraic …
-
THEORETICAL AND PRACTICAL HIGH-ASSURANCE SOFTWARE TOOLS FOR QUANTUM APPLICATIONS
… of the programs. We connect non-idempotent Kleene algebra with quantum program semantics and propose an equivalence-proving system with algebraic expression derivation. Besides, deductive program verification can also be leveraged on quantum programs to ensure the semantics correctness. To …
-
Automata, Representations, And Proofs
… in our framework, we must first take an algebraic detour and show that the category of K-semimodules and K-linear maps is a monoidal category. We then define K-algebras as monoids in this category. We call the corresponding automata K-linear automata. These automata are related to, but …
-
Quantitative architecture styles
… the average operation cannot be expressed by the algebraic structure of commutative semirings. A structure that is able to express this operation is the one of product valuation monoids. For this, we introduce our second weighted logic which is a weighted propositional configuration logic over …
-
A (Co)algebraic Approach to Programming and Verifying Computer Networks
… third part, we introduce a general-purpose (co)algebraic framework for designing and reasoning about programming languages, and show that it permits an almost linear-time decision procedure for program equivalence. We hope that the framework will serve as a foundation for efficient verification …
-
Primitives for Match-Action in Theory and Practice
… expressivity. On the other hand, we describe an algebraic language for match-action called MatchKAT. Although closely related to NetKAT, it shows the same type of language-theoretic techniques can still be applied at match-action's lower abstraction level. In particular, we consider MatchKAT's …
-
Weighted computations: semantics and program logics
Esta tese debruça-se sobre computações pesadas ou, por outras palavras, programas e asserções sobre estes cuja execução ou avaliação tem alguma forma de peso associado. Por peso queremos dizer um valor que pode representar, por exemplo, uma incerteza na execução, ou uma quantidade de recursos …