Lecture

Introduction to Quantifier Elimination for Presburger Arithmetic

In course
DEMO: pariatur excepteur
Nulla non ullamco minim dolore eu ad irure sunt non ea non fugiat non cupidatat. Aliqua irure ut consequat duis cillum esse ullamco ut nostrud aute eu dolor. Non sint mollit dolor ullamco ea ut ut in anim minim esse Lorem ipsum in. Esse dolor excepteur non cupidatat. Anim ut aliquip elit adipisicing tempor culpa cillum. Ut sit aliquip ut non velit qui velit eiusmod esse duis.
Login to see this section
Description

This lecture introduces the formal verification methodology for programs, focusing on expressing properties in logic, compiling them into logical formulas, and using automated theorem provers. It delves into Presburger arithmetic, a decidable theory with applications in program verification and automated reasoning.

Instructor
est excepteur sunt
Velit dolor non Lorem elit qui aute non enim est. Veniam non dolor nostrud deserunt labore ut laborum laborum labore consequat. Amet adipisicing laborum quis nisi sit.
Login to see this section
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related lectures (35)
Presburger Arithmetic and Quantifier Elimination
Covers Presburger arithmetic, quantifier elimination, and the transformation of formulas into disjunctive normal form.
Logical Formulas and Types: Understanding the Kerry Howard Isomorphism
Explores the Kerry Howard Isomorphism, translating logical propositions into types and terms, with a focus on proof by induction and exam preparation.
Concept of Proof in Mathematics
Delves into the concept of proof in mathematics, emphasizing the importance of evidence and logical reasoning.
Discrete Mathematics: Logic & Structures
Covers propositional logic, truth tables, and problem-solving strategies in discrete mathematics.
Numbers and Booleans
Introduces numbers and booleans in Python, covering numeric types, arithmetic operations, logical operations, and comparisons.
Show more

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.