================================================================
BOB 2016
Conference
"What happens if we simply use what's best?"
February 19, 2016
Berlin
http://bobkonf.de/2016/
Program:
http://bobkonf.de/2016/program.html
Registration:
http://bobkonf.de/2016/registration.html
================================================================
BOB is the conference for developers, architects and decision-makers
to explore technologies beyond the mainstream in software development,
and to find the best tools available to software developers today.
Our goal is for all participants of BOB to return home with new
insights that enable them to improve their own software development
experiences.
The program features 14 talks and 8 tutorials on current topics:
http://bobkonf.de/2016/program.html
The subject range of talks includes functional programming, advanced
front-end development, data management, and sophisticated uses of
types.
The tutorials feature introductions to Erlang, Haskell, Scala,
Isabelle, Purescript, Idris, Akka HTTP, and Specification by Example.
Elise Huard will hold the keynote talk - about Languages We Love.
Registration is open online:
http://bobkonf.de/2016/registration.html
NOTE: The early-bird rates expire on January 17, 2016!
BOB cooperates with the :clojured conference on the following day.
There is a registration discount available for participants of both events.
http://www.clojured.de/
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
2015-12-10
[Caml-list] FLOPS 2016: Call for Participation and Posters/Demos
FLOPS 2016: 13th International Symposium on Functional and Logic Programming
March 4-6, 2016, Kochi, Japan http://www.info.kochi-tech.ac.jp/FLOPS2016/
Call for Participation and Posters/Demos
Registration will be open on Monday, Dec 21, 2015.
Early registration deadline is Monday, Feb 8, 2016.
Poster/Demo abstract submission deadline is Monday, Jan 11, 2016.
FLOPS aims to bring together practitioners, researchers and
implementers of the declarative programming, to discuss mutually
interesting results and common problems: theoretical advances, their
implementations in language systems and tools, and applications of
these systems in practice. The scope includes all aspects of the
design, semantics, theory, applications, implementations, and teaching
of declarative programming. FLOPS specifically aims to
promote cross-fertilization between theory and practice and among
different styles of declarative programming.
In addition to the presentations of regular research papers, the FLOPS
program includes tutorials, as well as the poster/demo session for
demonstrating the tools and systems described during the talks and for
presenting works-in-progress and getting the feedback.
FLOPS has established a Best Paper award. The winner will be
announced at the symposium.
CALLS FOR POSTERS AND DEMONSTRATIONS
If you wish to present a poster at FLOPS, please send the plain text
abstract by e-mail to <flops2016@easychair.org> -- by January 11, 2016.
The abstract should include the title, the names of the authors and
their affiliation, along with enough details to judge its scope and
relevance. We will announce the accepted submissions on January 25,
2016. The format of the poster will be announced at that time.
Important Dates
* Submission due: January 11, 2016 (Monday), any time zone
* Notification: January 25, 2016 (Monday)
INVITED TALKS
Kazunori UEDA (Waseda University)
The exciting time and hard-won lessons of the Fifth Generation
Computer Project
Atze Dijkstra (Utrecht University)
UHC: Coping with Compiler Complexity
TUTORIALS
Andreas Abel, on Agda
Atze Dijkstra, on Attribute Grammars
Neng-Fa Zhou, on programming in Picat
ACCEPTED PAPERS
Ki Yung Ahn and Andrea Vezzosi.
Executable Relational Specifications of Polymorphic Type Systems using Prolog
Markus Triska.
The Boolean Constraint Solver of SWI-Prolog: System Description
Peng Fu, Ekaterina Komendantskaya, Tom Schrijvers and Andrew Pond.
Proof Relevant Corecursive Resolution
Jay McCarthy, Burke Fetscher, Max New and Robert Bruce Findler.
A Coq Library For Internal Verification of Running-Times
Akimasa Morihata.
Incremental Computing with Abstract Data Structures
Wouter Swierstra and Joao Alpuim.
From proposition to program: embedding the refinement calculus in Coq
Andre Van Delft and Anatoliy Kmetyuk.
Declarative Programming with Algebra
Ian Mackie and Shinya Sato.
An interaction net encoding of Godel's System T
Arthur Blot, Pierre-Evariste Dagand and Julia Lawall.
From Sets to Bits in Coq
Jeremy Yallop, David Sheets and Anil Madhavapeddy.
Declarative foreign function binding through generic programming
Praveen Narayanan, Jacques Carette, Wren Romano,
Chung-Chieh Shan and Robert Zinkov.
Probabilistic inference by program transformation in Hakaru: System description
Francisco Javier Lopez-Fraguas, Manuel Montenegro and Juan Rodriguez-Hortala.
Polymorphic Types in Erlang Function Specifications
Remy Haemmerle, Pedro Lopez-Garcia, Umer Liqat, Maximiliano Klemen,
John Gallagher and Manuel V. Hermenegildo.
A Transformational Approach to Parametric Accumulated-cost Static Profiling
Taus Brock-Nannestad.
Space-efficient Planar Acyclicity Constraints: A Declarative Pearl
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
March 4-6, 2016, Kochi, Japan http://www.info.kochi-tech.ac.jp/FLOPS2016/
Call for Participation and Posters/Demos
Registration will be open on Monday, Dec 21, 2015.
Early registration deadline is Monday, Feb 8, 2016.
Poster/Demo abstract submission deadline is Monday, Jan 11, 2016.
FLOPS aims to bring together practitioners, researchers and
implementers of the declarative programming, to discuss mutually
interesting results and common problems: theoretical advances, their
implementations in language systems and tools, and applications of
these systems in practice. The scope includes all aspects of the
design, semantics, theory, applications, implementations, and teaching
of declarative programming. FLOPS specifically aims to
promote cross-fertilization between theory and practice and among
different styles of declarative programming.
In addition to the presentations of regular research papers, the FLOPS
program includes tutorials, as well as the poster/demo session for
demonstrating the tools and systems described during the talks and for
presenting works-in-progress and getting the feedback.
FLOPS has established a Best Paper award. The winner will be
announced at the symposium.
CALLS FOR POSTERS AND DEMONSTRATIONS
If you wish to present a poster at FLOPS, please send the plain text
abstract by e-mail to <flops2016@easychair.org> -- by January 11, 2016.
The abstract should include the title, the names of the authors and
their affiliation, along with enough details to judge its scope and
relevance. We will announce the accepted submissions on January 25,
2016. The format of the poster will be announced at that time.
Important Dates
* Submission due: January 11, 2016 (Monday), any time zone
* Notification: January 25, 2016 (Monday)
INVITED TALKS
Kazunori UEDA (Waseda University)
The exciting time and hard-won lessons of the Fifth Generation
Computer Project
Atze Dijkstra (Utrecht University)
UHC: Coping with Compiler Complexity
TUTORIALS
Andreas Abel, on Agda
Atze Dijkstra, on Attribute Grammars
Neng-Fa Zhou, on programming in Picat
ACCEPTED PAPERS
Ki Yung Ahn and Andrea Vezzosi.
Executable Relational Specifications of Polymorphic Type Systems using Prolog
Markus Triska.
The Boolean Constraint Solver of SWI-Prolog: System Description
Peng Fu, Ekaterina Komendantskaya, Tom Schrijvers and Andrew Pond.
Proof Relevant Corecursive Resolution
Jay McCarthy, Burke Fetscher, Max New and Robert Bruce Findler.
A Coq Library For Internal Verification of Running-Times
Akimasa Morihata.
Incremental Computing with Abstract Data Structures
Wouter Swierstra and Joao Alpuim.
From proposition to program: embedding the refinement calculus in Coq
Andre Van Delft and Anatoliy Kmetyuk.
Declarative Programming with Algebra
Ian Mackie and Shinya Sato.
An interaction net encoding of Godel's System T
Arthur Blot, Pierre-Evariste Dagand and Julia Lawall.
From Sets to Bits in Coq
Jeremy Yallop, David Sheets and Anil Madhavapeddy.
Declarative foreign function binding through generic programming
Praveen Narayanan, Jacques Carette, Wren Romano,
Chung-Chieh Shan and Robert Zinkov.
Probabilistic inference by program transformation in Hakaru: System description
Francisco Javier Lopez-Fraguas, Manuel Montenegro and Juan Rodriguez-Hortala.
Polymorphic Types in Erlang Function Specifications
Remy Haemmerle, Pedro Lopez-Garcia, Umer Liqat, Maximiliano Klemen,
John Gallagher and Manuel V. Hermenegildo.
A Transformational Approach to Parametric Accumulated-cost Static Profiling
Taus Brock-Nannestad.
Space-efficient Planar Acyclicity Constraints: A Declarative Pearl
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
2015-12-08
[Caml-list] MSFP 2016: Call for Papers
Sixth Workshop on
MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING
8 April 2014, in Eindhoven, The Netherlands
A satellite workshop of ETAPS 2016
http://msfp2016.bentnib.org/
The sixth workshop on Mathematically Structured Functional Programming
is devoted to the derivation of functionality from structure. It is a
celebration of the direct impact of Theoretical Computer Science on
programs as we write them today. Modern programming languages, and in
particular functional languages, support the direct expression of
mathematical structures, equipping programmers with tools of remarkable
power and abstraction. Where would Haskell be without monads? Functional
reactive programming without temporal logic? Call-by-push-value without
adjunctions? The list goes on. This workshop is a forum for researchers
who seek to reflect mathematical phenomena in data and control.
The first MSFP workshop was held in Kuressaare, Estonia, in July 2006,
affiliated with MPC 2006 and AMAST 2006. The second MSFP workshop was
held in Reykjavik, Iceland as part of ICALP 2008. The third MSFP
workshop was held in Baltimore, USA, as part of ICFP 2010. The fourth
workshop was held in Tallinn, Estonia, as part of ETAPS 2012. The
fifth workshop was held in Grenoble, France, as part of ETAPS 2014.
Important Dates:
================
Abstract 10th January 2016
Submission 17th January 2016
Notification 17th February 2016
Final version 24th February 2016
Workshop 8th April 2016
Invited Speakers:
=================
To be announced.
Program Committee:
==================
Zena Ariola, University of Oregon
Robert Atkey, University of Strathclyde (co-chair)
Chantal Keller, IUT d'Orsay
Neelakantan Krishnaswami, University of Birmingham (co-chair)
Helle Hvid Hansen, Delft University of Technology
Nicolas Wu, University of Bristol
Ornela Dardha, University of Glasgow
Submission:
===========
Papers must report previously unpublished work and not be submitted
concurrently to another conference with refereed proceedings. Accepted
papers must be presented at the workshop by one of the authors, and will
be published under the auspices of EPTCS under a Creative Commons
license.
There is no specific page limit, but authors should strive for brevity.
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING
8 April 2014, in Eindhoven, The Netherlands
A satellite workshop of ETAPS 2016
http://msfp2016.bentnib.org/
The sixth workshop on Mathematically Structured Functional Programming
is devoted to the derivation of functionality from structure. It is a
celebration of the direct impact of Theoretical Computer Science on
programs as we write them today. Modern programming languages, and in
particular functional languages, support the direct expression of
mathematical structures, equipping programmers with tools of remarkable
power and abstraction. Where would Haskell be without monads? Functional
reactive programming without temporal logic? Call-by-push-value without
adjunctions? The list goes on. This workshop is a forum for researchers
who seek to reflect mathematical phenomena in data and control.
The first MSFP workshop was held in Kuressaare, Estonia, in July 2006,
affiliated with MPC 2006 and AMAST 2006. The second MSFP workshop was
held in Reykjavik, Iceland as part of ICALP 2008. The third MSFP
workshop was held in Baltimore, USA, as part of ICFP 2010. The fourth
workshop was held in Tallinn, Estonia, as part of ETAPS 2012. The
fifth workshop was held in Grenoble, France, as part of ETAPS 2014.
Important Dates:
================
Abstract 10th January 2016
Submission 17th January 2016
Notification 17th February 2016
Final version 24th February 2016
Workshop 8th April 2016
Invited Speakers:
=================
To be announced.
Program Committee:
==================
Zena Ariola, University of Oregon
Robert Atkey, University of Strathclyde (co-chair)
Chantal Keller, IUT d'Orsay
Neelakantan Krishnaswami, University of Birmingham (co-chair)
Helle Hvid Hansen, Delft University of Technology
Nicolas Wu, University of Bristol
Ornela Dardha, University of Glasgow
Submission:
===========
Papers must report previously unpublished work and not be submitted
concurrently to another conference with refereed proceedings. Accepted
papers must be presented at the workshop by one of the authors, and will
be published under the auspices of EPTCS under a Creative Commons
license.
There is no specific page limit, but authors should strive for brevity.
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
[Caml-list] WRLA 2016: 2nd Call for Papers (including invited speakers)
======================== Call for Papers =================================
WRLA 2016
11th International
Workshop on Rewriting Logic and its Applications
An ETAPS 2016 satellite event
Eindhoven, The Netherlands, April 2-3, 2016
==========================================================================
IMPORTANT DATES
* Abstract deadline: January 6th 2016
* Submission deadline: January 10th 2016
* Author notification: February 14th 2016
* Workshop: Saturday April 2nd and Sunday April 3rd, 2016
AIMS AND SCOPE
Rewriting is a natural model of computation and an expressive semantic
framework for concurrency, parallelism, communication, and interaction. It
can be used for specifying a wide range of systems and languages in various
application domains. It also has good properties as a metalogical framework
for representing logics. Several successful languages based on rewriting
(ASF+SDF, CafeOBJ, ELAN, Maude) have been designed and implemented. The aim
of WRLA is to bring together researchers with a common interest in rewriting
and its applications, and to give them the opportunity to present their
recent work, discuss future research directions, and exchange ideas.
The 2016 edition of WRLA will mark its 20th anniversary since its first
edition in Asilomar, California, in 1996.
The topics of the workshop include, but are not limited to:
A. Foundations
* foundations and models of rewriting and rewriting logic, including
termination, confluence, coherence and complexity
* unification, generalisation, narrowing, and partial evaluation
* constrained rewriting and symbolic algebra
* graph rewriting
* tree automata
* rewriting strategies
* rewriting-based calculi and explicit substitutions
B. Rewriting as a Logical and Semantic Framework
* uses of rewriting and rewriting logic as a logical framework,
including deduction modulo
* uses of rewriting as a semantic framework for programming language
semantics
* rewriting semantics of concurrency models, distributed systems, and
network protocols
* rewriting semantics of real-time, hybrid, and probabilistic systems
* uses of rewriting for compilation and language transformation
C. Rewriting Languages
* rewriting-based declarative languages
* type systems for rewriting
* implementation techniques
* tools supporting rewriting languages
D. Verification Techniques
* verification of confluence, termination, coherence, sufficient
completeness, and related properties
* temporal, modal and reachability logics for verifying dynamic
properties of rewrite theories
* explicit-state and symbolic model-checking techniques for
verification of rewrite theories
* rewriting-based theorem proving, including (co)inductive theorem proving
* rewriting-based constraint solving and satisfiability
* rewriting-semantics-based verification and analysis of programs
E. Applications
* applications to logic, mathematics and physics
* rewriting models of biology, chemistry, and membrane systems
* security specification and verification
* applications to distributed, network, mobile, and cloud computing
* specification and verification of real-time, probabilistic, and
cyber-physical systems
* specifications and verification of critical systems
* applications to model-based software engineering
* applications to engineering and planning
INVITED SPEAKERS
Nikolaj Bjorner (Microsoft Research)
Helene Kirchner (INRIA, France)
SUBMISSION
We solicit submissions of regular papers, tool papers, and
work-in-progress papers.
Regular papers must contain original contributions, be clearly written,
include appropriate references, and comparison with related work. They must
be unpublished and not submitted simultaneously for publication
elsewhere.
Tool papers have to present a new tool, a new tool component, or novel
extensions to an existing tool. They should provide a short description of
the theoretical foundations with relevant citations, emphasise the design and
implementation, and give a clear account of the tool's functionality. The
described tools must be publicly available via the web.
Work-in-progress papers present early-stage work or other types of innovative
or thought-provoking work related to the topics of the workshop. The
difference between work-in-progress and regular papers is that work-in-progress
submissions represent work that has not reached yet a level of
completion that would warrant the full-refereed selection process. We
encourage researchers and practitioners to submit work-in-progress papers as
this provides a unique opportunity for sharing valuable ideas, eliciting
useful feedback on ongoing work, and fostering discussions and collaborations
among colleagues.
All submissions should be formatted according to the guidelines for Springer
LNCS papers, and should be submitted electronically using EasyChair at
https://easychair.org/conferences/?conf=wrla2016
Regular and work-in-progress papers should not exceed 15 pages including
references. Tool papers can have a maximum of 6 pages including references
and may have an appendix of up to 4 additional pages with usage details and
tool demonstration.
PUBLICATION
All submissions will be evaluated by the program committee. Regular papers,
tool papers, and work-in-progress papers that are accepted will be presented
at the workshop and included in the pre-proceedings, which will be available
during the workshop. Following the tradition of the last editions, the
regular papers, tool papers, and invited presentations will be
published as a volume in Springer’s Lecture Notes in Computer Science
(LNCS) series to be distributed after the workshop.
A special issue of the Journal of Logical and Algebraic Methods in
Programming (JLAMP) will be devoted to extended versions of selected papers
from WRLA 2016.
PROGRAM COMMITTEE
Kyungmin Bae, SRI International, USA
Mark van den Brand, Eindhoven University of Technology, The Netherlands
Roberto Bruni, University of Pisa, Italy
Stefan Ciobaca, Alexandru Ioan Cuza University, Romania
Manuel Clavel, IMDEA Software Institute, Spain
Francisco Durán, Universidad de Málaga, Spain
Joerg Endrullis, Vrije Universiteit Amsterdam, The Netherlands
Santiago Escobar, Universidad Politécnica de Valencia, Spain
Maribel Fernández, King's College London, UK
Kokichi Futatsugi, JAIST, Japan
Thomas Genet, IRISA/Université de Rennes 1, France
Jürgen Giesl, RWTH Aachen, Germany
Deepak Kapur, University of New Mexico, USA
Helene Kirchner, INRIA, France
Alexander Knapp, Universitat Augsburg, Germany
Alberto Lluch Lafuente, Technical University of Denmark, Denmark
Dorel Lucanu, Alexandru Ioan Cuza University, Romania (chair)
Salvador Lucas, Universidad Politécnica de Valencia, Spain
Narciso MartÃ-Oliet, Universidad Complutense de Madrid, Spain
José Meseguer, University of Illinois at Urbana-Champaign, USA
Ugo Montanari, University of Pisa, Italy
Pierre-Etienne Moreau, Université de Lorraine, France
Vivek Nigam, Federal University of ParaÃba, Brasil
Kazuhiro Ogata, JAIST, Japan
Peter Ölveczky, University of Oslo, Norway
Miguel Palomino, Universidad Complutense de Madrid, Spain
Christophe Ringeissen, INRIA-Lorraine Nancy, France
Grigore Rosu, University of Illinois at Urbana-Champaign, USA
Vlad Rusu, INRIA Lille Nord-Europe, France
Ralf Sasse, ETH Zurich, Switzerland
Traian-Florin Serbanuta, University of Bucharest, Romania
Mark-Oliver Stehr, SRI International, USA
Carolyn Talcott, SRI International, USA
Martin Wirsing, Ludwig-Maximilians-Universität München, Germany
CONTACT INFORMATION
For more information, please contact the organizers
dlucanu@info.uaic.ro
or visit the workshop web page
http://fmse.info.uaic.ro/events/WRLA2016/
.
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
WRLA 2016
11th International
Workshop on Rewriting Logic and its Applications
An ETAPS 2016 satellite event
Eindhoven, The Netherlands, April 2-3, 2016
==========================================================================
IMPORTANT DATES
* Abstract deadline: January 6th 2016
* Submission deadline: January 10th 2016
* Author notification: February 14th 2016
* Workshop: Saturday April 2nd and Sunday April 3rd, 2016
AIMS AND SCOPE
Rewriting is a natural model of computation and an expressive semantic
framework for concurrency, parallelism, communication, and interaction. It
can be used for specifying a wide range of systems and languages in various
application domains. It also has good properties as a metalogical framework
for representing logics. Several successful languages based on rewriting
(ASF+SDF, CafeOBJ, ELAN, Maude) have been designed and implemented. The aim
of WRLA is to bring together researchers with a common interest in rewriting
and its applications, and to give them the opportunity to present their
recent work, discuss future research directions, and exchange ideas.
The 2016 edition of WRLA will mark its 20th anniversary since its first
edition in Asilomar, California, in 1996.
The topics of the workshop include, but are not limited to:
A. Foundations
* foundations and models of rewriting and rewriting logic, including
termination, confluence, coherence and complexity
* unification, generalisation, narrowing, and partial evaluation
* constrained rewriting and symbolic algebra
* graph rewriting
* tree automata
* rewriting strategies
* rewriting-based calculi and explicit substitutions
B. Rewriting as a Logical and Semantic Framework
* uses of rewriting and rewriting logic as a logical framework,
including deduction modulo
* uses of rewriting as a semantic framework for programming language
semantics
* rewriting semantics of concurrency models, distributed systems, and
network protocols
* rewriting semantics of real-time, hybrid, and probabilistic systems
* uses of rewriting for compilation and language transformation
C. Rewriting Languages
* rewriting-based declarative languages
* type systems for rewriting
* implementation techniques
* tools supporting rewriting languages
D. Verification Techniques
* verification of confluence, termination, coherence, sufficient
completeness, and related properties
* temporal, modal and reachability logics for verifying dynamic
properties of rewrite theories
* explicit-state and symbolic model-checking techniques for
verification of rewrite theories
* rewriting-based theorem proving, including (co)inductive theorem proving
* rewriting-based constraint solving and satisfiability
* rewriting-semantics-based verification and analysis of programs
E. Applications
* applications to logic, mathematics and physics
* rewriting models of biology, chemistry, and membrane systems
* security specification and verification
* applications to distributed, network, mobile, and cloud computing
* specification and verification of real-time, probabilistic, and
cyber-physical systems
* specifications and verification of critical systems
* applications to model-based software engineering
* applications to engineering and planning
INVITED SPEAKERS
Nikolaj Bjorner (Microsoft Research)
Helene Kirchner (INRIA, France)
SUBMISSION
We solicit submissions of regular papers, tool papers, and
work-in-progress papers.
Regular papers must contain original contributions, be clearly written,
include appropriate references, and comparison with related work. They must
be unpublished and not submitted simultaneously for publication
elsewhere.
Tool papers have to present a new tool, a new tool component, or novel
extensions to an existing tool. They should provide a short description of
the theoretical foundations with relevant citations, emphasise the design and
implementation, and give a clear account of the tool's functionality. The
described tools must be publicly available via the web.
Work-in-progress papers present early-stage work or other types of innovative
or thought-provoking work related to the topics of the workshop. The
difference between work-in-progress and regular papers is that work-in-progress
submissions represent work that has not reached yet a level of
completion that would warrant the full-refereed selection process. We
encourage researchers and practitioners to submit work-in-progress papers as
this provides a unique opportunity for sharing valuable ideas, eliciting
useful feedback on ongoing work, and fostering discussions and collaborations
among colleagues.
All submissions should be formatted according to the guidelines for Springer
LNCS papers, and should be submitted electronically using EasyChair at
https://easychair.org/conferences/?conf=wrla2016
Regular and work-in-progress papers should not exceed 15 pages including
references. Tool papers can have a maximum of 6 pages including references
and may have an appendix of up to 4 additional pages with usage details and
tool demonstration.
PUBLICATION
All submissions will be evaluated by the program committee. Regular papers,
tool papers, and work-in-progress papers that are accepted will be presented
at the workshop and included in the pre-proceedings, which will be available
during the workshop. Following the tradition of the last editions, the
regular papers, tool papers, and invited presentations will be
published as a volume in Springer’s Lecture Notes in Computer Science
(LNCS) series to be distributed after the workshop.
A special issue of the Journal of Logical and Algebraic Methods in
Programming (JLAMP) will be devoted to extended versions of selected papers
from WRLA 2016.
PROGRAM COMMITTEE
Kyungmin Bae, SRI International, USA
Mark van den Brand, Eindhoven University of Technology, The Netherlands
Roberto Bruni, University of Pisa, Italy
Stefan Ciobaca, Alexandru Ioan Cuza University, Romania
Manuel Clavel, IMDEA Software Institute, Spain
Francisco Durán, Universidad de Málaga, Spain
Joerg Endrullis, Vrije Universiteit Amsterdam, The Netherlands
Santiago Escobar, Universidad Politécnica de Valencia, Spain
Maribel Fernández, King's College London, UK
Kokichi Futatsugi, JAIST, Japan
Thomas Genet, IRISA/Université de Rennes 1, France
Jürgen Giesl, RWTH Aachen, Germany
Deepak Kapur, University of New Mexico, USA
Helene Kirchner, INRIA, France
Alexander Knapp, Universitat Augsburg, Germany
Alberto Lluch Lafuente, Technical University of Denmark, Denmark
Dorel Lucanu, Alexandru Ioan Cuza University, Romania (chair)
Salvador Lucas, Universidad Politécnica de Valencia, Spain
Narciso MartÃ-Oliet, Universidad Complutense de Madrid, Spain
José Meseguer, University of Illinois at Urbana-Champaign, USA
Ugo Montanari, University of Pisa, Italy
Pierre-Etienne Moreau, Université de Lorraine, France
Vivek Nigam, Federal University of ParaÃba, Brasil
Kazuhiro Ogata, JAIST, Japan
Peter Ölveczky, University of Oslo, Norway
Miguel Palomino, Universidad Complutense de Madrid, Spain
Christophe Ringeissen, INRIA-Lorraine Nancy, France
Grigore Rosu, University of Illinois at Urbana-Champaign, USA
Vlad Rusu, INRIA Lille Nord-Europe, France
Ralf Sasse, ETH Zurich, Switzerland
Traian-Florin Serbanuta, University of Bucharest, Romania
Mark-Oliver Stehr, SRI International, USA
Carolyn Talcott, SRI International, USA
Martin Wirsing, Ludwig-Maximilians-Universität München, Germany
CONTACT INFORMATION
For more information, please contact the organizers
dlucanu@info.uaic.ro
or visit the workshop web page
http://fmse.info.uaic.ro/events/WRLA2016/
.
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
[Caml-list] Call for Papers - 9th Conference on Intelligent Computer Mathematics - CICM 2016 - Deadline 28. February 2016
Call for Papers
9th Conference on Intelligent Computer Mathematics
- CICM 2016 -
July 25-29, 2016
University of Bialystok, Poland
http://www.cicm-conference.org/2016
----------------------------------------------------------------------
Digital and computational solutions are becoming the prevalent means
for the generation, communication, processing, storage and curation of
mathematical information. Separate communities have developed to
investigate and build computer based systems for computer algebra,
automated deduction, and mathematical publishing as well as novel user
interfaces. While all of these systems excel in their own right, their
integration can lead to synergies offering significant added
value. The Conference on Intelligent Computer Mathematics (CICM)
offers a venue for discussing and developing solutions to the great
challenges posed by the integration of these diverse areas.
CICM has been held annually as a joint meeting since 2008, co-locating
related conferences and workshops to advance work in these
subjects. Previous meetings have been held in Birmingham (UK 2008),
Grand Bend (Canada 2009), Paris (France 2010), Bertinoro (Italy 2011),
Bremen (Germany 2012), Bath (UK 2013), Coimbra (Portugal 2014), and
Washington DC (USA 2015).
This is a call for papers for CICM 2016, which will be held in
Bialystok, Poland, July 25-29, 2016.
The principal tracks of the conference will be:
* Track: Calculemus (chair: Leonardo de Moura)
* Track: Digital Mathematical Libraries (DML) (chair: Frank Tompa)
* Track: Mathematical Knowledge Management (MKM) (chair: Bruce Miller)
* Track: Systems & Data (chair: Moa Johansson)
* Track: Doctoral Programme (chair: TBD)
Like in previous years, project descriptions are welcomed as well.
The overall programme is organized by the General Program Chair
Michael Kohlhase. The workshop and publicity chair is Serge Autexier.
The local arrangements will be coordinated by Adam Naumowicz.
We plan to have proceedings of the conference as in previous years
with Springer Verlag as a volume in Lecture Notes in Artificial
Intelligence (LNAI).
*Important Dates*
Conference submissions
- Abstract submission deadline: 28. February 2016
- Submission deadline: 6. March 2016
- Reviews sent to authors: 10. April 2016
- Rebuttals due: 13. April 2016
- Notification of acceptance: 25. April 2016
- Camera ready copies due: 10. May 2016
- Conference: 25.-29. July 2016
Work-in-progress and Doctoral Programme
- Submission deadline (Doctoral: Abstract+CV): 1. May 2016
- Notification of acceptance: 19. May 2016
- Camera ready copies due: 19. June 2016
More details on the conference are available from
http://www.cicm-conference.org/2016/cicm.php?menu=cfp
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
9th Conference on Intelligent Computer Mathematics
- CICM 2016 -
July 25-29, 2016
University of Bialystok, Poland
http://www.cicm-conference.org/2016
----------------------------------------------------------------------
Digital and computational solutions are becoming the prevalent means
for the generation, communication, processing, storage and curation of
mathematical information. Separate communities have developed to
investigate and build computer based systems for computer algebra,
automated deduction, and mathematical publishing as well as novel user
interfaces. While all of these systems excel in their own right, their
integration can lead to synergies offering significant added
value. The Conference on Intelligent Computer Mathematics (CICM)
offers a venue for discussing and developing solutions to the great
challenges posed by the integration of these diverse areas.
CICM has been held annually as a joint meeting since 2008, co-locating
related conferences and workshops to advance work in these
subjects. Previous meetings have been held in Birmingham (UK 2008),
Grand Bend (Canada 2009), Paris (France 2010), Bertinoro (Italy 2011),
Bremen (Germany 2012), Bath (UK 2013), Coimbra (Portugal 2014), and
Washington DC (USA 2015).
This is a call for papers for CICM 2016, which will be held in
Bialystok, Poland, July 25-29, 2016.
The principal tracks of the conference will be:
* Track: Calculemus (chair: Leonardo de Moura)
* Track: Digital Mathematical Libraries (DML) (chair: Frank Tompa)
* Track: Mathematical Knowledge Management (MKM) (chair: Bruce Miller)
* Track: Systems & Data (chair: Moa Johansson)
* Track: Doctoral Programme (chair: TBD)
Like in previous years, project descriptions are welcomed as well.
The overall programme is organized by the General Program Chair
Michael Kohlhase. The workshop and publicity chair is Serge Autexier.
The local arrangements will be coordinated by Adam Naumowicz.
We plan to have proceedings of the conference as in previous years
with Springer Verlag as a volume in Lecture Notes in Artificial
Intelligence (LNAI).
*Important Dates*
Conference submissions
- Abstract submission deadline: 28. February 2016
- Submission deadline: 6. March 2016
- Reviews sent to authors: 10. April 2016
- Rebuttals due: 13. April 2016
- Notification of acceptance: 25. April 2016
- Camera ready copies due: 10. May 2016
- Conference: 25.-29. July 2016
Work-in-progress and Doctoral Programme
- Submission deadline (Doctoral: Abstract+CV): 1. May 2016
- Notification of acceptance: 19. May 2016
- Camera ready copies due: 19. June 2016
More details on the conference are available from
http://www.cicm-conference.org/2016/cicm.php?menu=cfp
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
2015-12-07
Re: [Caml-list] ICFP 2016 Call for Papers
[My apologies for the garbled text in a previous version of this
email. -- Lindsey]
ICFP 2016
The 21st ACM SIGPLAN International Conference on Functional Programming
http://conf.researchr.org/home/icfp-2016
Call for Papers
Important dates
---------------
Submissions due: Wednesday, March 16 2016, 15:00 (UTC)
https://icfp2016.hotcrp.com
(in preparation as of December 1)
Author response: Monday, 2 May, 2016, 15:00 (UTC) -
Thursday, 5 May, 2016, 15:00 (UTC)
Notification: Friday, 20 May, 2016
Final copy due: TBA
Early registration: TBA
Conference: Tuesday, 20 September -
Thursday, 22 September, 2016
Scope
-----
ICFP 2016 seeks original papers on the art and science of functional
programming. Submissions are invited on all topics from principles to
practice, from foundations to features, and from abstraction to
application. The scope includes all languages that encourage
functional programming, including both purely applicative and
imperative languages, as well as languages with objects, concurrency,
or parallelism. Topics of interest include (but are not limited to):
- Language Design: concurrency, parallelism, and distribution;
modules; components and composition; metaprogramming; type systems;
interoperability; domain-specific languages; and relations to
imperative, object-oriented, or logic programming.
- Implementation: abstract machines; virtual machines; interpretation;
compilation; compile-time and run-time optimization; garbage
collection and memory management; multi-threading; exploiting
parallel hardware; interfaces to foreign functions, services,
components, or low-level machine resources.
- Software-Development Techniques: algorithms and data structures;
design patterns; specification; verification; validation; proof
assistants; debugging; testing; tracing; profiling.
- Foundations: formal semantics; lambda calculus; rewriting; type
theory; monads; continuations; control; state; effects; program
verification; dependent types.
- Analysis and Transformation: control-flow; data-flow; abstract
interpretation; partial evaluation; program calculation.
- Applications: symbolic computing; formal-methods tools; artificial
intelligence; systems programming; distributed-systems and web
programming; hardware design; databases; XML processing; scientific
and numerical computing; graphical user interfaces; multimedia and
3D graphics programming; scripting; system administration; security.
- Education: teaching introductory programming; parallel programming;
mathematical proof; algebra.
- Functional Pearls: elegant, instructive, and fun essays on
functional programming.
- Experience Reports: short papers that provide evidence that
functional programming really works or describe obstacles that have
kept it from working.
If you are concerned about the appropriateness of some topic, do not
hesitate to contact the program chair.
Abbreviated instructions for authors
------------------------------------
- By Wednesday, March 16 2016, 15:00 (UTC), submit a full paper of at
most 12 pages (6 pages for an Experience Report), in standard
SIGPLAN conference format, including figures but ***excluding
bibliography***.
The deadlines will be strictly enforced and papers exceeding the page
limits will be summarily rejected.
***ICFP 2016 will employ a lightweight double-blind reviewing
process.*** To facilitate this, submitted papers must adhere to two
rules:
1. ***author names and institutions must be omitted***, and
2. ***references to authors' own related work should be in the third
person*** (e.g., not "We build on our previous work ..." but
rather "We build on the work of ...").
The purpose of this process is to help the PC and external reviewers
come to an initial judgement about the paper without bias, not to make
it impossible for them to discover the authors if they were to
try. Nothing should be done in the name of anonymity that weakens the
submission or makes the job of reviewing the paper more difficult
(e.g., important background references should not be omitted or
anonymized). In addition, authors should feel free to disseminate
their ideas or draft versions of their paper as they normally
would. For instance, authors may post drafts of their papers on the
web or give talks on their research ideas. We have put together a
document answering frequently asked questions that should address many
common concerns:
http://conf.researchr.org/track/icfp-2016/icfp-2016-papers#Submission-and-Reviewing-FAQ
- Authors have the option to attach supplementary material to a
submission, on the understanding that reviewers may choose not to
look at it. The material should be uploaded at submission time, as a
single pdf or a tarball, not via a URL. This supplementary material
may or may not be anonymized; if not anonymized, it will only be
revealed to reviewers after they have submitted their review of your
paper and learned your identity.
- Each submission must adhere to SIGPLAN's republication policy, as
explained on the web at:
http://www.sigplan.org/Resources/Policies/Republication
- Authors of resubmitted (but previously rejected) papers have the
option to attach an annotated copy of the reviews of their previous
submission(s), explaining how they have addressed these previous
reviews in the present submission. If a reviewer identifies
him/herself as a reviewer of this previous submission and wishes to
see how his/her comments have been addressed, the program chair will
communicate to this reviewer the annotated copy of his/her previous
review. Otherwise, no reviewer will read the annotated copies of the
previous reviews.
Overall, a submission will be evaluated according to its relevance,
correctness, significance, originality, and clarity. It should explain
its contributions in both general and technical terms, clearly
identifying what has been accomplished, explaining why it is
significant, and comparing it with previous work. The technical
content should be accessible to a broad audience. Functional Pearls
and Experience Reports are separate categories of papers that need not
report original research results and must be marked as such at the
time of submission. Detailed guidelines on both categories are given
below.
Presentations will be videotaped and released online if the presenter
consents. The proceedings will be freely available for download from
the ACM Digital Library from at least one week before the start of the
conference until two weeks after the conference.
Formatting: Submissions must be in PDF format printable in black and
white on US Letter sized paper and interpretable by
Ghostscript. Papers must adhere to the standard SIGPLAN conference
format: two columns, nine-point font on a ten-point baseline, with
columns 20pc (3.33in) wide and 54pc (9in) tall, with a column gutter
of 2pc (0.33in). A suitable document template for LaTeX is available
at http://www.sigplan.org/Resources/Author/
Submission: Submissions will be accepted at
https://icfp2016.hotcrp.com (in preparation as of December 1).
Improved versions of a paper may be submitted at any point before the
submission deadline using the same web interface.
Author response: Authors will have a 72-hour period, starting at 15:00
UTC on Monday, 2 May, 2016, to read reviews and respond to them.
ACM Author-Izer is a unique service that enables ACM authors to
generate and post links on either their home page or institutional
repository for visitors to download the definitive version of their
articles from the ACM Digital Library at no charge. Downloads through
Author-Izer links are captured in official ACM statistics, improving
the accuracy of usage and impact measurements. Consistently linking
the definitive version of ACM article should reduce user confusion
over article versioning. After your article has been published and
assigned to your ACM Author Profile page, please visit
http://www.acm.org/publications/acm-author-izer-service to learn how
to create your links for free downloads from the ACM DL.
Publication date: The official publication date of accepted papers is
the date the proceedings are made available in the ACM Digital
Library. This date may be up to two weeks prior to the first day of
the conference. The official publication date affects the deadline for
any patent filings related to published work.
Special categories of papers
----------------------------
In addition to research papers, ICFP solicits two kinds of papers that
do not require original research contributions: Functional Pearls,
which are full papers, and Experience Reports, which are limited to
six pages. Authors submitting such papers may wish to consider the
following advice.
Functional Pearls
=================
A Functional Pearl is an elegant essay about something related to
functional programming. Examples include, but are not limited to:
- a new and thought-provoking way of looking at an old idea
- an instructive example of program calculation or proof
- a nifty presentation of an old or new data structure
- an interesting application of functional programming techniques
- a novel use or exposition of functional programming in the classroom
While pearls often demonstrate an idea through the development of a
short program, there is no requirement or expectation that they do
so. Thus, they encompass the notions of theoretical and educational
pearls.
Functional Pearls are valued as highly and judged as rigorously as
ordinary papers, but using somewhat different criteria. In particular,
a pearl is not required to report original research, but, it should be
concise, instructive, and entertaining. Your pearl is likely to be
rejected if your readers get bored, if the material gets too
complicated, if too much specialized knowledge is needed, or if the
writing is inelegant. The key to writing a good pearl is polishing.
A submission you wish to have treated as a pearl must be marked as
such on the submission web page, and should contain the words
``Functional Pearl'' somewhere in its title or subtitle. These steps
will alert reviewers to use the appropriate evaluation
criteria. Pearls will be combined with ordinary papers, however, for
the purpose of computing the conference's acceptance rate.
Experience Reports
==================
The purpose of an Experience Report is to help create a body of
published, refereed, citable evidence that functional programming
really works -- or to describe what obstacles prevent it from working.
Possible topics for an Experience Report include, but are not limited
to:
- insights gained from real-world projects using functional
programming
- comparison of functional programming with conventional programming
in the context of an industrial project or a university curriculum
- project-management, business, or legal issues encountered when using
functional programming in a real-world project
- curricular issues encountered when using functional programming in
education
- real-world constraints that created special challenges for an
implementation of a functional language or for functional
programming in general
An Experience Report is distinguished from a normal ICFP paper by its
title, by its length, and by the criteria used to evaluate it.
- Both in the proceedings and in any citations, the title of each
accepted Experience Report must begin with the words ``Experience
Report'' followed by a colon. The acceptance rate for Experience
Reports will be computed and reported separately from the rate for
ordinary papers.
- An Experience Report is at most six pages long. Each accepted
Experience Report will be presented at the conference, but depending
on the number of Experience Reports and regular papers accepted,
authors of Experience reports may be asked to give shorter talks.
- Because the purpose of Experience Reports is to enable our community
to accumulate a body of evidence about the efficacy of functional
programming, an acceptable Experience Report need not add to the
body of knowledge of the functional-programming community by
presenting novel results or conclusions. It is sufficient if the
Report states a clear thesis and provides supporting evidence. The
thesis must be relevant to ICFP, but it need not be novel.
The program committee will accept or reject Experience Reports based
on whether they judge the evidence to be convincing. Anecdotal
evidence will be acceptable provided it is well argued and the author
explains what efforts were made to gather as much evidence as
possible. Typically, more convincing evidence is obtained from papers
which show how functional programming was used than from papers which
only say that functional programming was used. The most convincing
evidence often includes comparisons of situations before and after the
introduction or discontinuation of functional programming. Evidence
drawn from a single person's experience may be sufficient, but more
weight will be given to evidence drawn from the experience of groups
of people.
An Experience Report should be short and to the point: make a claim
about how well functional programming worked on your project and why,
and produce evidence to substantiate your claim. If functional
programming worked for you in the same ways it has worked for others,
you need only to summarize the results?the main part of your paper
should discuss how well it worked and in what context. Most readers
will not want to know all the details of your project and its
implementation, but please characterize your project and its context
well enough so that readers can judge to what degree your experience
is relevant to their own projects. Be especially careful to highlight
any unusual aspects of your project. Also keep in mind that specifics
about your project are more valuable than generalities about
functional programming; for example, it is more valuable to say that
your team delivered its software a month ahead of schedule than it is
to say that functional programming made your team more productive.
If your paper not only describes experience but also presents new
technical results, or if your experience refutes cherished beliefs of
the functional-programming community, you may be better off submitting
it as a full paper, which will be judged by the usual criteria of
novelty, originality, and relevance. If you are unsure in which
category to submit, the program chair will be happy to help you
decide.
Organizers
----------
General Co-Chairs:
Jacques Garrigue (Nagoya University)
Gabriele Keller (University of New South Wales)
Program Chair:
Eijiro Sumii (Tohoku University)
Program Committee:
Koen Claessen (Chalmers University of Technology)
Joshua Dunfield (University of British Columbia, Canada)
Matthew Fluet (Rochester Institute of Technology)
Nate Foster (Cornell University)
Dan Grossman (University of Washington, USA)
Jurriaan Hage (Utrecht University)
Roman Leshchinskiy (Standard Chartered Bank)
Keisuke Nakano (The University of Electro-Communications)
Aleksandar Nanevski (IMDEA Software Institute)
Scott Owens (University of Kent)
Sungwoo Park (Pohang University of Science and Technology)
Amr Sabry (Indiana University)
Tom Schrijvers (KU Leuven)
Olin Shivers (Northeastern University)
Walid Taha (Halmstad University)
Dimitrios Vytiniotis (Microsoft Research, Cambridge)
David Walker (Princeton University)
Nobuko Yoshida (Imperial College London, UK)
External Review Committee to be announced.
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
email. -- Lindsey]
ICFP 2016
The 21st ACM SIGPLAN International Conference on Functional Programming
http://conf.researchr.org/home/icfp-2016
Call for Papers
Important dates
---------------
Submissions due: Wednesday, March 16 2016, 15:00 (UTC)
https://icfp2016.hotcrp.com
(in preparation as of December 1)
Author response: Monday, 2 May, 2016, 15:00 (UTC) -
Thursday, 5 May, 2016, 15:00 (UTC)
Notification: Friday, 20 May, 2016
Final copy due: TBA
Early registration: TBA
Conference: Tuesday, 20 September -
Thursday, 22 September, 2016
Scope
-----
ICFP 2016 seeks original papers on the art and science of functional
programming. Submissions are invited on all topics from principles to
practice, from foundations to features, and from abstraction to
application. The scope includes all languages that encourage
functional programming, including both purely applicative and
imperative languages, as well as languages with objects, concurrency,
or parallelism. Topics of interest include (but are not limited to):
- Language Design: concurrency, parallelism, and distribution;
modules; components and composition; metaprogramming; type systems;
interoperability; domain-specific languages; and relations to
imperative, object-oriented, or logic programming.
- Implementation: abstract machines; virtual machines; interpretation;
compilation; compile-time and run-time optimization; garbage
collection and memory management; multi-threading; exploiting
parallel hardware; interfaces to foreign functions, services,
components, or low-level machine resources.
- Software-Development Techniques: algorithms and data structures;
design patterns; specification; verification; validation; proof
assistants; debugging; testing; tracing; profiling.
- Foundations: formal semantics; lambda calculus; rewriting; type
theory; monads; continuations; control; state; effects; program
verification; dependent types.
- Analysis and Transformation: control-flow; data-flow; abstract
interpretation; partial evaluation; program calculation.
- Applications: symbolic computing; formal-methods tools; artificial
intelligence; systems programming; distributed-systems and web
programming; hardware design; databases; XML processing; scientific
and numerical computing; graphical user interfaces; multimedia and
3D graphics programming; scripting; system administration; security.
- Education: teaching introductory programming; parallel programming;
mathematical proof; algebra.
- Functional Pearls: elegant, instructive, and fun essays on
functional programming.
- Experience Reports: short papers that provide evidence that
functional programming really works or describe obstacles that have
kept it from working.
If you are concerned about the appropriateness of some topic, do not
hesitate to contact the program chair.
Abbreviated instructions for authors
------------------------------------
- By Wednesday, March 16 2016, 15:00 (UTC), submit a full paper of at
most 12 pages (6 pages for an Experience Report), in standard
SIGPLAN conference format, including figures but ***excluding
bibliography***.
The deadlines will be strictly enforced and papers exceeding the page
limits will be summarily rejected.
***ICFP 2016 will employ a lightweight double-blind reviewing
process.*** To facilitate this, submitted papers must adhere to two
rules:
1. ***author names and institutions must be omitted***, and
2. ***references to authors' own related work should be in the third
person*** (e.g., not "We build on our previous work ..." but
rather "We build on the work of ...").
The purpose of this process is to help the PC and external reviewers
come to an initial judgement about the paper without bias, not to make
it impossible for them to discover the authors if they were to
try. Nothing should be done in the name of anonymity that weakens the
submission or makes the job of reviewing the paper more difficult
(e.g., important background references should not be omitted or
anonymized). In addition, authors should feel free to disseminate
their ideas or draft versions of their paper as they normally
would. For instance, authors may post drafts of their papers on the
web or give talks on their research ideas. We have put together a
document answering frequently asked questions that should address many
common concerns:
http://conf.researchr.org/track/icfp-2016/icfp-2016-papers#Submission-and-Reviewing-FAQ
- Authors have the option to attach supplementary material to a
submission, on the understanding that reviewers may choose not to
look at it. The material should be uploaded at submission time, as a
single pdf or a tarball, not via a URL. This supplementary material
may or may not be anonymized; if not anonymized, it will only be
revealed to reviewers after they have submitted their review of your
paper and learned your identity.
- Each submission must adhere to SIGPLAN's republication policy, as
explained on the web at:
http://www.sigplan.org/Resources/Policies/Republication
- Authors of resubmitted (but previously rejected) papers have the
option to attach an annotated copy of the reviews of their previous
submission(s), explaining how they have addressed these previous
reviews in the present submission. If a reviewer identifies
him/herself as a reviewer of this previous submission and wishes to
see how his/her comments have been addressed, the program chair will
communicate to this reviewer the annotated copy of his/her previous
review. Otherwise, no reviewer will read the annotated copies of the
previous reviews.
Overall, a submission will be evaluated according to its relevance,
correctness, significance, originality, and clarity. It should explain
its contributions in both general and technical terms, clearly
identifying what has been accomplished, explaining why it is
significant, and comparing it with previous work. The technical
content should be accessible to a broad audience. Functional Pearls
and Experience Reports are separate categories of papers that need not
report original research results and must be marked as such at the
time of submission. Detailed guidelines on both categories are given
below.
Presentations will be videotaped and released online if the presenter
consents. The proceedings will be freely available for download from
the ACM Digital Library from at least one week before the start of the
conference until two weeks after the conference.
Formatting: Submissions must be in PDF format printable in black and
white on US Letter sized paper and interpretable by
Ghostscript. Papers must adhere to the standard SIGPLAN conference
format: two columns, nine-point font on a ten-point baseline, with
columns 20pc (3.33in) wide and 54pc (9in) tall, with a column gutter
of 2pc (0.33in). A suitable document template for LaTeX is available
at http://www.sigplan.org/Resources/Author/
Submission: Submissions will be accepted at
https://icfp2016.hotcrp.com (in preparation as of December 1).
Improved versions of a paper may be submitted at any point before the
submission deadline using the same web interface.
Author response: Authors will have a 72-hour period, starting at 15:00
UTC on Monday, 2 May, 2016, to read reviews and respond to them.
ACM Author-Izer is a unique service that enables ACM authors to
generate and post links on either their home page or institutional
repository for visitors to download the definitive version of their
articles from the ACM Digital Library at no charge. Downloads through
Author-Izer links are captured in official ACM statistics, improving
the accuracy of usage and impact measurements. Consistently linking
the definitive version of ACM article should reduce user confusion
over article versioning. After your article has been published and
assigned to your ACM Author Profile page, please visit
http://www.acm.org/publications/acm-author-izer-service to learn how
to create your links for free downloads from the ACM DL.
Publication date: The official publication date of accepted papers is
the date the proceedings are made available in the ACM Digital
Library. This date may be up to two weeks prior to the first day of
the conference. The official publication date affects the deadline for
any patent filings related to published work.
Special categories of papers
----------------------------
In addition to research papers, ICFP solicits two kinds of papers that
do not require original research contributions: Functional Pearls,
which are full papers, and Experience Reports, which are limited to
six pages. Authors submitting such papers may wish to consider the
following advice.
Functional Pearls
=================
A Functional Pearl is an elegant essay about something related to
functional programming. Examples include, but are not limited to:
- a new and thought-provoking way of looking at an old idea
- an instructive example of program calculation or proof
- a nifty presentation of an old or new data structure
- an interesting application of functional programming techniques
- a novel use or exposition of functional programming in the classroom
While pearls often demonstrate an idea through the development of a
short program, there is no requirement or expectation that they do
so. Thus, they encompass the notions of theoretical and educational
pearls.
Functional Pearls are valued as highly and judged as rigorously as
ordinary papers, but using somewhat different criteria. In particular,
a pearl is not required to report original research, but, it should be
concise, instructive, and entertaining. Your pearl is likely to be
rejected if your readers get bored, if the material gets too
complicated, if too much specialized knowledge is needed, or if the
writing is inelegant. The key to writing a good pearl is polishing.
A submission you wish to have treated as a pearl must be marked as
such on the submission web page, and should contain the words
``Functional Pearl'' somewhere in its title or subtitle. These steps
will alert reviewers to use the appropriate evaluation
criteria. Pearls will be combined with ordinary papers, however, for
the purpose of computing the conference's acceptance rate.
Experience Reports
==================
The purpose of an Experience Report is to help create a body of
published, refereed, citable evidence that functional programming
really works -- or to describe what obstacles prevent it from working.
Possible topics for an Experience Report include, but are not limited
to:
- insights gained from real-world projects using functional
programming
- comparison of functional programming with conventional programming
in the context of an industrial project or a university curriculum
- project-management, business, or legal issues encountered when using
functional programming in a real-world project
- curricular issues encountered when using functional programming in
education
- real-world constraints that created special challenges for an
implementation of a functional language or for functional
programming in general
An Experience Report is distinguished from a normal ICFP paper by its
title, by its length, and by the criteria used to evaluate it.
- Both in the proceedings and in any citations, the title of each
accepted Experience Report must begin with the words ``Experience
Report'' followed by a colon. The acceptance rate for Experience
Reports will be computed and reported separately from the rate for
ordinary papers.
- An Experience Report is at most six pages long. Each accepted
Experience Report will be presented at the conference, but depending
on the number of Experience Reports and regular papers accepted,
authors of Experience reports may be asked to give shorter talks.
- Because the purpose of Experience Reports is to enable our community
to accumulate a body of evidence about the efficacy of functional
programming, an acceptable Experience Report need not add to the
body of knowledge of the functional-programming community by
presenting novel results or conclusions. It is sufficient if the
Report states a clear thesis and provides supporting evidence. The
thesis must be relevant to ICFP, but it need not be novel.
The program committee will accept or reject Experience Reports based
on whether they judge the evidence to be convincing. Anecdotal
evidence will be acceptable provided it is well argued and the author
explains what efforts were made to gather as much evidence as
possible. Typically, more convincing evidence is obtained from papers
which show how functional programming was used than from papers which
only say that functional programming was used. The most convincing
evidence often includes comparisons of situations before and after the
introduction or discontinuation of functional programming. Evidence
drawn from a single person's experience may be sufficient, but more
weight will be given to evidence drawn from the experience of groups
of people.
An Experience Report should be short and to the point: make a claim
about how well functional programming worked on your project and why,
and produce evidence to substantiate your claim. If functional
programming worked for you in the same ways it has worked for others,
you need only to summarize the results?the main part of your paper
should discuss how well it worked and in what context. Most readers
will not want to know all the details of your project and its
implementation, but please characterize your project and its context
well enough so that readers can judge to what degree your experience
is relevant to their own projects. Be especially careful to highlight
any unusual aspects of your project. Also keep in mind that specifics
about your project are more valuable than generalities about
functional programming; for example, it is more valuable to say that
your team delivered its software a month ahead of schedule than it is
to say that functional programming made your team more productive.
If your paper not only describes experience but also presents new
technical results, or if your experience refutes cherished beliefs of
the functional-programming community, you may be better off submitting
it as a full paper, which will be judged by the usual criteria of
novelty, originality, and relevance. If you are unsure in which
category to submit, the program chair will be happy to help you
decide.
Organizers
----------
General Co-Chairs:
Jacques Garrigue (Nagoya University)
Gabriele Keller (University of New South Wales)
Program Chair:
Eijiro Sumii (Tohoku University)
Program Committee:
Koen Claessen (Chalmers University of Technology)
Joshua Dunfield (University of British Columbia, Canada)
Matthew Fluet (Rochester Institute of Technology)
Nate Foster (Cornell University)
Dan Grossman (University of Washington, USA)
Jurriaan Hage (Utrecht University)
Roman Leshchinskiy (Standard Chartered Bank)
Keisuke Nakano (The University of Electro-Communications)
Aleksandar Nanevski (IMDEA Software Institute)
Scott Owens (University of Kent)
Sungwoo Park (Pohang University of Science and Technology)
Amr Sabry (Indiana University)
Tom Schrijvers (KU Leuven)
Olin Shivers (Northeastern University)
Walid Taha (Halmstad University)
Dimitrios Vytiniotis (Microsoft Research, Cambridge)
David Walker (Princeton University)
Nobuko Yoshida (Imperial College London, UK)
External Review Committee to be announced.
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
[Caml-list] FSCD'16 Second Call for Papers
SECOND CALL FOR PAPERS
First International Conference on Formal Structures for
Computation and Deduction (FSCD'16)
22 June -- 26 June 2016, Porto, Portugal
http://fscd2016.dcc.fc.up.pt/
[NEW: INVITED SPEAKERS, CONFERENCE AWARDS, SPECIAL ISSUE, SATELLITE EVENTS]
==========================================================================
IMPORTANT DATES
Abstract Submission: 29 January 2016
Paper Submission : 5 February 2016
Rebuttal : 21 - 23 March 2016
Notification : 6 April 2016
==========================================================================
FSCD (http://fscdconference.org/) covers all aspects of formal
structures for computation and deduction from theoretical foundations
to applications. Building on two communities, RTA (Rewriting
Techniques and Applications) and TLCA (Typed Lambda Calculi and
Applications), FSCD embraces their core topics and broadens their
scope to closely related areas in logics, proof theory and new
emerging models of computation such as quantum computing and homotopy
type theory. The name of the new conference comes from an unpublished
but important book by Gerard Huet that strongly influenced many
researchers in the area.
Suggested, but not exclusive, list of topics for submission are:
1 Calculi
* Lambda calculus
* Logics (first-order, higher-order, equational, modal, linear,
classical, constructive, etc.)
* Rewriting systems (string, term, higher-order, graph, conditional,
modulo, infinitary, etc.)
* Proof theory (natural deduction, sequent calculus, proof nets, etc.)
* Type theory and logical frameworks
* Homotopy type theory
2. Methods in Computation and Deduction
* Type systems (polymorphism, dependent, recursive, intersection,
session, etc.)
* Induction, coinduction
* Matching, unification, completion, orderings
* Strategies (normalization, completeness, etc.)
* Tree automata
* Model building and model checking
* Proof search (resolution, paramodulation, narrowing, focusing, etc.)
* Constraint solving and decision procedures
3. Semantics
* Operational semantics and abstract machines
* Game Semantics and applications
* Domain theory and categorical models
* Quantitative models (timing, probabilities, resources, etc.)
* Quantum computation and emerging models in computation
4. Algorithmic Analysis and Transformations of Formal Systems
* Type Inference and type checking
* Abstract Interpretation
* Complexity analysis and implicit computational complexity
* Checking termination, confluence, derivational complexity and
related properties
* Symbolic computation
5. Tools and Applications
* Programming and proof environments (proof assistants, automated
theorem prover, proof checkers, specialized provers, dependently
typed languages, etc.)
* Verification tools (abstract interpretation, termination,
confluence, specialized provers, etc.)
* Libraries for proof assistants and interactive theorem provers
(support for variable bindings, nominal, polynomial, equality, etc.)
* Case studies in proof assistants and interactive theorem provers
(formalizations, mechanizations, certifications)
* Certifications (theorems, rewriting techniques, etc.)
* Applications of formal systems inside and outside of CS (biology,
linguistics, physics, education, etc.)
INVITED SPEAKERS
Amal Ahmed (USA)
Ichiro Hasuo (Japan)
Gerard Huet (France)
Tobias Nipkow (Germany)
PROGRAM CHAIRS
Delia Kesner (Univ. Paris-Diderot)
Brigitte Pientka (McGill University)
fscd16@easychair.org
PROGRAM COMMITTEE
Andreas Abel (Gothenburg Univ.)
Zena Ariola (Univ. Oregon)
Patrick Baillot (CNRS & ENS Lyon)
Andrej Bauer (Univ. Ljubljana)
Eduardo Bonelli (Univ. Quilmes)
Patricia Bouyer (ENS Cachan)
Ugo Dal Lago (Univ. Bologna)
Nachum Dershowitz (Univ. Tel Aviv)
Mariangiola Dezani-Ciancaglini (Univ. Torino)
Derek Dreyer (MPI-SWS)
Santiago Figueira (Univ. Buenos Aires)
Marcelo Fiore (Univ. Cambridge)
Juergen Giesl (Univ. Aachen)
Nao Hirokawa (JAIST)
Martin Hofmann (LMU Munchen)
Delia Kesner (Univ. Paris-Diderot)
Naoki Kobayashi (Univ. Tokyo)
Dan Licata (Wesleyan Univ.)
Chris Lynch (Clarkson Univ.)
Narciso Marti-Oliet (Univ. Complutense)
Aart Middeldorp (Univ. Innsbruck)
Dale Miller (INRIA Saclay)
Cesar Munoz (NASA)
Vivek Nigam (Univ. Paraiba)
Brigitte Pientka (McGill Univ.)
Jakob Rehof (Univ. Dortmund)
Xavier Rival (ENS Paris)
Peter Selinger (Dalhousie Univ.)
Paula Severi (Univ. Leicester)
Jakob Grue Simonsen (Univ. Copenhagen)
Matthieu Sozeau (INRIA Rocquencourt)
Sophie Tison (Univ. Lille)
Femke van Raamsdonk (VU Univ. Amsterdam)
Nobuko Yoshida (Imperial College)
CONFERENCE CHAIR
Sandra Alves (University of Porto)
FSCD STEERING COMMITTEE:
Thorsten Altenkirch (Univ. Nottingham)
Gilles Dowek (INRIA)
Santiago Escobar (Univ. Politecnica de Valencia)
Maribel Fernandez (King's College London)
Masahito Hasegawa (Univ. Kyoto)
Hugo Herbelin (INRIA)
Nao Hirokawa (JAIST)
Luke Ong (Chair, Univ. Oxford)
Jens Palsberg (UCLA)
Kristoffer Rose (Two Sigma Investments)
Rene Thiemann (Univ. Innsbruck)
Pawel Urzyczyn (Univ. Warsaw)
Femke van Raamsdonk (VU Univ. Amsterdam)
PUBLICATION
The proceedings will be published as an electronic volume in the
Leibniz International Proceedings in Informatics (LIPIcs). All LIPIcs
proceedings are open access.
SUBMISSION GUIDELINES
Submissions can be made in two categories: regular research papers and
system descriptions.
Submissions of research papers must present original research which is
unpublished and not submitted elsewhere. They must not exceed 15 pages
(including figures and bibliography). Submissions of research papers
will be judged on originality, significance, correctness, and readability.
Submission of system descriptions must describe a working system which
has not been published or submitted elsewhere. They must not exceed 10
pages and should contain a link to a working system. System
descriptions will be judged on originality, significance, usefulness,
and readability.
Proofs of theoretical results that do not fit within the page limit,
executables of systems, code of case studies, benchmarks used to
evaluate a given system, should be made available, via a reference to
a website or in an appendix of the paper. Reviewers will be encouraged
to consider this additional material, but are not obliged
to. Submissions must be self-contained within the respective page
limit; considering the additional material should not be necessary to
assess the merits of a submission.
Submissions must be formatted using the LIPIcs style files using the
instructions at
http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/
A condition of submission is that, if accepted, one of the authors
must attend the conference to give the presentation.
Papers should be submitted via easychair. The submission site is at
https://easychair.org/conferences/?conf=fscd16
CONFERENCE AWARDS
Two awards will be selected: one for the best paper and another one for
the best student paper.
SPECIAL ISSUE
After the conference, authors of selected papers will be invited to submit
extended versions of their work to a special issue published in the
open-access
journal Logical Methods in Computer Science (LMCS).
SATELLITE EVENTS
The following meetings and workshops are colocated with FSCD 2016:
CL&C, DCM, HDRA, HOR, IFIP Working Group 1.6, ITRS, Linearity, LFMTP,
LSFA, UNIF, WPTE, WWV.
ORGANISING COMMITTEE
Sandra Alves (Univ. Porto)
Sabine Broda (Univ. Porto)
Jose Espirito-Santo (Univ. do Minho)
Mario Florido (Univ. Porto)
Nelma Moreira (Univ. Porto)
Luis Pinto (Univ. do Minho)
Rogerio Reis (Univ. Porto)
Ana Paula Tomas (Univ. Porto)
Pedro Vasconcelos (Univ. Porto)
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
First International Conference on Formal Structures for
Computation and Deduction (FSCD'16)
22 June -- 26 June 2016, Porto, Portugal
http://fscd2016.dcc.fc.up.pt/
[NEW: INVITED SPEAKERS, CONFERENCE AWARDS, SPECIAL ISSUE, SATELLITE EVENTS]
==========================================================================
IMPORTANT DATES
Abstract Submission: 29 January 2016
Paper Submission : 5 February 2016
Rebuttal : 21 - 23 March 2016
Notification : 6 April 2016
==========================================================================
FSCD (http://fscdconference.org/) covers all aspects of formal
structures for computation and deduction from theoretical foundations
to applications. Building on two communities, RTA (Rewriting
Techniques and Applications) and TLCA (Typed Lambda Calculi and
Applications), FSCD embraces their core topics and broadens their
scope to closely related areas in logics, proof theory and new
emerging models of computation such as quantum computing and homotopy
type theory. The name of the new conference comes from an unpublished
but important book by Gerard Huet that strongly influenced many
researchers in the area.
Suggested, but not exclusive, list of topics for submission are:
1 Calculi
* Lambda calculus
* Logics (first-order, higher-order, equational, modal, linear,
classical, constructive, etc.)
* Rewriting systems (string, term, higher-order, graph, conditional,
modulo, infinitary, etc.)
* Proof theory (natural deduction, sequent calculus, proof nets, etc.)
* Type theory and logical frameworks
* Homotopy type theory
2. Methods in Computation and Deduction
* Type systems (polymorphism, dependent, recursive, intersection,
session, etc.)
* Induction, coinduction
* Matching, unification, completion, orderings
* Strategies (normalization, completeness, etc.)
* Tree automata
* Model building and model checking
* Proof search (resolution, paramodulation, narrowing, focusing, etc.)
* Constraint solving and decision procedures
3. Semantics
* Operational semantics and abstract machines
* Game Semantics and applications
* Domain theory and categorical models
* Quantitative models (timing, probabilities, resources, etc.)
* Quantum computation and emerging models in computation
4. Algorithmic Analysis and Transformations of Formal Systems
* Type Inference and type checking
* Abstract Interpretation
* Complexity analysis and implicit computational complexity
* Checking termination, confluence, derivational complexity and
related properties
* Symbolic computation
5. Tools and Applications
* Programming and proof environments (proof assistants, automated
theorem prover, proof checkers, specialized provers, dependently
typed languages, etc.)
* Verification tools (abstract interpretation, termination,
confluence, specialized provers, etc.)
* Libraries for proof assistants and interactive theorem provers
(support for variable bindings, nominal, polynomial, equality, etc.)
* Case studies in proof assistants and interactive theorem provers
(formalizations, mechanizations, certifications)
* Certifications (theorems, rewriting techniques, etc.)
* Applications of formal systems inside and outside of CS (biology,
linguistics, physics, education, etc.)
INVITED SPEAKERS
Amal Ahmed (USA)
Ichiro Hasuo (Japan)
Gerard Huet (France)
Tobias Nipkow (Germany)
PROGRAM CHAIRS
Delia Kesner (Univ. Paris-Diderot)
Brigitte Pientka (McGill University)
fscd16@easychair.org
PROGRAM COMMITTEE
Andreas Abel (Gothenburg Univ.)
Zena Ariola (Univ. Oregon)
Patrick Baillot (CNRS & ENS Lyon)
Andrej Bauer (Univ. Ljubljana)
Eduardo Bonelli (Univ. Quilmes)
Patricia Bouyer (ENS Cachan)
Ugo Dal Lago (Univ. Bologna)
Nachum Dershowitz (Univ. Tel Aviv)
Mariangiola Dezani-Ciancaglini (Univ. Torino)
Derek Dreyer (MPI-SWS)
Santiago Figueira (Univ. Buenos Aires)
Marcelo Fiore (Univ. Cambridge)
Juergen Giesl (Univ. Aachen)
Nao Hirokawa (JAIST)
Martin Hofmann (LMU Munchen)
Delia Kesner (Univ. Paris-Diderot)
Naoki Kobayashi (Univ. Tokyo)
Dan Licata (Wesleyan Univ.)
Chris Lynch (Clarkson Univ.)
Narciso Marti-Oliet (Univ. Complutense)
Aart Middeldorp (Univ. Innsbruck)
Dale Miller (INRIA Saclay)
Cesar Munoz (NASA)
Vivek Nigam (Univ. Paraiba)
Brigitte Pientka (McGill Univ.)
Jakob Rehof (Univ. Dortmund)
Xavier Rival (ENS Paris)
Peter Selinger (Dalhousie Univ.)
Paula Severi (Univ. Leicester)
Jakob Grue Simonsen (Univ. Copenhagen)
Matthieu Sozeau (INRIA Rocquencourt)
Sophie Tison (Univ. Lille)
Femke van Raamsdonk (VU Univ. Amsterdam)
Nobuko Yoshida (Imperial College)
CONFERENCE CHAIR
Sandra Alves (University of Porto)
FSCD STEERING COMMITTEE:
Thorsten Altenkirch (Univ. Nottingham)
Gilles Dowek (INRIA)
Santiago Escobar (Univ. Politecnica de Valencia)
Maribel Fernandez (King's College London)
Masahito Hasegawa (Univ. Kyoto)
Hugo Herbelin (INRIA)
Nao Hirokawa (JAIST)
Luke Ong (Chair, Univ. Oxford)
Jens Palsberg (UCLA)
Kristoffer Rose (Two Sigma Investments)
Rene Thiemann (Univ. Innsbruck)
Pawel Urzyczyn (Univ. Warsaw)
Femke van Raamsdonk (VU Univ. Amsterdam)
PUBLICATION
The proceedings will be published as an electronic volume in the
Leibniz International Proceedings in Informatics (LIPIcs). All LIPIcs
proceedings are open access.
SUBMISSION GUIDELINES
Submissions can be made in two categories: regular research papers and
system descriptions.
Submissions of research papers must present original research which is
unpublished and not submitted elsewhere. They must not exceed 15 pages
(including figures and bibliography). Submissions of research papers
will be judged on originality, significance, correctness, and readability.
Submission of system descriptions must describe a working system which
has not been published or submitted elsewhere. They must not exceed 10
pages and should contain a link to a working system. System
descriptions will be judged on originality, significance, usefulness,
and readability.
Proofs of theoretical results that do not fit within the page limit,
executables of systems, code of case studies, benchmarks used to
evaluate a given system, should be made available, via a reference to
a website or in an appendix of the paper. Reviewers will be encouraged
to consider this additional material, but are not obliged
to. Submissions must be self-contained within the respective page
limit; considering the additional material should not be necessary to
assess the merits of a submission.
Submissions must be formatted using the LIPIcs style files using the
instructions at
http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/
A condition of submission is that, if accepted, one of the authors
must attend the conference to give the presentation.
Papers should be submitted via easychair. The submission site is at
https://easychair.org/conferences/?conf=fscd16
CONFERENCE AWARDS
Two awards will be selected: one for the best paper and another one for
the best student paper.
SPECIAL ISSUE
After the conference, authors of selected papers will be invited to submit
extended versions of their work to a special issue published in the
open-access
journal Logical Methods in Computer Science (LMCS).
SATELLITE EVENTS
The following meetings and workshops are colocated with FSCD 2016:
CL&C, DCM, HDRA, HOR, IFIP Working Group 1.6, ITRS, Linearity, LFMTP,
LSFA, UNIF, WPTE, WWV.
ORGANISING COMMITTEE
Sandra Alves (Univ. Porto)
Sabine Broda (Univ. Porto)
Jose Espirito-Santo (Univ. do Minho)
Mario Florido (Univ. Porto)
Nelma Moreira (Univ. Porto)
Luis Pinto (Univ. do Minho)
Rogerio Reis (Univ. Porto)
Ana Paula Tomas (Univ. Porto)
Pedro Vasconcelos (Univ. Porto)
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
2015-12-06
[Caml-list] ICFP 2016 Call for Papers
ICFP 2016
The 21st ACM SIGPLAN International Conference on Functional Programming
http://conf.researchr.org/home/icfp-2016
Call for Papers
Important dates
---------------
Submissions due: Wednesday, March 16 2016, 15:00 (UTC)
https://icfp2016.hotcrp.com
(in preparation as of December 1)
Author response: Monday, 2 May, 2016, 15:00 (UTC) -
Thursday, 5 May, 2016, 15:00 (UTC)
Notification: Friday, 20 May, 2016
Final copy due: TBA
Early registration: TBA
Conference: Tuesday, 20 September -
Thursday, 22 September, 2016
Scope
-----
ICFP 2016 seeks original papers on the art and science of functional
programming. Submissions are invited on all topics from principles to
practice, from foundations to features, and from abstraction to
application. The scope includes all languages that encourage
functional programming, including both purely applicative and
imperative languages, as well as languages with objects, concurrency,
or parallelism. Topics of interest include (but are not limited to):
- Language Design: concurrency, parallelism, and distribution;
modules; components and composition; metaprogramming; type systems;
interoperability; domain-specific languages; and relations to
imperative, object-oriented, or logic programming.
- Implementation: abstract machines; virtual machines; interpretation;
compilation; compile-time and run-time optimization; garbage
collection and memory management; multi-threading; exploiting
parallel hardware; interfaces to foreign functions, services,
components, or low-level machine resources.
- Software-Development Techniques: algorithms and data structures;
design patterns; specification; verification; validation; proof
assistants; debugging; testing; tracing; profiling.
- Foundations: formal semantics; lambda calculus; rewriting; type
theory; monads; continuations; control; state; effects; program
verification; dependent types.
- Analysis and Transformation: control-flow; data-flow; abstract
interpretation; partial evaluation; program calculation.
- Applications: symbolic computing; formal-methods tools; artificial
intelligence; systems programming; distributed-systems and web
programming; hardware design; databases; XML processing; scientific
and numerical computing; graphical user interfaces; multimedia and
3D graphics programming; scripting; system administration; security.
- Education: teaching introductory programming; parallel programming;
mathematical proof; algebra.
- Functional Pearls: elegant, instructive, and fun essays on
functional programming.
- Experience Reports: short papers that provide evidence that
functional programming really works or describe obstacles that have
kept it from working.
If you are concerned about the appropriateness of some topic, do not
hesitate to contact the program chair.
Abbreviated instructions for authors
------------------------------------
- By Wednesday, March 16 2016, 15:00 (UTC), submit a full paper of at
most 12 pages (6 pages for an Experience Report), in standard
SIGPLAN conference format, including figures but ***excluding
bibliography***.
The deadlines will be strictly enforced and papers exceeding the page
limits will be summarily rejected.
***ICFP 2016 will employ a lightweight double-blind reviewing
process.*** To facilitate this, submitted papers must adhere to two
rules:
1. ***author names and institutions must be omitted***, and
2. ***references to authors' own related work should be in the third
person*** (e.g., not "We build on our previous work ..." but
rather "We build on the work of ...").
The purpose of this process is to help the PC and external reviewers
come to an initial judgement about the paper without bias, not to make
it impossible for them to discover the authors if they were to
try. Nothing should be done in the name of anonymity that weakens the
submission or makes the job of reviewing the paper more difficult
(e.g., important background references should not be omitted or
anonymized). In addition, authors should feel free to disseminate
their ideas or draft versions of their paper as they normally
would. For instance, authors may post drafts of their papers on the
web or give talks on their research ideas. We have put together a
document answering frequently asked questions that should address many
common concerns:
http://conf.researchr.org/track/icfp-2016/icfp-2016-papers#Submission-and-Reviewing-FAQ
- Authors have the option to attach supplementary material to a
submission, on the understanding that reviewers may choose not to
look at it. The material should be uploaded at submission time, as a
single pdf or a tarball, not via a URL. This supplementary material
may or may not be anonymized; if not anonymized, it will only be
revealed to reviewers after they have submitted their review of your
paper and learned your identity.
- Each submission must adhere to SIGPLAN's republication policy, as
explained on the web at:
http://www.sigplan.org/Resources/Policies/Republication
- Authors of resubmitted (but previously rejected) papers have the
option to attach an annotated copy of the reviews of their previous
submission(s), explaining how they have addressed these previous
reviews in the present submission. If a reviewer identifies
him/herself as a reviewer of this previous submission and wishes to
see how his/her comments have been addressed, the program chair will
communicate to this reviewer the annotated copy of his/her previous
review. Otherwise, no reviewer will read the annotated copies of the
previous reviews.
Overall, a submission will be evaluated according to its relevance,
correctness, significance, originality, and clarity. It should explain
its contributions in both general and technical terms, clearly
identifying what has been accomplished, explaining why it is
significant, and comparing it with previous work. The technical
content should be accessible to a broad audience. Functional Pearls
and Experience Reports are separate categories of papers that need not
report original research results and must be marked as such at the
time of submission. Detailed guidelines on both categories are given
below.
Presentations will be videotaped and released online if the presenter
consents. The proceedings will be freely available for download from
the ACM Digital Library from at least one week before the start of the
conference until two weeks after the conference.
Formatting: Submissions must be in PDF format printable in black and
white on US Letter sized paper and interpretable by
Ghostscript. Papers must adhere to the standard SIGPLAN conference
format: two columns, nine-point font on a ten-point baseline, with
columns 20pc (3.33in) wide and 54pc (9in) tall, with a column gutter
of 2pc (0.33in). A suitable document template for LaTeX is available
at http://www.sigplan.org/Resources/Author/
Submission: Submissions will be accepted at
https://icfp2016.hotcrp.com (in preparation as of December 1).
Improved versions of a paper may be submitted at any point before the
submission deadline using the same web interface.
Author response: Authors will have a 72-hour period, starting at 15:00
UTC on Monday, 2 May, 2016, to read reviews and respond to them.
ACM Author-Izer is a unique service that enables ACM authors to
generate and post links on either their home page or institutional
repository for visitors to download the definitive version of their
articles from the ACM Digital Library at no charge. Downloads through
Author-Izer links are captured in official ACM statistics, improving
the accuracy of usage and impact measurements. Consistently linking
the definitive version of ACM article should reduce user confusion
over article versioning. After your article has been published and
assigned to your ACM Author Profile page, please visit
http://www.acm.org/publications/acm-author-izer-service to learn how
to create your links for free downloads from the ACM DL.
Publication date: The official publication date of accepted papers is
the date the proceedings are made available in the ACM Digital
Library. This date may be up to two weeks prior to the first day of
the conference. The official publication date affects the deadline for
any patent filings related to published work.
Special categories of papers
----------------------------
In addition to research papers, ICFP solicits two kinds of papers that
do not require original research contributions: Functional Pearls,
which are full papers, and Experience Reports, which are limited to
six pages. Authors submitting such papers may wish to consider the
following advice.
Functional Pearls
=================
A Functional Pearl is an elegant essay about something related to
functional programming. Examples include, but are not limited to:
- a new and thought-provoking way of looking at an old idea
- an instructive example of program calculation or proof
- a nifty presentation of an old or new data structure
- an interesting application of functional programming techniques
- a novel use or exposition of functional programming in the classroom
While pearls often demonstrate an idea through the development of a
short program, there is no requirement or expectation that they do
so. Thus, they encompass the notions of theoretical and educational
pearls.
Functional Pearls are valued as highly and judged as rigorously as
ordinary papers, but using somewhat different criteria. In particular,
a pearl is not required to report original research, but, it should be
concise, instructive, and entertaining. Your pearl is likely to be
rejected if your readers get bored, if the material gets too
complicated, if too much specialized knowledge is needed, or if the
writing is inelegant. The key to writing a good pearl is polishing.
A submission you wish to have treated as a pearl must be marked as
such on the submission web page, and should contain the words
``Functional Pearl'' somewhere in its title or subtitle. These steps
will alert reviewers to use the appropriate evaluation
criteria. Pearls will be combined with ordinary papers, however, for
the purpose of computing the conference's acceptance rate.
Experience Reports
==================
The purpose of an Experience Report is to help create a body of
published, refereed, citable evidence that functional programming
really works -- or to describe what obstacles prevent it from working.
Possible topics for an Experience Report include, but are not limited
to:
- insights gained from real-world projects using functional
programming
- comparison of functional programming with conventional programming
in the context of an industrial project or a university curriculum
- project-management, business, or legal issues encountered when using
functional programming in a real-world project
- curricular issues encountered when using functional programming in
education
- real-world constraints that created special challenges for an
implementation of a functional language or for functional
programming in general
An Experience Report is distinguished from a normal ICFP paper by its
title, by its length, and by the criteria used to evaluate it.
- Both in the proceedings and in any citations, the title of each
accepted Experience Report must begin with the words ``Experience
Report'' followed by a colon. The acceptance rate for Experience
Reports will be computed and reported separately from the rate for
ordinary papers.
- An Experience Report is at most six pages long. Each accepted
Experience Report will be presented at the conference, but depending
on the number of Experience Reports and regular papers accepted,
authors of Experience reports may be asked to give shorter talks.
- Because the purpose of Experience Reports is to enable our community
to accumulate a body of evidence about the efficacy of functional
programming, an acceptable Experience Report need not add to the
body of knowledge of the functional-programming community by
presenting novel results or conclusions. It is sufficient if the
Report states a clear thesis and provides supporting evidence. The
thesis must be relevant to ICFP, but it need not be novel.
The program committee will accept or reject Experience Reports based
on whether they judge the evidence to be convincing. Anecdotal
evidence will be acceptable provided it is well argued and the author
explains what efforts were made to gather as much evidence as
possible. Typically, more convincing evidence is obtained from papers
which show how functional programming was used than from papers which
only say that functional programming was used. The most convincing
evidence often includes comparisons of situations before and after the
introduction or discontinuation of functional programming. Evidence
drawn from a single person's experience may be sufficient, but more
weight will be given to evidence drawn from the experience of groups
of people.
An Experience Report should be short and to the point: make a claim
about how well functional programming worked on your project and why,
and produce evidence to substantiate your claim. If functional
programming worked for you in the same ways it has worked for others,
you need only to summarize the results?the main part of your paper
should discuss how well it worked and in what context. Most readers
will not want to know all the details of your project and its
implementation, but please characterize your project and its context
well enough so that readers can judge to what degree your experience
is relevant to their own projects. Be especially careful to highlight
any unusual aspects of your project. Also keep in mind that specifics
about your project are more valuable than generalities about
functional programming; for example, it is more valuable to say that
your team delivered its software a month ahead of schedule than it is
to say that functional programming made your team more productive.
If your paper not only describes experience but also presents new
technical results, or if your experience refutes cherished beliefs of
the functional-programming community, you may be better off submitting
it as a full paper, which will be judged by the usual criteria of
novelty, originality, and relevance. If you are unsure in which
category to submit, the program chair will be happy to help you
decide.
Organizers
----------
General Co-Chairs:
Jacques Garrigue (Nagoya University)
Gabriele Keller (University of New South Wales)
Program Chair:
Eijiro Sumii (Tohoku University)
Program Committee:
Koen Claessen (Chalmers University of Technology)
Joshua Dunfield (University of British Columbia, Canada)
Matthew Fluet (Rochester Institute of Technology)
Nate Foster (Cornell University)
Dan Grossman (University of Washington, USA)
Jurriaan Hage (Utrecht University)
Roman Leshchinskiy (Standard Chartered Bank)
Keisuke Nakano (The University of Electro-Communications)
Aleksandar Nanevski (IMDEA Software Institute)
Scott Owens (University of Kent)
Sungwoo Park (Pohang University of Science and Technology)
Amr Sabry (Indiana University)
Tom Schrijvers (KU Leuven)
Olin Shivers (Northeastern University)
Walid Taha (Halmstad University)
Dimitrios Vytiniotis (Microsoft Research, Cambridge)
David Walker (Princeton University)
Nobuko Yoshida (Imperial College London, UK)
External Review Committee to be announced.
The 21st ACM SIGPLAN International Conference on Functional Programming
http://conf.researchr.org/home/icfp-2016
Call for Papers
Important dates
---------------
Submissions due: Wednesday, March 16 2016, 15:00 (UTC)
https://icfp2016.hotcrp.com
(in preparation as of December 1)
Author response: Monday, 2 May, 2016, 15:00 (UTC) -
Thursday, 5 May, 2016, 15:00 (UTC)
Notification: Friday, 20 May, 2016
Final copy due: TBA
Early registration: TBA
Conference: Tuesday, 20 September -
Thursday, 22 September, 2016
Scope
-----
ICFP 2016 seeks original papers on the art and science of functional
programming. Submissions are invited on all topics from principles to
practice, from foundations to features, and from abstraction to
application. The scope includes all languages that encourage
functional programming, including both purely applicative and
imperative languages, as well as languages with objects, concurrency,
or parallelism. Topics of interest include (but are not limited to):
- Language Design: concurrency, parallelism, and distribution;
modules; components and composition; metaprogramming; type systems;
interoperability; domain-specific languages; and relations to
imperative, object-oriented, or logic programming.
- Implementation: abstract machines; virtual machines; interpretation;
compilation; compile-time and run-time optimization; garbage
collection and memory management; multi-threading; exploiting
parallel hardware; interfaces to foreign functions, services,
components, or low-level machine resources.
- Software-Development Techniques: algorithms and data structures;
design patterns; specification; verification; validation; proof
assistants; debugging; testing; tracing; profiling.
- Foundations: formal semantics; lambda calculus; rewriting; type
theory; monads; continuations; control; state; effects; program
verification; dependent types.
- Analysis and Transformation: control-flow; data-flow; abstract
interpretation; partial evaluation; program calculation.
- Applications: symbolic computing; formal-methods tools; artificial
intelligence; systems programming; distributed-systems and web
programming; hardware design; databases; XML processing; scientific
and numerical computing; graphical user interfaces; multimedia and
3D graphics programming; scripting; system administration; security.
- Education: teaching introductory programming; parallel programming;
mathematical proof; algebra.
- Functional Pearls: elegant, instructive, and fun essays on
functional programming.
- Experience Reports: short papers that provide evidence that
functional programming really works or describe obstacles that have
kept it from working.
If you are concerned about the appropriateness of some topic, do not
hesitate to contact the program chair.
Abbreviated instructions for authors
------------------------------------
- By Wednesday, March 16 2016, 15:00 (UTC), submit a full paper of at
most 12 pages (6 pages for an Experience Report), in standard
SIGPLAN conference format, including figures but ***excluding
bibliography***.
The deadlines will be strictly enforced and papers exceeding the page
limits will be summarily rejected.
***ICFP 2016 will employ a lightweight double-blind reviewing
process.*** To facilitate this, submitted papers must adhere to two
rules:
1. ***author names and institutions must be omitted***, and
2. ***references to authors' own related work should be in the third
person*** (e.g., not "We build on our previous work ..." but
rather "We build on the work of ...").
The purpose of this process is to help the PC and external reviewers
come to an initial judgement about the paper without bias, not to make
it impossible for them to discover the authors if they were to
try. Nothing should be done in the name of anonymity that weakens the
submission or makes the job of reviewing the paper more difficult
(e.g., important background references should not be omitted or
anonymized). In addition, authors should feel free to disseminate
their ideas or draft versions of their paper as they normally
would. For instance, authors may post drafts of their papers on the
web or give talks on their research ideas. We have put together a
document answering frequently asked questions that should address many
common concerns:
http://conf.researchr.org/track/icfp-2016/icfp-2016-papers#Submission-and-Reviewing-FAQ
- Authors have the option to attach supplementary material to a
submission, on the understanding that reviewers may choose not to
look at it. The material should be uploaded at submission time, as a
single pdf or a tarball, not via a URL. This supplementary material
may or may not be anonymized; if not anonymized, it will only be
revealed to reviewers after they have submitted their review of your
paper and learned your identity.
- Each submission must adhere to SIGPLAN's republication policy, as
explained on the web at:
http://www.sigplan.org/Resources/Policies/Republication
- Authors of resubmitted (but previously rejected) papers have the
option to attach an annotated copy of the reviews of their previous
submission(s), explaining how they have addressed these previous
reviews in the present submission. If a reviewer identifies
him/herself as a reviewer of this previous submission and wishes to
see how his/her comments have been addressed, the program chair will
communicate to this reviewer the annotated copy of his/her previous
review. Otherwise, no reviewer will read the annotated copies of the
previous reviews.
Overall, a submission will be evaluated according to its relevance,
correctness, significance, originality, and clarity. It should explain
its contributions in both general and technical terms, clearly
identifying what has been accomplished, explaining why it is
significant, and comparing it with previous work. The technical
content should be accessible to a broad audience. Functional Pearls
and Experience Reports are separate categories of papers that need not
report original research results and must be marked as such at the
time of submission. Detailed guidelines on both categories are given
below.
Presentations will be videotaped and released online if the presenter
consents. The proceedings will be freely available for download from
the ACM Digital Library from at least one week before the start of the
conference until two weeks after the conference.
Formatting: Submissions must be in PDF format printable in black and
white on US Letter sized paper and interpretable by
Ghostscript. Papers must adhere to the standard SIGPLAN conference
format: two columns, nine-point font on a ten-point baseline, with
columns 20pc (3.33in) wide and 54pc (9in) tall, with a column gutter
of 2pc (0.33in). A suitable document template for LaTeX is available
at http://www.sigplan.org/Resources/Author/
Submission: Submissions will be accepted at
https://icfp2016.hotcrp.com (in preparation as of December 1).
Improved versions of a paper may be submitted at any point before the
submission deadline using the same web interface.
Author response: Authors will have a 72-hour period, starting at 15:00
UTC on Monday, 2 May, 2016, to read reviews and respond to them.
ACM Author-Izer is a unique service that enables ACM authors to
generate and post links on either their home page or institutional
repository for visitors to download the definitive version of their
articles from the ACM Digital Library at no charge. Downloads through
Author-Izer links are captured in official ACM statistics, improving
the accuracy of usage and impact measurements. Consistently linking
the definitive version of ACM article should reduce user confusion
over article versioning. After your article has been published and
assigned to your ACM Author Profile page, please visit
http://www.acm.org/publications/acm-author-izer-service to learn how
to create your links for free downloads from the ACM DL.
Publication date: The official publication date of accepted papers is
the date the proceedings are made available in the ACM Digital
Library. This date may be up to two weeks prior to the first day of
the conference. The official publication date affects the deadline for
any patent filings related to published work.
Special categories of papers
----------------------------
In addition to research papers, ICFP solicits two kinds of papers that
do not require original research contributions: Functional Pearls,
which are full papers, and Experience Reports, which are limited to
six pages. Authors submitting such papers may wish to consider the
following advice.
Functional Pearls
=================
A Functional Pearl is an elegant essay about something related to
functional programming. Examples include, but are not limited to:
- a new and thought-provoking way of looking at an old idea
- an instructive example of program calculation or proof
- a nifty presentation of an old or new data structure
- an interesting application of functional programming techniques
- a novel use or exposition of functional programming in the classroom
While pearls often demonstrate an idea through the development of a
short program, there is no requirement or expectation that they do
so. Thus, they encompass the notions of theoretical and educational
pearls.
Functional Pearls are valued as highly and judged as rigorously as
ordinary papers, but using somewhat different criteria. In particular,
a pearl is not required to report original research, but, it should be
concise, instructive, and entertaining. Your pearl is likely to be
rejected if your readers get bored, if the material gets too
complicated, if too much specialized knowledge is needed, or if the
writing is inelegant. The key to writing a good pearl is polishing.
A submission you wish to have treated as a pearl must be marked as
such on the submission web page, and should contain the words
``Functional Pearl'' somewhere in its title or subtitle. These steps
will alert reviewers to use the appropriate evaluation
criteria. Pearls will be combined with ordinary papers, however, for
the purpose of computing the conference's acceptance rate.
Experience Reports
==================
The purpose of an Experience Report is to help create a body of
published, refereed, citable evidence that functional programming
really works -- or to describe what obstacles prevent it from working.
Possible topics for an Experience Report include, but are not limited
to:
- insights gained from real-world projects using functional
programming
- comparison of functional programming with conventional programming
in the context of an industrial project or a university curriculum
- project-management, business, or legal issues encountered when using
functional programming in a real-world project
- curricular issues encountered when using functional programming in
education
- real-world constraints that created special challenges for an
implementation of a functional language or for functional
programming in general
An Experience Report is distinguished from a normal ICFP paper by its
title, by its length, and by the criteria used to evaluate it.
- Both in the proceedings and in any citations, the title of each
accepted Experience Report must begin with the words ``Experience
Report'' followed by a colon. The acceptance rate for Experience
Reports will be computed and reported separately from the rate for
ordinary papers.
- An Experience Report is at most six pages long. Each accepted
Experience Report will be presented at the conference, but depending
on the number of Experience Reports and regular papers accepted,
authors of Experience reports may be asked to give shorter talks.
- Because the purpose of Experience Reports is to enable our community
to accumulate a body of evidence about the efficacy of functional
programming, an acceptable Experience Report need not add to the
body of knowledge of the functional-programming community by
presenting novel results or conclusions. It is sufficient if the
Report states a clear thesis and provides supporting evidence. The
thesis must be relevant to ICFP, but it need not be novel.
The program committee will accept or reject Experience Reports based
on whether they judge the evidence to be convincing. Anecdotal
evidence will be acceptable provided it is well argued and the author
explains what efforts were made to gather as much evidence as
possible. Typically, more convincing evidence is obtained from papers
which show how functional programming was used than from papers which
only say that functional programming was used. The most convincing
evidence often includes comparisons of situations before and after the
introduction or discontinuation of functional programming. Evidence
drawn from a single person's experience may be sufficient, but more
weight will be given to evidence drawn from the experience of groups
of people.
An Experience Report should be short and to the point: make a claim
about how well functional programming worked on your project and why,
and produce evidence to substantiate your claim. If functional
programming worked for you in the same ways it has worked for others,
you need only to summarize the results?the main part of your paper
should discuss how well it worked and in what context. Most readers
will not want to know all the details of your project and its
implementation, but please characterize your project and its context
well enough so that readers can judge to what degree your experience
is relevant to their own projects. Be especially careful to highlight
any unusual aspects of your project. Also keep in mind that specifics
about your project are more valuable than generalities about
functional programming; for example, it is more valuable to say that
your team delivered its software a month ahead of schedule than it is
to say that functional programming made your team more productive.
If your paper not only describes experience but also presents new
technical results, or if your experience refutes cherished beliefs of
the functional-programming community, you may be better off submitting
it as a full paper, which will be judged by the usual criteria of
novelty, originality, and relevance. If you are unsure in which
category to submit, the program chair will be happy to help you
decide.
Organizers
----------
General Co-Chairs:
Jacques Garrigue (Nagoya University)
Gabriele Keller (University of New South Wales)
Program Chair:
Eijiro Sumii (Tohoku University)
Program Committee:
Koen Claessen (Chalmers University of Technology)
Joshua Dunfield (University of British Columbia, Canada)
Matthew Fluet (Rochester Institute of Technology)
Nate Foster (Cornell University)
Dan Grossman (University of Washington, USA)
Jurriaan Hage (Utrecht University)
Roman Leshchinskiy (Standard Chartered Bank)
Keisuke Nakano (The University of Electro-Communications)
Aleksandar Nanevski (IMDEA Software Institute)
Scott Owens (University of Kent)
Sungwoo Park (Pohang University of Science and Technology)
Amr Sabry (Indiana University)
Tom Schrijvers (KU Leuven)
Olin Shivers (Northeastern University)
Walid Taha (Halmstad University)
Dimitrios Vytiniotis (Microsoft Research, Cambridge)
David Walker (Princeton University)
Nobuko Yoshida (Imperial College London, UK)
External Review Committee to be announced.
2015-11-30
[Caml-list] First Call for Papers: Special Issue of the SCP on Automated Verification of Critical Systems
Science of Computer Programming
Special Issue on Automated Verification of Critical Systems
First Call for Papers
Guest editors: Gudmund Grov & Andrew Ireland
Submission deadline: 20 May 2016
Notification: 31 August 2016
This special issue is devoted to the 15th international workshop on Automated Verification of Critical Systems (AVoCS 2015), hosted
in September 2015 by Heriot-Watt University in Edinburgh (UK):
https://sites.google.com/site/avocs15/
The aim of AVoCS is to contribute to the interaction and exchange of ideas among members of the international research community on tools
and techniques for the verification of critical systems. These topics are to be interpreted broadly and inclusively. It covers all aspects
of automated verification, and typical (but not exclusive) topics of interest are:
- Model Checking
- Automatic and Interactive Theorem Proving
- SAT, SMT or Constraint Solving for Verification
- Abstract Interpretation
- Specification and Refinement
- Requirements Capture and Analysis
- Verification of Software and Hardware
- Specification and Verification of Fault Tolerance and Resilience
- Probabilistic and Real-Time Systems
- Dependable Systems
- Verified System Development
- Industrial Applications
Submission to this special issue is open. We expect original articles (typically 20-30 pages) that present high-quality contributions,
have not been previously published in an archival venue and that must not be simultaneously submitted for publication elsewhere.
Submissions must be written in English and comply with SCP's author guidelines
http://www.elsevier.com/wps/find/journaldescription.cws_home/505623/authorinstructions
Submission is over the SCP website:
http://ees.elsevier.com/scico/default.asp
which you will have to register for if you do not have an account.
When submitting your paper please choose the article type "Special issue: AVoCS 2015".
Please send any queries you may have to Gudmund Grov (G.Grov@hw.ac.uk)
-----
We invite research leaders and ambitious early career researchers to
join us in leading and driving research in key inter-disciplinary themes.
Please see www.hw.ac.uk/researchleaders for further information and how
to apply.
Heriot-Watt University is a Scottish charity
registered under charity number SC000278.
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
Special Issue on Automated Verification of Critical Systems
First Call for Papers
Guest editors: Gudmund Grov & Andrew Ireland
Submission deadline: 20 May 2016
Notification: 31 August 2016
This special issue is devoted to the 15th international workshop on Automated Verification of Critical Systems (AVoCS 2015), hosted
in September 2015 by Heriot-Watt University in Edinburgh (UK):
https://sites.google.com/site/avocs15/
The aim of AVoCS is to contribute to the interaction and exchange of ideas among members of the international research community on tools
and techniques for the verification of critical systems. These topics are to be interpreted broadly and inclusively. It covers all aspects
of automated verification, and typical (but not exclusive) topics of interest are:
- Model Checking
- Automatic and Interactive Theorem Proving
- SAT, SMT or Constraint Solving for Verification
- Abstract Interpretation
- Specification and Refinement
- Requirements Capture and Analysis
- Verification of Software and Hardware
- Specification and Verification of Fault Tolerance and Resilience
- Probabilistic and Real-Time Systems
- Dependable Systems
- Verified System Development
- Industrial Applications
Submission to this special issue is open. We expect original articles (typically 20-30 pages) that present high-quality contributions,
have not been previously published in an archival venue and that must not be simultaneously submitted for publication elsewhere.
Submissions must be written in English and comply with SCP's author guidelines
http://www.elsevier.com/wps/find/journaldescription.cws_home/505623/authorinstructions
Submission is over the SCP website:
http://ees.elsevier.com/scico/default.asp
which you will have to register for if you do not have an account.
When submitting your paper please choose the article type "Special issue: AVoCS 2015".
Please send any queries you may have to Gudmund Grov (G.Grov@hw.ac.uk)
-----
We invite research leaders and ambitious early career researchers to
join us in leading and driving research in key inter-disciplinary themes.
Please see www.hw.ac.uk/researchleaders for further information and how
to apply.
Heriot-Watt University is a Scottish charity
registered under charity number SC000278.
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
2015-11-06
[Caml-list] LPAR-20 in Fiji - Register now
===============================================================================
The 20th International Conference on
Logic for Programming, Artificial Intelligence and Reasoning
Suva, Fiji, 23rd-28th November 2015
www.LPAR-20.info
CALL FOR PARTICIPATION
Registration for LPAR-20 is still open ... follow the link from the conference
web page. Information about travel to Fiji, and accomodation in Suva, is also
available on the web page. Come join us for the focussed workshops, the high
quality conference, and the renowned LPAR social events.
===============================================================================
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
The 20th International Conference on
Logic for Programming, Artificial Intelligence and Reasoning
Suva, Fiji, 23rd-28th November 2015
www.LPAR-20.info
CALL FOR PARTICIPATION
Registration for LPAR-20 is still open ... follow the link from the conference
web page. Information about travel to Fiji, and accomodation in Suva, is also
available on the web page. Come join us for the focussed workshops, the high
quality conference, and the renowned LPAR social events.
===============================================================================
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
2015-10-28
[Caml-list] WRLA 2016: 1st Call for Papers
======================== Call for Papers =================================
WRLA 2016
11th International
Workshop on Rewriting Logic and its Applications
An ETAPS 2016 satellite event
Eindhoven, The Netherlands, April 2-3, 2016
==========================================================================
IMPORTANT DATES
* Abstract deadline: January 6th 2016
* Submission deadline: January 10th 2016
* Author notification: February 14th 2016
* Workshop: Saturday April 2nd and Sunday April 3rd, 2016
AIMS AND SCOPE
Rewriting is a natural model of computation and an expressive semantic
framework for concurrency, parallelism, communication, and interaction. It
can be used for specifying a wide range of systems and languages in various
application domains. It also has good properties as a metalogical framework
for representing logics. Several successful languages based on rewriting
(ASF+SDF, CafeOBJ, ELAN, Maude) have been designed and implemented. The aim
of WRLA is to bring together researchers with a common interest in rewriting
and its applications, and to give them the opportunity to present their
recent work, discuss future research directions, and exchange ideas.
The 2016 edition of WRLA will mark its 20th anniversary since its first
edition in Asilomar, California, in 1996.
The topics of the workshop include, but are not limited to:
A. Foundations
* foundations and models of rewriting and rewriting logic, including
termination, confluence, coherence and complexity
* unification, generalisation, narrowing, and partial evaluation
* constrained rewriting and symbolic algebra
* graph rewriting
* tree automata
* rewriting strategies
* rewriting-based calculi and explicit substitutions
B. Rewriting as a Logical and Semantic Framework
* uses of rewriting and rewriting logic as a logical framework,
including deduction modulo
* uses of rewriting as a semantic framework for programming language
semantics
* rewriting semantics of concurrency models, distributed systems, and
network protocols
* rewriting semantics of real-time, hybrid, and probabilistic systems
* uses of rewriting for compilation and language transformation
C. Rewriting Languages
* rewriting-based declarative languages
* type systems for rewriting
* implementation techniques
* tools supporting rewriting languages
D. Verification Techniques
* verification of confluence, termination, coherence, sufficient
completeness, and related properties
* temporal, modal and reachability logics for verifying dynamic
properties of rewrite theories
* explicit-state and symbolic model-checking techniques for
verification of rewrite theories
* rewriting-based theorem proving, including (co)inductive theorem proving
* rewriting-based constraint solving and satisfiability
* rewriting-semantics-based verification and analysis of programs
E. Applications
* applications to logic, mathematics and physics
* rewriting models of biology, chemistry, and membrane systems
* security specification and verification
* applications to distributed, network, mobile, and cloud computing
* specification and verification of real-time, probabilistic, and
cyber-physical systems
* specifications and verification of critical systems
* applications to model-based software engineering
* applications to engineering and planning
INVITED SPEAKERS
TBA
SUBMISSION
We solicit submissions of regular papers, tool papers, and
work-in-progress papers.
Regular papers must contain original contributions, be clearly written,
include appropriate references, and comparison with related work. They must
be unpublished and not submitted simultaneously for publication
elsewhere.
Tool papers have to present a new tool, a new tool component, or novel
extensions to an existing tool. They should provide a short description of
the theoretical foundations with relevant citations, emphasise the design and
implementation, and give a clear account of the tool's functionality. The
described tools must be publicly available via the web.
Work-in-progress papers present early-stage work or other types of innovative
or thought-provoking work related to the topics of the workshop. The
difference between work-in-progress and regular papers is that work-in-progress
submissions represent work that has not reached yet a level of
completion that would warrant the full-refereed selection process. We
encourage researchers and practitioners to submit work-in-progress papers as
this provides a unique opportunity for sharing valuable ideas, eliciting
useful feedback on ongoing work, and fostering discussions and collaborations
among colleagues.
All submissions should be formatted according to the guidelines for Springer
LNCS papers, and should be submitted electronically using EasyChair at
https://easychair.org/conferences/?conf=wrla2016
Regular and work-in-progress papers should not exceed 15 pages including
references. Tool papers can have a maximum of 6 pages including references
and may have an appendix of up to 4 additional pages with usage details and
tool demonstration.
PUBLICATION
All submissions will be evaluated by the program committee. Regular papers,
tool papers, and work-in-progress papers that are accepted will be presented
at the workshop and included in the pre-proceedings, which will be available
during the workshop. Following the tradition of the last editions, it is
expected the regular papers, tool papers, and invited presentations to be
published as a volume in Springer’s Lecture Notes in Computer Science (LNCS)
series to be distributed after the workshop.
A special issue of the Journal of Logical and Algebraic Methods in
Programming (JLAMP) will be devoted to extended versions of selected papers
from WRLA 2016.
PROGRAM COMMITTEE
Kyungmin Bae, SRI International, USA
Mark van den Brand, Eindhoven University of Technology, The Netherlands
Roberto Bruni, University of Pisa, Italy
Stefan Ciobaca, Alexandru Ioan Cuza University, Romania
Manuel Clavel, IMDEA Software Institute, Spain
Francisco Durán, Universidad de Málaga, Spain
Joerg Endrullis, Vrije Universiteit Amsterdam, The Netherlands
Santiago Escobar, Universidad Politécnica de Valencia, Spain
Maribel Fernández, King's College London, UK
Kokichi Futatsugi, JAIST, Japan
Thomas Genet, ISTIC/Université de Rennes 1, France
Jürgen Giesl, RWTH Aachen, Germany
Deepak Kapur, University of New Mexico, USA
Helene Kirchner, INRIA, France
Alexander Knapp, Universitat Augsburg, Germany
Alberto Lluch Lafuente, Technical University of Denmark, Denmark
Dorel Lucanu, Alexandru Ioan Cuza University, Romania (chair)
Salvador Lucas, Universidad Politécnica de Valencia, Spain
Narciso MartÃ-Oliet, Universidad Complutense de Madrid, Spain
José Meseguer, University of Illinois at Urbana-Champaign, USA
Ugo Montanari, University of Pisa, Italy
Pierre-Etienne Moreau, Université de Lorraine, France
Vivek Nigam, Federal University of ParaÃba, Brasil
Kazuhiro Ogata, JAIST, Japan
Peter Ölveczky, University of Oslo, Norway
Miguel Palomino, Universidad Complutense de Madrid, Spain
Christophe Ringeissen, INRIA-Lorraine Nancy, France
Grigore Rosu, University of Illinois at Urbana-Champaign, USA
Vlad Rusu, INRIA Lille Nord-Europe, France
Ralf Sasse, ETH Zurich, Switzerland
Traian-Florin Serbanuta, University of Bucharest, Romania
Mark-Oliver Stehr, SRI International, USA
Carolyn Talcott, SRI International, USA
Martin Wirsing, Ludwig-Maximilians-Universität München, Germany
CONTACT INFORMATION
For more information, please contact the organizers
dlucanu@info.uaic.ro
or visit the workshop web page
http://fmse.info.uaic.ro/events/WRLA2016/
.
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
WRLA 2016
11th International
Workshop on Rewriting Logic and its Applications
An ETAPS 2016 satellite event
Eindhoven, The Netherlands, April 2-3, 2016
==========================================================================
IMPORTANT DATES
* Abstract deadline: January 6th 2016
* Submission deadline: January 10th 2016
* Author notification: February 14th 2016
* Workshop: Saturday April 2nd and Sunday April 3rd, 2016
AIMS AND SCOPE
Rewriting is a natural model of computation and an expressive semantic
framework for concurrency, parallelism, communication, and interaction. It
can be used for specifying a wide range of systems and languages in various
application domains. It also has good properties as a metalogical framework
for representing logics. Several successful languages based on rewriting
(ASF+SDF, CafeOBJ, ELAN, Maude) have been designed and implemented. The aim
of WRLA is to bring together researchers with a common interest in rewriting
and its applications, and to give them the opportunity to present their
recent work, discuss future research directions, and exchange ideas.
The 2016 edition of WRLA will mark its 20th anniversary since its first
edition in Asilomar, California, in 1996.
The topics of the workshop include, but are not limited to:
A. Foundations
* foundations and models of rewriting and rewriting logic, including
termination, confluence, coherence and complexity
* unification, generalisation, narrowing, and partial evaluation
* constrained rewriting and symbolic algebra
* graph rewriting
* tree automata
* rewriting strategies
* rewriting-based calculi and explicit substitutions
B. Rewriting as a Logical and Semantic Framework
* uses of rewriting and rewriting logic as a logical framework,
including deduction modulo
* uses of rewriting as a semantic framework for programming language
semantics
* rewriting semantics of concurrency models, distributed systems, and
network protocols
* rewriting semantics of real-time, hybrid, and probabilistic systems
* uses of rewriting for compilation and language transformation
C. Rewriting Languages
* rewriting-based declarative languages
* type systems for rewriting
* implementation techniques
* tools supporting rewriting languages
D. Verification Techniques
* verification of confluence, termination, coherence, sufficient
completeness, and related properties
* temporal, modal and reachability logics for verifying dynamic
properties of rewrite theories
* explicit-state and symbolic model-checking techniques for
verification of rewrite theories
* rewriting-based theorem proving, including (co)inductive theorem proving
* rewriting-based constraint solving and satisfiability
* rewriting-semantics-based verification and analysis of programs
E. Applications
* applications to logic, mathematics and physics
* rewriting models of biology, chemistry, and membrane systems
* security specification and verification
* applications to distributed, network, mobile, and cloud computing
* specification and verification of real-time, probabilistic, and
cyber-physical systems
* specifications and verification of critical systems
* applications to model-based software engineering
* applications to engineering and planning
INVITED SPEAKERS
TBA
SUBMISSION
We solicit submissions of regular papers, tool papers, and
work-in-progress papers.
Regular papers must contain original contributions, be clearly written,
include appropriate references, and comparison with related work. They must
be unpublished and not submitted simultaneously for publication
elsewhere.
Tool papers have to present a new tool, a new tool component, or novel
extensions to an existing tool. They should provide a short description of
the theoretical foundations with relevant citations, emphasise the design and
implementation, and give a clear account of the tool's functionality. The
described tools must be publicly available via the web.
Work-in-progress papers present early-stage work or other types of innovative
or thought-provoking work related to the topics of the workshop. The
difference between work-in-progress and regular papers is that work-in-progress
submissions represent work that has not reached yet a level of
completion that would warrant the full-refereed selection process. We
encourage researchers and practitioners to submit work-in-progress papers as
this provides a unique opportunity for sharing valuable ideas, eliciting
useful feedback on ongoing work, and fostering discussions and collaborations
among colleagues.
All submissions should be formatted according to the guidelines for Springer
LNCS papers, and should be submitted electronically using EasyChair at
https://easychair.org/conferences/?conf=wrla2016
Regular and work-in-progress papers should not exceed 15 pages including
references. Tool papers can have a maximum of 6 pages including references
and may have an appendix of up to 4 additional pages with usage details and
tool demonstration.
PUBLICATION
All submissions will be evaluated by the program committee. Regular papers,
tool papers, and work-in-progress papers that are accepted will be presented
at the workshop and included in the pre-proceedings, which will be available
during the workshop. Following the tradition of the last editions, it is
expected the regular papers, tool papers, and invited presentations to be
published as a volume in Springer’s Lecture Notes in Computer Science (LNCS)
series to be distributed after the workshop.
A special issue of the Journal of Logical and Algebraic Methods in
Programming (JLAMP) will be devoted to extended versions of selected papers
from WRLA 2016.
PROGRAM COMMITTEE
Kyungmin Bae, SRI International, USA
Mark van den Brand, Eindhoven University of Technology, The Netherlands
Roberto Bruni, University of Pisa, Italy
Stefan Ciobaca, Alexandru Ioan Cuza University, Romania
Manuel Clavel, IMDEA Software Institute, Spain
Francisco Durán, Universidad de Málaga, Spain
Joerg Endrullis, Vrije Universiteit Amsterdam, The Netherlands
Santiago Escobar, Universidad Politécnica de Valencia, Spain
Maribel Fernández, King's College London, UK
Kokichi Futatsugi, JAIST, Japan
Thomas Genet, ISTIC/Université de Rennes 1, France
Jürgen Giesl, RWTH Aachen, Germany
Deepak Kapur, University of New Mexico, USA
Helene Kirchner, INRIA, France
Alexander Knapp, Universitat Augsburg, Germany
Alberto Lluch Lafuente, Technical University of Denmark, Denmark
Dorel Lucanu, Alexandru Ioan Cuza University, Romania (chair)
Salvador Lucas, Universidad Politécnica de Valencia, Spain
Narciso MartÃ-Oliet, Universidad Complutense de Madrid, Spain
José Meseguer, University of Illinois at Urbana-Champaign, USA
Ugo Montanari, University of Pisa, Italy
Pierre-Etienne Moreau, Université de Lorraine, France
Vivek Nigam, Federal University of ParaÃba, Brasil
Kazuhiro Ogata, JAIST, Japan
Peter Ölveczky, University of Oslo, Norway
Miguel Palomino, Universidad Complutense de Madrid, Spain
Christophe Ringeissen, INRIA-Lorraine Nancy, France
Grigore Rosu, University of Illinois at Urbana-Champaign, USA
Vlad Rusu, INRIA Lille Nord-Europe, France
Ralf Sasse, ETH Zurich, Switzerland
Traian-Florin Serbanuta, University of Bucharest, Romania
Mark-Oliver Stehr, SRI International, USA
Carolyn Talcott, SRI International, USA
Martin Wirsing, Ludwig-Maximilians-Universität München, Germany
CONTACT INFORMATION
For more information, please contact the organizers
dlucanu@info.uaic.ro
or visit the workshop web page
http://fmse.info.uaic.ro/events/WRLA2016/
.
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
2015-10-15
[Caml-list] LPAR-20 in Fiji - Registration is open
===============================================================================
The 20th International Conference on
Logic for Programming, Artificial Intelligence and Reasoning
Suva, Fiji, 23rd-28th November 2015
www.LPAR-20.info
CALL FOR PARTICIPATION
Registration for LPAR-20 is now open ... follow the link from the conference
web page. Information about travel to Fiji, and accomodation in Suva, is also
available on the web page. Come join us for the focussed workshops, the high
quality conference, and the renowned LPAR social events.
===============================================================================
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
The 20th International Conference on
Logic for Programming, Artificial Intelligence and Reasoning
Suva, Fiji, 23rd-28th November 2015
www.LPAR-20.info
CALL FOR PARTICIPATION
Registration for LPAR-20 is now open ... follow the link from the conference
web page. Information about travel to Fiji, and accomodation in Suva, is also
available on the web page. Come join us for the focussed workshops, the high
quality conference, and the renowned LPAR social events.
===============================================================================
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
2015-10-13
[Caml-list] First Call for Papers: CAV 2016, July 17-23, 2016, Toronto, Ontario, Canada
[ posted on behalf of Roopsha Samanta <roopsha.samanta@ist.ac.at> ]
Apologies for multiple copies of this CFP.
***************************************************************
* 28th International Conference
* on
* Computer Aided Verification (CAV 2016)
*
* July 17-23, 2016
* Toronto, Ontario, Canada
*
* Call for Papers
*
* http://i-cav.org/2016/
****************************************************************
Important Dates
----------------------
All deadlines are 4pm EST.
Abstract submission: January 17, 2016 (Sunday)
Paper submission: January 29, 2016 (Friday)
Author response period: March 23-25, 2016 (Wednesday-Friday)
Author Notification: April 15, 2016 (Friday)
Conference: July 17-23, 2016
Scope
--------
CAV 2016 is the 28th in a series dedicated to the advancement of the theory and
practice of computer-aided formal analysis methods for hardware and software
systems. CAV considers it vital to continue spurring advances in hardware and
software verification while expanding to new domains such as biological systems
and computer security. The conference covers the spectrum from theoretical
results to concrete applications, with an emphasis on practical verification
tools and the algorithms and techniques that are needed for their
implementation. The proceedings of the conference will be published in the
Springer LNCS series. A selection of papers will be invited to a special issue
of Formal Methods in System Design and the Journal of the ACM.
Topics of interest include but are not limited to:
* Algorithms and tools for verifying models and implementations
* Algorithms and tools for system synthesis
* Mathematical and logical foundations of verification and synthesis
* Specifications and correctness criteria for programs and systems
* Deductive verification using proof assistants
* Hardware verification techniques
* Program analysis and software verification
* Software synthesis
* Hybrid systems and embedded systems verification
* Compositional and abstraction-based techniques for verification
* Probabilistic and statistical approaches to verification
* Verification methods for parallel and concurrent systems
* Testing and run-time analysis based on verification technology
* Decision procedures and solvers for verification and synthesis
* Applications and case studies in verification and synthesis
* Verification in industrial practice
* New application areas for algorithmic verification and synthesis
* Formal models and methods for security
* Formal models and methods for biological systems
Paper Submission
------------------------
*** NEW this year: Double-blind submissions ***
Submissions on a wide range of topics are sought, particularly ones that
identify new research directions. CAV 2016 is not limited to topics discussed
in previous instances of the conference. Authors concerned about the
appropriateness of a topic may communicate by electronic mail with the
conference chairs prior to submission.
As explained below, CAV 2016 will follow a lightweight double-blind review
process. Submissions that are not "blinded" will be rejected without review.
Submissions will be in two categories: Regular Papers and Tool Papers.
* Regular Papers should not exceed 15 pages in LNCS format, not counting
references. These papers should contain original research and sufficient detail
to assess the merits and relevance of the contribution. Papers will be
evaluated on basis of a combination of correctness, technical depth,
significance, novelty, clarity, and elegance. We welcome papers on theory, case
studies and comparisons with existing experimental research, as well as
combinations of new theory with experimental evaluation. A strong theoretical
paper is not required to have an experimental component. On the other hand,
strong papers reproducing and comparing existing results experimentally do not
require new theoretical insights.
* Tool Papers should not exceed 6 pages, not counting references. These papers
should describe system and implementation aspects of a tool with a large
(potential) user base (experiments not required, rehash of theory strongly
discouraged). Papers describing tools that have already been presented (in any
conference) will be accepted only if significant and clear enhancements to the
tool are reported and implemented.
Unlike last year, there is no separate Short Paper category.
Prior to the registration deadline, the authors will register their paper by
uploading information on the submission title, abstract (of at most 300 words),
authors, topics, and conflicts to the conference web site. Papers that are not
registered on time will be rejected.
We encourage authors to provide any supplementary material that is required to
support the claims made in the paper, such as detailed proofs or experimental
data. These materials should be uploaded at submission time, as a single pdf or
a tarball, not via a URL. It will be made available to reviewers only after
they have submitted their first-draft reviews and hence need not be anonymized.
Reviewers are under no obligation to look at the supplementary material but may
refer to it if they have questions about the material in the body of the paper.
Simultaneous submission to other conferences with proceedings or submission of
material that has already been published elsewhere is not allowed.
The review process will include a feedback/rebuttal period where authors will
have the option to respond to reviewer comments. The PC chairs may solicit
further reviews after the rebuttal period.
Papers must be submitted in PDF format. Submission will be via the HotCRP
system. The submission URL will be available on the website of the conference
closer to the deadline.
Lightweight Double-Blind Reviewing Process
-------------------------------------------------------------
CAV 2016 will employ a lightweight double-blind reviewing process. This means
that committee members will not have access to authors' names or affiliations
as they review a paper; however, authors' names will be revealed once reviews
have been submitted and online discussion has begun.
To facilitate this, submitted papers must adhere to two rules:
(1) author names and institutions must be omitted, and
(2) references to authors' own related work should be in the third person
(e.g., not "We build on our previous work ..." but rather "We build on the work
of ...").
The purpose of this process is to help the PC and external reviewers come to an
initial judgement about the paper without bias, not to make it impossible for
them to discover the authors if they were to try. Nothing should be done in
the name of anonymity that weakens the submission or makes the job of reviewing
the paper more difficult (e.g., important background references should not be
omitted or anonymized). In addition, authors should feel free to disseminate
their ideas or draft versions of their paper as they normally would. For
instance, authors may post drafts of their papers on the web or give talks on
their research ideas. A document answering frequently asked questions about the
double-blind review process is available on the conference website.
Artifact Evaluation
------------------------
Authors of accepted papers will be invited to submit their artifacts for
evaluation by a special committee.
Organizers
---------------
Chairs
---------
Swarat Chaudhuri, Rice University, USA
Azadeh Farzan, University of Toronto, Canada
CAV Award Committee
-------------------------------
Ahmed Bouajjani (Chair), Univ. Paris Diderot (Paris 7)
Tom Ball, Microsoft Research
Kim G. Larsen, Aalborg University
Natarajan Shankar, SRI International
Program Committee
---------------------------
Rajeev Alur, University of Pennsylvania
Christel Baier, Technische Universität Dresden
Clark Barrett, New York University
Roderick Bloem, Graz University of Technology
Pavol Cerny, University of Colorado, Boulder
Adam Chlipala, MIT
Alessandro Cimatti, Fondazione Bruno Kessler
Loris D'Antoni, University of Wisconsin, Madison
Constantin Enea, Univ. Paris Diderot (Paris 7)
Javier Esparza, Technische Universität München
Kousha Etessami, University of Edinburgh
Susanne Graf, VERIMAG
Orna Grumberg, Technion
Franjo Ivancic, Google
Somesh Jha, University of Wisconsin, Madison
Ranjit Jhala, University of California, San Diego
Joost-Pieter Katoen, RWTH Aachen University
Zachary Kincaid, University of Toronto
Laura Kovacs, Chalmers University of Technology
Viktor Kuncak, EPFL
Shuvendu Lahiri, Microsoft Research
Akash Lal, Microsoft Research
Pete Manolios, Northeastern University
Kenneth McMillan, Microsoft Research
David Monniaux, VERIMAG
Marta Kwaitkowska, Oxford Unive
Kedar Namjoshi, Bell Labs, Alcatel-Lucent
David Parker, University of Birmingham
Corina Pasareneau, Carnegie Mellon Silicon Valley/NASA Ames
Ruzica Piskac, Yale University
Andreas Podelski, University of Freiburg
Shaz Qadeer, Microsoft Research
Andrey Rybalchenko, Microsoft Research
Mooly Sagiv, Tel Aviv University
Sriram Sankaranarayanan, University of Colorado, Boulder
Sanjit Seshia, University of California, Berkeley
Natasha Sharygina, University of Lugano
Sharon Shoham, Academic College of Tel-Aviv Yaffo
Armando Solar-Lezama, MIT
Fabio Somenzi, University of Colorado, Boulder
Serdar Tesiran, Koç University
Mahesh Viswanathan, University of Illinois, Urbana-Champaign
Bow-Yaw Wang, Academia Sinica
Thomas Wies, New York University
Lenore Zuck, University of Illinois, Chicago
Workshop Chair
----------------------
Zachary Kincaid, University of Toronto, Canada
Artifact Evaluation Chair
--------------------------------
Aws Albarghouthi, University of Wisconsin, USA
Publicity Chair
-------------------
Roopsha Samanta, IST, Austria
Steering Committee
---------------------------
Michael Gordon, University of Cambridge, UK
Orna Grumberg, Technion, Israel
Aarti Gupta, Princeton University, USA
Kenneth McMillan, Microsoft Research, USA
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
Apologies for multiple copies of this CFP.
***************************************************************
* 28th International Conference
* on
* Computer Aided Verification (CAV 2016)
*
* July 17-23, 2016
* Toronto, Ontario, Canada
*
* Call for Papers
*
* http://i-cav.org/2016/
****************************************************************
Important Dates
----------------------
All deadlines are 4pm EST.
Abstract submission: January 17, 2016 (Sunday)
Paper submission: January 29, 2016 (Friday)
Author response period: March 23-25, 2016 (Wednesday-Friday)
Author Notification: April 15, 2016 (Friday)
Conference: July 17-23, 2016
Scope
--------
CAV 2016 is the 28th in a series dedicated to the advancement of the theory and
practice of computer-aided formal analysis methods for hardware and software
systems. CAV considers it vital to continue spurring advances in hardware and
software verification while expanding to new domains such as biological systems
and computer security. The conference covers the spectrum from theoretical
results to concrete applications, with an emphasis on practical verification
tools and the algorithms and techniques that are needed for their
implementation. The proceedings of the conference will be published in the
Springer LNCS series. A selection of papers will be invited to a special issue
of Formal Methods in System Design and the Journal of the ACM.
Topics of interest include but are not limited to:
* Algorithms and tools for verifying models and implementations
* Algorithms and tools for system synthesis
* Mathematical and logical foundations of verification and synthesis
* Specifications and correctness criteria for programs and systems
* Deductive verification using proof assistants
* Hardware verification techniques
* Program analysis and software verification
* Software synthesis
* Hybrid systems and embedded systems verification
* Compositional and abstraction-based techniques for verification
* Probabilistic and statistical approaches to verification
* Verification methods for parallel and concurrent systems
* Testing and run-time analysis based on verification technology
* Decision procedures and solvers for verification and synthesis
* Applications and case studies in verification and synthesis
* Verification in industrial practice
* New application areas for algorithmic verification and synthesis
* Formal models and methods for security
* Formal models and methods for biological systems
Paper Submission
------------------------
*** NEW this year: Double-blind submissions ***
Submissions on a wide range of topics are sought, particularly ones that
identify new research directions. CAV 2016 is not limited to topics discussed
in previous instances of the conference. Authors concerned about the
appropriateness of a topic may communicate by electronic mail with the
conference chairs prior to submission.
As explained below, CAV 2016 will follow a lightweight double-blind review
process. Submissions that are not "blinded" will be rejected without review.
Submissions will be in two categories: Regular Papers and Tool Papers.
* Regular Papers should not exceed 15 pages in LNCS format, not counting
references. These papers should contain original research and sufficient detail
to assess the merits and relevance of the contribution. Papers will be
evaluated on basis of a combination of correctness, technical depth,
significance, novelty, clarity, and elegance. We welcome papers on theory, case
studies and comparisons with existing experimental research, as well as
combinations of new theory with experimental evaluation. A strong theoretical
paper is not required to have an experimental component. On the other hand,
strong papers reproducing and comparing existing results experimentally do not
require new theoretical insights.
* Tool Papers should not exceed 6 pages, not counting references. These papers
should describe system and implementation aspects of a tool with a large
(potential) user base (experiments not required, rehash of theory strongly
discouraged). Papers describing tools that have already been presented (in any
conference) will be accepted only if significant and clear enhancements to the
tool are reported and implemented.
Unlike last year, there is no separate Short Paper category.
Prior to the registration deadline, the authors will register their paper by
uploading information on the submission title, abstract (of at most 300 words),
authors, topics, and conflicts to the conference web site. Papers that are not
registered on time will be rejected.
We encourage authors to provide any supplementary material that is required to
support the claims made in the paper, such as detailed proofs or experimental
data. These materials should be uploaded at submission time, as a single pdf or
a tarball, not via a URL. It will be made available to reviewers only after
they have submitted their first-draft reviews and hence need not be anonymized.
Reviewers are under no obligation to look at the supplementary material but may
refer to it if they have questions about the material in the body of the paper.
Simultaneous submission to other conferences with proceedings or submission of
material that has already been published elsewhere is not allowed.
The review process will include a feedback/rebuttal period where authors will
have the option to respond to reviewer comments. The PC chairs may solicit
further reviews after the rebuttal period.
Papers must be submitted in PDF format. Submission will be via the HotCRP
system. The submission URL will be available on the website of the conference
closer to the deadline.
Lightweight Double-Blind Reviewing Process
-------------------------------------------------------------
CAV 2016 will employ a lightweight double-blind reviewing process. This means
that committee members will not have access to authors' names or affiliations
as they review a paper; however, authors' names will be revealed once reviews
have been submitted and online discussion has begun.
To facilitate this, submitted papers must adhere to two rules:
(1) author names and institutions must be omitted, and
(2) references to authors' own related work should be in the third person
(e.g., not "We build on our previous work ..." but rather "We build on the work
of ...").
The purpose of this process is to help the PC and external reviewers come to an
initial judgement about the paper without bias, not to make it impossible for
them to discover the authors if they were to try. Nothing should be done in
the name of anonymity that weakens the submission or makes the job of reviewing
the paper more difficult (e.g., important background references should not be
omitted or anonymized). In addition, authors should feel free to disseminate
their ideas or draft versions of their paper as they normally would. For
instance, authors may post drafts of their papers on the web or give talks on
their research ideas. A document answering frequently asked questions about the
double-blind review process is available on the conference website.
Artifact Evaluation
------------------------
Authors of accepted papers will be invited to submit their artifacts for
evaluation by a special committee.
Organizers
---------------
Chairs
---------
Swarat Chaudhuri, Rice University, USA
Azadeh Farzan, University of Toronto, Canada
CAV Award Committee
-------------------------------
Ahmed Bouajjani (Chair), Univ. Paris Diderot (Paris 7)
Tom Ball, Microsoft Research
Kim G. Larsen, Aalborg University
Natarajan Shankar, SRI International
Program Committee
---------------------------
Rajeev Alur, University of Pennsylvania
Christel Baier, Technische Universität Dresden
Clark Barrett, New York University
Roderick Bloem, Graz University of Technology
Pavol Cerny, University of Colorado, Boulder
Adam Chlipala, MIT
Alessandro Cimatti, Fondazione Bruno Kessler
Loris D'Antoni, University of Wisconsin, Madison
Constantin Enea, Univ. Paris Diderot (Paris 7)
Javier Esparza, Technische Universität München
Kousha Etessami, University of Edinburgh
Susanne Graf, VERIMAG
Orna Grumberg, Technion
Franjo Ivancic, Google
Somesh Jha, University of Wisconsin, Madison
Ranjit Jhala, University of California, San Diego
Joost-Pieter Katoen, RWTH Aachen University
Zachary Kincaid, University of Toronto
Laura Kovacs, Chalmers University of Technology
Viktor Kuncak, EPFL
Shuvendu Lahiri, Microsoft Research
Akash Lal, Microsoft Research
Pete Manolios, Northeastern University
Kenneth McMillan, Microsoft Research
David Monniaux, VERIMAG
Marta Kwaitkowska, Oxford Unive
Kedar Namjoshi, Bell Labs, Alcatel-Lucent
David Parker, University of Birmingham
Corina Pasareneau, Carnegie Mellon Silicon Valley/NASA Ames
Ruzica Piskac, Yale University
Andreas Podelski, University of Freiburg
Shaz Qadeer, Microsoft Research
Andrey Rybalchenko, Microsoft Research
Mooly Sagiv, Tel Aviv University
Sriram Sankaranarayanan, University of Colorado, Boulder
Sanjit Seshia, University of California, Berkeley
Natasha Sharygina, University of Lugano
Sharon Shoham, Academic College of Tel-Aviv Yaffo
Armando Solar-Lezama, MIT
Fabio Somenzi, University of Colorado, Boulder
Serdar Tesiran, Koç University
Mahesh Viswanathan, University of Illinois, Urbana-Champaign
Bow-Yaw Wang, Academia Sinica
Thomas Wies, New York University
Lenore Zuck, University of Illinois, Chicago
Workshop Chair
----------------------
Zachary Kincaid, University of Toronto, Canada
Artifact Evaluation Chair
--------------------------------
Aws Albarghouthi, University of Wisconsin, USA
Publicity Chair
-------------------
Roopsha Samanta, IST, Austria
Steering Committee
---------------------------
Michael Gordon, University of Cambridge, UK
Orna Grumberg, Technion, Israel
Aarti Gupta, Princeton University, USA
Kenneth McMillan, Microsoft Research, USA
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
2015-10-02
[Caml-list] CPS-Week 2016: Call for Papers
|
Subscribe to:
Posts (Atom)