Add to ORKGWe define a framework for automatic generation of loop invariants for a small language. The method proceeds by 1) translation to an intermediate language of parallel guarded assignments 2) pattern detection. The patterns are modular in the sense that they are independent of the loop they appear in. Some maximality results are also proved on some pattern invariants
Special issue on "Optimizing Compilers for Parallel Languages"International audienceWe explore the l...
Invariants are a standard concept for reasoning about unbounded loops since Floyd-Hoare logic in the...
The paper extends the framework of linear loop transformations adding a new nonlinear step at the tr...
National audienceThis is a companion paper of "Maximal and Compositional Pattern-Based Loop Invarian...
International audienceBy combining algorithmic learning, decision procedures, predicate abstraction,...
(eng) In this paper, we survey loop parallelization algorithms, analyzing the dependence representat...
Any non-trivial program contains loop control structures such as while, for and do statements. A for...
In this paper, we survey loop parallelization algorithms, analyzing the dependence representations t...
Abstract. Most of the properties established during program verification are either invariants or de...
A pattern is a string of constant symbols and variables. The language defined by a pattern p is the...
A general framework is presented for automatig the discovery of loop invariants for imperative progr...
In this paper we study recognition of topological invariant properties of patterns by use of finite,...
The automatic detection of parallel loops is a well-known problem. Sophisticated polynomial algorith...
An important problem in automatic parallelization of scientific programs is to generate loops from a...
We present a framework for automating the discovery of loop invariants based upon failed proof atte...
Special issue on "Optimizing Compilers for Parallel Languages"International audienceWe explore the l...
Invariants are a standard concept for reasoning about unbounded loops since Floyd-Hoare logic in the...
The paper extends the framework of linear loop transformations adding a new nonlinear step at the tr...
National audienceThis is a companion paper of "Maximal and Compositional Pattern-Based Loop Invarian...
International audienceBy combining algorithmic learning, decision procedures, predicate abstraction,...
(eng) In this paper, we survey loop parallelization algorithms, analyzing the dependence representat...
Any non-trivial program contains loop control structures such as while, for and do statements. A for...
In this paper, we survey loop parallelization algorithms, analyzing the dependence representations t...
Abstract. Most of the properties established during program verification are either invariants or de...
A pattern is a string of constant symbols and variables. The language defined by a pattern p is the...
A general framework is presented for automatig the discovery of loop invariants for imperative progr...
In this paper we study recognition of topological invariant properties of patterns by use of finite,...
The automatic detection of parallel loops is a well-known problem. Sophisticated polynomial algorith...
An important problem in automatic parallelization of scientific programs is to generate loops from a...
We present a framework for automating the discovery of loop invariants based upon failed proof atte...
Special issue on "Optimizing Compilers for Parallel Languages"International audienceWe explore the l...
Invariants are a standard concept for reasoning about unbounded loops since Floyd-Hoare logic in the...
The paper extends the framework of linear loop transformations adding a new nonlinear step at the tr...