Call for Papers
Horn Clauses for Verification and Synthesis (HCVS)
July 19, 2015 · San Francisco, USA
Submission deadlines:
- paper submission: May 22, 2015
- paper notification: June 19, 2015
Most Program Verification and Synthesis problems of interest can be
modeled directly using Horn clauses and many recent advances in the
CLP and CAV communities have centered around efficiently solving
problems presented as Horn clauses.
This workshop aims to bring together researchers working in the two
communities of Constraint/Logic Programming (e.g., ICLP and CP) and
Program Verification community (e.g., CAV, TACAS, and VMCAI) on the
topic of Horn clause based analysis, verification and synthesis.
Horn clauses for verification and synthesis have been advocated by
these two communities in different times and from different
perspectives and this workshop is organized to stimulate interaction
and a fruitful exchange and integration of experiences.
Topics of interest include, but are not limited to the use of Horn
clauses, constraints, and related formalisms in the following areas:
- Analysis and verification of programs in various programming
paradigms (e.g., imperative, object-oriented, functional, logic,
higher-order, concurrent)
- Program synthesis
- Program testing
- Program transformation
- Constraint solving
- Type systems
- Case studies and tools
- Challenging problems
We solicit regular papers describing theory and implementation of
Horn-clause based analysis and tool descriptions. We also solicit
extended abstracts describing work-in-progress and presentations
covering previously published results that are of interest to the
workshop.
Invited speakers:
- Ranjit Jhala, University of California at San Diego
- Joxan Jaffar, National University of Singapore
Program Committee:
Elvira Albert (Complutense University of Madrid)
Nikolaj Bjorner (Microsoft Research)
Gregory J. Duck (National University of Singapore)
Fabio Fioravanti (University of Chieti-Pescara)
John Gallagher (Roskilde University and IMDEA-Software Madrid)
Arie Gurfinkel (Software Engineering Institute, Carnegie Mellon University)
- chair
Radu Grigore (University of Oxford)
Konstantin Korovin (Manchester University)
Viktor Kuncak (EPFL)
David Monniaux (CNRS/Verimag)
Jorge A. Navas (NASA) - chair
Corneliu Popeea (CQSE)
Maurizio Proietti (IASI-CNR, Italy)
Philipp Ruemmer (Uppsala University, Department of Information Technology)
Andrey Rybalchenko (Microsoft Research)
Valerio Senni (ALES srl)
Peter Stuckey (University of Melbourne)
Yakir Vizel (Princeton University)
The submission format is up to 12 pages plus bibliography for regular
papers and 1 to 3 pages (for work-in-progress), both in EPTCS format.
Original accepted papers will be published electronically as a volume
in the Electronic Proceedings in Theoretical Computer Science (EPTCS)
series, see http://www.eptcs.org/
Authors of accepted papers are required to ensure that at least one of
them will be present at the workshop. Papers must be submitted
through the EasyChair system using the web page:
https://easychair.org/conferences/?conf=hcvs2015.
Call for Papers
===============
17th International Symposium on
Practical Aspects of Declarative Languages (PADL 2015)
http://www.cs.nmsu.edu/padl15
Portland, Oregon, June 18-19, 2015
Conference Description
======================
Declarative languages build on sound theoretical bases to provide
attractive frameworks for application development. These languages
have been successfully applied to many different real-world
situations, ranging from data base management to active networks to
software engineering to decision support systems.
New developments in theory and implementation have opened up new
application areas. At the same time, applications of declarative
languages to novel problems raise numerous interesting research
issues. Well-known questions include designing for scalability,
language extensions for application deployment, and programming
environments. Thus, applications drive the progress in the theory and
implementation of declarative systems, and benefit from this progress
as well.
PADL is a forum for researchers and practitioners to present
original work emphasizing novel applications and implementation
techniques for all forms of declarative concepts, including,
functional, logic, constraints, etc. Topics of interest include, but
are not limited to:
* Innovative applications of declarative languages
* Declarative domain-specific languages and applications
* Practical applications of theoretical results
* New language developments and their impact on applications
* Declarative languages and software engineering
* Evaluation of implementation techniques on practical applications
* Practical experiences and industrial applications
* Novel uses of declarative languages in the classroom
* Practical extensions such as constraint-based, probabilistic, and
reactive languages.
PADL 2015 welcomes new ideas and approaches pertaining to
applications and implementation of declarative languages. PADL 2015 will
be co-located with the ACM Federated Computing Research Conferences, in
Portland, Oregon.
Important Dates and Submission Guidelines
=========================================
Paper Submission: February 28, 2015
Notification: March 31, 2015
Camera-ready: April 15, 2015
Symposium: June 18-19, 2015
Authors should submit an electronic copy of the full paper in PDF
using the Springer LNCS format. The submission will be done through
EasyChair conference system:
https://easychair.org/conferences/?conf=padl2015
All submissions must be original work written in English. Submissions
must be unpublished and not submitted for publication elsewhere. Work
that already appeared in unpublished or informally published workshops
proceedings may be submitted but the authors should notify the program
chair about the place on which it has previously appeared.
PADL 2015 will accept both technical and application papers:
* Technical papers must describe original, previously unpublished
research results. Technical papers must not exceed 15 pages (plus
one page of references) in Springer LNCS format.
* Application papers are a mechanism to present important practical
applications of declarative languages that occur in industry or
in areas of research other than Computer Science.
Application papers are expected to describe complex and/or
real-world applications that rely on an innovative use of
declarative languages. Application descriptions, engineering
solutions and real-world experiences (both positive and negative)
are solicited. The limit for application papers is 8 pages in
Springer LNCS format but such papers can also point to sites with
supplemental information about the application or the system that
they describe.
The proceedings of PADL’15 will appear in the LNCS series of Springer
Verlag.
Contacts
========
For additional information about papers and submissions, please
contact the Program Chairs:
Enrico Pontelli and Son Cao Tran
New Mexico State University, USA
Email: epontell | tson <AT> cs <DOT> nmsu <DOT> edu
Hello,
I am trying to find out more about how tabling is implemented in Ciao.
A google search brought me to the paper
"A Sketch of a Complete Scheme for Tabled Execution Based on Program Transformation” by Guzmán et al.
(Link: http://link.springer.com/chapter/10.1007%2F978-3-540-89982-2_79 )
In it the authors mention that “all […] executions were performed using local scheduling”.
This paper was written 8 years ago. Has Ciao’s tabling implementation changed since then or is it still the same?
Am I right to assume that Ciao uses the local scheduling strategy described in "Beyond depth-first: Improving tabled logic programs through alternative scheduling strategies.“ by Freire et al. ?
Is there any other documentation available on how the tabling mechanism works apart from the first paper?
Thank you very much!
Lorenz