Lecture

Challenges in Bit-Precise Reasoning

Description

This lecture by the instructor from Johannes Kepler University, Linz, Austria, at FMCAD 2014 discusses challenges in bit-precise reasoning, including SMT-COMP results, AIG, bit-blasting, Tseitin transformation, Boolector architecture, and complexity classes. It covers topics like bit-wise operators, shifting, dual propagation, and model checking.

Official source

https://mediaspace.epfl.ch/media/0_bwwlwqrf

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.

Ontological neighbourhood

Theoretical computer science

Programming language theory: High-level programming languages

Theory of computation: Computational complexity theory

Logic

Classical logic: First-order logic

Related lectures (31)

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.