Parsing@SLE 2015: Call for talk proposals
by Ali Afroozeh, July 13, 2015The goal of this workshop is to bring together today's experts in the fields of
parser construction and parser application from across the diverse application
areas. Participants will present ongoing work as well as explore the challenges
that lie ahead. By bringing the whole community together (a rare occurrence,
given the diversity of domain-specific conferences/workshops), we hope to have
a wide-ranging collection of talks on parsing-related topics, and forge new
collaborations.
*********************************************************************
CALL FOR TALK PROPOSALS
Third Workshop on
Parsing@SLE 2015
October 25, 2015
Pittsburgh, Pennsylvania, United States
Co-located with SPLASH, OOPSLA, and GPCE
http://2015.splashcon.org/track/ParsingAtSLE2015
*********************************************************************
*** Topics ***
While parsing and parser generation, both in theory and in practice, are mature topics, there are still many challenging problems with respect to the construction, maintenance, optimization, and application of parsers in real world scenarios.
Especially in the context of real programming languages there are ample theoretical as well as practical obstacles to be overcome. Contemporary parsing challenges are caused by programming-language evolution and diversity in the face of new application areas such as IDE construction, reverse engineering, software metrics, domain specific (embedded) languages, etc. What are modular formalisms for parser generation? How to obtain (fast and correct) parsers for both legacy and new languages that require more computational power than context-free grammars and regular expressions can provide? How to use increasing parallelism offered by multi-cores and GPUs in parsers? How to enable the verified construction or prototyping of parsers for languages such as COBOL, C++ and Scala without years of effort?
In addition to the traditional programming-language applications of parsing technology, several other areas of computing also depend heavily on parsers. Examples include computational linguistics, network traffic classification, network security, and bioinformatics. Those areas often have their own unusual requirements, such as: speed (e.g. in network algorithmics), memory efficiency (e.g. embedded devices for networks, but also computational linguistics), or rapid/dynamic parser construction (e.g. in network traffic classification and in bioinformatics) as grammars are adapted. We encourage talk proposals on parsing challenges and solutions in such non-traditional areas as well.
*** Call for Submissions ***
We solicit talk proposals in the form of short abstracts (max. 2 pages in ACM 2-column format). A good talk proposal describes an interesting position, demonstration, or early achievement. The submissions will be reviewed on relevance and clarity, and used to plan the mostly interactive sessions of the workshop day. Parsing@SLE is not a publication venue. Publication of accepted abstracts and slides on the website is voluntary.
* Deadline for talk proposals: Friday August 7, 2015
* Workshop: Sunday October 25, 2015
* Notification: Monday September 7, 2015
* Submission website: https://www.easychair.org/conferences/?conf=parsingsle2015
*** Workshop Organization ***
Organizers
* Loek Cleophas, Umeå University, Sweden; and FASTAR, Stellenbosch University, South Africa
* Ali Afroozeh, CWI research institute for mathematics and computer science in the Netherlands
