Please post - apologies for multiple copies.]
Third and Last Call for Papers, Deadline Extension
W I N G 2010
3nd International Workshop on INvariant Generation
July 21, 2010
University of Edinburgh, UK
Satellite Workshop of FLoC 2010
Paper submission deadline is extended to March 19, 2010.
The ability to extract and synthesize auxiliary properties
of programs has had a profound effect on program analysis,
testing and verification over the last several decades.
The field of invariant generation draws on a multitude of
techniques ranging from computer algebra, theorem proving,
constraint solving, abstract interpretation techniques
Likewise, the application areas are diversified from
bootstrapping static program analysis tools,
to test-case generation and into aiding the quest
for verified software. So invariants are a key ingredient
in program analysis and understanding.
Yet, invariant generation poses as many challenges as promises:
A key impediment for program verification
is the overhead associated with providing, debugging,
and verifying auxiliary invariant annotations.
As the design and implementation of reliable software remains
an important issue, any progress in this area will be of utmost
importance for future developments in verified software. In the
context of static analysis and test-case generation, suitable
invariants have the potential of enabling sophisticated
automatic program analysis and high-coverage test-case
Several modern techniques for program termination and
expected program execution time also rely heavily on
suitable invariants (as relations) for the termination analysis.
Automated discovery of inductive assertions is therefore
one of the ultimate challenges for verification of safety and
security properties of programs.
The increasing power of automated theorem proving and
computer algebra has opened new perspectives for computer
aided program verification; in particular for the automatic
generation of inductive assertions in order to reason about
loops and recursion. Especially promising breakthroughs are
invariant generation techniques by Groebner bases,
quantifier elimination, and algorithmic combinatorics,
which can be used in conjunction with model checking,
theorem proving, static analysis and abstract interpretation.
This workshop aims to bring together researchers from
several fields of abstract interpretation, computational
logic and computer algebra to support reasoning about loops,
in particular, by using algorithmic combinatorics,
narrowing/widening techniques, static analysis,
polynomial algebra, quantifier elimination and model checking.
We encourage submissions presenting work in progress,
tools under development, as well as research of PhD students,
such that the workshop can become a forum for active dialog
between the groups involved in this new research area.
Relevant topics include (but are not limited to) the following:
- Program analysis and verification
- Inductive Assertion Generation
- Inductive Proofs for Reasoning about Loops
- Applications to Assertion Generation using the following tools:
- Abstract Interpretation,
- Static Analysis,
- Model Checking,
- Theorem Proving,