[TYPES/announce] Postdoc in PL, RL, and Networking
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] We invite applications for a postdoctoral research associate with Wen Sun and Nate Foster at Cornell University. The successful candidate will conduct interdisciplinary research in Programming Languages, Reinforcement Learning, and Networking, with the goal of developing techniques for rapidly training and deploying defensive agents in real-world networks. They will also be provided with significant freedom to explore ideas that expand the scope of the project as well as mentoring and opportunities for professional development. Applicants should have a PhD in CS or a related field, with expertise in Programming Languages, Reinforcement Learning, or Networking, a demonstrated track record, and strong communication skills, and a desire to work as part of an interdisciplinary team. The position is for one year initially but may be extended to additional years. To apply, please send a CV, a representative publication, and the names of 2-3 references to Wen Sun (ws...@cornell.edu) and Nate Foster ( jn...@cornell.edu). We especially welcome applications from women and members of under-represented minority groups.
[TYPES/announce] Postdoctoral Researcher at Cornell University
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] We invite applications for a postdoctoral research associate at Cornell University. The position is part of the Pronto Project (prontoproject.org). We are developing verified compilers for network devices. Applicants should have a PhD in Computer Science, expertise in programming languages design and implementation, strong communication skills, and a desire to work as part of an interdisciplinary team. A background in networking is not required. However, familiarity with formal semantics and proof assistants is preferred. The successful candidate will be provided with significant freedom to explore ideas that expand the scope of the project as well as opportunities for professional development. The position is for one year initially but may be extended to additional years. To apply, please send a CV, a research statement, one representative publication, and the names of three references to Nate Foster ( jnfos...@cs.cornell.edu). We especially welcome applications from women and members of under-represented minority groups.
[TYPES/announce] NetPL '18: Call for Participation
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] We are excited to announce the 4th Workshop on Networking and Programming Languages (NetPL), co-located with POPL in Los Angeles. We have assembled an excellent lineup of invited speakers from academia and industry, representing both the PL and networking perspectives. Details about the technical program and registration are provided below. See you in Los Angeles! Regards, Marco Canini, Nate Foster, and Todd Millstein DATE January, 9th 2018 WEBSITE https://popl18.sigplan.org/track/netpl-2018 REGISTRATION https://regmaster4.com/2018conf/POPL18/register.php DESCRIPTION This workshop aims to bring together researchers from two areas that are increasingly mutually relevant: programming languages and networking. The relevance of languages to computer networks has become apparent in recent years by the emergence of software-defined networking (SDN) and programmable data planes, which allow the behavior of the network to be controlled in software. Further, the increasing demands on and complexity of networks in the era of cloud services has exacerbated the need for network reliability and tools for reasoning about network behavior. However, while many aspects of networking can in principle be improved by suitable programming languages for expressing network policy and software verification tools for guaranteeing network properties, traditional programming languages techniques do not work “out of the box” for networks due to a range of theoretical and practical challenges. The goals of this workshop are to raise awareness in the POPL community of the relevance of languages to computer networks, to showcase recent research highlights in this area, and to identify and discuss current challenges in a way that is accessible to the POPL community. PROGRAM The program is structured around a mixture of invited talks, panels, and breakout groups to discuss specific research directions. Participation in the workshop is open to everyone, and participants will be given an opportunity to briefly describe their current research if interested. Store, Translate and Forward: From Model to Metal in 25 Years Jonathan Smith (DARPA) Common Models for Network Configuration and Behavioral Validation Anees Shaikh (Google) Working Groups Very Large Scale Network Verification Andrey Rybalchenko (MSR) Safety Verification of Stateful Networks Sharon Shoham (Tel Aviv) Understand and verify your network using Header Space Analysis Peyman Kazemian (Forward Networks) P4: A Language for Data Plane Programming Calin Cascaval (Barefoot Networks) A Vision for Network Design Automation George Varghese (UCLA) Panel David Walker (Princeton), Barath Raghavan (USC) Wrap Up Marco Canini (KAUST), Nate Foster (Cornell), Todd Millstein (UCLA)
[TYPES/announce] Workshop on Reasoning about Declarative Programs -- Call for Participation
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] * CALL FOR PARTICIPATION Workshop on Reasoning about Declarative Programs Paris, January 21, 2017 The first workshop on Reasoning about Declarative Programs (RDP) will be held in conjunction with the ACM SIGPLAN Symp. on Principles of Programming Languages (POPL 2017). It aims to bring together researchers from programming languages, distributed computing, declarative networking, and databases, to stimulate cross-fertilization among these areas. The technical program consists of discussions and the following invited talks: Aws AlbarghouthiSynthesizing Data-parallel Programs Alvin Cheung Cosette: A Solver for SQL Equivalences Adam Chlipala Fiat: A New Take on Domain-Specific Languages by Programming with Specifications Alin DeutschAutomatic Verification of Database-Centric Workflows Kathleen Fisher Programming Language Ideas Escape the Lab: Declarative Data Description Languages for Managing Ad-hoc Data Rick Hull Verification Challenges in Applications of Blockchain for Business Collaboration Christoph KochBuilding performance-sensitive systems in high-level languages Frank NevenParallel-Correctness and Transferability for Conjunctive Queries Szymon Torunczyk Computation with Atoms We invite broad participation from the programming languages and database communities. *Early registration ends on December 17*. Program Committee Nate Foster, Cornell University Mooly Sagiv, Tel Aviv University Victor Vianu, UC San Diego For more information see http://conf.researchr.org/track/POPL-2017/RDP-2017
[TYPES/announce] SOSR CFP: abstracts 26 Oct, submissions 30 Oct
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] SOSR is a new conference on software-defined networking research, sponsored by ACM SIGCOMM and co-located with the Open Networking Summit (a large industrial conference) and USENIX NSDI. Work at the intersection of programming languages, formal methods, and networking is very much within scope. If you are doing work in this area, please consider submitting. Regards, Nate The Symposium on SDN Research (SOSR) is the premiere venue for research publications on SDN, building on past years' successful SOSR and HotSDN (Hot Topics in Software Defined Networking) workshops. This year, SOSR will be co-located with the Open Networking Summit (ONS) and the USENIX Symposium on Networked Systems Design and Implementation (NSDI'16), providing greater opportunity for industry and academia to jointly explore and debate recent developments related to all aspects of SDN. SOSR will accept both short (6-page) and long (12 page) papers, covering everything from radical ideas to deployed systems related to Software-Defined Networking. Important Dates • 5pm PST Monday October 26 (midnight GMT): Abstract registration • 5pm PST Friday October 30 (midnight GMT): Paper submission • December 18: Notification • March 14-15: Symposium Full CFP and submissions: http://conferences.sigcomm.org/sosr/2016/
[TYPES/announce] Research position at Cornell
[ The Types Forum (announcements only),
http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]
We invite applications for an {OCaml, Coq} programmer supporting the
Frenetic Project. See the following URL or the text below for further
details:
https://cornellu.taleo.net/careersection/10164/jobdetail.ftl?job=368072
-N
Description
The Programmer Analyst will, as a staff member of the Department of
Computer Science, support the Frenetic project team and its objective to
develop a high-level programming language for software-defined networks.
Under the supervision of the Principal Investigators (PIs) and in
collaboration with researchers and graduate students, the programmer will
design and develop the Frenetic language, along with its associated tools
and applications. The programmer will design, develop, test, document and
maintain the software they create. This will entail designing and
implementing compiles and run-time systems using OCaml, Coq and Z3;
developing infrastructure for interfacing with software and hardware
OpenFlow switches; conducting tests and simulations using the server
cluster maintained by the project; and building applications that leverage
the features provided in Frenetic to enable novel functionality. The end
result will be a high-fidelity functional end-to-end working prototype that
incorporates agreed upon interfaces and designs.
Additionally, the programmer will assume responsibility for managing all
project databases, source code repositories, servers, Wikis, mailing lists,
websites and other IT resources associated with the project. The supervisor
will assign specific tasks. General tasks are to be performed by the
appointee on his or her own initiative. Regular meetings will be held as
needed to review work, discuss problems and plan future efforts.
This is a one-year term position and will be based either in Ithaca, NY or
New York, NY.
Qualifications
The successful candidate will have: Bachelors degree in Computer Science
with 2-3 years experience or equivalent combination. Experience with OCaml;
familiarity with Coq preferred. Prior experience building production
software and familiarity with professional software development
methods. Background check may be required. No relocation assistance is
provided for this position. Visa sponsorship is not available for this
position.
[TYPES/announce] postdoc position at Cornell
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] We invite applications for a postdoctoral research associate at Cornell University. The position is part of a project that seeks to develop new language abstractions for managing software updates in distributed systems. Applicants should have a PhD in Computer Science, expertise in programming languages design and implementation, strong communication skills, and a desire to work as part of an interdisciplinary team. The successful candidate will be provided with opportunities for professional development and for exploring ideas that expand the scope of the project. The position is for one year initially but may be extended to additional years. To apply, please send a CV, a research statement, one representative publication, and the names of three references to Nate Foster (jnfos...@cs.cornell.edu). We especially welcome applications from women and members of under-represented minority groups. Best regards, Nate
[TYPES/announce] Summer school on formal methods and networks
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Summer School on Formal Methods and Networks June 10-14, 2013 Cornell University Ithaca, NY, USA INTRODUCTION In many areas of computing, techniques ranging from testing to formal modeling to full-blown verification have been successfully used to help programmers create reliable systems. For example, in processor development, automated theorem proving uncovers deep bugs in designs before they become costly errors in silicon; avionics developers use program analysis to verify critical safety properties of the embedded software running on airplanes; and operating system vendors have successfully used model checking to eliminate entire classes of bugs in device drivers. But, until recently, networks have largely resisted analysis using formal techniques. The goal of this summer school is to bring together leading researchers and graduate students to study recent research results on applying formal methods to networks. The curriculum will consist of a series of lectures on topics from theoretical frameworks for modeling network behavior to practical techniques and tools. The lectures will be designed to be accessible to a general computer science audience and will not assume advanced knowledge of formal methods or networks. SPEAKERS Nikolaj Bjorner (Microsoft Research) Satisfiability Modulo Theories Solving for Network Verification Brighten Godfrey (University of Illinois at Urbana-Champaign) Verifying Networks in Real Time Timothy Griffin (University of Cambridge) Partial Automation in the Design and Implementation of Path-finding Algorithms Arjun Guha (University of Massachusetts Amherst) Network Programming With Frenetic Shriram Krishnamurthi (Brown University) Modeling and Reasoning about Network Components Ratul Mahajan (Microsoft Research) Systematically Exploring the Behavior of Control Programs Nick McKeown and Peyman Kazemian (Stanford University) Network Verification Using Header Space Analysis Pamela Zave (ATT Research) Compositional Abstractions of Network Architectures REGISTRATION Information coming soon... SUPPORT Generous support for the summer school is provided by the National Science Foundation under grants CNS-698 and CNS-520. To encourage broad participation, registration fees will be kept low, and we expect to be able to offer a number of student travel scholarships. ORGANIZERS Nate Foster (Cornell University) Jennifer Rexford (Princeton University) David Walker (Princeton University)
[TYPES/announce] BX'13 Call for Papers
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] CALL FOR PAPERS Second International Workshop on Bidirectional Transformations (BX 2013) http://bx-community.wikidot.com/bx2013:home Sunday March 17th, 2013 Rome, Italy colocated with ETAPS 2013 Bidirectional transformations (bx) are a mechanism for maintaining the consistency of at least two related sources of information. Such sources can be databases, software models, documents, graphs, and trees. BX are an emerging topic in a wide range of research areas with prominent presence at top conferences in different fields. Following the success of BX'12, BX'13 is a dedicated venue for bx in all relevant areas. The methodologies used for bx range from classical program transformation to graph transformation techniques, from ad-hoc techniques for data synchronization to the development of domain-specific languages and their integration. We also solicit papers on model/metamodel co-evolution, which is a different yet closely related subject. Aims and Topics The aim of the workshop is to bring together researchers, established and new, interested in bidirectional transformations from different perspectives, such as: language-based approaches, software/model transformations, and data/schema co-evolution. Topics of interest for BX'13 include, but are not limited to: * software-model synchronization * data-schema co-evolution and data synchronization * consistency analysis * (coupled) software/model transformations * language-based approaches * analysis/classification of requirements for bx technologies * case studies and tool support * efficiency of algorithms and benchmarks * comparison of bx technologies Submissions can be: * research papers providing new concepts and results * position papers and research perspectives * papers that apply bx in new domains * papers closing gaps between formal concepts and application scenarios Submitted papers must be 6-15 pages in length, otherwise they will be rejected without review. Preliminary proceedings, including all the papers selected for the workshop, will be available electronically at the workshop. Post-proceedings of the workshop will appear as a volume of EC-EASST. Workshop papers that were shorter than 11 pages will require extension and a second round of reviewing, if their authors wish them to appear in the post-proceedings. We specifically welcome short papers that may be extended to full papers, perhaps with extra authors, following discussion at the workshop. Perdita Stevens (University of Edinburgh, UK) James Terwilliger (Microsoft, USA) Paper submission: 18 December 2012 Notification: 22 January 2013 Camera ready: 3 February 2013 Dates: Sunday March 17th, 2013 Website: http://bx-community.wikidot.com/bx2013:home
[TYPES/announce] WRiPE '12: deadline extended
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Due to several requests we've decided to push the submission deadline back a few days to August 3rd (anywhere in the world). We look forward to receiving your submissions. The 2nd International Workshop on Rigorous Protocol Engineering http://www.cs.cornell.edu/conferences/wripe2012 Austin, Texas, USA 30 October 2012 co-located with ICNP 2012 OVERVIEW The increased performance and maturity of verification techniques, including the use of tools such as model checkers, theorem provers, and SAT/SMT solvers, provides a rich set of techniques that could be applied to the area of networking. Unfortunately these techniques are rarely used in practice. WRiPE is an inter-disciplinary workshop that seeks to bring together researchers from the networking, formal methods, and programming languages communities to discuss current research on rigorous network protocol design and implementation. The goal of the workshop is to reinvigorate and revitalize the application of formal methods to the design, analysis, and implementation of protocols. SCOPE We include under the heading of verification any rigorous method of synthesizing an implementation, demonstrating that an existing implementation satisfies a given specification, or showing how reliable conclusions can be extracted from measurements. Under network protocols we include the traditional IP stack, emerging software router platforms such as OpenFlow, as well as routing, transport, application overlays, wireless protocols for carrier, enterprise, and data center networks. We are also interested in rigorous methods for establishing security properties of protocols. Specific topics of interest include (but are not limited to) the following: * Correct-by-construction methods for developing protocols. * Applications of model checkers, theorem provers, SAT/SMT solvers, and so on to network protocols. * Techniques for synthesizing protocol implementations and configurations. * Domain specific languages for describing protocols. * Run-time techniques for formally verifying and testing the correctness of protocols. IMPORTANT DATES Submission: 3 August 2012 anywhere in the world (extended from 31 July) Notification: 3 September 2012 Camera-ready: 20 September 2012 WRiPE 2012: 30 October 2012 ORGANIZERS Nate Foster (Cornell University, co-chair) Alexander Gurney (University of Pennsylvania, co-chair) Anja Feldmann (Deutsche Telekom Laboratories/TU Berlin) Limin Jia (Carnegie Mellon University) Peyman Kazemian (Stanford University) Dejan Kostic (Ecole Polytechnique Federale de Lausanne) Hung Nguyen (University of Adelaide) Olaf Maennel (Loughborough University) Robbert van Renesse (Cornell University) Michael Schapira (Hebrew University of Jerusalem) Jonathan Sobel (Cisco Systems) Stefano Vissicchio (Universite Catholique de Louvain) David Walker (Princeton University) Pamela Zave (ATT Research) Wenchao Zhou (Georgetown University) AUTHOR GUIDELINES Prospective authors are invited to submit papers in English presenting original research. Submissions to WRiPE must not be concurrent with a substantially similar submission to a conference or workshop, including condensed versions of work that has been submitted and is currently under review. Please do not submit abbreviated versions of journal or conference papers. Reviewing will not be blind. We encourage submissions of work-in-progress based on novel and interesting ideas and tool demonstrations. All submitted papers must be no longer than six (6) pages in double-column format with standard margins (i.e., at least one inch all around) and at least a 10 point font. Longer submissions will not be reviewed. We suggest using the IEEE Transactions Style: http://www.ieee.org/publications_standards/publications/authors/authors_journals.html PROCEEDINGS Accepted papers will be published by the IEEE Press.
[TYPES/announce] Call for papers: Workshop on Rigorous Protocol Engineering (WRiPE)
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] The 2nd International Workshop on Rigorous Protocol Engineering http://www.cs.cornell.edu/conferences/wripe2012 Austin, Texas, USA 30 October 2012 co-located with ICNP 2012 OVERVIEW The increased performance and maturity of verification techniques, including the use of tools such as model checkers, theorem provers, and SAT/SMT solvers, provides a rich set of techniques that could be applied to the area of networking. Unfortunately these techniques are rarely used in practice. WRiPE is an inter-disciplinary workshop that seeks to bring together researchers from the networking, formal methods, and programming languages communities to discuss current research on rigorous network protocol design and implementation. The goal of the workshop is to reinvigorate and revitalize the application of formal methods to the design, analysis, and implementation of protocols. SCOPE We include under the heading of verification any rigorous method of synthesizing an implementation, demonstrating that an existing implementation satisfies a given specification, or showing how reliable conclusions can be extracted from measurements. Under network protocols we include the traditional IP stack, emerging software router platforms such as OpenFlow, as well as routing, transport, application overlays, wireless protocols for carrier, enterprise, and data center networks. We are also interested in rigorous methods for establishing security properties of protocols. Specific topics of interest include (but are not limited to) the following: * Correct-by-construction methods for developing protocols. * Applications of model checkers, theorem provers, SAT/SMT solvers, and so on to network protocols. * Techniques for synthesizing protocol implementations and configurations. * Domain specific languages for describing protocols. * Run-time techniques for formally verifying and testing the correctness of protocols. IMPORTANT DATES Submission: 31 July 2012 (anywhere in the world) Notification: 3 September 2012 Camera-ready: 20 September 2012 WRiPE 2012: 30 October 2012 ORGANIZERS Nate Foster (Cornell University, co-chair) Alexander Gurney (University of Pennsylvania, co-chair) Limin Jia (Carnegie Mellon University) Peyman Kazemian (Stanford University) Hung Nguyen (University of Adelaide) Olaf Maennel (Loughborough University) Robbert van Renesse (Cornell University) Michael Schapira (Hebrew University of Jerusalem) Stefano Vissicchio (Universite Catholique de Louvain) David Walker (Princeton University) Pamela Zave (ATT Research) Wenchao Zhou (Georgetown University) AUTHOR GUIDELINES Prospective authors are invited to submit papers in English presenting original research. Submissions to WRiPE must not be concurrent with a substantially similar submission to a conference or workshop, including condensed versions of work that has been submitted and is currently under review. Please do not submit abbreviated versions of journal or conference papers. Reviewing will not be blind. We encourage submissions of work-in-progress based on novel and interesting ideas and tool demonstrations. All submitted papers must be no longer than six (6) pages in double-column format with standard margins (i.e., at least one inch all around) and at least a 10 point font. Longer submissions will not be reviewed. We suggest using the IEEE Transactions Style: http://www.ieee.org/web/publications/authors/transjnl/index.html. PROCEEDINGS Accepted papers will be published by the IEEE Press.
[TYPES/announce] DBPL '11 Call for Participation
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] The 13th International Symposium on Database Programming Languages http://www.cs.cornell.edu/conferences/dbpl2011 Seattle, Washington, USA August 29, 2011 co-located with VLDB 2011 Call for Participation For over 20 years, DBPL has established itself as the principal venue for publishing and discussing new ideas at the intersection of databases and programming languages. Many key contributions in query languages for object-oriented data, persistent databases, nested relational data, semistructured data, as well as fundamental ideas in types for query languages were first announced at DBPL. Today, the emergence of new data management applications such as Semantic Web and Web services, XML processing, Social and Sensor Networks, Cloud Computing and Peer-to-peer data management has lead to a new flurry of creative research in this area. DBPL is an established destination for such new ideas. INVITED SPEAKERS * Philip Wadler (Edinburgh) Databases and Programming Languages: Together again for the first time * Christopher Olsten (Bionica Human Computing) Programming and Debugging Large-Scale Data Processing Workflows --- ACCEPTED PAPERS --- * Temporal Data Model for Program Debugging Demian Lessa, Bharat Jayaraman, Jan Chomicki * DBWiki: A Database Wiki prototyped in Links James Cheney, Sam Lindley, Heiko Mueller * Chasing One's Tail: XPath Containment Under Cyclic DTDs Peter Wood, Mahtab Montazerian * On guarded simulations and acyclic first-order languages George Fletcher, Jan Hidders, Stijn Vansummeren, Yongming Luo, Francois Picalausa, Paul De Bra * Remote Batch Invocation for Database Access William Cook, Ben Wiedermann * PSPARQL Query Containment Melisachew Wudage Chekol, Jerome Euzenat, Pierre Geneves, Nabil Layaida * Next Generation Database Programming and Execution Environment Dirk Habich, Matthias Boehm, Maik Thiele, Benjamin Schlegel, Ulrike Fischer, Hannes Voigt, Wolfgang Lehner * Validity of Positive XPath Queries with Wildcard in the Presence of DTDs Kenji Hashimoto, Yohei Kusunoki, Yasunori Ishihara, Toru Fujiwara REGISTRATION Registration and local arrangements are being handled through the main VLDB conference. * Registration: http://www.vldb.org/2011/?q=node/20 * Local Arrangements: http://www.vldb.org/2011/?q=node/21 -- ORGANIZERS -- Nate Foster, Cornell University (Co-chair) Anastasios Kementsietsidis, IBM (Co-chair) Yanif Ahmad, Johns Hopkins Gavin Bierman, MSR-Cambridge Martin Bravenboer, LogicBlox Songyun Duan, IBM Floris Geerts, Edinburgh Pierre Geneves, CNRS Giorgio Ghelli, Pisa Todd Green, UC Davis Fritz Henglein, DIKU Feifei Li, Florida State Lipyeow Lim, Hawaii Sam Lindley, Edinburgh Kim Nguyen, LRI, Paris-Sud 11 Jorge Perez, UChile Dimitris Theodoratos, NJIT Yannis Velegrakis, Trento
[TYPES/announce] DBPL 2011 Call for papers
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] The 13th International Symposium on Database Programming Languages http://www.cs.cornell.edu/conferences/dbpl2011 Seattle, Washington, USA August 29, 2011 co-located with VLDB 2011 Call for Papers For over 20 years, DBPL has established itself as the principal venue for publishing and discussing new ideas at the intersection of databases and programming languages. Many key contributions in query languages for object-oriented data, persistent databases, nested relational data, semistructured data, as well as fundamental ideas in types for query languages were first announced at DBPL. Today, the emergence of new data management applications such as Semantic Web and Web services, XML processing, Social and Sensor Networks, Cloud Computing and Peer-to-peer data management has lead to a new flurry of creative research in this area. DBPL is an established destination for such new ideas. - SCOPE - DBPL solicits theoretical and practical papers in all areas of Database Programming Languages. Papers emphasizing new topics or foundations of emerging areas are especially welcome. Suggested, but not exclusive, topics of interest for submissions include: * Data Exchange * Data Integration and Interoperability * Databases and Information Retrieval * Databases and the Semantic Web * Databases and Social Networking * Databases and Cloud Computing * Databases in Bioinformatics * Databases in Computational Linguistics * Declarative Data Centers * Dependent Type Systems * Information-Flow Type Systems * Managing Uncertain and Imprecise Information * Language-Integrated Query Mechanisms * Programming Language Support for Databases * Databases in E-commerce * Multimedia Databases * Peer-to-peer Data Management * Provenance * Stream Data Processing * Schema Mapping and Metadata Management * Security in Data Management * Semi-structured Data * Spatial and Temporal data * Transaction Management * Validation, Type-checking * Web Services * XML Processing - AUTHOR GUIDELINES - Prospective authors are invited to submit papers in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. Submissions should be no more than 6 pages long in the standard ACM SIG proceedings format with two columns and a nine-point font on a ten-point baseline. It is recommended that each submission begin with a succinct statement of the problem and a summary of the main results. If the authors believe more details are necessary to substantiate the main claims of the paper, they may include a clearly marked appendix to be read at the discretion of the committee. At least one author of each accepted paper must attend the symposium to present their work. Papers must be submitted online at the following URL: https://cmt.research.microsoft.com/DBPL2011/Default.aspx --- IMPORTANT DATES --- Submission : June 8, 2011 (11:59pm EDT) Notification : July 16, 2011 DBPL 2011: August 29, 2011 --- PROCEEDINGS --- Accepted papers will appear in an informal proceedings, distributed electronically from the symposium website. - PROGRAM COMMITTEE - Nate Foster, Cornell University (Co-chair) Anastasios Kementsietsidis, IBM Research (Co-chair) Yanif Ahmad, Johns Hopkins Gavin Bierman, MSR-Cambridge Martin Bravenboer, LogicBlox Songyun Duan, IBM Research Floris Geerts, Edinburgh Pierre Geneves, CNRS Giorgio Ghelli, Universita di Pisa Todd Green, UC Davis Fritz Henglein, DIKU Feifei Li, Florida State Lipyeow Lim, Hawaii Sam Lindley, Edinburgh Kim Nguyen, NICTA Jorge Perez, Pontificia Universidad Catolica de Chile Dimitris Theodoratos, NJIT Yannis Velegrakis, Trento --- HISTORY --- The 13th Symposium on Data Base Programming Languages (DBPL 2011) continues the tradition of excellence initiated by its predecessors in Roscoff, Finistere (1987), Salishan, Oregon (1989), Nafplion, Argolida (1991), Manhattan, New York (1993), Gubbio, Umbria (1995), Estes Park, Colorado (1997), Kinloch Rannoch, Scotland (1999), Marino, Rome (2001), Potsdam, Germany (2003), Trondheim, Norway (2005), Vienna, Austria (2007), and Lyon, France (2009). DBPL has been affiliated with VLDB since 1999.
