Essays about: "formell analys"
Showing result 1 - 5 of 14 essays containing the words formell analys.
-
1. Practical Analysis of the Giskard Consensus Protoco
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Consensus protocols are the core of modern blockchain systems, such as the Bitcoin, Ethereum, and Algorand networks. Thanks to these protocols, participants in a blockchain network can reach consensus on which blocks to add to a blockchain, to have a consistent chain of blocks in the whole network. READ MORE
-
2. Grand Strategy Games and Economies : The Effect of Complexity on Gameplay
University essay from Uppsala universitet/Institutionen för speldesignAbstract : This bachelor’s thesis’s purpose was to determine how the complexity of economic systems invideo games affect the gameplay of said video games, Victoria II (Paradox Interactive AB,2010) and Civilization V (Take-Two Interactive Software, Inc, 2010). This was done by askingthe research question: “How does the complexity of economic systems in grand strategygames affect gameplay?“. READ MORE
-
3. Grönare vägslänter : en intervjustudie om hinder mot vegetationsbeklädnad
University essay from SLU/Dept. of Urban and Rural DevelopmentAbstract : Denna studie inom landskapsarkitektur undersöker och identifierar hinder mot vegetationsklädda vägslänter i praktiken. Vegetationsklädda slänter är något som efterfrågas för att gynna mål om hållbarhet men som det finns en problematik att i praktiken genomföra. READ MORE
-
4. From Relations to Simplicial Complexes: A Toolkit for the Topological Analysis of Networks
University essay from KTH/Matematik (Avd.)Abstract : We present a rigorous yet accessible introduction to structures on finite sets foundational for a formal study of complex networks. This includes a thorough treatment of binary relations, distance spaces, their properties and similarities. READ MORE
-
5. Proof-producing resolution of indirect jumps in the binary intermediate representation BIR
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : HolBA is a binary analysis library that can be used to formally verify binary programs using contracts. It is developed in the interactive theorem prover HOL4 to achieve a high degree of trust in verification, the result of verification is a machine-checked proof demonstrating its correctness. This thesis presents two proof-producing procedures. READ MORE