Publication

Invariant generation for P-solvable loops with assignments

2008
Conference Papers

Abstract

We discuss interesting properties of a general technique for inferring polynomial invariants for a subfamily of imperative loops, called the P-solvable loops, with assignments only. The approach combines algorithmic combinatorics, polynomial algebra and computational logic, and it is implemented in a new software package called Aligator. We present a collection of examples illustrating the power of the framework.

Official source

Graph Chat

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.

Invariant generation for P-solvable loops with assignments

Chat with Graph Search

The multivariate Serre conjecture ring

Linear Complexity Self-Attention With 3rd Order Polynomials

Stable high-order randomized cubature formulae in arbitrary dimension