JiscMail Logo
Email discussion lists for the UK Education and Research communities

Help for FMNET Archives


FMNET Archives

FMNET Archives


FMNET@JISCMAIL.AC.UK


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

FMNET Home

FMNET Home

FMNET  January 2012

FMNET January 2012

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

WING 2012: First Call for Papers

From:

Gudmund Grov <[log in to unmask]>

Reply-To:

Gudmund Grov <[log in to unmask]>

Date:

Mon, 30 Jan 2012 14:39:44 +0000

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (141 lines)

[Please post - apologies for multiple copies.]

----------------------------------------------------
WING 2012 - 4th International Workshop on INvariant Generation
         http://cs.nyu.edu/acsys/wing2012/
                June 30, 2012
   Manchester, UK (a satellite Workshop of IJCAR 2012)
----------------------------------------------------
        --- First Call for Papers ---

General
-------

The ability to automatically extract and synthesize auxiliary
properties of programs has had a profound effect on program analysis,
testing, and verification over the last several decades. A key
impediment for program verification is the overhead associated with
providing, debugging, and verifying auxiliary invariant
annotations. Releasing the software developer from this burden is
crucial for ensuring the practical relevance of program verification.
In the context of testing, suitable invariants have the potential of
enabling high-coverage test-case generation. Thus, invariant
generation is a key ingredient in a broad spectrum of tools that help
to improve program reliability and understanding. As the design and
implementation of reliable software remains an important issue, any
progress in this area will have a significant impact.

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. The aim of this workshop is to
bring together researchers from these diverse fields.


Scope
-----

We encourage submissions presenting work in progress, tools under
development, as well as work by PhD students, such that the
workshop can become a forum for active dialogue 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,
- Theory Formation,
- Algebraic Techniques
* Tools for inductive assertion generation and verification
* Alternative techniques for reasoning about loops


Committee
-----------------

Program Chairs:

* Gudmund Grov (University of Edinburgh, UK)
* Thomas Wies (New York University, USA)

Program Committee:

* Clark Barrett (New York University, USA) 
* Nikolaj Bjorner (Microsoft Research, USA)
* Gudmund Grov (University of Edinburgh, UK)
* Ashutosh Gupta (IST Austria)
* Bart Jacobs (Katholieke Universiteit Leuven, Belgium) 
* Moa Johansson (Chalmers University of Technology, Sweden)
* Laura Kovacs (Vienna University of Technology, Austria)
* David Monniaux (VERIMAG, France)
* Enric Rodriguez Carbonell (Technical University of Catalonia, Spain) 
* Helmut Veith (Vienna University of Technology, Austria)
* Thomas Wies (New York University, USA)


Important Dates
---------------

Submission deadline: April 06, 2012
Notification of acceptance: May 04, 2012
Final version due: June 08, 2012
Workshop: June 30, 2012


Submission
----------

WING 2012 encourages submissions in the following two categories:

* Original papers: contain original research (simultaneous submissions
are not allowed) and sufficient detail to assess the merits and
relevance of the submission. Given the informal style of the
workshop, papers describing work in progress, with sufficient detail
to assess the contribution, are also welcome. Original papers should
not exceed 15 pages. 

* Extended abstracts: contain preliminary reports of work in progress,
case studies, or tool descriptions. These will be judged based on
the expected level of interest for the WING community. They will be
included in the CEUR-WS proceedings. Extended abstracts should not
exceed 5 pages. 

All submissions should conform to Springer's LNCS format. Formatting style 
files can be found at 

 http://www.springer.de/comp/lncs/authors.html 

Technical details may be included in an appendix to be read at the reviewers' 
discretion and to be omitted in the final version.

Please prepare your submission in accordance with the rules described above and 
submit a pdf file via

 https://www.easychair.org/?conf=wing2012


Publication
-----------

All submissions will be peer-reviewed by the program committee.
Accepted contributions will be published in archived electronic notes,
as a volume of CEUR Workshop Proceedings.

A special issue of the Journal of Science of Computer Programming with
extended versions of selected papers will be published after the workshop.


-- 
The University of Edinburgh is a charitable body, registered in
Scotland, with registration number SC005336.

Top of Message | Previous Page | Permalink

JiscMail Tools


RSS Feeds and Sharing


Advanced Options


Archives

April 2024
March 2024
February 2024
January 2024
December 2023
November 2023
October 2023
September 2023
August 2023
July 2023
June 2023
May 2023
April 2023
March 2023
February 2023
January 2023
December 2022
November 2022
October 2022
September 2022
August 2022
July 2022
June 2022
May 2022
April 2022
March 2022
February 2022
January 2022
December 2021
November 2021
October 2021
September 2021
August 2021
July 2021
June 2021
May 2021
April 2021
March 2021
February 2021
January 2021
December 2020
November 2020
October 2020
September 2020
August 2020
July 2020
June 2020
May 2020
April 2020
March 2020
February 2020
January 2020
December 2019
November 2019
October 2019
September 2019
August 2019
July 2019
June 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
November 2018
October 2018
September 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
February 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
July 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
October 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
October 2013
September 2013
August 2013
July 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
June 2009
May 2009
April 2009
March 2009
February 2009
November 2008
October 2008
September 2008
August 2008
July 2008
June 2008
May 2008
April 2008
March 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
February 2007
January 2007
2006
2005
2004
2003
2002


JiscMail is a Jisc service.

View our service policies at https://www.jiscmail.ac.uk/policyandsecurity/ and Jisc's privacy policy at https://www.jisc.ac.uk/website/privacy-notice

For help and support help@jisc.ac.uk

Secured by F-Secure Anti-Virus CataList Email List Search Powered by the LISTSERV Email List Manager