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

Help for CPHC-CONF Archives


CPHC-CONF Archives

CPHC-CONF Archives


cphc-conf@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

CPHC-CONF Home

CPHC-CONF Home

CPHC-CONF  May 2009

CPHC-CONF May 2009

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

Announcement of SCSS 2009

From:

Temur Kutsia <[log in to unmask]>

Reply-To:

Temur Kutsia <[log in to unmask]>

Date:

Wed, 27 May 2009 15:34:03 +0200

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (113 lines)

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

SCSS 2009
TUNISIA - JAPAN WORKSHOP ON
SYMBOLIC COMPUTATION IN SOFTWARE SCIENCE
September 22-24, 2009
Gammarth, Tunisia
http://www2.score.cs.tsukuba.ac.jp/scssWorkshop/index.html

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%


IMPORTANT DATES
===============
Abstract submission: May 29, 2009
Acceptance notification: June 22, 2009
Final versions of full papers: August 30, 2009
Workshop: September 22-24, 2009

SCOPE
=====
Symbolic computation is the science of computing with symbolic objects
(terms, formulae, programs, algebraic objects, geometrical objects, etc).
Powerful symbolic algorithms have been developed during the past decades
like theorem proving techniques, software verification, model checking,
rewriting techniques, network security, Groebner bases, characteristic sets,
etc.

In this workshop, we solicit papers on algorithms and techniques of symbolic
computations and their applications in software science.
The topics of the workshop include:

   * theorem proving methods and techniques
   * algorithm (program) synthesis
   * algorithm (program) verification
   * formal methods for the analysis of network security
   * termination analysis of algorithms (programs)
   * complexity analysis of algorithms (programs)
   * extraction of specifications from algorithms (programs)
   * generation of inductive assertion for algorithm (programs)
   * algorithm (program) transformations
   * component-based programming
   * computational origami
   * query languages (in particular for XML documents)
   * semantic web
   * etc.

SCSS 2009 workshop is the second in the SCSS workshop series.
SCSS 2008 took place at the Research Institute for Symbolic Computation
(RISC), Hagenberg, Austria. The Workshop grew out of internal workshops that
bring together researchers from SCORE (Symbolic Computation Research Group,
University of Tsukuba, Japan), the Theorema Group at RISC (Research
Institute for Symbolic Computation, Johannes Kepler University, Linz -
Hagenberg, Austria), SSFG (Software Science Foundation Group, Kyoto
University, Japan) and Sup'Com (University of November 7th at Carthage,
Tunisia). SCSS is open for the international community and welcomes paper
submissions.

VENUE
=======
The workshop will be held at Ramada Hotel in Gammarth, Tunisia.
Gammarth is 20km north east of Tunis and 10km north of the archeological
site of Carthage. The legendary Phoenician princess Dido founded Carthage
and the city possessed economic, cultural, and military power in the
Mediterranean during Punic and Roman eras.

INVITED SPEAKERS
================
 * Henk Barendregt (Radboud University Nijmegen, Netherlands)
 * Dongming Wang (University Pierre et Marie Curie - CNRS, France)
 * Stephen Watt (University of Western Ontario, Canada)

PROGRAM CO-CHAIRS
=================
 * Adel Bouhoula (University of November 7th at Carthage, Tunisia)
 * Tetsuo Ida (University of Tsukuba, Japan)

PROGRAM COMMITTEE
=================

 * Tudor Jebelean (Johannes Kepler University Linz, Austria)
 * Temur Kutsia (Johannes Kepler University Linz, Austria)
 * Yasuhiko Minamide (University of Tsukuba, Japan)
 * Mohamed Mosbah (University of Bordeaux, France)
 * Michael Rusinowitch (INRIA Lorraine, France)
 * Masahiko Sato (Kyoto University, Japan)
 * Yahya Slimani (University El Manar Tunis, Tunisia)

LOCAL ORGANIZERS
================
 * Nizar Ben Neji (University of November 7th at Carthage, Tunisia)
 * Fadoua Ghourabi (University of Tsukuba, Japan)
 * Sourour Meharouech (University of November 7th at Carthage, Tunisia)

SUBMISSION
===========
Abstracts and papers or extended abstracts should be submitted using
EasyChair: http://www.easychair.org/conferences/?conf=scss2009

Papers or extended abstracts should be prepared in LaTeX, formatted
according to the EasyChair style (style files are available from
http://www.easychair.org/easychair.zip), and should not exceed
16 pages.

PUBLICATION
===========
Accepted papers will be available during the workshop as the proceedings of
SCSS 2009. We plan to have a special issue of the Journal of Symbolic
Computation on SCSS 2009. The final decision for organizing the special
issue will be made after the workshop.  The full version of selected papers
will be considered for the publication of the special issue subjected to the
normal peer review process of the Journal of Symbolic Computation.

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
July 2009
June 2009
May 2009
April 2009
March 2009
February 2009
January 2009
December 2008
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
2001
2000
1999
1998


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