Proving Termination of Imperative Programs using Max-SMT Daniel - PowerPoint PPT Presentation

Introduction SMT/Max-SMT solving Invariant generation Termination analysis Further work Proving Termination of Imperative Programs using Max-SMT Daniel Larraz, Albert Oliveras, Enric Rodr´ ıguez-Carbonell and Albert Rubio Universitat Polit` ecnica de Catalunya FMCAD, October 2013 1 Larraz,Oliveras,Rodr´ ıguez-Carbonell,Rubio, UPC FMCAD’13 Proving Termination of Imperative Programs Using Max-SMT

Introduction SMT/Max-SMT solving Invariant generation Termination analysis Further work Outline 1 Introduction 2 SMT/Max-SMT solving 3 Invariant generation 4 Termination analysis 5 Further work 2 Larraz,Oliveras,Rodr´ ıguez-Carbonell,Rubio, UPC FMCAD’13 Proving Termination of Imperative Programs Using Max-SMT

Introduction SMT/Max-SMT solving Invariant generation Termination analysis Further work Motivation • Prove termination of imperative programs automatically. • Find ranking functions. • Find supporting invariants. • How to guide the search!. 4 Larraz,Oliveras,Rodr´ ıguez-Carbonell,Rubio, UPC FMCAD’13 Proving Termination of Imperative Programs Using Max-SMT

Introduction SMT/Max-SMT solving Invariant generation Termination analysis Further work Simple example void simpleT(int x, int y) { while (y>0) { while (x>0) { x=x-y; y=y+1; } y=y-1; } } 5 Larraz,Oliveras,Rodr´ ıguez-Carbonell,Rubio, UPC FMCAD’13 Proving Termination of Imperative Programs Using Max-SMT

Introduction SMT/Max-SMT solving Invariant generation Termination analysis Further work Simple example void simpleT(int x, int y) { while (y>0) { while (x>0) { x=x-y; y=y+1; } y=y-1; } } Terminates. 5 Larraz,Oliveras,Rodr´ ıguez-Carbonell,Rubio, UPC FMCAD’13 Proving Termination of Imperative Programs Using Max-SMT

Introduction SMT/Max-SMT solving Invariant generation Termination analysis Further work Simple example void simpleT(int x, int y) { while (y>0) { Ranking function: y // Inv: y>0 while (x>0) { Ranking function: x x=x-y; y=y+1; } y=y-1; } } Terminates. 5 Larraz,Oliveras,Rodr´ ıguez-Carbonell,Rubio, UPC FMCAD’13 Proving Termination of Imperative Programs Using Max-SMT

Introduction SMT/Max-SMT solving Invariant generation Termination analysis Further work Goals Main goal: fully-automatic program termination analysis. 6 Larraz,Oliveras,Rodr´ ıguez-Carbonell,Rubio, UPC FMCAD’13 Proving Termination of Imperative Programs Using Max-SMT

Introduction SMT/Max-SMT solving Invariant generation Termination analysis Further work Goals Main goal: fully-automatic program termination analysis. • Consider integer linear programs. • Use the constraint-based method [CSS2003, BMS2005]. 6 Larraz,Oliveras,Rodr´ ıguez-Carbonell,Rubio, UPC FMCAD’13 Proving Termination of Imperative Programs Using Max-SMT

Introduction SMT/Max-SMT solving Invariant generation Termination analysis Further work Goals Main goal: fully-automatic program termination analysis. • Consider integer linear programs. • Use the constraint-based method [CSS2003, BMS2005]. • Use an SMT solver to solve the constraints. 6 Larraz,Oliveras,Rodr´ ıguez-Carbonell,Rubio, UPC FMCAD’13 Proving Termination of Imperative Programs Using Max-SMT

Introduction SMT/Max-SMT solving Invariant generation Termination analysis Further work Goals Main goal: fully-automatic program termination analysis. • Consider integer linear programs. • Use the constraint-based method [CSS2003, BMS2005]. • Use an SMT solver to solve the constraints. • Use Max-SMT to guide the search • Invariant conditions are hard • Termination conditions are soft 6 Larraz,Oliveras,Rodr´ ıguez-Carbonell,Rubio, UPC FMCAD’13 Proving Termination of Imperative Programs Using Max-SMT

Introduction SMT/Max-SMT solving Invariant generation Termination analysis Further work SMT solving Input: Given a boolean formula ϕ over some theory T . Question: Is there any interpretation that satisfies the formula? Example: T = linear integer/real arithmetic. ( x < 0 ∨ x ≤ y ∨ y < z ) ∧ ( x ≥ 0) ∧ ( x > y ∨ y < z ) { x = 1 , y = 0 , z = 2 } 8 Larraz,Oliveras,Rodr´ ıguez-Carbonell,Rubio, UPC FMCAD’13 Proving Termination of Imperative Programs Using Max-SMT

Introduction SMT/Max-SMT solving Invariant generation Termination analysis Further work SMT solving Input: Given a boolean formula ϕ over some theory T . Question: Is there any interpretation that satisfies the formula? Example: T = linear integer/real arithmetic. ( x < 0 ∨ x ≤ y ∨ y < z ) ∧ ( x ≥ 0) ∧ ( x > y ∨ y < z ) { x = 1 , y = 0 , z = 2 } There exist very efficient solvers: yices, z3, Barcelogic, ... Can handle large formulas with a complex boolean structure. 8 Larraz,Oliveras,Rodr´ ıguez-Carbonell,Rubio, UPC FMCAD’13 Proving Termination of Imperative Programs Using Max-SMT

Introduction SMT/Max-SMT solving Invariant generation Termination analysis Further work SMT solving Input: Given a boolean formula ϕ over some theory T . Question: Is there any interpretation that satisfies the formula? Example: T = non-linear (polynomial) integer/real arithmetic. ( x 2 + y 2 > 2 ∨ x · z ≤ y ∨ y · z < z 2 ) ∧ ( x > y ∨ 0 < z ) { x = 0 , y = 1 , z = 1 } 8 Larraz,Oliveras,Rodr´ ıguez-Carbonell,Rubio, UPC FMCAD’13 Proving Termination of Imperative Programs Using Max-SMT

Introduction SMT/Max-SMT solving Invariant generation Termination analysis Further work SMT solving Input: Given a boolean formula ϕ over some theory T . Question: Is there any interpretation that satisfies the formula? Example: T = non-linear (polynomial) integer/real arithmetic. ( x 2 + y 2 > 2 ∨ x · z ≤ y ∨ y · z < z 2 ) ∧ ( x > y ∨ 0 < z ) { x = 0 , y = 1 , z = 1 } Non-linear arithmetic decidability: • Integers: undecidable • Reals: decidable but unpractical due to its complexity. 8 Larraz,Oliveras,Rodr´ ıguez-Carbonell,Rubio, UPC FMCAD’13 Proving Termination of Imperative Programs Using Max-SMT

Introduction SMT/Max-SMT solving Invariant generation Termination analysis Further work SMT solving Input: Given a boolean formula ϕ over some theory T . Question: Is there any interpretation that satisfies the formula? Example: T = non-linear (polynomial) integer/real arithmetic. ( x 2 + y 2 > 2 ∨ x · z ≤ y ∨ y · z < z 2 ) ∧ ( x > y ∨ 0 < z ) { x = 0 , y = 1 , z = 1 } Non-linear arithmetic decidability: • Integers: undecidable • Reals: decidable but unpractical due to its complexity. Incomplete solvers focused on either satisfiability or unsatisfiability. 8 Larraz,Oliveras,Rodr´ ıguez-Carbonell,Rubio, UPC FMCAD’13 Proving Termination of Imperative Programs Using Max-SMT

Introduction SMT/Max-SMT solving Invariant generation Termination analysis Further work SMT solving Input: Given a boolean formula ϕ over some theory T . Question: Is there any interpretation that satisfies the formula? Example: T = non-linear (polynomial) integer/real arithmetic. ( x 2 + y 2 > 2 ∨ x · z ≤ y ∨ y · z < z 2 ) ∧ ( x > y ∨ 0 < z ) { x = 0 , y = 1 , z = 1 } Non-linear arithmetic decidability: • Integers: undecidable • Reals: decidable but unpractical due to its complexity. Incomplete solvers focused on either satisfiability or unsatisfiability. Need to handle again large formulas with complex boolean structure. Barcelogic SMT-solver works very well finding solutions 8 Larraz,Oliveras,Rodr´ ıguez-Carbonell,Rubio, UPC FMCAD’13 Proving Termination of Imperative Programs Using Max-SMT

Proving Termination of Imperative Programs using Max-SMT Daniel - PowerPoint PPT Presentation

Introduction SMT/Max-SMT solving Invariant generation Termination analysis Further work Proving Termination of Imperative Programs using Max-SMT Daniel Larraz, Albert Oliveras, Enric Rodr guez-Carbonell and Albert Rubio Universitat

. Needs effective (finitary) representation .. Failed Termination Proof vs. Non- TNT:

Customised Induction Rules for Proving Correctness of Imperative Programs Angela Wallenburg

Proving Equivalence of Imperative Programs via Constrained Rewriting Induction Carsten Fuhs

On Proving Almost-Sure Termination Joost-Pieter Katoen Talk 2019 Meeting IFIP WG 2.2, Vienna

FITR304 - Software Validation Deductive methods for proving imperative programs Christophe Garion

Semantic Labelling for Proving Termination of Combinatory Reduction Systems Makoto Hamana

Better termination proving through cooperation Marc Brockschmidt 1 Byron Cook 2 , 3 Carsten Fuhs 3

Logic Programming 1 Logic Programming Instead of using functions as in imperative and

Proving Equivalence Between Imperative and MapReduce Implementations Using Program

Certification of proving termination of term rewriting by matrix interpretations Adam Koprowski

Verification of Imperative Programs through Transformation of Constraint Logic Programs Emanuele

Structural counter abstraction Proving fair-termination of depth bounded systems Kshitij Bansal 1

Proving termination using dependent types: the case of xor-terms J.-F. Monin J. Courant VERIMAG

Automatic Cyclic Termination Proofs for Recursive Procedures in Separation Logic Reuben Rowe and

Analysis using Configurable Software Verification Sebastian Ott Termination No infinite

The Dependency Pair Technique Proving Termination of Term Rewrite Systems Hannes Saffrich

Parallel dense linear algebra computations (1) Prof. Richard Vuduc Georgia Institute of

OpenSHMEM: Overview of Exercises MSc in HPC David Henty, Alan Simpson, Dominic Sloan-Murphy

ROSE-CIRM Detecting C-Style Errors in UPC Code Peter Pirkelbauer 1 Chunhua Liao 1 Ch h Li 1

Network-aware Service Placement in Community Network Clouds Mennan Selimi mselimi@ac.upc.edu

Limited Discrepancy AND/OR Search and its Application to Optimization Tasks in Graphical Models

A Comprehensive Scenario Agnostic Data LifeCycle Model for an Efficient Data Complexity

A C omparative S tudy of M odulo S cheduling T echniques Josep M. Codina, Josep Llosa and Antonio

Steven R. Seidel 1951-2014 Professional Background Ph.D 1979 University of Iowa