Zobrazeno 1 - 10
of 10
pro vyhledávání: '"formell verifiering"'
Autor:
Smyrnioudis, Nikolaos
The most performant Machine Learning (ML) classifiers have been labeled black-boxes due to the complexity of their decision process. eXplainable Artificial Intelligence (XAI) methods aim to alleviate this issue by crafting an interpretable explanatio
Externí odkaz:
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-337740
Autor:
Söderberg, Oskar
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
Externí odkaz:
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-337373
Autor:
Manjikian, Hovig
This work investigates possible improvements to an existing annotation inference tool. The tool is part of a toolchain that aims to automate the process of software verification using formal methods. The purpose of the annotations is to facilitate th
Externí odkaz:
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-337369
Autor:
Haglund, Jonas
In many contexts, computers run both critical and untrusted software,necessitating the need for isolating critical software from untrusted software.These computers contain CPUs, memory and peripherals. For performance reasons,some of these peripheral
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______260::8e51e5ef0b30bcf458da21f89c55b512
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-327312
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-327312
Autor:
Lindner, Andreas
With the increasing ubiquity of computing devices, their correct and secure operation is of growing importance. In particular, critical components that provide core functionalities or process sensitive data have to operate as intended. Examples are o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______260::8c0df32db5f20444afdc78a35d78e924
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-326719
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-326719
Autor:
Prabhakar, Gautham
Application Specific Integrated Circuits (ASIC) and Field Programmable Gate Arrays (FPGA) verification is quite a time consuming phase in design flow cycle and it can be done using methodologies such as Universal Verification Methodology (UVM) and fo
Externí odkaz:
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-322836
Autor:
Westerberg, Adrian
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-
Externí odkaz:
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-304168
Autor:
Westerberg, Adrian
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-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::66048a9f487a7aeb9b08fcca2febfbb1
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-304168
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-304168
Formal analysis of security protocols is becoming increasingly relevant. In formal analysis, a model is created of a protocol or system, and propositions about the security of the model are written. A program is then used to verify that the propositi
Externí odkaz:
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-281753
Formal analysis of security protocols is becoming increasingly relevant. In formal analysis, a model is created of a protocol or system, and propositions about the security of the model are written. A program is then used to verify that the propositi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::af7cad6aea3cb2fec3a2891cd7655ed0
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-281753
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-281753