CALL FOR PAPERS FTfJP 2011: Formal Techniques for Java-like Programs colocated with ECOOP 2011, Lancaster UK July 26, 2011 URL: http://www.cs.williams.edu/FTfJP2011/index.html OVERVIEW Formal techniques can help analyze programs, precisely describe program behavior, and verify program properties. Newer languages such as Java and C# provide good platforms to bridge the gap between formal techniques and practical program development, because of their reasonably clear semantics and standardized libraries. Moreover, these languages are interesting targets for formal techniques, because the novel paradigm for program deployment introduced with Java, with its improved portability and mobility, opens up new possibilities for abuse and causes concern about security. Work on formal techniques and tools for programs and work on the formal underpinnings of programming languages themselves naturally complement each other. This workshop aims to bring together people working in both these fields, on topics such as: - formal techniques for Java, C#, Scala or similar languages - specification techniques and interface specification languages - specification of software components and library packages - automated checking and verification of program properties - verification logics - language semantics - type systems - dynamic linking and loading - security CALL FOR CONTRIBUTIONS Contributions (of up to 6 pages in the ACM 2-column style) are sought on open questions, new developments, or interesting new applications of formal techniques in the context of Java or similar languages. Contributions should not merely present completely finished work, but also raise challenging open problems or propose speculative new approaches. We particularly welcome contributions that simply suggest good topics for discussion at the workshop, or raise issues that you feel deserve the attention of the research community. Contributions will be formally reviewed, for originality, relevance, and the potential to generate interesting discussions. The workshop is intended for around 25 participants. The workshop will be organized into four or more sessions, each focused on a specific topic, and initiated by a presentation of few related position papers by the respective participants, or the introduction of the specific topic by a single speaker, and followed by discussions. Accepted papers will be published in the ACM Digital Library. In addition, depending on the nature of the contributions, we may organize a special journal issue as a follow-up to the workshop, as has been done for some of the previous FTfJP workshops. Contributions must be in English, in pdf format, and are limited to 6 pages in ACM 2-column style. Papers must be submitted electronically via Easy Chair. A plain-text ASCII abstract must be submitted one week before the paper submission deadline. Submission site: http://www.easychair.org/conferences/?conf=ftfjp13 Any PC member, other than the chair, may be an author or co-author on any paper submitted for consideration but will be excluded from any evaluation or discussion of the paper. IMPORTANT DATES abstract submission: April 8, 2011 full paper submission: April 15, 2011 notification: May 20, 2011 camera-ready paper: June 10, 2011 workshop: July 26, 2011 PROGRAM COMMITTEE Gavin Bierman, Microsoft Research, UK Viviana Bono, Universita di Torino, Italy Manuel Fahndrich, Microsoft Research, USA Stephen Freund, Williams College, USA (chair) Miguel Garcia, Ecole Polytechnique Federale de Lausanne, Switzerland Giovanni Lagorio, Universita di Genova, Italy Rustan Leino, Microsoft Research, USA Rosemary Monahan, National University of Ireland, Ireland Wojciech Mostowski, Radboud University Nijmegen, The Netherlands Chin Wei Ngan, University of Singapore, Singapore Jan Smans, Katholieke Universiteit Leuven, Belgium Serdar Tasiran, Koc University, Turkey Frank Tip, IBM Research, USA (on sabbatical at University of Oxford, UK) Tobias Wrigstad, Uppsala University, Sweden ORGANIZATION Susan Eisenbach, Imperial College, London, Great Britain Stephen Freund, Williams College, USA Gary T. Leavens, University of Central Florida, Orlando, USA Rustan Leino, Microsoft Research, USA Peter Muller, ETH Zurich, Switzerland Arnd Poetzsch-Heffter, Universitat Kaiserlautern, Germany Erik Poll, Radboud University Nijmegen, The Netherlands