{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Cousot_MIT_2005_Course_03_4-1

# Cousot_MIT_2005_Course_03_4-1 - Abstract Program Invariance...

This preview shows pages 1–3. Sign up to view the full content.

« Abstract Program Invariance and Termination Proofs » Patrick Cousot École normale supérieure 45 rue d’Ulm, 75230 Paris cedex 05, France [email protected] www.di.ens.fr/ ~ cousot Course 16.399: “Abstract interpretation” — MIT — Tuesday, February 22, 2005 Course 16.399: “Abstract interpretation”, Tuesday, February 22, 2005 1 ľ P. Cousot , 2005 Undecidability Course 16.399: “Abstract interpretation”, Tuesday, February 22, 2005 2 ľ P. Cousot , 2005 The fundamental limitation: undecidability – In 1921, David Hilbert put forward the so-called Hilbert’s Program , calling for a formalization of all of mathe- matics in axiomatic form, together with a proof that this axiomatization of mathematics is consistent, to be carried out using only “finitary” methods. Kurt Gödel ’s incompleteness theorems [1] essentially show that Hilbert’s Program cannot be carried out. Reference [1] Gödel, K., “Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme, I”, Monatshefte für Mathematik und Physik , vol. 38 (1931), pp. 173–198. Course 16.399: “Abstract interpretation”, Tuesday, February 22, 2005 3 ľ P. Cousot , 2005 David Hilbert Kurt Gödel Course 16.399: “Abstract interpretation”, Tuesday, February 22, 2005 4 ľ P. Cousot , 2005

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Decision Problems – A decision problem is a computational problem where the answer is always YES/NO: solve_problem ( data ) 7!f YES, NO g – The complement : P of a decision problem P is one where all the YES and NO answers are exchanged. Course 16.399: “Abstract interpretation”, Tuesday, February 22, 2005 5 ľ P. Cousot , 2005 Decidability/Semidecidable/Undecidability A decision problem is: – “ Decidable ” if and only if there exists an algorithm to solve the problem in finite time; – “ Undecidable ” if and only if there exists no algorithm to solve the problem in finite time; – “ Semidecidable ” if and only if there exists an algorithm to solve the problem in finite time when the answer is YES but which may not terminate when the answer is NO ; Course 16.399: “Abstract interpretation”, Tuesday, February 22, 2005 6 ľ P. Cousot , 2005 The termination problem – “ Termination problem ”: given a sequential program and its input data, will execution of this program on these data ever terminate? – The complement is the “ Nontermination problem ”: given a sequential program and its input data, will execution of this program on these data never terminate? – Termination is undecidable (but semidecidable); – Nontermination is undecidable (and not semidecid- able). Course 16.399: “Abstract interpretation”, Tuesday, February 22, 2005 7 ľ P. Cousot , 2005 Interpretor – We let Ff be the text file (of type text ) containing the text of a program encoding a function f of type text -> bool ; – We let Fd be the text file (of type text ) containing the text encoding the data d – An interpreter I : text * text -> bool is a program which execution I(Ff, Fd) is the result f ( d ) of the evaluation of function f on the data d .
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern