Sökning: "Peter Backeman"
Hittade 3 avhandlingar innehållade orden Peter Backeman.
1. New techniques for handling quantifiers in Boolean and first-order logic
Sammanfattning : The automation of reasoning has been an aim of research for a long time. Already in 17th century, the famous mathematician Leibniz invented a mechanical calculator capable of performing all four basic arithmetic operators. LÄS MER
2. Quantifiers and Theories : A Lazy Approach
Sammanfattning : In this thesis we study Automated Theorem Proving (ATP) as well as Satisfiability Modulo Theories (SMT) and present lazy strategies for improving reasoning within these areas. A lazy strategy works by simplifying a problem, and gradually refines the abstraction only when necessary. LÄS MER
3. Modeling and Formal Analysis of e-Health Systems
Sammanfattning : With the healthcare practice being increasingly dependent on digital processes and electronic communication, there is a need to support a variety of e-Health applications of different requirements, with respect to connectivity, low latency, and high reliability. The focus of this thesis is on providing formal assurance to systems supporting e-Health applications. LÄS MER