Sökning: "proof construction"

Visar resultat 1 - 5 av 66 avhandlingar innehållade orden proof construction.

  1. 1. Predictability By Construction : Working the Architecture/Program Seam

    Författare :Kurt C. Wallnau; Ivica Crnkovic; Magnus Larsson; Hans Hansson; Clemens Szyperski; Mälardalens högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; software engineering; software architecture; software components; quality attributes; Software engineering; Programvaruteknik; Computer Science; datavetenskap;

    Sammanfattning : Contemporary software engineering practice overemphasizes the distinction of software design from software implementation, and designer (“software architect”) from implementor (“computer programmer”). In this contemporary meme, software architects are concerned with large-grained system structures, quality attributes that arise from these structures (security, availability, performance, etc. LÄS MER

  3. 2. Testing and Proving using Narrowing

    Författare :Fredrik Lindblad; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; program correctness; software testing; formal verification; proof construction; dependent types; type theory; narrowing; dependent types;

    Sammanfattning : In order to know if a program is correct a specification of its intended behaviour must be stated. The two main activities concerning program correctness are testing and verification. LÄS MER

  4. 3. Simple Modules over Lie Algebras

    Författare :Jonathan Nilsson; Volodymyr Mazorchuk; Erhard Neher; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Lie algebra; Representation; Simple module; Non-weight module; Classification; Construction; Mathematics; Matematik;

    Sammanfattning : Simple modules are the elemental components in representation theory for Lie algebras, and numerous mathematicians have worked on their construction and classification over the last century. This thesis consists of an introduction together with four research articles on the subject of simple Lie algebra modules. LÄS MER

  5. 4. Natural deduction for intuitionistic least and greatest fixedpoint logics : with an application to program construction

    Författare :Tarmo Uustalu; KTH; []
    Nyckelord :;

    Sammanfattning : This thesis discusses intuitionistic least and greatest fixedpoint logics, i.e., intuitionistic systems of logic with primitive predicate-valued operators on predicate transformers that send monotone predicate transformers to their least and greatest fixedpoints, predicates being quasiordered by inclusion. LÄS MER

  7. 5. Authentication in Quantum Key Distribution : Security Proof and Universal Hash Functions

    Författare :Aysajan Abidin; Jan-Åke Larsson; Viiveke Fåk; Robert Forchheimer; Joseph Merrill Renes; Linköpings universitet; []
    Nyckelord :;

    Sammanfattning : Quantum Key Distribution (QKD) is a secret key agreement technique that consists of two parts: quantum transmission and measurement on a quantum channel, and classical post-processing on a public communication channel. It enjoys provable unconditional security provided that the public communication channel is immutable. LÄS MER