Sökning: "recursion"
Visar resultat 1 - 5 av 28 uppsatser innehållade ordet recursion.
1. Implementation of Dyson equation to accelerate convergence in RS-LMTO-ASA code
Master-uppsats, Uppsala universitet/MaterialteoriSammanfattning : First-principle calculations is a key ingredient for us to understand, improve and design new materials. Density functional theory (DFT) [1] has proven to be a very powerful tool and a number of different versions exist depending on the problem at hand. LÄS MER
2. Adding Basic Support for Function Pointers in TriCera
Kandidat-uppsats, Uppsala universitet/Institutionen för informationsteknologiSammanfattning : TriCera is a verification tool that encodes programs in a C-like language to a set of Constrained Horn Clauses. These clauses describe the program states that can be reached when the program is executed. A solver can then be used to check if the program is safe. LÄS MER
3. Functional Programming Languages and the JVM : Comparing Functional Language Compilation Techniques for the JVM
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : Because of its security, high availability, and automatic memory management, the JVM (Java Virtual Machine) is a desirable execution environment. However, since the JVM was originally made for Java, which is an objectoriented language, it is hard for languages with other paradigms to run on it. LÄS MER
4. Floating Thresholds – On the Idea of the Portal in Architecture
Uppsats för yrkesexamina på avancerad nivå, KTH/ArkitekturSammanfattning : This project investigates a specific concept within architecture: the portal. Divided into eight independent chapters, all possible to read as stand-alone parts, the thesis – a hybrid essay consisting of text, images, drawings and models – uses the portal as a springboard, or tool, for approaching existing theories on the invisible forces that shape the world and our built environment. LÄS MER
5. Automated Inference of ACSL Contracts for Programs with Heaps
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : Contract inference consists in automatically computing contracts that formally describe the behaviour of program functions. Contracts are used in deductive verification, which is a method for verifying whether a system behaves according to a provided specification. The Saida plugin in Frama-C is a contract inference tool for C code. LÄS MER