From mboxrd@z Thu Jan 1 00:00:00 1970 Received: from mail4-relais-sop.national.inria.fr (mail4-relais-sop.national.inria.fr [192.134.164.105]) by walapai.inria.fr (8.13.6/8.13.6) with ESMTP id p38AemcM014074 for ; Fri, 8 Apr 2011 12:40:48 +0200 X-IronPort-AV: E=Sophos;i="4.63,322,1299452400"; d="scan'208,217";a="92524921" Received: from zmbs1.inria.fr ([128.93.142.14]) by mail4-relais-sop.national.inria.fr with ESMTP; 08 Apr 2011 12:40:43 +0200 Date: Fri, 8 Apr 2011 12:40:42 +0200 (CEST) From: Emilie Balland To: caml-list@inria.fr Message-ID: <1020389207.1202077.1302259242936.JavaMail.root@zmbs1.inria.fr> MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="----=_Part_1202076_812442519.1302259242935" X-Originating-IP: [194.199.1.140] X-Mailer: Zimbra 6.0.10_GA_2692 (ZimbraWebClient - FF3.0 (Mac)/6.0.10_GA_2692) Subject: [Caml-list] DSL 2011 - Last CFP ------=_Part_1202076_812442519.1302259242935 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D Call for Papers =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=20 DSL 2011: Conference on Domain-Specific Languages=20 (IFIP sponsorship pending approval)=20 6-8 September 2011, Bordeaux, France=20 http://dsl2011.bordeaux.inria.fr/=20 IMPORTANT DATES=20 * 2011-04-18 : Abstracts due=20 * 2011-04-25 : Submissions due=20 * 2011-06-10 : Authors notified of decisions=20 * 2011-07-11 : Final manuscripts due=20 * 2011-09-05 : Distilled tutorials=20 * 2011-09-06 / 2011-09-08 : Main conference=20 CALL FOR PAPERS=20 Domain-specific languages have long been a popular way to shorten=20 the distance from ideas to products in software engineering. On one=20 hand, the interface of a DSL lets domain experts express high-level=20 concepts succinctly in familiar notation, such as grammars for text or=20 scripts for animation, and often provides guarantees and tools that take=20 advantage of the specifics of the domain to help write and maintain=20 these particular programs. On the other hand, the implementation of a=20 DSL can automate many tasks traditionally performed by a few experts=20 to turn a specification into an executable, thus making this expertise=20 available widely. Overall, a DSL thus mediates a collaboration between=20 its users and implementers that results in software that is more usable,=20 more portable, more reliable, and more understandable.=20 These benefits of DSLs have been delivered in domains old and new, such=20 as signal processing, data mining, and Web scripting. Widely known=20 examples of DSLs include Matlab, Verilog, SQL, LINQ, HTML, OpenGL,=20 Macromedia Director, Mathematica, Maple, AutoLisp/AutoCAD, XSLT, RPM,=20 Make, lex/yacc, LaTeX, PostScript, and Excel. Despite these successes,=20 the adoption of DSLs have been stunted by the lack of general tools and=20 principles for developing, compiling, and verifying domain-specific=20 programs. General support for building and using DSLs is thus urgently=20 needed. Languages that straddle the line between the domain-specific=20 and the general-purpose, such as Perl, Tcl/Tk, and JavaScript, suggest=20 that such support be based on modern notions of language design and=20 software engineering. The goal of this conference, following the last=20 one in 2009, is to explore how present and future DSLs can fruitfully=20 draw from and potentially enrich these notions.=20 We seek research papers on the theory and practice of DSLs, including=20 but not limited to the following topics.=20 * Foundations, including semantics, formal methods, type theory, and=20 complexity theory=20 * Language design, including concrete syntax, semantics, and types=20 * Software engineering, including domain analysis, software design,=20 and round-trip engineering=20 * Modularity and composability of DSLs=20 * Software processes, including metrics for software and language=20 evaluation=20 * Implementation, including parsing, compiling, program generation,=20 program analysis, transformation, optimization, and parallelization=20 * Reverse engineering, re-engineering, design discovery, automated=20 refactoring=20 * Hardware/software codesign=20 * Programming environments and tools, including visual languages,=20 debuggers, testing, and verification=20 * Teaching DSLs and the use of DSLs in teaching=20 * Case studies in any domain, especially the general lessons they=20 provide for DSL design and implementation=20 The conference will include a visit to the city of Bordeaux, a tour=20 and tasting at the wine museum and cellar, and a banquet at La Belle=20 =C9poque.=20 INSTRUCTIONS FOR AUTHORS=20 Papers will be judged on the depth of their insight and the extent=20 to which they translate specific experience into general lessons=20 for software engineers and DSL designers and implementers. Where=20 appropriate, papers should refer to actual languages, tools, and=20 techniques, provide pointers to full definitions, proofs, and=20 implementations, and include empirical results.=20 Proceedings will be published in Electronic Proceedings in Theoretical=20 Computer Science ( http://info.eptcs.org/) . Submissions and final=20 manuscripts should be at most 25 pages in EPTCS format.=20 PROGRAM COMMITTEE=20 * Emilie Balland (INRIA)=20 * Olaf Chitil (University of Kent)=20 * Zo=E9 Drey (IRIT)=20 * Nate Foster (Cornell University)=20 * Mayer Goldberg (Ben-Gurion University)=20 * Shan Shan Huang (LogicBlox)=20 * Sam Kamin (University of Illinois at Urbana-Champaign)=20 * Jerzy Karczmarczuk (University of Caen)=20 * Jan Midtgaard (Aarhus University)=20 * Keiko Nakata (Tallinn University of Technology)=20 * Klaus Ostermann (University of Marburg)=20 * Jeremy Siek (University of Colorado at Boulder)=20 * Tony Sloane (Macquarie University)=20 * Josef Svenningsson (Chalmers University of Technology)=20 * Paul Tarau (University of North Texas)=20 * Dana N. Xu (INRIA)=20 ORGANIZERS=20 Local chair: Emilie Balland (INRIA)=20 Program chairs: Olivier Danvy (Aarhus University),=20 Chung-chieh Shan (Rutgers University)=20 ------------------------------------------------------------------------= ------=_Part_1202076_812442519.1302259242935 Content-Type: text/html; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable <= div style=3D'font-family: Times New Roman; font-size: 12pt; color: #000000'= >
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D Call for Papers =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D

DSL 2011: Conference on D= omain-Specific Languages
(IFIP sponsorship pending approval)

6-= 8 September 2011, Bordeaux, France

http://dsl2011.borde= aux.inria.fr/

IMPORTANT DATES

* 2011= -04-18: Abstracts due
* 2011= -04-25: Submissions due
* 2011= -06-10: Authors notified of decisions
* 2011= -07-11: Final manuscripts due
* 2011= -09-05: Distilled tutorials
* 2011= -09-06/2011-09-08: Main conference
CALL FOR PAPERS

Domain-specific languages have long been a pop= ular way to shorten
the distance from ideas to products in software eng= ineering. On one
hand, the interface of a DSL lets domain experts expre= ss high-level
concepts succinctly in familiar notation, such as grammar= s for text or
scripts for animation, and often provides guarantees and = tools that take
advantage of the specifics of the domain to help write = and maintain
these particular programs. On the other hand, the implemen= tation of a
DSL can automate many tasks traditionally performed by a fe= w experts
to turn a specification into an executable, thus making this = expertise
available widely. Overall, a DSL thus mediates a collaboratio= n between
its users and implementers that results in software that is m= ore usable,
more portable, more reliable, and more understandable.
=

These benefits of DSLs have been delivered in domains old and new, = such
as signal processing, data mining, and Web scripting. Widely known=
examples of DSLs include Matlab, Verilog, SQL, LINQ, HTML, OpenGL, Macromedia Director, Mathematica, Maple, AutoLisp/AutoCAD, XSLT, RPM,
= Make, lex/yacc, LaTeX, PostScript, and Excel. Despite these successes,
= the adoption of DSLs have been stunted by the lack of general tools and principles for developing, compiling, and verifying domain-specific
pr= ograms. General support for building and using DSLs is thus urgently
ne= eded. Languages that straddle the line between the domain-specific
and = the general-purpose, such as Perl, Tcl/Tk, and JavaScript, suggest
that= such support be based on modern notions of language design and
softwar= e engineering. The goal of this conference, following the last
one in 2= 009, is to explore how present and future DSLs can fruitfully
draw from= and potentially enrich these notions.


We seek research papers = on the theory and practice of DSLs, including
but not limited to the fo= llowing topics.


* Foundations, including semantics, formal meth= ods, type theory, and
complexity theory
* Language design, includin= g concrete syntax, semantics, and types
* Software engineering, includi= ng domain analysis, software design,
and round-trip engineering
* M= odularity and composability of DSLs
* Software processes, including met= rics for software and language
evaluation
* Implementation, includi= ng parsing, compiling, program generation,
program analysis, transforma= tion, optimization, and parallelization
* Reverse engineering, re-engin= eering, design discovery, automated
refactoring
* Hardware/software= codesign
* Programming environments and tools, including visual langua= ges,
debuggers, testing, and verification
* Teaching DSLs and the u= se of DSLs in teaching
* Case studies in any domain, especially the gen= eral lessons they
provide for DSL design and implementation

The conference will include a visit to the city of Bordeaux, a tour
an= d tasting at the wine museum and cellar, and a banquet at La Belle
=C9p= oque.

INSTRUCTIONS FOR AUTHORS

Papers will be judged on the= depth of their insight and the extent
to which they translate specific= experience into general lessons
for software engineers and DSL designe= rs and implementers. Where
appropriate, papers should refer to actual l= anguages, tools, and
techniques, provide pointers to full definitions, = proofs, and
implementations, and include empirical results.

Pro= ceedings will be published in Electronic Proceedings in Theoretical
Com= puter Science (http://in= fo.eptcs.org/). Submissions and final
manuscri= pts should be at most 25 pages in EPTCS format.

PROGRAM COMMITTEE <= br>
* Emilie Balland (INRIA)
* Olaf Chitil (University of Kent)
= * Zo=E9 Drey (IRIT)
* Nate Foster (Cornell University)
* Mayer Gold= berg (Ben-Gurion University)
* Shan Shan Huang (LogicBlox)
* Sam Kamin (University of Illinois at Urbana-Champaign)
* Jerzy= Karczmarczuk (University of Caen)
* Jan Midtgaard (Aarhus University) =
* Keiko Nakata (Tallinn University of Technology)
* Klaus Ostermann= (University of Marburg)
* Jeremy Siek (University of Colorado at Bould= er)
* Tony Sloane (Macquarie University)
* Josef Svenningsson (Chal= mers University of Technology)
* Paul Tarau (University of North Texas)=
* Dana N. Xu (INRIA)

ORGANIZERS

Local chair: Emilie Ba= lland (INRIA)
Program chairs: Olivier Danvy (Aarhus University),
Ch= ung-chieh Shan (Rutgers University)


---------------------------= ---------------------------------------------
= ------=_Part_1202076_812442519.1302259242935--