From ohad.kammar at cs.ox.ac.uk Sun Jan 1 16:37:43 2017 From: ohad.kammar at cs.ox.ac.uk (Ohad Kammar) Date: Sun, 1 Jan 2017 21:37:43 +0000 Subject: [TYPES/announce] CFP: S-REPLS-5 @ Oxford Message-ID: =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-= CALL FOR PARTICIPATION Southern-Region English Programming Language Seminar (S-REPLS) (Fifth Meeting) 11am-5pm, Thursday, 12th January 2017 (Thursday before POPL) University of Oxford Department of Computer Science http://www.cs.ox.ac.uk/people/ohad.kammar/s-repls-5/ Doodle registration: http://doodle.com/poll/hz6z3zqpupds2fm4 (free participation) =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-= S-REPLS is a regular informal meeting for those with a professional interest in programming languages in the South of England region. The past four meetings consisted of 50-90 participants from academia and industry with invited and contributed talks ranging from abstract areas in semantics and type system theory to nuts-and-bolts implementations of mainstream and avant-garde compilers and programming languages. We will hold the next meeting at the University of Oxford Department of Computer Science. Schedule -------- For schedule and abstracts, see: http://www.cs.ox.ac.uk/people/ohad.kammar/s-repls-5 Sign-up ------- The meeting is free of charge, but for logistical purposes please indicate if you plan to attend: http://doodle.com/poll/hz6z3zqpupds2fm4 Mailing list ------------ All S-REPLS related communications are made via the mailing list: http://www.jiscmail.ac.uk/srepls This mailing list has very low traffic. If you have professional interests in programming language in the region, we encourage you to sign up. Sponsorship ----------- Please let us know of potential sponsorship opportunities at: Ohad Kammar Past events have had academic, industrial, and government sponsorship for invited speaker costs, catering costs (lunch, dinner, or refreshments during the break). Organising future meetings -------------------------- If you would like to organise future meetings at your university or company, please get in touch with the steering committee Dominic Mulligan Jeremy Yallop Ohad Kammar We would be grateful if you could please circulate this announcement in your department/company. We hope to see you there, Jeremy Gibbons, Sam Staton, and Ohad Kammar. From sandra at dcc.fc.up.pt Sun Jan 1 21:08:45 2017 From: sandra at dcc.fc.up.pt (Sandra Alves) Date: Mon, 2 Jan 2017 02:08:45 +0000 Subject: [TYPES/announce] FSCD'17 Call for Papers Message-ID: <60E9BFA9-E58C-4BED-8C94-68DFC4F53091@dcc.fc.up.pt> (Apologies for multiple copies of this announcement) ============================================================== CALL FOR PAPERS Second International Conference on Formal Structures for Computation and Deduction (FSCD'17) 3 -- 6 September 2017, Oxford, UK (co-located with ICFP 2017) http://www.cs.ox.ac.uk/conferences/fscd2017/ FSCD (http://fscdconference.org/) covers all aspects of formal structures for computation and deduction from theoretical foundations to applications. Building on two communities, RTA (Rewriting Techniques and Applications) and TLCA (Typed Lambda Calculi and Applications), FSCD embraces their core topics and broadens their scope to closely related areas in logics, proof theory and new emerging models of computation such as quantum computing or homotopy type theory. ========================================================================== IMPORTANT DATES All deadlines are midnight anywhere-on-earth (AoE) and are firm; late submissions will not be considered. Abstract Deadline: 7 April 2017 Submission Deadline: 14 April 2017 Rebuttal: 29--31 May 2017 Notification: 14 June 2017 Camera-Ready: 7 July 2017 ========================================================================== Suggested, but not exclusive, list of topics for submission are: 1. Calculi: Lambda calculus * Concurrent calculi * Logics * Rewriting systems * Proof theory * Type theory and logical frameworks 2. Methods in Computation and Deduction: Type systems * Induction and coinduction * Matching, unification, completion, and orderings * Strategies * Tree automata * Model checking * Proof search and theorem proving * Constraint solving and decision procedures 3. Semantics: Operational semantics * Abstract machines * Game Semantics * Domain theory and categorical models * Quantitative models 4. Algorithmic Analysis and Transformations of Formal Systems: Type Inference and type checking * Abstract Interpretation * Complexity analysis and implicit computational complexity * Checking termination, confluence, derivational complexity and related properties * Symbolic computation 5. Tools and Applications: Programming and proof environments * Verification tools * Libraries for proof assistants and interactive theorem provers * Case studies in proof assistants and interactive theorem provers * Certification PUBLICATION The proceedings will be published as an electronic volume in the Leibniz International Proceedings in Informatics (LIPIcs) of Schloss Dagstuhl. All LIPIcs proceedings are open access. SUBMISSION GUIDELINES Submissions can be made in two categories. Regular research papers are limited to 15 pages and must present original research which is unpublished and not submitted elsewhere. System descriptions are limited to 10 pages and must describe a working system which has not been published or submitted elsewhere. Submissions must be formatted using the LIPIcs style files and submitted via EasyChair. Complete instructions on submitting a paper can be found on the conference web site. SPECIAL ISSUES Full versions of several accepted papers, to be selected by the program committee, will be invited for submission to a special issue of Logical Methods in Computer Science. BEST PAPER AWARD BY JUNIOR RESEARCHERS The program committee will consider declaring this award to a paper in which all authors are junior researchers: a junior researcher is a person who is either a student or whose PhD award date is less than three years from the first day of the meeting. PROGRAM COMMITTEE CHAIR Dale Miller, Inria Saclay & LIX PROGRAM COMMITTEE Andreas Abel, Gothenburg Univ. Elvira Albert, Complutense Madrid Maria Alpuente, TU Valencia Takahito Aoto, Niigata Univ. Zena Ariola, Univ. Oregon Federico Aschieri, TU Wien Stefano Berardi, Univ. Turin Lars Birkedal, Aarhus Univ. Filippo Bonchi, CNRS, ENS Lyon Pierre Clairambault, CNRS, ENS Lyon Ugo Dal Lago, Univ. Bologna Herman Geuvers, Radboud Univ. Silvia Ghilezan, Univ. Novi Sad Juergen Giesl, RWTH Aachen Hugo Herbelin, Inria Paris Jan Hoffmann, Carnegie Mellon Deepak Kapur, Univ. New Mexico Paul Blain Levy, Univ. Birmingham Paulo Oliva, QMUL, London Vincent van Oostrom, Univ. Innsbruck Daniela Petrisan, LIAFA, Paris Femke van Raamsdonk, VU Univ. Amsterdam Grigore Rosu, Univ. Illinois Albert Rubio, UPC-BarcelonaTech Paula Severi, Univ. Leicester Bas Spitters, Aarhus Univ. Aaron Stump, Univ. Iowa Kazushige Terui, Kyoto Univ. Rene Thiemann, Univ. Innsbruck Sophie Tison, Lille Univ. CONFERENCE CHAIR Sam Staton, Univ. of Oxford WORKSHOP CHAIR Jamie Vicary, Univ. of Oxford PUBLICITY CHAIR Sandra Alves, Univ. of Porto FSCD STEERING COMMITTEE T. Altenkirch (Univ. Nottingham), S. Alves (Univ. Porto), G. Dowek, (Inria), S. Escobar (Univ. Politecnica de Valencia), M. Fernandez (King's College London), H. Herbelin (Inria), D. Kesner (Univ. Paris), N. Kobayashi (Univ. Tokyo), L. Ong (Chair, Univ. Oxford), B. Pientka (McGill Univ.), R. Thiemann (Univ. Innsbruck). -------------- next part -------------- A non-text attachment was scrubbed... Name: cfp-latex.pdf Type: application/pdf Size: 103191 bytes Desc: not available URL: -------------- next part -------------- From james.cheney at gmail.com Wed Jan 4 05:28:43 2017 From: james.cheney at gmail.com (James Cheney) Date: Wed, 4 Jan 2017 10:28:43 +0000 Subject: [TYPES/announce] Lecturer/Senior Lecturer/Reader positions in Security & Privacy, Artificial Intelligence at Edinburgh Message-ID: Dear TYPES/announce, The School of Informatics, University of Edinburgh is hiring in the following areas relevant to / overlapping with types and verification: * Lecturer/Senior Lecturer/Reader in Security & Privacy https://www.vacancies.ed.ac.uk/pls/corehrrecruit/erq_ jobspec_version_4.jobspec?p_id=037885 Types, verification and programming languages have well-known applications to security & privacy. Our current Security & Privacy group covers "applied and theoretical cryptography, software security, human factors, protocol analysis, verification and quantum/post-quantum cryptography." For further details of the S&P group see: http://web.inf.ed.ac.uk/ security-privacy * Lecturer/Senior Lecturer/Reader in Artificial Intelligence https://www.vacancies.ed.ac.uk/pls/corehrrecruit/erq_ jobspec_version_4.jobspec?p_id=038357 This includes research on AI based on "human-intelligible [symbolic] representations", "logical inference", "explanation and justification of decisions" and "verification of AI systems", and does not mean "machine learning" - we have a separate search going on for that. For further details of the AI group (CISA) see: http://web.inf.ed.ac.uk/cisa/ --James -------------- next part -------------- An HTML attachment was scrubbed... URL: From ruy at cin.ufpe.br Thu Jan 5 10:10:45 2017 From: ruy at cin.ufpe.br (Ruy de Queiroz) Date: Thu, 5 Jan 2017 12:10:45 -0300 Subject: [TYPES/announce] 24th WoLLIC 2017 - Second Call for Papers Message-ID: [Please circulate. Apologies for multiple copies.] WoLLIC 2017 24th Workshop on Logic, Language, Information and Computation July 18-21, 2017 University College London (UCL), London, UK SCIENTIFIC SPONSORSHIP Interest Group in Pure and Applied Logics (IGPL) The Association for Logic, Language and Information (FoLLI) Association for Symbolic Logic (ASL) European Association for Theoretical Computer Science (EATCS) European Association for Computer Science Logic (EACSL) ACM Special Interest Group on Logic and Computation (ACM-SIGLOG) (TBC) Sociedade Brasileira de Computa??o (SBC) Sociedade Brasileira de L?gica (SBL) ORGANISATION Department of Computer Science, University College London, London, UK School of Electronic Engineering and Computer Science, Queen Mary College, London, UK Centro de Inform?tica, Universidade Federal de Pernambuco, Brazil HOSTED BY Department of Computer Science, University College London, London, UK CALL FOR PAPERS WoLLIC is an annual international forum on inter-disciplinary research involving formal logic, computing and programming theory, and natural language and reasoning. Each meeting includes invited talks and tutorials as well as contributed papers. The twenty-fourth WoLLIC will be held at the School of Electronic Engineering and Computer Science, Queen Mary College, London, UK, from July 18th to 21st, 2017. It is sponsored by the Association for Symbolic Logic (ASL), the Interest Group in Pure and Applied Logics (IGPL), the The Association for Logic, Language and Information (FoLLI), the European Association for Theoretical Computer Science (EATCS), the European Association for Computer Science Logic (EACSL), the Sociedade Brasileira de Computa??o (SBC), and the Sociedade Brasileira de L?gica (SBL). PAPER SUBMISSION Contributions are invited on all pertinent subjects, with particular interest in cross-disciplinary topics. Typical but not exclusive areas of interest are: foundations of computing and programming; novel computation models and paradigms; broad notions of proof and belief; proof mining, type theory, effective learnability; formal methods in software and hardware development; logical approach to natural language and reasoning; logics of programs, actions and resources; foundational aspects of information organization, search, flow, sharing, and protection; foundations of mathematics; philosophy of mathematics; philosophical logic. Proposed contributions should be in English, and consist of a scholarly exposition accessible to the non-specialist, including motivation, background, and comparison with related works. Articles should be written in the LaTeX format of LNCS by Springer (see authors instructions at http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0). They must not exceed 12 pages, with up to 5 additional pages for references and technical appendices. The paper's main results must not be published or submitted for publication in refereed venues, including journals and other scientific meetings. It is expected that each accepted paper be presented at the meeting by one of its authors. Papers must be submitted electronically at the WoLLIC 2017 EasyChair website. (Please go to http://wollic.org/wollic2017/instructions.html for instructions.) A title and single-paragraph abstract should be submitted by Mar 14, 2017, and the full paper by Mar 21, 2017 (firm date). Notifications are expected by Apr 22, 2017, and final papers for the proceedings will be due by May 6, 2017 (firm date). PROCEEDINGS The proceedings of WoLLIC 2017, including both invited and contributed papers, will be published in advance of the meeting as a volume in Springer's LNCS series. In addition, abstracts will be published in the Conference Report section of the Logic Journal of the IGPL, and selected contributions will be published as a special post-conference WoLLIC 2017 issue of a scientific journal (to be confirmed). INVITED SPEAKERS Hazel Brickhill (Bristol) (University of Bristol) Michael Detlefsen (University of Notre Dame) Alexander Kurz (University of Leicester) Frederike Moltmann (New York University) David Pym (University College London) Nicole Schweikardt (Humboldt Universitat) Fan Yang (Delft University) Boris Zilber (University of Oxford), STUDENT GRANTS ASL sponsorship of WoLLIC 2017 will permit ASL student members to apply for a modest travel grant (deadline: May 1st, 2017). See http://www.aslonline.org/studenttravelawards.html for details. IMPORTANT DATES Mar 14, 2017: Paper title and abstract deadline Mar 21, 2017: Full paper deadline Apr 22, 2017: Author notification May 6, 2017: Final version deadline (firm) PROGRAMME COMMITTEE Matthias Baaz (University of Technology, Vienna, Austria) John Baldwin (University of Illinois at Chicago, USA) Dana Bartozov? (Universidade de S?o Paulo, Brazil) Agata Ciabattoni (University of Technology, Vienna, Austria) Walter Dean (University of Warwick, UK) Erich Gr?del (RWTH Aachen, Germany) Volker Halbach (University of Oxford, UK) Juliette Kennedy (Helsinki University, Finland) (Chair) Dexter Kozen (Cornell University, USA) Janos Makowsky (Technion - Israel Institute of Technology, Israel) Larry Moss (indiana University, USA) Alessandra Palmigiano (Delft University, The Netherlands) Mehrnoosh Sadrzadeh (Queen Mary, UK) Sonja Smets (Amsterdam University, The Netherlands) Asger T?rnquist (K?benhavns Universitet, Denmark) Rineke Verbrugge (University of Groningen, The Netherlands) Andr?s Villaveces (Universidad Nacional, Colombia) Philip Welch (University of Bristol, UK) STEERING COMMITTEE Samson Abramksy, Johan van Benthem, Anuj Dawar, Joe Halpern, Wilfrid Hodges, Ulrich Kohlenbach, Daniel Leivant, Leonid Libkin, Angus Macintyre, Luke Ong, Hiroakira Ono, Valeria de Paiva, Ruy de Queiroz, Jouko V??n?nen. ORGANISING COMMITTEE Alexandra Silva (Univ College London, UK) (Local co-chair) Mehrnoosh Sadrzadeh (Queen Mary, UK) (Local co-chair) Paulo Oliva (Queen Mary, UK) James Brotherston (Univ College London, UK) Anjolina G. de Oliveira (U Fed Pernambuco) Ruy de Queiroz (U Fed Pernambuco) (co-chair) FURTHER INFORMATION Contact one of the Co-Chairs of the Organising Committee. WEB PAGE http://wollic.org/wollic2017/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From kirstin.peters at tu-berlin.de Fri Jan 6 08:31:56 2017 From: kirstin.peters at tu-berlin.de (Kirstin Peters) Date: Fri, 6 Jan 2017 14:31:56 +0100 Subject: [TYPES/announce] Call for Workshops - CONCUR 2017 Message-ID: <2646816d-bbf3-d13c-a8c3-990c31e87e8e@tu-berlin.de> * *CONCUR 2017* * THE 28TH INTERNATIONAL CONFERENCE ON CONCURRENCY THEORY 5-8 September 2017, Berlin, Germany (https://www.concur2017.tu-berlin.de/) CALL FOR AFFILIATED WORKSHOPS The 28th Conference on Concurrency Theory (CONCUR 2017) will be held from September 5th to September 8th 2017, in Berlin, Germany. It will be co-located with the 14th International Conference on Quantitative Evaluation of SysTems (QEST 2017), the 15th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS 2017), and the 14th European Performance Engineering Workshop (EPEW 2017). Researchers and practitioners are invited to submit proposals for workshops to be affiliated to CONCUR 2017, on topics related to concurrency theory and its applications. Example topics include: semantics, logics, verification techniques for concurrent systems, cross-fertilization between industry and academia and opportunities for young and prospective researchers. Past CONCUR conferences have been accompanied by successful workshops on a variety of topics, such as formal and foundational methods, models of systems (biological, timed), security issues, semantical issues, and verification methods. You can have an idea of the past workshops by browsing the pages of the past editions of CONCUR. The purpose of the workshops is to provide participants with a friendly, interactive atmosphere for presenting novel ideas and discussing their application. The workshops take place on Monday, September 4th and Saturday, September 9th, 2017. Proposals should include: * The name and the preferred date of the proposed workshop (Sept. 4th or 9th). * A short description of the workshop (500 words max). * If applicable, a description of past versions of the workshop, including dates, organizers, submission and acceptance counts, and attendance. * The expected number of participants. * The name and short CV of the organizer(s). * The publication plan (only invited speakers, no published proceedings, pre-/post-proceedings published with EPTCS/ENTCS/...). The CONCUR organization offers: * Link from the CONCUR web site. * Setup of meeting space, and related equipment. * Coffee-breaks. * On-line and on-site registration to the workshop. * One free workshop registration (for an invited speaker). The main responsibility of organizing a workshop goes to the workshop chairperson(s), including: * Workshop publicity (possibly including call for papers, submission and review process). * Scheduling workshop activities in collaboration with the CONCUR workshop chairs. IMPORTANT DATES Submission of workshop proposals: by January 27th, 2017 Notification: by February 3rd, 2017 SUBMISSION TO: Kirstin Peters (kirstin.peters at tu-berlin.de) For more information, please contact me via email (kirstin.peters at tu-berlin.de) The CONCUR 2017 workshop chair, Kirstin Peters https://kirstin-peters.de/ Technische Universit?t Berlin -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: smime.p7s Type: application/pkcs7-signature Size: 5002 bytes Desc: S/MIME Cryptographic Signature URL: From tmoldere at vub.ac.be Fri Jan 6 10:08:08 2017 From: tmoldere at vub.ac.be (Tim Molderez) Date: Fri, 6 Jan 2017 16:08:08 +0100 Subject: [TYPES/announce] 2017: Call for workshop, symposium & poster submissions Message-ID: ----------------------------------------------------------------------- 2017 : The Art, Science, and Engineering of Programming April 3-6, 2017, Brussels, Belgium http://2017.programming-conference.org ----------------------------------------------------------------------- We are excited to announce there will be 10 co-located events at the 2017 conference (and more to come!): - ELS 2017 - 10th European Lisp Symposium - Modularity 2017 Invited talks - International Symposium on Modularity - ACM Student Research Competition / 2017 Posters - LASSY 2017 - 2nd Workshop on Live Adaptation of Software SYstems - MOMO 2017 - 2nd Workshop on Modularity in Modelling - MoreVMs 2017 - 1st Workshop on Modern Language Runtimes, Ecosystems, and VMs - PASS 2017 - 1st Workshop on Programming Across the System Stack - PX 2017 - 2nd Workshop on Programming Experience - ProWeb 2017 - 1st Workshop on Programming Technology for the Future Web - Salon des Refus?s 2017 - 1st edition of the Salon des Refus?s workshop All co-located events will take place during April 3-4 2017. CFPs for each of these events are listed below. (apart from Modularity 2017, which is invitation-based) **************************************************************** ELS 2017 - 10th European Lisp Symposium Submissions: Mon 30 Jan 2017 Notifications: Mon 27 Feb 2017 http://2017.programming-conference.org/track/els-2017 **************************************************************** The purpose of the European Lisp Symposium is to provide a forum for the discussion and dissemination of all aspects of design, implementation and application of any of the Lisp and Lisp-inspired dialects, including Common Lisp, Scheme, Emacs Lisp, AutoLisp, ISLISP, Dylan, Clojure, ACL2, ECMAScript, Racket, SKILL, Hop and so on. We encourage everyone interested in Lisp to participate. The 10th European Lisp Symposium invites high quality papers about novel research results, insights and lessons learned from practical applications and educational perspectives. We also encourage submissions about known ideas as long as they are presented in a new setting and/or in a highly elegant way. Topics include but are not limited to: * Context-, aspect-, domain-oriented and generative programming * Macro-, reflective-, meta- and/or rule-based development approaches * Language design and implementation * Language integration, inter-operation and deployment * Development methodologies, support and environments * Educational approaches and perspectives * Experience reports and case studies ******************************************************************** ACM Student Research Competition / 2017 Posters Submissions: Mon 16 Jan 2017 http://2017.programming-conference.org/track/programming-posters ******************************************************************** The ACM Student Research Competition (SRC), sponsored by Microsoft Research, offers a unique forum for ACM student members at the undergraduate and graduate levels to present their original research before a panel of judges and conference attendees. The SRC gives visibility to up-and-coming young researchers, and offers them an opportunity to discuss their research with experts in their field, get feedback, and to help sharpen communication and networking skills. ACM?s SRC program covers expenses up to $500 for all students invited to an SRC. Please see our website for requirements and further details. ****************************************************************** LASSY 2017 - 2nd Workshop on Live Adaptation of Software SYstems Submissions: Fri 3 Feb 2017 Notifications: Fri 3 Mar 2017 http://2017.programming-conference.org/track/LASSY-2017-papers ****************************************************************** When developing current-day software systems, their deployment and usage environments should be considered carefully, in order to understand the adaptations those systems might need to undergo to interact with other systems and with their environment. Moreover, due to the portability, mobility and increasingly evolutionary nature of software systems, such adaptations should be enacted even while the system is running. Developing such software systems can prove challenging, and many seemingly different techniques to address this concern have been proposed over the last couple of years. The intention of the LASSY workshop is to congregate all topics relevant to dynamic adaptation and run-time evolution of software systems, ranging from a computer science perspective covering the domains of programming languages, model-driven software development, software and service composition, context-aware databases, software variability, requirements engineering, UI adaptation and other domains, to a human perspective covering sociological or ethical implications of dynamic software systems. The workshop provides a space for discussion and collaboration between researchers working on the problem of enabling live adaptations to software systems, across the development stack. Topics of Interest: * Design and Implementation of Live Adaptive Software Systems * Context-, aspect-, feature-, role- and agent-oriented programming * Context representation and discovery * Context-aware model-driven software development * Context-aware data management * Software variability and dynamic product lines * Self-adaptive, self-explanatory systems * Inconsistency management, verification, and validation * Middleware and Runtime of Live Adaptive Software Systems * Dynamic software evolution, upgrades and configuration * Dynamic software and service composition mechanisms * Dynamic software architecture and middleware approaches * Dynamic user interface adaptation and multimodal user interfaces * Impact and Assessment of Live Adaptive Software Systems * User acceptance and usability issues * Human, sociological, ethical and legal aspects * Privacy and security aspects of dynamic adaptability * Live adaptation in smart environments (e.g. smart rooms, smart robot cells, smart factories, smart cities) * Self-adaptation and emergence in SoS and CPSoS **************************************************************** MOMO 2017 - 2nd Workshop on Modularity in Modelling Abstract submissions (optional): Sun Jan 29 2017 Paper submissions: Sun Feb 5 2017 Notifications: Wed Feb 22 2017 http://www.momo2017.ece.mcgill.ca/cfp.htm **************************************************************** Extending the time-honored practice of separation of concerns, Model-Driven Engineering (MDE) promotes the use of separate models to address the various concerns in the development of complex software-intensive systems. The main objective is to choose the right level of abstraction to modularize a concern, specify its properties and reason about the system under development depending on stakeholder and development needs. While some of these models can be defined with a single modelling language, a variety of heterogeneous models and languages are typically used in the various phases of software development. Furthermore, Domain-Specific Modelling Languages designed to address particular concerns are also increasingly used. Despite the power of abstraction of modelling, models of real-world problems and systems quickly grow to such an extent that managing the complexity by using proper modularization techniques becomes necessary. As a result, many (standard) modelling notations have been extended with aspect-oriented mechanisms and advanced composition operators to support advanced separation of concerns, to combine (possibly heterogeneous) models modularizing different concerns, to execute an application based on modularized models, and to reason over global properties of modularized models. The Second International Modularity in Modelling Workshop brings together researchers and practitioners interested in the theoretical and practical challenges resulting from applying modularity, advanced separation of concerns, and advanced composition at the modelling level. It is intended to provide a forum for presenting new ideas and discussing the impact of the use of modularization in the context of MDE at different levels of abstraction. We are interested in submissions on all topics related to modularity and modelling including but not limited to: * Modularization Support in Modelling Languages and Tools * Model Interfaces * Homogeneous Model Composition Operators * Heterogeneous Model Composition Operators * Visualization of Modularized and Composed Models * Effects of Using Modularization and Composition in Modelling * On Verification and Validation * On Reuse * On the Model-Driven Software Development Process (Requirements Engineering, Software Architecture, Software Design, Implementation) * On Maintenance * Experience Reports / Empirical Evaluations of Applying Modularization and Composition in Modelling * Feature-Oriented, Aspect-Oriented and Concern-Oriented Modelling * Modularization support and composition operators for specific modelling notations * Modelling essential characteristics of specific (crosscutting) concerns * Multi-View Modelling: avoiding inconsistencies, avoiding Redundancies * Support for Detecting and/or Resolution of Feature Interactions * Domain-Specific Modelling * Modularization for Domain-Specific Languages * Composition for Domain-Specific Languages * Domain-specific Aspect Models ****************************************************************************** MoreVMs 2017 - 1st Workshop on Modern Language Runtimes, Ecosystems, and VMs Submissions: Wed 15 Feb 2017 Notifications: Wed 1 Mar 2017 http://2017.programming-conference.org/track/MoreVMs-2017-papers ****************************************************************************** The main goal of the workshop is to bring together both researchers and practitioners and facilitate effective sharing of their respective experiences and ideas on how languages and runtimes are utilized and where they need to improve further. We welcome presentation proposals in the form of extended abstracts discussing experiences, work-in-progress, as well as future visions from the academic as well as industrial perspective. Relevant topics include, but are definitely not limited to, the following: * Extensible VM design (compiler- or interpreter-based VMs) * Reusable runtime components (e.g. interpreters, garbage collectors, intermediate representations) * Static and dynamic compiler techniques * Techniques for compilation to high-level languages such as JavaScript * Runtimes and mechanisms for interoperability between languages * Tooling support (e.g. debugging, profiling, etc.) * Programming language development environments and virtual machines * Case studies of existing language implementations, virtual machines, and runtime components (e.g. design choices, tradeoffs, etc.) * Language implementation challenges and trade-offs (e.g. performance, completeness, etc.) * Surveys and applications usage reports to understand runtime usage in the wild * Surveys on frameworks and their impact on runtime usage * New research ideas on how we want to build languages in the future ************************************************************************** PASS 2017 - 1st Workshop on Programming Across the System Stack Submissions: Mon 13 Feb 2017 Notifications: Mon 27 Feb 2017 http://2017.programming-conference.org/track/PASS-2017#Call-for-Papers ************************************************************************** The landscape of computation platforms has changed dramatically in recent years. Emerging systems - such as wearable devices, smartphones, unmanned aerial vehicles, Internet of things, cloud computing servers, heterogeneous clusters, and data centers - pose a distinct set of system-oriented challenges ranging from data throughput, energy efficiency, security, real-time guarantees, to high performance. In the meantime, code quality, such as modularity or extensibility, remains a cornerstone in modern software engineering, bringing in crucial benefits such as modular reasoning, program understanding, and collaborative software development. Current methodologies and software development technologies should be revised in order to produce software to meet system-oriented goals, while preserving high internal code quality. The role of the Software Engineer is essential, having to be aware of the implications that each design, architecture and implementation decision has on the application system ecosystem. This workshop is driven by one fundamental question: How does internal code quality interact with system-oriented goals? We welcome both positive and negative responses to this question. An example of the former would be modular reasoning systems specifically designed to promote system-oriented goals, whereas an example of the latter would be anti-patterns against system-oriented goals during software development. Areas of interest include but are not limited to: * Energy-aware software engineering (e.g. energy efficiency models, energy efficiency as a quality attribute) * Modularity support (e.g., programming language design, development tools or verification) for applications in resource-constrained or real-time systems * Emerging platforms (e.g., Internet of Things and wearable devices) * Security support (e.g., compositional information flow, compositional program analysis) * Software architecture for reusability and adaptability in systems and their interactions with applications * Empirical studies (patterns and anti-patterns) on the relationship between internal code quality and system-oriented goals * Software engineering techniques to balance the trade-off between internal code quality and efficiency * Memory bloats and long-tail performance problems across modular boundaries * Program optimization across modular boundaries * Internal code quality in systems software * Reasoning across applications, compilers, and virtual machines **************************************************************** PX 2017 - 2nd Programming Experience Workshop Submissions: Sat 4 Feb 2017 Notifications: Mon 27 Feb 2017 http://programming-experience.org/px17 **************************************************************** Imagine a software development task: some sort of requirements and specification including performance goals and perhaps a platform and programming language. A group of developers head into a vast workroom. In that room they discover they need to explore the domain and the nature of potential solutions?they need exploratory programming. The Programming Experience Workshop is about what happens in that room when one or a couple of programmers sit down in front of computers and produce code, especially when it?s exploratory programming. Do they create text that is transformed into running behavior (the old way), or do they operate on behavior directly (?liveness?); are they exploring the live domain to understand the true nature of the requirements; are they like authors creating new worlds; does visualization matter; is the experience immediate, immersive, vivid and continuous; do fluency, literacy, and learning matter; do they build tools, meta-tools; are they creating languages to express new concepts quickly and easily; and curiously, is joy relevant to the experience? Correctness, performance, standard tools, foundations, and text-as-program are important traditional research areas, but the experience of programming and how to improve and evolve it are the focus of this workshop, and in this edition we would like to focus on exploratory programming. The technical topics include: * Exploratory programming * Live programming * Authoring * Representation of active content * Visualization * Navigation * Modularity mechanisms * Immediacy * Literacy * Fluency * Learning * Tool building * Language engineering ************************************************************************* ProWeb 2017 - 1st Workshop on Programming Technology for the Future Web Submissions: Wed 15 Feb 2017 Notifications: Wed 1 Mar 2017 http://2017.programming-conference.org/track/proweb-2017-papers ************************************************************************* Full-fledged web applications have become ubiquitous on desktop and mobile devices alike. Whereas ?responsive? web applications already offered a more desktop-like experience, there is an increasing demand for ?rich? web applications (RIAs) that offer collaborative and even off-line functionality ?Google docs being the prototypical example. Long gone are the days that web servers merely had to answer incoming HTTP request with a block of static HTML. Today?s servers react to a continuous stream of events coming from JavaScript applications that have been pushed to clients. As a result, application logic and data is increasingly distributed. Traditional dichotomies such as ?client vs. server? and ?offline vs. online? are fading. The 1st International Workshop on Programming Technology for the Future Web, or ProWeb17, is a forum for researchers and practitioners to share and discuss new technology for programming these and future evolutions of the web. We welcome submissions introducing programming technology (i.e., frameworks, libraries, programming languages, program analyses and development tools) for implementing web applications and for maintaining their quality over time, as well as experience reports about the use of state-of-the-art programming technology. Relevant topics include, but are not limited to: * Quality on the new web: static and dynamic program analyses; code, design test and process metrics; development and migration tools; automated testing and test generation; contract systems, type systems, and web service API conformance checking; ? * Hosting languages on the web: new runtimes; transpilation or compilation to JavaScript, WebAssembly, asm.js, ? * Designing languages for the web: multi-tier (or tierless) programming; reactive programming; frameworks for multi-tier or reactive programming on the web; ? * Distributed data sharing, replication and consistency: cloud types, CRDTs, eventual consistency, offline storage, peer-to-peer communication, ? * Security on the web: client-side and server-side security policies; policy enforcement; proxies and membranes; vulnerability detection; dynamic patching, ? * Surveys and case studies using state-of-the-art web technology (e.g., WebAssembly, WebSocket, LocalStorage, AppCache, ServiceWorkers, Meteor, deepstream.io, Angular.js, React and React Native, Swarm.js, Caja, TypeScript, Proxies, ClojureScript, Amber Smalltalk, Scala.js, ?) * Ideas on and experience reports about: how to reconcile the need for quality with the need for agility on the web; how to master and combine the myriad of tier-specific technologies required to develop a web application, ? * Position statements on what the future of the web will look like **************************************************************** Salon des Refus?s 2017 Submissions: Wed 1 Feb 2017 Notifications: Fri 17 Feb 2017 https://refuses.github.io **************************************************************** Salon des Refus?s (?exhibition of rejects?) was an 1863 exhibition of artworks rejected from the official Paris Salon. The jury of Paris Salon required near-photographic realism and classified works according to a strict genre hierarchy. Paintings by many, later famous, modernists such as ?douard Manet were rejected and appeared in what became known as the Salon des Refus?s. This workshop aims to be the programming language research equivalent of Salon des Refus?s. We provide a venue for exploring new ideas and new ways of doing computer science. Many interesting ideas about programming might struggle to find space in the modern programming language research community, often because they are difficult to evaluate using established evaluation methods (be it proofs, measurements or controlled user studies). As a result, new ideas are often seen as ?unscientific?. This workshop provides a venue where such interesting and thought-provoking ideas can be exposed to critical evaluation. Submissions that provoke interesting discussion among the program committee members will be published together with an attributed review that presents an alternative position, develops additional context or summarizes discussion from the workshop. This means of engaging with papers not just enables explorations of novel programming ideas, but also encourages new ways of doing computer science. Topics of interest The scope of the workshop is determined more by the format of submissions than by the specific area of programming language or computer science research that we are interested in. We welcome submissions in a format that makes it possible to think about programming in a new way, including, but not limited to: * Thought experiments ? we believe that thought experiments, analogies and illustrative metaphors can provide novel insights and inspire fruitful programming language ideas. * Experimentation ? we find prejudices in favour of theory, as far back as there is institutionalized science, but programming can often be seen more as experimentation than as theorizing. We welcome interesting experiments even if there is yet no overarching theory that explains why they happened. * Paradigms ? all scientific work is rooted in a scientific paradigm that frame what questions can be asked. We encourage submissions that reflect on existing paradigms or explore alternative scientific paradigms. * Metaphors, myths and analogies ? any description of formal, mathematical, quantitative or even poetical nature still represents just an analogy. We believe that fruitful ideas can be learned from less common forms of analogies as well as from the predominant, formal and mathematical ones. * From jokes to science fiction ? a story or an artistic performance may explore ideas and spark conversations that provide crucial inspiration for development of new computer science thinking. From ezio.bartocci at tuwien.ac.at Sat Jan 7 05:44:48 2017 From: ezio.bartocci at tuwien.ac.at (Ezio Bartocci) Date: Sat, 7 Jan 2017 11:44:48 +0100 Subject: [TYPES/announce] QEST 2017 - Call for papers for the 14th International Conference on Quantitative Evaluation of Systems Message-ID: QEST2017 International Conference on Quantitative Evaluation of SysTems Berlin, September 5th-7th 2017 | www.qest.org/qest2017 Co-located with Concur, EPEW Scope and Topics The International Conference on Quantitative Evaluation of SysTems (QEST) is the leading forum on quantitative evaluation and verification of computer systems and networks. Areas of interest include quantitative specification methods, stochastic models, and metrics for performance, reliability, safety, correctness, and security. QEST is interested in both theoretical and experimental research. QEST welcomes a diversity of modeling formalisms, programming languages and methodologies that incorporate quantitative aspects such as probabilities, approximations and other quantitative aspects. Papers may advance empirical, simulation and analytic methods. Of particular interest are case studies that highlight the role of quantitative specification, modeling and evaluation in the design of systems. Systems of interest include computer hardware and software architectures, communication systems, cyber-physical systems, infrastructural systems, and biological systems. Papers that describe novel tools to support the practical application of research results in all of the above areas are also welcome. Special sessions To encourage submissions of papers in frontier topics, submissions in selected areas are encouraged. Paper submitted to special sessions will be treated as regular submitted papers, they will be peer reviewed, and subject to the same quality requirements. A special session with accepted papers on the selected topics will be organised during the conference. This year selected topics are: Smart Energy Systems over the Cloud <> We solicit contributions dealing with quantitative analysis, verification, and performance evaluation of models of networks of smart devices interconnected physically and over the cloud, and in particular within the technological context of smart energy, dealing with smart buildings, the smart grid, or with modern power networks. Instances of problems of interest are energy management in smart buildings, demand response over smart grids, or frequency control over power networks. We are interested in configurations related to cyber-physical systems, of systems of systems, and of the Internet of things, and on models encompassing continuous and digital components, and uncertainty (either environmental, adversarial, or probabilistic). Machine Learning and Formal Methods <> We call for contributions on the fusion of formal methods and machine learning techniques. In particular, we are interested in the use of machine learning approaches, such as reinforcement learning, learning automata, decision trees, gradient based methods, etc. in (statistical) model checking, controller synthesis, program analysis and synthesis, timed systems, compositional verification, etc. The main aim is to disseminate learning based techniques that have potential of improving theory and practice of formal methods. Special issue A selection of the best papers presented at QEST 2017 will be invited to submit an extended version of their paper for a Special Issue that will appear in the ACM Transactions of Modelling and Computer Simulation. Important Dates Abstract submission: 24 March 2017 Paper and tool submission: 31 March 2017 (AoE) Author notification: 29 May 2017 Final version due: 23 June 2017 Submissions All accepted papers (including tool demonstrations) must be presented at the conference by one of the authors. The QEST 2017 proceedings will be published by Springer in the LNCS Series and indexed by ISI Web of Science, Scopus, ACM Digital Library, dblp, Google Scholar. All submitted papers will be evaluated by at least three reviewers on the basis of their originality, technical quality, scientific or practical contribution to the state of the art, methodology, clarity, and adequacy of references. QEST considers five types of papers with additional reviewing criteria: Theoretical: advance our understanding, apply to non-trivial problems and be mathematically rigorous. Methodological and technical: describe situations that require the development and proposal of new analysis processes and techniques. Application: describes a novel application, and compares with previous results. Tools: should motivate the development of the new tools and the formalisms they support, with a focus on the software architecture and practical capabilities. Tool demonstration: describe a relevant tool, as well as its features, evaluation, or any other information that may demonstrate the merits of the tool. Submissions must be prepared in LaTeX, following Springer's LNCS guidelines . Submitted papers should not exceed 16 pages (4 pages for tool demonstrations). Papers must be unpublished and not be submitted for publication elsewhere. Authors of tool papers (both regular and demonstration) must make their tools and input data available to reviewers; reproducibility of results will be taken into account during the evaluation process, and the conference will include a demo session. Authors should present use cases, distinctive features, and computational/memory requirements through motivating examples. Theoretical background need not be presented in tool demonstration papers; substantial improvements are required for existing tools. Papers should be submitted electronically using the EasyChair online submission system . -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: qest2017-banner.png Type: image/png Size: 97354 bytes Desc: not available URL: From tobias.grosser at inf.ethz.ch Sun Jan 8 02:19:21 2017 From: tobias.grosser at inf.ethz.ch (Tobias Grosser) Date: Sun, 8 Jan 2017 08:19:21 +0100 Subject: [TYPES/announce] IMPACT'17 @ HiPEAC'17 - Call for participation + posters Message-ID: <1483859961.3013717.840744905.45252CC1@webmail.messagingengine.com> CALL FOR PARTICIPATION IMPACT'17: 7th Workshop on Polyhedral Compilation Techniques 23 January 2015, Stockholm, Sweden (@HIPEAC 2017) Register: https://www.hipeac.net/2017/stockholm/ Please find below the list of accepted papers. Also, if you intend to present at HIPEAC a poster related to polyhedral compilation, please contact us. Indeed, we may add a poster teaser session at the end of IMPACT, just before the HIPEAC poster evening, and try to regroup all such posters in the same area for more lively discussions. KeyNote: Delivering and generalising domain-specific program optimisations Paul Kelly (Imperial College London) # Polyhedral Modeling and Code Generation * Semi-Automatic Generation of Adaptive Codes Maxime Schmitt, C?sar Sabater, C?dric Bastoul * Splitting Polyhedra to Generate More Efficient Code Harenome Razanajato, Vincent Loechner, and C?dric Bastoul * A general compilation algorithm to parallelize and optimize counted loops with dynamic data-dependent bounds Jie Zhao, Albert Cohen # Compilation Systems and Architecture * APOLLO: Automatic speculative POLyhedral Loop Optimizer Juan Manuel Martinez Caamano, Aravind Sukumaran-Rajam, Artiom Baloian, Manuel Selva and Philippe Clauss * Data Reuse Analysis for Automated Synthesis of Custom Instructions in Sliding Window Applications Georgios Zacharopoulos, Giovanni Ansaloni and Laura Pozzi * More Data Locality for Static Control Programs on NUMA Architectures Adilla Susungi, Albert Cohen and Claude Tadonki # Short-papers and Panel Discussion * Short-Talk: Bounded Task Schedules for Task-based Run-times Yuhan Peng, Martin Kong and Vivek Sarkar (Rice University) * Short-Talk: Memory-Aware Tiling using Conflict Lattices Adrian Tate, David Adjiashvili and Utz-Uwe Haus. (Cray EMEA Research Lab, IFOR, D-MATH, ETH Zurich) Best, Tobias From aleks.nanevski at imdea.org Sun Jan 8 12:59:39 2017 From: aleks.nanevski at imdea.org (Aleksandar Nanevski) Date: Sun, 8 Jan 2017 18:59:39 +0100 Subject: [TYPES/announce] CfP: Workshop on Principles and Practice of Consistency for Distributed Data (PaPoC) Message-ID: <51e488cc-6244-9b4e-acfe-f49e0793f07d@imdea.org> [Talk proposals on formal approaches to consistency in distributed systems are welcome at the following workshop] ------------ Call for Papers ------------ PaPoC 2017 - Workshop on Principles and Practice of Consistency for Distributed Data April 23, 2017. http://software.imdea.org/Conferences/PAPOC17/cfp.shtml ----------------------------------------------- Consistency is one of the fundamental issues of distributed computing. There are many competing consistency models, with subtly different power in principle. In practice, the well-known the Consistency-Availability-Partition Tolerance trade-off translates to difficult choices between fault tolerance, performance, and programmability. The issues and trade-offs are particularly vexing at scale, with a large number of processes or a large shared database, and in the presence of high latency and failure-prone networks. It is clear that there is no one universally best solution. Possible approaches cover the whole spectrum between strong and eventual consistency. Strong consistency (total ordering via, for example, linearizability or serializability) provides familiar and intuitive semantics but requires slow and fragile synchronization and coordination overheads. The unlimited parallelism allowed by weaker models such as eventual consistency promises high performance, but divergence and conflicts make it difficult to ensure useful application invariants, and meta-data is hard to keep in check. The research and development communities are actively exploring intermediate models (replicated data types, monotonic programming, CRDTs, LVars, causal consistency, red-blue consistency, invariant- and proof-based systems, etc.), designed to improve efficiency, programmability, and overall operation without negatively impacting scalability. This workshop aims to investigate the principles and practice of consistency models for large-scale, fault-tolerant, distributed shared data systems. It will bring together theoreticians and practitioners from different horizons: system development, distributed algorithms, concurrency, fault tolerance, databases, language and verification, including both academia and industry. *Relevant discussion topics include* - Design principles, correctness conditions, and programming patterns for scalable distributed data systems. - Techniques for weak consistency: session guarantees, causal consistency, operational transformation, conflict-free replicated data types, monotonic programming, state merge, commutativity, etc. - Consistency vs. performance and scalability trade-offs: guiding developers, controlling the system. - Analysis and verification of weakly consistent programs. - Strengthening guarantees of weakly consistent system: transactions, fault tolerance, security, ensuring invariants, bounding metadata size, and controlling divergence. - Platform guarantees vs. application involvement: guiding developers, controlling the system. - Techniques for scaling and improving the performance of strongly consistent systems (e.g., Paxos-based or state machine replication). *Submission Guidelines* We solicit proposals for contributed talks. We recommend preparing proposals of 2 pages, written in English and in either plain text or PDF format. However, we will accept longer proposals or submissions to other conferences, under the understanding that PC members are only expected to read the first two pages of such longer submissions. Authors will have the opportunity to choose if they want their papers published in ACM Digital Library (with papers from other EuroSys workshops). *Important Dates* - Paper submission: February 17, 2017 (any place on Earth) - Authors notification: March 3, 2017 *Committees* Program Chairs Annette Bieniusa (University of Kaiserslautern, Germany) Alexey Gotsman (IMDEA Software Institute, Spain) Program Committee Carlos Bacquero (University of Minho) Sebastian Burckhardt (Microsoft Research) Colin Charles (Percona) Alan Fekete (University of Sydney) Jo?o Leit?o (INESC-ID) Christopher Meiklejohn (Universit? Catholique de Louvain) Achour Mostefaoui (University of Nantes) Roberto Palmieri (Virginia Tech) Fernando Pedone (University of Lugano) Masoud Saeida Ardekani (Samsung Research America) Ken Salem (University of Waterloo) Pierre Sutra (T?l?com SudParis) -------------- next part -------------- An HTML attachment was scrubbed... URL: From eacsl at kahle.ch Mon Jan 9 06:04:32 2017 From: eacsl at kahle.ch (European Association of Computer Science Logic) Date: Mon, 9 Jan 2017 11:04:32 +0000 Subject: [TYPES/announce] Ackermann Award 2017 Message-ID: ACKERMANN AWARD 2017 - THE EACSL OUTSTANDING DISSERTATION AWARD FOR LOGIC IN COMPUTER SCIENCE CALL FOR NOMINATIONS Nominations are now invited for the 2017 Ackermann Award. PhD dissertations in topics specified by the CSL and LICS conferences, which were formally accepted as PhD theses at a university or equivalent institution between 1.1.2015 and 31.12.2016 are eligible for nomination for the award. The deadline for submission is 1 April 2017. Submission details follow below. Nominations can be submitted from 1 January 2017 and should be sent to the chair of the Jury, Anuj Dawar, by e-mail:anuj.dawar at cl.cam.ac.uk The Award The 2017 Ackermann award will be presented to the recipient(s) at the annual conference of the EACSL, 20-24 August 2017, in Stockholm (Sweden). The award consists of * a certificate, * an invitation to present the thesis at the CSL/LICS conference, * the publication of the laudatio in the CSL/LICS proceedings, and * travel support to attend the conference. The jury is entitled to give the award to more (or less) than one dissertation in a year. Jury The jury consists of: * Anuj Dawar (University of Cambridge), the president of EACSL; * Dale Miller (INRIA and Ecole Polytechnique), ACM SigLog representative; * Orna Kupferman (Hebrew University of Jerusalem); * Daniel Leivant (Indiana University, Bloomington); * Luke Ong (University of Oxford); * Jean-Eric Pin (CNRS and University of Paris 7); * Simona Ronchi Della Rocca (University of Torino), the vice-president of EACSL; * Thomas Schwentick (TU Dortmund). How to submit The candidate or his/her supervisor should submit 1. the thesis (ps or pdf file); 2. a detailed description (not longer than 20 pages) of the thesis in ENGLISH (ps or pdf file); 3. a supporting letter by the PhD advisor and two supporting letters by other senior researchers (in English); supporting letters can also be sent directly to Anuj Dawar (anuj.dawar at cl.cam.ac.uk); 4. a short CV of the candidate; 5. a copy of the document asserting that the thesis was accepted as a PhD thesis at a recognized University (or equivalent institution) and that the candidate has received his/her PhD within the specified period. The submission should be sent by e-mail as attachments to the chairman of the jury, Anuj Dawar: anuj.dawar at cl.cam.ac.uk With the following subject line and text: * Subject: Ackermann Award Submission * Text: Name of candidate, list of attachments Submission can be sent via several e-mail messages. If this is the case, please indicate it in the text. Letters of support and documents can also be faxed to: Anuj Dawar Ackermann Award +44 1223 334678 The Jury has the right to declare submissions to be out of scope or not to meet the requirements. -------------- next part -------------- An HTML attachment was scrubbed... URL: From marina.lenisa at uniud.it Tue Jan 10 03:52:45 2017 From: marina.lenisa at uniud.it (Marina Lenisa) Date: Tue, 10 Jan 2017 08:52:45 +0000 Subject: [TYPES/announce] GaLoP 2017 Message-ID: <029A30A9-0C88-411C-90BA-7EEA8B6A904E@uniud.it> ______________________________________________________________ 12th Workshop on Games for Logic and Programming Languages (GaLoP 2017) Uppsala, Sweden, 22-23 April http://www.gamesemantics.org GaLoP is an annual international workshop on game-semantic models for logics and programming languages and their applications. This is an informal workshop that welcomes work in progress, overviews of more extensive work, programmatic or position papers and tutorials. GaLoP XII will be held in Uppsala, Sweden, on 22-23 April 2017 as a satellite workshop of ETAPS (http://www.etaps.org/). Areas of interest include: * Games and other interaction-based denotational and operational models; * Game-based program analysis and verification; * Logics for games and games for logics; * Algorithmic aspects of game semantics; * Categorical aspects of game semantics; * Programming languages and full abstraction; * Higher-order automata and Petri nets; * Geometry of interaction; * Ludics; * Epistemic game theory; * Logics of dependence and independence; * Computational linguistics; * Games and multi-valued logics. There will be no formal proceedings but the possibility of a special issue in a journal will be considered. (The 2005, 2008, 2011 and 2014 workshops led to special issues in Annals of Pure and Applied Logic.) // Submission Instructions // Please submit an abstract (up to one page, excluding bibliography) of your proposed talk on the EasyChair submission page below. Supplementary material may be submitted, and will be considered at the discretion of the PC. https://easychair.org/conferences/?conf=galop2017 // Important Dates // Submission: 30 January 2017 Notification: 20 February 2017 Workshop: 22-23 April 2017 // Tutorial // Lauri Hella // Invited talks // Andreas Blass Dan Ghica Erich Gr?del Martin Hyland (TBC) // Programme Committee // Dietmar Berwanger Esfandiar Haghverdi Juha Kontinen (Co-Chair) Jim Laird Marina Lenisa (Co-Chair) Pierre Lescanne Luke Ong Jouko V??n?nen __________________________________ -------------- next part -------------- An HTML attachment was scrubbed... URL: From nevrenato at gmail.com Tue Jan 10 08:25:41 2017 From: nevrenato at gmail.com (Renato Neves) Date: Tue, 10 Jan 2017 13:25:41 +0000 Subject: [TYPES/announce] First School on Foundations of Programming and Software systems -- Probabilistic programming Message-ID: <20170110132541.GA33437@p187.glmf.di.uminho.pt> It is our greatest pleasure to announce the first edition of the School on Foundations of Programming and Software systems. The school is jointly funded by EATCS, ETAPS, ACM SIGLOG, and ACM SIGPLAN. The topic of the first edition is Probabilistic programming. It will take place in Braga, Portugal, May 29th - June 4th 2017. Probabilistic programming languages are used for modelling and analysis purposes across multiple areas of computer science, including machine learning, security, and quantitative biology. In particular, they provide a rigorous foundation for machine learning where they are used to describe probabilistic models and to perform inference in presence of uncertain information. Probabilistic programs are also used in cryptography and in privacy for modelling and quantifying security. The goal of the school is to introduce attendants to theoretical and practical aspects of programming languages, and will propose courses that cover the following topics: semantics, analysis, verification, applications to machine learning, privacy, and security. The school will have lectures by Andy Gordon, Catuscia Palamidessi, Christel Baier, Dexter Kozen, Frank Wood, Hongseok Yang, Javier Esparza, Michael Carbin, Peter Selinger, Prakash Panangaden, Sriram Sankaranarayanan, and Vitaly Shmatikov. For more information please check the school webpage http://probprogschool2017.di.uminho.pt/ If you have any queries feel free to contact the organisers. Best wishes, Luis Barbosa Gilles Barthe Joost-Pieter Katoen Renato Neves Alexandra Silva From s.singh at acm.org Tue Jan 10 11:30:26 2017 From: s.singh at acm.org (Satnam Singh) Date: Tue, 10 Jan 2017 08:30:26 -0800 Subject: [TYPES/announce] ACM SIGPLAN Awards deadline extended to 30 January Message-ID: The deadline for submitting nominations for the following awards has been extended to 30 January: - Programming Languages Software Award (last year's winner V8) - Programming Languages Achievement Award (last year's winner Simon Peyton-Jones) - Robin Milner Young Researcher Award (last year's winner Stephanie Weirich) Descriptions of these awards and the link for submitting nominations can be found at http://www.sigplan.org/Awards/ (note that the deadline for the John C. Reynolds dissertation award is not extended). Please can you consider submitting nominations and also publicizing these awards to other colleagues and appropriate groups. Thank you kindly. Please don't hesitate to contact me if you have any questions about the awards. Satnam Singh ACM SIGPLAN EC Awards Chair Satnam Singh Email: s.singh at acm.org satnamsingh at fb.com satnam at raintown.org satnam6502 at gmail.com Cell (USA, personal): +1 408 656 4590 Cell (Facebook, work): +1 650 924 6838 Home (Los Altos, California): +1 650 383 7650 Twitter: @satnam6502 LinkedIn: www.linkedin.com/in/satnam6502 - -------------- next part -------------- An HTML attachment was scrubbed... URL: From eacsl at kahle.ch Wed Jan 11 03:56:29 2017 From: eacsl at kahle.ch (European Association of Computer Science Logic) Date: Wed, 11 Jan 2017 08:56:29 +0000 Subject: [TYPES/announce] CSL2017: Call for Papers Message-ID: <16f88fc7-b99c-1f66-9da2-e4a087fc5178@kahle.ch> CALL FOR PAPERS 26th EACSL Annual Conference on Computer Science Logic CSL2017 August 20 -- 24, 2017, Stockholm, Sweden https://www.csl17.conf.kth.se AIM AND SCOPE Computer Science Logic (CSL) is the annual conference of the European Association for Computer Science Logic (EACSL). It is an interdisciplinary conference, spanning across both basic and application oriented research in mathematical logic and computer science and is intended for computer scientists whose research involves logic, as well as for logicians working on issues essential for computer science. CSL2017 is the 26th EACSL annual conference. It will be co-organised by Stockholm University and KTH Royal Institute of Technology, and hosted by Stockholm University. CSL2017 will be co-located with, and immediately preceded by, the Logic Colloquium 2017 (LC2017). There will be a joint session of CSL2017 and LC2017 in the morning of August 20, as well as CSL-affiliated workshops during August 25-26. IMPORTANT DATES: ----------------------------------------------------------------------------- Abstract submission for contributed papers: March 24, 2017 Paper submission: March 31, 2017 Notification: May 31, 2017 Abstract submission for short presentations: June 4, 2017 Notification on short presentations: June 14, 2017 ---------------------------------------------------------------------------- TOPICS OF INTEREST for CSL2017 include (but are not limited to): ----------------------------------------------------------------------------- ? automata and games, game semantics ? automated deduction and interactive theorem proving ? bounded arithmetic and propositional proof complexity ? categorical logic and topological semantics ? computational proof theory ? constructive mathematics and type theory ? decision procedures ? domain theory ? equational logic and rewriting ? finite model theory ? higher-order logic ? lambda calculus and combinatory logic ? linear logic and other substructural logics ? logic programming and constraints ? logical aspects of computational complexity ? logical aspects of quantum computing ? logic in database theory ? logical foundations of programming paradigms ? logical foundations of cryptography and information hiding ? logics for multi-agent systems ? modal and temporal logic ? model checking and logic-based verification ? nonmonotonic reasoning ? SAT solving and automated induction ? satisfiability modulo theories ? specification, extraction and transformation of programs ? verification and program analysis ----------------------------------------------------------------------------- INVITED SPEAKERS ------------------------------ LC-CSL joint session highlight speakers: Phokion Kolaitis, University of California, Santa Cruz Wolfgang Thomas, RWTH Aachen CSL plenary speakers: Laura Kov?cs, Vienna University of Technology Stephan Kreutzer, Technische Universit?t Berlin Meena Mahajan, Institute of Mathematical Sciences, Chennai Marcus Veanes, Microsoft Research SPECIAL AND AFFILIATED EVENTS -------------------------------------------------- In addition to the plenary and contributed talks CSL2017, the conference will also include the following events: ? Joint session of CSL2017 and LC2017 in the morning of August 20, consisting of four plenary highlight talks, offered by speakers from both conferences. ? Presentation of the Alonzo Church award for Outstanding Contributions to Logic and Computation, ? Presentation of the EACSL Ackermann award for Outstanding Dissertation on Logic in Computer Science, ? CSL-affiliated workshops, to be held as co-located events on August 25 and (possibly) 26, including: ? Workshop on Logical Aspects of Multi-Agent Systems LAMAS2017 (August 25) ? Workshop on Logic and Automata Theory (in memory of Zoltan Ezik) (August 25) More workshops may be added later. SUBMISSIONS --------------------- The CSL2017 conference proceedings will be published in Leibniz International Proceedings in Informatics (LIPIcs). Authors are invited to submit contributed papers of no more than 15 pages in LIPIcs style (including references), presenting not previously published work, fitting the scope of the conference. The submission of contributed papers will be in two stages: * abstracts, due by March 24, 2017 (AoE); * full papers, due by March 31, 2017 (AoE). The submissions must be done via the EasyChair page for the conference: https://easychair.org/conferences/?conf=csl2017. Submitted papers must be in English and must provide sufficient detail to allow the Programme Committee to assess the merits of the paper. Full proofs may appear in a clearly marked technical appendix which will be read at the reviewers' discretion. Authors are strongly encouraged to include a well written introduction which is directed at all members of the PC. Papers may not be submitted concurrently to another conference with refereed proceedings. The PC chairs should be informed of closely related work submitted to a conference or a journal. Papers authored or co-authored by members of the PC are not allowed. In addition, there will be an opportunity for short oral presentations at the conference. Abstracts for such oral presentations must be submitted through the Easychair submission webpage, under the category ``short presentations'', by June 4, 2017. They will not be included in the proceedings. PROGRAMME COMMITTEE ------------------- ? Parosh Aziz Abdulla (University of Uppsala), ? Lars Birkedal (University of Aarhus), ? Nikolaj Bjorner (Microsoft Research), ? Maria Paola Bonacina (Universit? degli Studi di Verona), ? Patricia Bouyer-Decitre (LSV, ENS Cachan), ? Agata Ciabattoni (University of Viena), ? Thierry Coquand (University of Gothenburg), ? Mads Dam (KTH, Stockholm), PC co-chair ? Ugo Dal Lago (University of Bologna), ? Anuj Dawar (Cambridge University), ? Valentin Goranko (Stockholm University), PC co-chair ? Maribel Fernandez (King's College London), ? Martin Grohe (RWTH Aachen), ? Lauri Hella (University of Tampere), ? Joost-Pieter Katoen (RWTH Aachen), ? Orna Kupferman (University of Jerusalem), ? Leonid Libkin (University of Edinburgh), ? Angelo Montanari (University of Udine), ? Catuscia Palamidessi (Paris, INRIA), ? Frank Pfenning (Carnegie Mellon University, Pittsburgh) ? Ram Ramanujam (Institute of Mathematical Sciences, Chennai), ? Jean-Francois Raskin (University of Bruxelles), ? Thomas Schwentick (TU Dortmund University), ? Viorica Sofronie-Stokkermans (University of Koblenz-Landau), ? Thomas Streicher (University of Darmstadt), ? Jean-Marc Talbot (University of Aix-Marseille), ? Luca Vigan? (King's College London), ? Ron van der Meyden (UNSW Australia), ? Lijun Zhang (Chinese Academy of Sciences, Beijing). ORGANISING COMMITTEE -------------------- ? Mads Dam (OC co-chair), Department of Computer Science, KTH ? Valentin Goranko (OC co-chair), Department of Philosophy, Stockholm University ? Dilian Gurov (Workshops chair), Department of Computer Science, KTH ? Roussanka Loukanova, Department of Mathematics, Stockholm University ? Peter LeFanu Lumsdaine, Department of Mathematics, Stockholm University ? Erik Palmgren (OC co-chair), Department of Mathematics, Stockholm University CONTACTS AND ENQUIRIES: -------------------- With enquiries on organising matters, send email to: csl2017philosophy.su.se With enquiries on scientific and programme issues, send email to: csl2017pcgmail.com -------------- next part -------------- An HTML attachment was scrubbed... URL: From Kristina.Liefke at lrz.uni-muenchen.de Wed Jan 11 02:44:27 2017 From: Kristina.Liefke at lrz.uni-muenchen.de (Liefke, Kristina) Date: Wed, 11 Jan 2017 08:44:27 +0100 Subject: [TYPES/announce] CfP - Logic, Information, Language, Memory, Reasoning 2017 (LogInfoLangMR'17) Message-ID: <010f7d93ffcd655ad85cfd320f4b162f@lrz.uni-muenchen.de> ========================================================================= CALL FOR PAPERS Special Session on Logic, Information, Language, Memory, Reasoning 2017 (LogInfoLangMR?17) http://www.dcai-conference.net/special-sessions/loginfolangmr 14th International Conference on Distributed Computing and Artificial Intelligence 2017 (DCAI'17) Polytechnic of Porto, Porto (Portugal) June 21-23, 2017 * Submission deadline: February 6, 2017 * ========================================================================= DESCRIPTION ===== We are in the reality of systems that model human language, reasoning, and use advanced techniques for saving and accessing information. Prominently, computational processing of human language is an interdisciplinary area of research and development of computerized systems. In nature, relations between information, language, reasoning, and memory have many interdependent facets that can be heterogeneous. Theories, applications, and technologies strive to meet adequate treatment of natural phenomena of information, language, and information exchange. Furthermore, integrated approaches from mathematics and computer science provide support for reliable, advanced, applications. We welcome submissions of papers on the following topics, without limiting to them, across theories, applications, methods, approaches, and technologies: - Logic for applications to language processing - Classic and new theories of formal and natural languages - Computational processing of natural language --- approaches, theories, methods, computerized systems - Computational morphology, syntax, semantics, and syntax-semantics interfaces - Multilingual Processing - Speech Processing - Logic for reasoning systems --- theories and applications - Logic in data science - Information theories - Integration of data and reasoning - Models of computation - Mathematics for linguistics and cognitive science - Interdisciplinary approaches to computation, language, reasoning, memory, data - Computational theories and applications in life sciences - Computational neuroscience of information, language, memory, reasoning - Computational aspects of information, languages, and memory in nature IMPORTANT DATES: ===== Submission dates: 06 February, 2017 Notification date: 13 March, 2017 Paper ready deadline: 27 March, 2017 Conference dates: 21-23 June, 2017 SUBMISSION INSTRUCTIONS: ===== DCAI Special Session papers must be formatted according to the Springer LNCS Template, with a maximum length of 8 pages, including figures and references. All papers must be submitted in electronic form (PDF format) using the Paper Submission Page. http://www.dcai-conference.net/submission PUBLICATION: ===== Accepted papers will be included in DCAI Proceedings. At least one of the authors will be required to register and attend the symposium to present the paper in order to include the paper in the conference proceedings. All accepted papers will be published by Advances in Intelligent Systems and Computing series of Springer Verlag. For more details, see: http://www.dcai-conference.net/special-sessions CO-CHAIRS: ===== Roussanka Loukanova, Stockholm University, Sweden Kristina Liefke, Ludwig-Maximilians-University Munich, Germany Program Committee (PC): The PC consists of experts in the topics of the event. CONTACT: ===== Roussanka Loukanova Kristina Liefke From Klaus.Havelund at jpl.nasa.gov Tue Jan 10 18:26:43 2017 From: Klaus.Havelund at jpl.nasa.gov (Havelund, Klaus (348B)) Date: Tue, 10 Jan 2017 23:26:43 +0000 Subject: [TYPES/announce] [fm-announcements] SPIN 2017 in Santa Barbara, CA, USA - 1 month from the paper submission deadline Message-ID: SPIN 2017 24th International Symposium on Model Checking of Software Santa Barbara, CA, USA, July 13-14, 2017 http://conf.researchr.org/home/spin-2017 Collocated with ISSTA ________________________________ The SPIN symposium aims at bringing together researchers and practitioners interested in automated tool-based techniques for the analysis of software as well as models of software, for the purpose of verification and validation. The symposium specifically focuses on concurrent software, but does not exclude analysis of sequential software. Submissions are solicited on theoretical results, novel algorithms, tool development, empirical evaluation, and education. History: The SPIN symposium originated as a workshop focusing on explicit state model checking, specifically as related to the Spin model checker. However, over the years it has evolved to a broadly scoped symposium for software analysis using any automated techniques, including model checking, automated theorem proving, and symbolic execution. An overview of the previous SPIN symposia (and early workshops) can be found at: http://spinroot.com/spin/symposia. SPIN 2017 will be organized as an ACM SIGSOFT event, collocated with the International Symposium on Software Testing and Analysis (ISSTA 2017): http://conf.researchr.org/home/issta-2017. The RERS Verification Challenge In addition there will be a one-day Rigorous Examination of Reactive Systems verification challenge Workshop (RERS 2017): http://www.rers-challenge.org/2017. ________________________________ SPIN 2017 Topics of interest include, but are not limited to: * Formal verification techniques for automated analysis of software * Formal analysis for modeling languages, such as UML/state charts * Formal specification languages, temporal logic, design-by-contract * Model checking * Automated theorem proving, including SAT and SMT * Verifying compilers * Abstraction and symbolic execution techniques * Static analysis and abstract interpretation * Combination of verification techniques * Modular and compositional verification techniques * Verification of timed and probabilistic systems * Automated testing using advanced analysis techniques * Combination of static and dynamic analyses * Derivation of specifications, test cases, or other useful material via formal analysis * Case studies of interesting systems or with interesting results * Engineering and implementation of software verification and analysis tools * Benchmark and comparative studies for formal verification and analysis tools * Formal methods education and training * Insightful surveys or historical accounts on topics of relevance to the symposium ________________________________ Submission Guidelines ________________________________ The contributions to SPIN 2017 will be published as ACM Proceedings, and should be submitted in the ACM Conference Format: https://www.acm.org/publications/proceedings-template. Submissions must be original and should not have been published previously or be under consideration for publication while being evaluated for this symposium. Authors are required to adhere to the ACM Policy and Procedures on Plagiarism and the ACM Policy on Prior Publication and Simultaneous Submissions. We are soliciting two categories of papers: * Full Research Papers describing fully developed work and complete results (10 pages); * Short Papers presenting tools, technology, experiences with lessons learned, new ideas, work in progress with preliminary results, and novel contributions to formal methods education (4 pages). Papers should be submitted via the EasyChair SPIN 2017 submission website: https://easychair.org/conferences/?conf=spin2017. Best Paper awards will be given and announced at the conference. A selection of papers will be invited to a special issue of the International Journal on Software Tools for Technology Transfer (STTT). ________________________________ Important Dates ________________________________ * Paper Submission: February 10, 2017 (23:59:59 Anywhere on Earth) * Author Notification: April 15, 2017 * Camera-Ready Paper: May 20, 2017 * Symposium: July 13-14, 2017 ________________________________ Organization ________________________________ * Hakan Erdogmus, Program Co-Chair, Carnegie Mellon University, USA * Klaus Havelund, Program Co-Chair, NASA/Caltech Jet Propulsion Laboratory, USA * Corina Pasareanu, Awards Chair, NASA Ames Research Center, USA * Yli?s Falcone, Publicity Chair, Univ. Grenoble Alpes, Inria, France ________________________________ Program Committee ________________________________ * Erika Abraham, RWTH Aachen University, Germany * Christel Baier, Technical University of Dresden, Germany * Tom Ball, Microsoft Research, USA * Ezio Bartocci, Vienna University of Technology, Austria * Dirk Beyer, Ludwig-Maximilians-Universit?t M?nchen (LMU Munich), Germany * Armin Biere, Johannes Kepler University, Austria * Dragan Bosnacki, Eindhoven University of Technology, Netherlands * Zmago Brezocnik, University of Maribor, Slovenia * Sagar Chaki, Software Engineering Institute CMU, USA * Alessandro Cimatti, Fondazione Bruno Kessler, Italy * Lucas Cordeiro, University of Oxford, UK * Patrice Godefroid, Microsoft Research, USA * Susanne Graf, VERIMAG Laboratory, France * Radu Grosu, Vienna University of Technology, Austria * Arie Gurfinkel, University of Waterloo, USA * Gerard Holzmann, NASA/Caltech Jet Propulsion Laboratory, USA * Rajeev Joshi, NASA/Caltech Jet Propulsion Laboratory, USA * Sarfraz Khurshid, The University of Texas at Austin, USA * Kim Larsen, Aalborg University, Denmark * Stefan Leue, University of Konstanz, Germany * Alice Miller, University of Glasgow, Scotland * Corina Pasareanu, NASA Ames Research Center, USA * Doron Peled, Bar Ilan University, Israel * Neha Rungta, Amazon Web Services, USA * Theo Ruys, RUwise, Netherlands * Scott Smolka, Stony Brook University, USA * Scott Stoller, Stony Brook University, United States * Jun Sun, Singapore University of Technology and Design, Singapore * Oksana Tkachuk, NASA Ames Research Center, USA * Stavros Tripakis, University of California, Berkeley, USA * Willem Visser, Stellenbosch University, South Africa * Farn Wang, National Taiwan University, Taiwan * Michael Whalen, University of Minnesota, USA * Anton Wijs, Eindhoven University of Technology, Netherlands -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- --- To opt-out from this mailing list, send an email to fm-announcements-request at lists.nasa.gov with the word 'unsubscribe' as subject or in the body. You can also make the request by contacting fm-announcements-owner at lists.nasa.gov From aart.middeldorp at uibk.ac.at Thu Jan 12 08:14:24 2017 From: aart.middeldorp at uibk.ac.at (Aart Middeldorp) Date: Thu, 12 Jan 2017 14:14:24 +0100 Subject: [TYPES/announce] postdoc position (5 years) in Innsbruck Message-ID: 5 year postdoc position in computational logic ============================================== The University of Innsbruck invites applications for a 5 year postdoctoral position in the Computational Logic research group. Candidates must hold a PhD degree in computer science. A strong background in computational logic (in particular automated and interactive theorem proving, SMT solving, term rewriting, type theory) is desired. The ideal candidate enjoys working with students at all levels. Candidates are expected to conduct research leading to a habilitation and contribute to teaching and administration. Knowledge of German is not essential. The position is a full-time "B1/3 position" with teaching obligations of 4 hours per semester. The annual gross salary is approximately EUR 50,000. The official job advert (reference MIP-9118) appeared at http://orawww.uibk.ac.at/public/karriereportal.details?asg_id_in=9118 Applications (including CV, publication list, and two letters of recommendation) must be submitted electronically at https://orawww.uibk.ac.at/public/karriereportal.bewerben?page=w&a_id=9118 no later than 2 February 2017. The starting date for the position is 1 March 2017. Informal inquiries may be addressed to aart.middeldorp at uibk.ac.at The city of Innsbruck, which hosted the Olympic Winter Games in 1964 and 1976, is superbly located in the beautiful surroundings of the Tyrolean Alps. The combination of the Alpine environment and urban life in this historic town provides a high quality of living. Further information is available from the following links: Computational Logic: http://cl-informatik.uibk.ac.at/ Department of Computer Science: http://informatik.uibk.ac.at/ University of Innsbruck: http://www.uibk.ac.at/ City of Innsbruck: http://www.innsbruck.at/ From aleks0 at gmail.com Thu Jan 12 06:19:21 2017 From: aleks0 at gmail.com (Aleks Kissinger) Date: Thu, 12 Jan 2017 12:19:21 +0100 Subject: [TYPES/announce] Call for papers: QPL 2017 Message-ID: CALL FOR PAPERS The 14th International Conference on Quantum Physics and Logic (QPL) July 3-7, 2017 Radboud Universiteit, Nijmegen, Netherlands http://qpl.cs.ru.nl The 14th International Conference on Quantum Physics and Logic (QPL) will take place at Radboud University between Monday 3 and Friday 7 July, 2017. The conference brings together researchers working on mathematical foundations of quantum physics, quantum computing, and related areas, with a focus on structural perspectives and the use of logical tools, ordered algebraic and category-theoretic structures, formal languages, semantical methods, and other computer science techniques applied to the study of physical behaviour in general. Work that applies structures and methods inspired by quantum theory to other fields (including computer science) is also welcome. Previous QPL events were held in Glasgow (2016), Oxford (2015), Kyoto (2014), Barcelona (2013), Brussels (2012), Nijmegen (2011), Oxford (2010), Oxford (2009), Reykjavik (2008), Oxford (2006), Chicago (2005), Turku (2004), and Ottawa (2003). INVITED SPEAKERS Jamie Vicary Miguel Navasques Matthias Christandl Paulo Perinotti INVITED TUTORIALS Bart Jacobs (effectus theory) Dan Marsden (categorical string diagrams) Ronald de Wolf (quantum algorithms) Simon Perdrix (TBC) SATELLITES There will be a satellite workshop on Quantum Structures hosted by the International Quantum Structures Association (IQSA) from Tuesday July 4th to Friday the 7th. Look out for details on the QPL website and via an official announcement later this year! IMPORTANT DATES Submission: 21 April, 2017 Notification: 29 May Papers ready: 23 June Conference: 3-7 July SUBMISSIONS Prospective speakers are invited to submit a contribution to the conference. - Original contributions consist of a 5-12 page extended abstract which provides sufficient evidence of results of genuine interest and enough detail to allow the program committee to assess the merits of the work. Submission of substantial albeit partial results of work in progress is encouraged. Authors of accepted papers will be invited to give long or short talks, depending on the quality and/or maturity of the submission. - Extended abstracts describing work submitted/published elsewhere will also be considered, provided the work is recent and relevant to the conference. These consist of a 3 page description and should include a link to a separate published paper or preprint. Extended versions of accepted original research contributions will be published in Electronic Proceedings in Theoretical Computer Science (EPTCS) after the conference. Submissions should be prepared using LaTeX, and must be submitted in PDF format. Use of the EPTCS style is encouraged. Submission is done via EasyChair: https://www.easychair.org/conferences/?conf=qpl2017 There will be an award for the best paper whose authors are all students, at the discretion of the programme committee. REGISTRATION Registration will be opened later, please visit the website for more details. PROGRAMME COMMITTEE Aleks Kissinger (Radboud, co-chair) Bob Coecke (Oxford, co-chair) Bart Jacobs (Radboud) Benoit Valiron (Paris-Sud) Benno Van Den Berg (Amsterdam) Chris Heunen (Edinburgh) Dan Browne (University College London) Daniel Oi (Strathclyde) Dominic Horsman (Durham) Dusko Pavlovic (Hawaii) Giulio Chiribella (Hong Kong) Hans Maassen (Radboud) Isar Stubbe (Littoral-Cote-d'Opale) Jamie Vicary (Oxford) Joachim Kock (Barcelona) John Baez (UC Riverside) Kohei Kishida (Oxford) Matt Leifer (Chapman) Matty Hoban (Oxford) Michael Moortgat (Utrecht) Mingsheng Ying (UT Sydney) Miriam Backens (Bristol) Paolo Perinotti (Pavia) Paul-Andre Mellies (Paris Diderot) Pawel Sobocinski (Southampton) Peter Selinger (Dalhousie) Prakash Panangaden (McGill) Rick Blute (Ottowa) Rob Spekkens (Permiter Institute) Robert Raussendorf (British Columbia) Ross Duncan (Strathclyde) Samson Abramsky (Oxford) Simon Gay (Glasgow) Simon Perdrix (CNRS Nancy) STEERING COMMITTEE Bob Coecke (University of Oxford) Prakash Panangaden (McGill University) Peter Selinger (Dalhousie University) LOCAL ORGANISATION Aleks Kissinger Bart Jacobs Sander Uijlen From alexandra.silva at ucl.ac.uk Thu Jan 12 06:40:46 2017 From: alexandra.silva at ucl.ac.uk (Alexandra Silva) Date: Thu, 12 Jan 2017 06:40:46 -0500 Subject: [TYPES/announce] MFPS 33: first call for papers Message-ID: <201701121140.v0CBekFJ009876@telepathy.seas.upenn.edu> The 33rd Conference on the Mathematical Foundations of Programming Semantics (MFPS XXXIII) will take place on the campus of Ljubljana University, Slovenia, between 12 and 15 June 2017. MFPS conferences are dedicated to the areas of mathematics, logic, and computer science that are related to models of computation in general, and to semantics of programming languages in particular. This is a forum where researchers in mathematics and computer science can meet and exchange ideas. The participation of researchers in neighbouring areas is strongly encouraged. Topics include, but are not limited to, the following: bio-computation; concurrent qualitative and quantitative distributed systems; process calculi; probabilistic systems; constructive mathematics; domain theory and categorical models; formal languages; formal methods; game semantics; lambda calculus; programming-language theory; quantum computation; security; topological models; logic; type systems; type theory. We also welcome contributions that address applications of semantics to novel areas such as complex systems, markets, and networks, for example. Conference home page: http://coalg.org/mfps-calco2017 ## INVITED SPEAKERS * Rehana Patel, Olin College * Laura Kovacs, TU Wien * Dexter Kozen, Cornell University * Amr Sabry, Indiana University ## TUTORIAL SPEAKERS AND SPECIAL SESSIONS * Laure Daviaud, Warsaw - Algebraic automata theory * Nate Foster, Cornell - Foundations of Network Programming, special session in honour of Dexter Kozen???s 65th Birthday * Ben Worrell, Oxford - Metrics and Privacy (Joint MPFS & CALCO) * Derek Dreyer, MPI-SWS - Formal Verification ## SUBMISSION ### Important dates: * Submission Deadline: March 10 * Notification: April 28 * Proceedings: May 19 * Conference: June 12-15 ### Submitting Submissions should be prepared using the [ENTCS Macros](http://www.entcs.org/), in the form of a PDF file not exceeding 15 pages. Submissions are open on [EasyChair] (https://easychair.org/conferences/?conf=mfps33). ### Proceedings A preliminary version will be distributed at the meeting. Final proceedings will appear in ENTCS after the meeting. ## PROGRAM COMMITTEE: Gilles Barthe, Madrid, Spain Andrej Bauer, Ljubljana, Slovenia Steve Brookes, Pittsburgh, PA, USA Carla Ferreira, Lisbon, Portugal Nate Foster, Ithaca, NY, USA Chris Heunen, Edinburgh, UK Justin Hsu, Philadelphia, PA, USA Achim Jung, Birmingham, UK Elham Kashefi, Edinburgh, UK Clemens Kupke, Glasgow, UK Barbara Koenig, Duisburg, Germany Catherine Meadows, NRL , USA Andrzej Murawski, Warwick, UK, Bart Jacobs, Radboud U, Netherlands Bob Coecke, Oxford, UK Cameron Freer, Cambridge MA, USA Catherine Meadows, Washington, DC, USA Michael Mislove, New Orleans, LA, USA Joel Ouaknine, Saarbrucken, Germany Alessandra Palmigiano, Delft, The Netherlands Prakash Panangaden, Montreal, Canada Daniela Petrisan, Paris, France Brigitte Pientka, Montreal, Canada Jurriaan Rot, Nijmegen, The Netherlands Mehrnoosh Sadrzadeh, London, UK Alexandra Silva (Chair), London, UK Ana Sokolova, Salzburg, Austria Valeria Vignudelli, Bologna, Italy ## LOCAL ORGANISERS: * Matja Pretnar * Andrej Bauer From Peter.Sewell at cl.cam.ac.uk Thu Jan 12 13:28:05 2017 From: Peter.Sewell at cl.cam.ac.uk (Peter Sewell) Date: Thu, 12 Jan 2017 18:28:05 +0000 Subject: [TYPES/announce] Postdoc position in Applied Semantics for Production Architectures In-Reply-To: References: Message-ID: On 15 December 2016 at 23:20, Peter Sewell wrote: > [please circulate this to any likely candidates - thanks, Peter] > > Research Associate/Senior Research Associate in Applied Semantics for > Production Architectures > Updating this: the likellihood of new funding means we may be able to make several appointments, to build a really strong team. Closing date 24 Jan, as before. Peter > University of Cambridge Computer Laboratory > Research Associate ?29,301 - ?38,183 or Senior Research Associate ?39,324 > - 49,772 > Fixed-term: until February 28, 2019, when the grant funding the post > currently ends. > Details: http://www.jobs.cam.ac.uk/job/12397/ > > > Do you want to help build mathematically rigorous foundations for > real-world computing, to make it more robust and secure? > > We have an ongoing project to establish rigorous semantic models for > production multiprocessors, to provide a clear basis for programming, > software verification, and hardware verification. This involves long-term > close collaborations with ARM and IBM, and we have an agreement with ARM to > take their internal ISA description, build a mathematical model based on > it, integrate it with the concurrency semantics we are developing, and > release the whole in a form usable for verification. This will provide the > first strongly validated public model for a production multiprocessor > architecture. We also have a close collaboration with the CHERI research > project, developing processors with hardware-accelerated in-process memory > protection and sandboxing, together with an open-source operating system > and toolchain based on FreeBSD and Clang/LLVM; formal modelling is at the > heart of the CHERI design process. For more details, see some of our > previous papers: > POPL17 (http://www.cl.cam.ac.uk/~pes20/popl17/mixed-size.pdf), POPL16 ( > http://www.cl.cam.ac.uk/~pes20/popl16-armv8/top.pdf), MICRO 2015 ( > http://www.cl.cam.ac.uk/~pes20/micro-48-2015.pdf), PLDI11 ( > http://www.cl.cam.ac.uk/~pes20/ppc-supplemental/pldi105-sarkar.pdf), > CHERI ISA spec (http://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-891.html), > CHERI (https://www.cl.cam.ac.uk/research/security/ctsrd/cheri/), REMS ( > http://rems.io). > > We have a position available to work on: > > - the development of our Sail metalanguage for ISA description: a language > with a lightweight dependent type system, designed to capture ARM, IBM > POWER, and CHERI instruction semantics in an engineer-friendly way; > - translation from Sail to generate efficient emulators and usable > theorem-prover definitions; > - mechanised proof about the architecture definitions, e.g. of security > properties, relationships between concurrency models, and correctness > results for high-level language concurrency compilation; and/or > - development of reasoning, symbolic execution, debugging, and/or > model-checking tools above the architecture definitions - the initial work > should generate many opportunities along these lines. > > The successful candidate must have a PhD (or equivalent experience), a > track-record of publication in relevant areas of Computer Science, good > knowledge of English and communication skills, and the expertise and > commitment to apply rigorous semantics to real systems. We're looking for > people with the skills to make solid models and tools, well-engineered and > widely usable. You should have expertise in one or more of: > > - functional programming (e.g. OCaml) > - programming language semantics and type systems > - theorem provers, especially Isabelle and/or Coq > - symbolic execution > - model-checking > > For senior applicants, e.g. who will be able to contribute substantially > to future grant applications, it may be possible to appoint at the Senior > Research Associate level. > > This is part of the broader REMS (Rigorous Engineering for Mainstream > Systems) programme grant: a lively collaboration between systems and > semantics researchers in Cambridge, Imperial, and Edinburgh to scale up and > apply mathematically rigorous semantics to mainstream systems. > > Informal enquiries should be directed to Peter Sewell ( > Peter.Sewell at cl.cam.ac.uk). > > To apply online for this vacancy, please click on the 'Apply' button > below. This will route you to the University's Web Recruitment System, > where you will need to register an account (if you have not already) and > log in before completing the online application form. > > Please ensure you upload your Curriculum Vitae (CV) and a cover letter > explaining your potential contribution to the project, as pdf documents. > Include the names of 2 or 3 referees at the appropriate point in the online > application. Your referees should be prepared to send references within a > week of the closing date, if asked by the University. If you upload any > additional documents which have not been requested, we will not be able to > consider these as part of your application. > > Please quote reference NR10978 on your application and in any > correspondence about this vacancy. > > The University values diversity and is committed to equality of > opportunity. > > The University has a responsibility to ensure that all employees are > eligible to live and work in the UK. > > -------------- next part -------------- An HTML attachment was scrubbed... URL: From David.Aspinall at ed.ac.uk Thu Jan 12 12:14:06 2017 From: David.Aspinall at ed.ac.uk (David Aspinall) Date: Thu, 12 Jan 2017 17:14:06 +0000 Subject: [TYPES/announce] Postdoc in SDN verification and security at Edinburgh Message-ID: Dear All, We have an opening for a postdoctoral Research Associate to work on formal modelling and verification for network security applications of SDN (Software Defined Networking) at University of Edinburgh. For details please see here: https://www.vacancies.ed.ac.uk/pls/corehrrecruit/erq_jobspec_version_4.jobspec?p_id=038513 The post is available for a year with a possibility of extension subject to funding. It would suit somebody with a background in (ideally) formal methods, networking and security. I welcome people to contact me to discuss informally. - David -- Prof. David Aspinall, Email: David.Aspinall at ed.ac.uk LFCS, School of Informatics, URL: http://homepages.inf.ed.ac.uk/da University of Edinburgh, Office: +44 (0)131 650 5177 10 Crichton Street, Mobile: +44 (0)773 809 2693 Edinburgh. EH8 9AB U.K. Office: Room 5.12A, Inf. Forum The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From rxg at cs.ubc.ca Fri Jan 13 19:56:39 2017 From: rxg at cs.ubc.ca (Ronald Garcia) Date: Fri, 13 Jan 2017 16:56:39 -0800 Subject: [TYPES/announce] =?utf-8?q?_SPLASH=E2=80=9917_Call_for_Contributi?= =?utf-8?q?ons=3A_Workshops?= Message-ID: <510F8D96-282A-4CF2-993F-1B465A98F623@cs.ubc.ca> /************************************************************************************/ ACM Conference on Systems, Programming, Languages, and Applications: Software for Humanity (SPLASH'17) Vancouver, Canada October 22-27, 2017 http://2017.splashcon.org Sponsored by ACM SIGPLAN /************************************************************************************/ CALL FOR CONTRIBUTIONS: Workshops /************************************************************************************/ ## SPLASH Workshops Following its long-standing tradition, SPLASH 2017 will host a variety of high-quality workshops, allowing their participants to meet and discuss research questions with peers, to mature new and exciting ideas, and to build up communities and start new collaborations. SPLASH workshops complement the main tracks of the conference and provide meetings in a smaller and more specialized setting. Workshops cultivate new ideas and concepts for the future, optionally recorded in formal proceedings. ## Call for Submissions: We encourage proposals for workshops on any topic relevant to SPLASH. If there is a topic relevant to SPLASH that you feel passionate about, and you want to connect with others who have similar interests, you should consider submitting a proposal to organize a workshop! The exact format of the workshop can be defined by the proposal submitters, and we more than welcome new, and unconventional ideas for workshop formats. The following suggestions may serve as a starting point: - Mini-conferences provide their participants the possibility to present their work to other domain experts. The smaller and more specialized setting of the workshop allows for more extensive Q&A sessions and facilitates ample discussions,which may continue after the workshop. Typically, presentations of work-in-progress as well as of completed projects are welcome. The workshop may or may not produce formal proceedings. - Retreats act as a platform for domain experts to gather with the purpose of tackling the issues of a predetermined research agenda. Retreats are highly interactive and goal-oriented, allowing their participants to address open challenges in their domain, to explore new, uncharted ideas, and to (maybe even) uncover new, promising research domains. - Agenda-setting workshops provide a forum for domain experts to determine a research agenda for a sub-field, and may include collaborations on an agenda document that is published after the workshop is over. Other common activities at workshops include poster sessions, hands-on practical work, and focus groups. Proposal submitters should feel free to direct questions about workshop formats to the workshop chairs. Workshops that include presentation of research papers, and that implement a SIGPLAN-approved selection process, may be archived as formal proceedings in the ACM Digital Library; note that this option is available only to submitters to the early phase. ## Workshop Submission Phase: This year, SPLASH provides two options to submit proposals, either Early Phase or Late Phase (but not both): Early Phase Submissions due: 20 January 2017 Late Phase Submissions due: 3 March 2017 ## Information Website: http://2017.splashcon.org/track/splash-2017-Workshops Email: workshops at splashcon.org ## Organization: SPLASH General Chair: Gail Murphy (University of British Columbia) OOPSLA Papers Chair: Jonathan Aldrich (Carnegie Mellon University) Workshops Co-Chairs: Craig Anslow (Middlesex University, London) and Alex Potanin (Victoria University of Wellington) /************************************************************************************/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From compscience.announcement at gmail.com Sat Jan 14 23:41:27 2017 From: compscience.announcement at gmail.com (Klaus Havelund) Date: Sat, 14 Jan 2017 20:41:27 -0800 Subject: [TYPES/announce] RV'17 - First call for papers and tutorials Message-ID: *RV 2017* *Call for Papers and Tutorials* The 17th International Conference on Runtime Verification September 13-16, Seattle, WA, USA http://rv2017.cs.manchester.ac.uk Runtime verification is concerned with the monitoring and analysis of the runtime behaviour of software and hardware systems. Runtime verification techniques are crucial for system correctness, reliability, and robustness; they provide an additional level of rigor and effectiveness compared to conventional testing, and are generally more practical than exhaustive formal verification. Runtime verification can be used prior to deployment, for testing, verification, and debugging purposes, and after deployment for ensuring reliability, safety, and security and for providing fault containment and recovery as well as online system repair. Topics of interest to the conference include, but are not limited to: - specification languages - monitor construction techniques - program instrumentation - logging, recording, and replay - combination of static and dynamic analysis - specification mining and machine learning over runtime traces - monitoring techniques for concurrent and distributed systems - runtime checking of privacy and security policies - statistical model checking - metrics and statistical information gathering - program/system execution visualization - fault localization, containment, recovery and repair - integrated vehicle health management (IVHM) Application areas of runtime verification include cyber-physical systems, safety/mission-critical systems, enterprise and systems software, autonomous and reactive control systems, health management and diagnosis systems, and system security and privacy. We welcome contributions exploring the combination of runtime verification techniques with machine learning and static analysis. Whilst these are highlight topics, papers falling into these categories will not be treated differently from other contributions. An overview of previous RV conferences and earlier workshops can be found at: http://www.runtime-verification.org. RV 2017 will be held September 13-16 in Seattle, WA, USA. RV 2017 will feature a tutorial day (September 13), and three conference days (September 14-16). Important Dates *Papers* as well as *tutorial proposals* will follow the following timeline: - Abstract deadline: April 24, 2017 (Anywhere on Earth) - Paper and tutorial deadline: May 1, 2017 (Anywhere on Earth) - Tutorial notification: May 21, 2017 - Paper notification: June 26, 2017 - Conference: September 13-16, 2017 General Information on Submissions All papers and tutorials will appear in the conference proceedings in an LNCS volume. Submitted papers and tutorials must use the LNCS/Springer style detailed here: http://www.springer.de/comp/lncs/authors.html Papers must be original work and not be submitted for publication elsewhere. Papers must be written in English and submitted electronically (in PDF format) using the EasyChair submission page here: https://easychair.org/conferences/?conf=rv17 The page limitations mentioned below include all text and figures, but exclude references. Additional details omitted due to space limitations may be included in a clearly marked appendix, that will be reviewed at the discretion of reviewers, but not included in the proceedings. At least one author of each accepted paper and tutorial must attend RV 2017 to present. Paper Submissions There are three categories of papers which can be submitted: regular, short or tool papers. Papers in each category will be reviewed by at least 3 members of the Program Committee. - *Regular Papers* (up to 15 pages, not including references) should present original unpublished results. We welcome theoretical papers, system papers, papers describing domain-specific variants of RV, and case studies on runtime verification. - *Short Papers* (up to 6 pages, not including references) may present novel but not necessarily thoroughly worked out ideas, for example emerging runtime verification techniques and applications, or techniques and applications that establish relationships between runtime verification and other domains. - *Tool Demonstration Papers* (up to 8 pages, not including references) should present a new tool, a new tool component, or novel extensions to existing tools supporting runtime verification. The paper must include information on tool availability, maturity, selected experimental results and it should provide a link to a website containing the theoretical background and user guide. Furthermore, we strongly encourage authors to make their tools and benchmarks available with their submission. The Program Committee of RV 2017 will give a best paper award, and a selection of accepted regular papers will be invited to appear in a special issue of the Springer Journal on Formal Methods in System Design . Tutorial Submissions Tutorials are two-to-three-hour presentations on a selected topic. Additionally, tutorial presenters will be offered to publish a paper of up to 20 pages in the LNCS conference proceedings, not including references. A proposal for a tutorial must contain the subject of the tutorial, a proposed timeline, a note on previous similar tutorials (if applicable) and the differences to this incarnation, and a brief biography of the presenter. The proposal should not exceed 2 pages. Organization *General Chair* Klaus Havelund , NASA Jet Propulsion Laboratory, USA *Program Chairs* Giles Reger , University of Manchester, UK Shuvendu Lahiri , Microsoft Research, USA *Finance Chair* Oleg Sokolsky , University of Pennsylvania, USA *Publicity Chair* Ayoub Nour i, University of Grenoble Alpes, France *Local Organisation Chairs* Grigory Fedyukovich , University of Washington, USA Rahul Kumar , Microsoft Research, USA *Program Committee* Wolfgang Ahrendt , Chalmers Univ. of Technology/Univ. of Gothenburg, Sweden Cyrille Artho , KTH Royal Institute of Technology, Sweden Howard Barringer , The University of Manchester, UK Ezio Bartocci , Vienna University of Technology, Austria Andreas Bauer , KUKA Systems, Germany Saddek Bensalem , VERIMAG (University of Grenoble Alpes), France Eric Bodden , Fraunhofer SIT and Technische University Darmstadt, Germany Borzoo Bonakdarpour , McMaster University, Canada Christian Colombo , University of Malta, Malta Ylies Falcone , University of Grenoble Alpes, France Grigory Fedyukovich , University of Washington, USA Lu Feng , University of Virginia, USA Patrice Godefroid , Microsoft Research, USA Jean Goubault-Larrecq , CNRS & ENS de Cachan, France Alex Groce , Northern Arizona University, USA Radu Grosu , Vienna University of Technology, Austria Sylvain Hall? , University of Qu?bec at Chicoutimi, Canada Marieke Huisman , University of Twente, Netherlands Franjo Ivancic , Google Bengt Jonsson , Uppsala University, Sweden Felix Klaedtke , NEC Europe Ltd. Rahul Kumar , Microsoft Research, USA Kim Larsen , Aalborg University, Denmark Insup Lee , University of Pennsylvania, USA Axel Legay , Inria Rennes, France Martin Leucker , University of L?beck, Germany Ben Livshits , Microsoft Research, USA David Lo , Singapore Management University, Singapore Francesco Logozzo , Facebook Parthasarathy Madhusudan , University of Illinois at Urbana-Champaign, USA Leonardo Mariani , University of Milan Bicocca, Italy Madanlal Musuvathi , Microsoft Research Ayoub Nouri , University of Grenoble Alpes, France Gordon Pace , University of Malta, Malta Doron Peled , Bar Ilan University, Israel Grigore Rosu , University of Illinois at Urbana-Champaign, USA Veselin Raychev , ETH Zurich, Switzerland Cesar Sanchez , IMDEA Software Institute, Spain Gerardo Schneider, Chalmers Univ. of Technology/Univ. of Gothenburg, Sweden Rahul Sharma , Microsoft Research, USA Julien Signoles , CEA LIST, France Scott Smolka , Stony Brook University, USA Oleg Sokolsky , University of Pennsylvania, USA Bernhard Steffen , University of Dortmund, Germany Scott Stoller , Stony Brook University, USA Volker Stolz , University of Olso, Norway Frits Vaandrager , Radboud University, Netherlands Neil Walkinshaw , University of Leicester, UK Chao Wang , University of Southern California, USA Eugen Zalinescu , Technische Universitat M?nchen, Germany -------------- next part -------------- An HTML attachment was scrubbed... URL: From marta.kwiatkowska at cs.ox.ac.uk Sat Jan 14 07:52:32 2017 From: marta.kwiatkowska at cs.ox.ac.uk (Marta Kwiatkowska) Date: Sat, 14 Jan 2017 12:52:32 +0000 Subject: [TYPES/announce] Job: Associate Professor/Professor of Automated Verification, with Tutorial Fellowship at St. John's College, University of Oxford In-Reply-To: References: Message-ID: [Please forward to anyone interested. Apologies for multiple mailing.] ----------------- Associate Professorship & Tutorial Fellowship of Automated Verification Department of Computer Science, University of Oxford Salary from: ?45,562 p.a. (plus substantial benefits) http://www.cs.ox.ac.uk/news/1237-full.html Applications are invited for the post of Associate Professor (or Professor) of Automated Verification to be held in the Department of Computer Science starting as soon as possible. The successful candidate will also be appointed as Fellow and Tutor in Computer Science at St. John?s College. The Department of Computer Science is a vibrant and growing academic department, which has a research profile across the entire spectrum of contemporary computing. The Department is seeking to recruit an Associate Professor in Computer Science, with a research specialism in automated verification and synthesis, ideally complementing existing expertise. This is an area of fundamental importance in the design, evaluation and construction of software and systems (design flaws in applications such as autonomous vehicles can have devastating consequences, for example). The Associate Professor?s research will focus on developing theories and techniques to ensure system correctness and employing them in novel application domains. The appointee will also contribute to teaching on the Department?s highly successful undergraduate and graduate programmes. The Associate Professor will be a member of both the University and the St John's College community. They will be part of a lively and intellectually stimulating research community which performs to the highest international levels in research and publications and will have access to the excellent research facilities which Oxford offers. They will have a role to play in the running of the College as a member of the Governing Body and a trustee of the College as a charity. The successful candidate will hold a doctorate in Computer Science or a cognate discipline. They will have the ability to teach across a range of computer science subjects, and will also have a proven research record of high quality at international level in the area of Automated Verification and experience of research collaborations at both national and international level. Closing date for applications: *** 12.00 noon on 3 March 2017. *** Interviews will be held on 18 April ? please allow a full day for these. Further details: http://www.cs.ox.ac.uk/news/1237-full.html -- Professor Marta Kwiatkowska Fellow of Trinity College Department of Computer Science University of Oxford Wolfson Building, Parks Road Oxford, OX1 3QD Tel: +44 (0)1865 283509 Email: Marta.Kwiatkowska at cs.ox.ac.uk URL: http://www.cs.ox.ac.uk/people/marta.kwiatkowska/ Personal Assistant: Jordan Summers Young Email: Jordan.Summers at cs.ox.ac.uk Tel: +44 (0)1865 610650 From francesco.tiezzi at unicam.it Mon Jan 16 06:45:45 2017 From: francesco.tiezzi at unicam.it (Francesco Tiezzi) Date: Mon, 16 Jan 2017 12:45:45 +0100 Subject: [TYPES/announce] COORDINATION 2017 - 2nd Announcement Message-ID: [We apologize for multiple copies] ====================================================================== COORDINATION 2017 19th International Conference on Coordination Models and Languages Neuchatel, Switzerland, June 19-21 2017 http://2017.discotec.org ====================================================================== Publications * Publication of the proceedings in the Lecture Notes of Computer Science of Springer-Verlag * Publication of extended versions of selected work is planned in a special issue of an international journal as in previous issues of COORDINATION ====================================================================== IMPORTANT DATES * Submission of abstract: February 3, 2017 * Submission of papers: February 10, 2017 * Notification of acceptance: April 10, 2017 * Final version: April 24, 2017 * Conference: June 19-21, 2017 CONFERENCE GOALS Modern information systems rely increasingly on combining concurrent, distributed, mobile, adaptive, reconfigurable and heterogenous components. New models, architectures, languages and verification techniques are necessary to cope with the complexity induced by the demands of today's software development. Coordination languages have emerged as a successful approach, in that they provide abstractions that cleanly separate behaviour from communication, therefore increasing modularity, simplifying reasoning, and ultimately enhancing software development. Building on the success of the previous editions, this conference provides a well-established forum for the growing community of researchers interested in models, languages, architectures, and implementation techniques for coordination. Topics of interest encompass all areas of coordination, including (but not limited to) coordination related aspects of: * Theoretical models and foundations for coordination: component composition, concurrency, mobility, dynamic, spatial and probabilistic aspects of coordination, emergent behaviour, types, semantics; * Specification, refinement, and analysis of architectures: patterns and styles, verification of functional and non-functional properties, including performance aspects; * Coordination, architectural, and interface definition languages: implementation, interoperability, heterogeneity; * Middlewares and coordination; * Dynamic software architectures: distributed mobile code, configuration, reconfiguration, networked computing, parallel, high-performance and cloud computing; * Nature- and bio-inspired approaches to coordination; * Coordination of multiagent and collective systems: models, languages, infrastructures, self-adaptation, self-organisation, distributed solving, collective intelligence and emerging behaviour; * Coordination and modern distributed computing: Web services, peer-to-peer networks, grid computing, context-awareness, ubiquitous computing, mobile computing; * Programming languages, middleware, tools, and environments for the development of coordinated applications; * Programming methodologies and verification of coordinated applications; * Industrial relevance of coordination and software architectures: programming in the large, domain-specific software architectures and coordination models, case studies; * Interdisciplinary aspects of coordination. PROCEEDINGS The conference proceedings will be published by Springer, in the Lecture Notes in Computer Science (LNCS) series. Extended versions of a selection of the best papers is planned to be published in a special issue of an international journal as in previous issues of COORDINATION. SUBMISSION INSTRUCTIONS Authors are invited to submit full papers electronically in PostScript or PDF using a two-phase online submission process. Registration of the paper information and abstract (max. 250 words) must be completed before February 3, 2017. Submission of the full paper is due no later than February 10, 2017. Submissions are handled through the EasyChair conference management system, accessible from the conference web site: http://2017.discotec.org . Contributions must be written in English and report on original, unpublished work not submitted for publication elsewhere (cf. IFIP?s Author Code of Conduct, see http://www.ifip.org/ under Publications/Links). The submissions must not exceed the total page number limit (see below), including figures and references, prepared using Springer?s LNCS style. Submissions not adhering to the above specified constraints may be rejected without review. Papers should be submitted as PDF or PS via EasyChair. We solicit two kinds of submissions: * Full papers (up to 16 pages + 2 pages references): describing thorough and complete research results and experience reports. * Short papers (up to 8 pages + 1 page references): describing research in progress or opinion papers on the past of Coordination research, on the current state of the art, or on prospects for the years to come. The conference proceedings, formed by accepted submissions of both kinds above, will be published by Springer in the LNCS Series. Extended versions of a selection of the best full papers is planned to be published in a special issue of an international journal as in previous issues of COORDINATION. PROGRAM COMMITTEE Co-Chairs Jean-Marie Jacquet University of Namur, Belgium Jean-Marie.Jacquet at unamur.be staff.info.unamur.be/jmj Mieke Massink CNR-ISTI, Italy Mieke.Massink at isti.cnr.it www.isti.cnr.it/People/M.Massink Members Gul Agha University of Illinois at Urbana-Champaign, USA Farhad Arbab CWI and Leiden University, The Netherlands Jacob Beal Raytheon BBN Technologies, USA Simon Bliudze EPFL, Switzerland Frank de Boer CWI and Leiden University, The Netherlands Antonio Brogi University of Pisa, Italy Roberto Bruni University of Pisa, Italy Vincenzo Ciancia CNR-ISTI, Italy Dave Clarke Uppsala University, Sweden Ferruccio Damiani Universit? di Torino, Italy Wolfgang De Meuter Vrije Universiteit Brussel, Belgium Rocco De Nicola IMT - Institute for Advanced Studies, Italy Erik de Vink Eindhoven University of Technology, The Netherlands Schahram Dustdar TU Wien, Austria Jos? Luiz Fiadeiro Royal Holloway University of London, United Kingdom Stephen Gilmore University of Edinburgh, United Kingdom Paola Inverardi University of l'Aquila, Italy Ramtin Khosravi University of Tehran, Iran Eva Kuhn Vienna University of Technology, Austria Alberto Lluch Lafuente Technical University of Denmark, Denmark Michele Loreti University of Florence, Italy Hernan Melgratti University of Buenos Aires, Argentina Andrea Omicini University of Bologna, Italy Ernesto Pimentel University of Malaga, Spain Gwen Salaun University of Grenoble Alpes, France Marjan Sirjani Reykjavik University, Iceland Vasco T. Vasconcelos University of Lisbon, Portugal Carolyn Talcott SRI International, USA Emilio Tuosto University of Leicester, UK Mirko Viroli University of Bologna, Italy Takuo Watanabe Tokyo Institute of Technology, Japan Danny Weyns Katholieke Universiteit Leuven, Belgium Martin Wirsing Ludwig-Maximilians-Universit?t M?nchen, Germany PUBLICITY CHAIR Francesco Tiezzi University of Camerino, Italy STEERING COMMITTEE Gul Agha University of Illinois at Urbana Champaign, USA Farhad Arbab CWI and Leiden University, The Netherlands Dave Clarke Uppsala University, Sweden Tom Holvoet KU Leuven, Belgium Jean-Marie Jacquet University of Namur, Belgium Christine Julien The University of Texas at Austin, USA Eva K?hn Vienna University of Technology, Austria Alberto Lluch Lafuente Technical University of Denmark, Denmark Wolfgang De Meuter Vrije Universiteit Brussels, Belgium Rocco De Nicola IMT - Institute for Advanced Studies Lucca, Italy Jose Proenca University of Minho, Portugal Rosario Pugliese Universit? di Firenze, Italy Marjan Sirjani Reykjavik University, Iceland Carolyn Talcott SRI International, California, USA Vasco T. Vasconcelos University of Lisbon, Portugal Gianluigi Zavattaro University of Bologna, Italy (Chair) Mirko Viroli University of Bologna, Italy -------------- next part -------------- An HTML attachment was scrubbed... URL: From m.r.mousavi at hh.se Mon Jan 16 06:04:54 2017 From: m.r.mousavi at hh.se (M.R. Mousavi) Date: Mon, 16 Jan 2017 12:04:54 +0100 Subject: [TYPES/announce] TTCS 2017 First CFP: Deadline May 1 Message-ID: ========================================= Topics in Theoretical Computer Science (TTCS 2017) http://www.ttcs.ir/ Institute for Research in Fundamental Sciences (IPM), Tehran, Iran September 12-14, 2017 *** Abstract Submission Deadline: May 1, 2017 *** ========================================= TTCS is a bi-annual conference series, serving as a forum for novel and high-quality research in all areas of Theoretical Computer Science. The proceedings will be published in Springer LNCS series. The conference is sponsored by EATCS and IEEE (Iran section). ------------------------------ Keynote Speakers ------------------------------ - Mahdi Cheraghchi, Imperial College, UK - Jaco van de Pol, University of Twente, The Netherlands - Stefano Leonardi, Sapienza University of Rome, Italy ------------------------------ Important Dates ------------------------------ - Abstract Submission: May 1, 2017 - Full Paper Submission: May 8, 2017 - Author notification: June 26, 2017 - Camera ready paper: July 31, 2017 - Conference: September 12-14, 2017 ------------------------------ Submissions ------------------------------ For the main conference, we solicit research papers in all areas of theoretical computer science. All papers will undergo a rigorous review process and will be judged based on their originality, soundness, significance of the results, and relevance to the theme of the conference. Papers should be written in English. Research papers should not exceed 15 pages in the LNCS style format. All technical details necessary for a proper evaluation of a submission must be included in the submission or in a clearly-labelled appendix, to be consulted at the discretion of program committee members. Multiple and/or concurrent submission to other scientific venues is not allowed and will result in rejection as well as notification to the other venue. Any case of plagiarism (including self-plagiarism from earlier publications) will result in rejection as well as notification to the the authors' institutions. Papers should be submitted to the appropriate track through our EasyChair submission website: https://www.easychair.org/conferences/?conf=ttcs2017 . The web site is open for submissions. ------------------------------ Scope ------------------------------ TTCS is organized in 2 tracks. Topics of interest include but are not limited to: Track A: Algorithms and Complexity - algorithms and data structures, - algorithmic coding theory, - algorithmic graph theory and combinatorics, - approximation algorithms, - computational complexity, - computational geometry, - computational learning theory, - economics and algorithmic game theory, - fixed parameter algorithms, - machine learning, - optimization, - parallel and distributed algorithms, - quantum computing, - randomness in computing, - theoretical cryptography. Track B: Logic, Semantics, and Programming Theory - algebra and co-algebra in computer science, - concurrency theory, - coordination languages, - formal verification and model-based testing, - logic in computer science, - methods, models of computation and reasoning for embedded, hybrid, and cyber-physical systems, - stochastic and probabilistic specification and reasoning, - theoretical aspects of other CS-related research areas, e.g., computational science, databases, information retrieval, and networking, - theory of programming languages, - type theory and its application in program verification. ------------------------------ Program Committee ------------------------------ Track A: Algorithms and Complexity - Amitabha Bagchi, IIT Delhi, India - Samuel R. Buss, University of California, San Diego, USA - Jaroslaw Byrka, University of Wroclaw, Poland - Amir Daneshgar, Sharif University of Technology, Iran - Anna Gal, University of Texas at Austin, USA - Mohammad T. Hajiaghayi, University of Maryland, USA - Amit Kumar, IIT Delhi, India - Mohammad Mahmoody, University of Virginia, USA - Rolf Niedermeier, TU Berlin, Germany - Giuseppe Persiano, University of Salerno, Italy - Jorg-Rudiger Sack, Carleton University, Ottawa, Canada - Rahul Santhanam, University of Oxford, United Kingdom - Jiri Sgall, Charles University, Prague, Czech Republic (Co-Chair) - Vijay Vazirani, Georgia Institute of Technology, Atlanta, USA - Gerhard Woeginger, RWTH Aachen, Germany - Hamid Zarrabi-Zadeh, Sharif University of Technology, Iran Track B: Logic, Semantics, and Programming Theory - Farhad Arbab, CWI and Leiden University, The Netherlands - Ilaria Castellani, INRIA Sophia Antipolis, France - Fatemeh Ghassemi, University of Tehran, Iran - Hossein Hojjat, Rochester Institute of Technology, USA - Mohammad Izadi, Sharif University of Technology, Iran - Sung-shik Jongmans, Open University, The Netherlands - Ramtin Khosravi, University of Tehran, Iran - Jan Kretinsky, Munich University of Techology, Germany - Bas Luttik, Eindhoven University of Technology, The Netherlands - Larry Moss, Indiana University, USA - Mohammad Reza Mousavi, Halmstad University, Sweden (Co-Chair) - Mehrnoosh Sadrzadeh, Queen Mary University of London, UK - Gerardo Schneider, Chalmers and University of Gothenburg, Sweden - Subodh Sharma, IIT Delhi, India - Mirco Tribastone, IMT Institute for Advanced Studies, Itay - Kazunori Ueda, Waseda University, Japan -------------- next part -------------- An HTML attachment was scrubbed... URL: From ndanner at wesleyan.edu Tue Jan 17 09:18:18 2017 From: ndanner at wesleyan.edu (Norman Danner) Date: Tue, 17 Jan 2017 09:18:18 -0500 Subject: [TYPES/announce] LCC 2017: Call for papers Message-ID: <3908770.SQZKcm65sY@nellie> ====================================================================== First Call for Papers LCC 2017 18th International Workshop on Logic and Computational Complexity June 19, 2017, Reykjavik, Iceland collocated with LICS 2017 http://www.cs.swansea.ac.uk/lcc/ ====================================================================== LCC meetings are aimed at the foundational interconnections between logic and computational complexity, as present, for example, in implicit computational complexity (descriptive and type-theoretic methods); deductive formalisms as they relate to complexity (e.g. ramification, weak comprehension, bounded arithmetic, linear logic and resource logics); complexity aspects of finite model theory and databases; complexity-mindful program derivation and verification; computational complexity at higher type; and proof complexity. The program will consist of invited lectures as well as contributed talks selected by the Program Committee. IMPORTANT DATES: * submission April 14, 2017 * notification May 1, 2017 * workshop June 19, 2017 INVITED SPEAKERS: * Arnaud Durand, Universit? Denis Diderot - Paris 7 * Damiano Mazza, Institut Galil?e, Universit? Paris-Nord SUBMISSION: We welcome submissions of abstracts based on work submitted or published elsewhere, provided that all pertinent information is disclosed at submission time. There will be no formal reviewing as is usually understood in peer-reviewed conferences with published proceedings. The program committee checks relevance and may provide additional feedback. Submissions must be in English and in the form of an abstract of about 3-4 pages. All submissions should be submitted through Easychair at: https://easychair.org/conferences/?conf=lcc2017 PROGRAM COMMITTEE: Norman Danner (co-chair, Wesleyan University, Connecticut, USA) Heribert Vollmer (co-chair, Leibniz Universit?t, Hannover) Martin Avanzini (Universit?t Innsbruck) Olaf Beyersdorff (University of Leeds) Juha Kontinen (University of Helsinki) Ramyaa (New Mexico Tech) James S. Royer (Syracuse University) Cristina Sirangelo (Paris Diderot University - Paris 7) -- Norman Danner - ndanner at wesleyan.edu - http://ndanner.web.wesleyan.edu Department of Mathematics and Computer Science - Wesleyan University From georg.moser at uibk.ac.at Tue Jan 17 11:21:21 2017 From: georg.moser at uibk.ac.at (Georg Moser) Date: Tue, 17 Jan 2017 17:21:21 +0100 Subject: [TYPES/announce] DICE-FOPARA 2017: Call for Papers Message-ID: <53a007f8-1df4-d0c8-61ec-c16ea8b9bd6e@uibk.ac.at> ------------------------------------------------------------------------------------------- 8th Workshop on Developments in Implicit Computational complExity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis (DICE-FOPARA 2017) Affiliated with ETAPS 2017 April 22 - 23, 2017, Uppsala, Sweden http://cbr.uibk.ac.at/events/dice-fopara ------------------------------------------------------------------------------------------- OBJECTIVES The first joint international workshop on Developments in Implicit Computational complExity (DICE) and FOundational and Practical Aspects of Resource Analysis (FOPARA) will be held in Uppsala, Sweden, from April 22-23, 2017 as part of ETAPS. The DICE workshop explores the area of Implicit Computational Complexity (ICC), which grew out from several proposals to use logic and formal methods to provide languages for complexity-bounded computation (e.g. Ptime, Logspace computation). It aims at studying the computational complexity of programs without referring to external measuring conditions or a particular machine model, but only by considering language restrictions or logical/computational principles entailing complexity properties. The FOPARA workshop serves as a forum for presenting original research results that are relevant to the analysis of resource (e.g. time, space, energy) consumption by computer programs. The workshop aims to bring together the researchers that work on foundational issues with the researchers that focus more on practical results. Therefore, both theoretical and practical contributions are encouraged. We also encourage papers that combine theory and practice. Given the complementarity and the synergy between these two communities, and following the successful experience of co-location of DICE-FOPARA 2015 in London at ETAPS 2015, we will hold the 8th Workshop on DICE and the 5th Workshop on FOPARA together at ETAPS 2017. TOPICS The joint international DICE-FOPARA workshop serves as a forum for presenting original and established research results that are relevant to the implicit computational complexity theory and to the analysis of resource (e.g. time, space, energy) consumption by computer programs. The workshop aims to bring together the researchers that work on foundational issues with the researchers that focus more on practical results. Therefore, both theoretical and practical contributions are encouraged, as well as papers that combine theory and practice. Areas of interest to the workshop include, but are not limited to, the following: * type systems for controlling/inferring/checking complexity * logical and machine-independent characterisations of complexity classes * logics closely related to complexity classes * linear logic * semantics of complexity-bounded computation * rewriting and termination orderings * interpretation-based methods for implicit complexity * programming languages for complexity-bounded computation * theoretical foundations of program complexity analysis * application of implicit complexity to security * resource static analysis for embedded or/and critical systems; * semantic methods to analyse resources, including quasi-interpretations; * practical applications of resource analysis; * resource analysis by term and graph rewriting. SUBMISSIONS We ask for submission of *regular papers* describing original work (10--15 pages) or *extended abstracts* (2--6 pages) presenting already published work or work in progress. With respect to regular papers, submissions will be in particular verified for originality and novelty and the manuscript must not have been published, nor is presently submitted, elsewhere. With respect of submissions of extended abstracts already published manuscripts are acceptable, but have to be within the scope of the workshop and potentially give rise to lively discussions during the meeting. After the workshop we plan to edit a special issue of DICE-FOPARA 2017 in a renown journal in conjunction with the 7th Workshop on Developments in Implicit Computational complExity (DICE 2016). Regular papers must be prepared using the LaTeX EPTCS class (see http://eptcs.org/). Accepted regular papers will appear in an EPTCS volume (application pending). Papers should be submitted electronically via the submission page: https://easychair.org/conferences/?conf=dicefopara2017 IMPORTANT DATES Paper submission February 19, 2017 Notification March 19, 2017 Final versions due March 26, 2017 Workshop date April 22-23, 2017 CONFERENCE VENUE The workshop will be held as a satellite workshop of European Joint Conferences on Theory and Practice of Software 2017 (ETAPS 2017) which takes place in Uppsala, Sweden. PROGRAM COMMITTEE Beniamino Accattoli (Paris) Guillaume Bonfante (Nancy, co-chair) Marko van Eekelen (Nijmegen) Marco Gaboardi (Buffalo) Dan Ghica (Birmingham) Clemens Grelck (Amsterdam) Charles Grellois (Bologna) Nao Hirokawa (JAIST) Jan Hoffmann (CMU) Thomas Jensen (Rennes) Bj?rn Lisper (M?lardalen) Hans-Wolfgang Loidl (Edinburgh) Georg Moser (Innsbruck, co-chair) Kazushige Terui (Kyoto) Simon Wegener (Saarbr?cken) Florian Zuleger (Vienna) From elaine at mat.ufmg.br Tue Jan 17 09:31:20 2017 From: elaine at mat.ufmg.br (Elaine Pimentel) Date: Tue, 17 Jan 2017 11:31:20 -0300 Subject: [TYPES/announce] TABLEAUX 2017 - Second Call for Papers Message-ID: SECOND CALL FOR PAPERS TABLEAUX 2017 26th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods University of Bras?lia, Brazil September 25-28, 2017 Submission Deadline: 25 Apr 2017 http://tableaux2017.cic.unb.br/ GENERAL INFORMATION TABLEAUX is the main international conference at which research on all aspects, theoretical foundations, implementation techniques, systems development and applications, of the mechanization of tableau-based reasoning and related methods is presented. As the first TABLEAUX workshop was held in Lautenbach in 1992, this year's conference will include special events celebrating 25 years of TABLEAUX. The conference will be held in Bras?lia from 25-28 September 2017. It will be co-located with both the 11th International Symposium on Frontiers of Combining Systems (FroCoS 2017) and the 8th International Conference on Interactive Theorem Proving (ITP 2017). TOPICS Tableau methods offer a convenient and flexible set of tools for automated reasoning in classical logic, extensions of classical logic, and a large number of non-classical logics. For large groups of logics, tableau methods can be generated automatically. Areas of application include verification of software and computer systems, deductive databases, knowledge representation and its required inference engines, teaching, and system diagnosis. Topics of interest include but are not limited to: * tableau methods for classical and non-classical logics (including first-order, higher-order, modal, temporal, description, hybrid, intuitionistic, substructural, relevance, non-monotonic logics) and their proof-theoretic foundations; * related methods (SMT, model elimination, model checking, connection methods, resolution, BDDs, translation approaches); * sequent calculi and natural deduction calculi for classical and non-classical logics, as tools for proof search and proof representation; * flexible, easily extendable, light weight methods for theorem proving; * novel types of calculi for theorem proving and verification in classical and non-classical logics; * systems, tools, implementations, empirical evaluations and applications (provers, logical frameworks, model checkers, ...); * implementation techniques (data structures, efficient algorithms, performance measurement, extensibility, ...); * extensions of tableau procedures with conflict-driven learning, generation of proofs; compact (or humanly readable) representation of proofs; * decision procedures, theoretically optimal procedures; * applications of automated deduction to mathematics, software development, verification, deductive and temporal databases, knowledge representation, ontologies, fault diagnosis or teaching. We also welcome papers describing applications of tableau procedures to real world examples. Such papers should be tailored to the tableau community and should focus on the role of reasoning, and logical aspects of the solution. CELEBRATING 25 YEARS To celebrate 25 years TABLEAUX the conference will include a special session of invited talks by: Reiner H?hnle Technische Universit?t Darmstadt, Germany Wolfgang Bibel Technische Universit?t Darmstadt, Germany INVITED SPEAKERS: Carlos Areces FaMAF - Universidad Nacional de C?rdoba, Argentina Katalin Bimb? University of Alberta, Canada (joint with FroCoS and ITP) Jasmin Blanchette Inria and LORIA, Nancy, France (joint with FroCoS and ITP) Cesary Kaliszyk Universit?t Innsbruck, Austria (joint with FroCoS and ITP) WORKSHOPS AND TUTORIALS There will be a three-day programme of four workshops and four tutorials from 23-25 September. Workshops: 12th Logical and Semantic Frameworks with Applications (LSFA 2017) Sandra Alves, Renata Wassermann, Fl?vio L. C. de Moura 23 and 24 September 2017 Proof eXchange for Theorem Proving (PxTP) Catherine Dubois, Bruno Woltzenlogel Paleo 23 and 24 September 2017 EPS - Encyclopedia of Proof Systems Giselle Reis, Bruno Woltzenlogel Paleo 24 and 25 September 2017 DaL? ? Dynamic Logic: new trends and applications M?rio Benevides, Alexandre Madeira 24 September 2017 Tutorials: General methods in proof theory for modal and substructural logics Bj?rn Lellmann, Revantha Ramanayake 23 September 2017 From proof systems to complexity bounds Anupam Das 24 September 2017 Proof Compressions and the conjecture NP = PSPACE Lew Gordeev, Edward Hermann Haeusler 25 September 2017 PVS for Computer Scientists C?sar Mu?oz, Mauricio Ayala-Rinc?n, Mariano Moscato 25 September 2017 Details will be published in separate calls and on the conference website. PUBLICATION DETAILS The conference proceedings will published in the Springer LNAI/LNCS series, as in previous editions. SUBMISSIONS Submissions are invited in two categories: A Research papers, which describe original theoretical research, original algorithms, or applications, with length up to 15 pages. B System descriptions, with length up to 9 pages. Submissions will be reviewed by the PC, possibly with the help of external reviewers, taking into account readability, relevance and originality. For category A, theoretical results and algorithms must be original, and not submitted for publication elsewhere. Submissions will be reviewed taking into account correctness, theoretical elegance, and possible implementability. For category B submissions, a working implementation must be accessible via the internet, which includes sources. The aim of a system description is to make the system available in such a way that users can use it, understand it, and build on it. Accepted papers in both categories will be published in the conference proceedings. Papers must be edited in LaTeX using the llncs style and must be submitted electronically as PDF files via the EasyChair system: https://easychair.org/conferences/?conf=tableaux2017. For all accepted papers at least one author is required to attend the conference and present the paper. A paper title and a short abstract of about 100 words must be submitted before the paper submission deadline. Further information about paper submissions will be made available at the conference website. Be aware that neither plagiarism, nor self-plagiarism, nor duplicate publication is acceptable. Formatting instructions and the LNCS style files can be obtained via http://www.springer.com/br/computer-science/lncs/conference-proceedings-guidelines BEST PAPER AWARD The TABLEAUX 2017 Best Paper Award will be presented to the best submission nominated and chosen by the Program Committee among the accepted papers. The eligibility criteria will place emphasis on the originality and significance of the contribution, but readability and the overall technical quality, including correctness and completeness of results, will also be considered. The TABLEAUX Best Paper Award was established in 2015 and is a permanent initiative of TABLEAUX. IMPORTANT DATES 18 Apr 2017 Abstract submission 25 Apr 2017 Paper submission 8 Jun 2017 Notification of paper decisions 3 Jul 2017 Camera-ready papers due 23-25 Sep 2017 Workshops & Tutorials 25-28 Sep 2017 TABLEAUX Conference PROGRAM COMMITTEE Peter Baumgartner National ICT Australia, Canberra Maria Paola Bonacina Universit? degli Studi di Verona Laura Bozzelli Universidad Polit?cnica de Madrid Torben Bra?ner Roskilde University Serenella Cerrito Ibisc, Universit? d'Evry Val d'Essonne Agata Ciabattoni Technische Universit?t Wien Clare Dixon University of Liverpool Pascal Fontaine LORIA, INRIA, Universit? de Lorraine Didier Galmiche LORIA, Universit? de Lorraine Martin Giese Universitetet i Oslo Laura Giordano DISIT, Universit? del Piemonte Orientale Rajeev Gore The Australian National University Volker Haarslev Concordia University George Metcalfe Universit?t Bern Angelo Montanari Universit? degli Studi di Udine Barbara Morawska Technische Universit?t Dresden Boris Motik University of Oxford Leonardo de Moura Microsoft Research Neil Murray SUNY at Albany Cl?udia Nalon Universidade de Bras?lia Linh Anh Nguyen Uniwersytet Warszawski Hans de Nivelle Uniwersytet Wroc?awski Nicola Olivetti LSIS, Aix-Marseille Universit? Jens Otten Universitetet i Oslo Valeria de Paiva Nuance Communications Nicolas Peltier Centre National de la Recherche Scientifique, Laboratoire d'Informatique de Grenoble Elaine Pimentel Universidade Federal do Rio Grande do Norte Giselle Reis Carnegie Mellon University-Qatar Philipp Ruemmer Uppsala Universitet Katsuhiko Sano Hokkaido University Renate Schmidt The University of Manchester Cesare Tinelli The University of Iowa Alwen Tiu Nanyang Technological University David Toman University of Waterloo Josef Urban ?esk? vysok? u?en? technick? v Praze LOCAL CONFERENCE ORGANIZATION COMMITTEE Cl?udia Nalon, Universidade de Bras?lia, Brazil Daniele Nantes Sobrinho, Universidade de Bras?lia, Brazil Elaine Pimentel, Universidade Federal do Rio Grande do Norte, Brazil Jo?o Marcos, Universidade Federal do Rio Grande do Norte, Brazil CONFERENCE CHAIR Cl?udia Nalon, University of Bras?lia, Brazil PC CHAIRS Cl?udia Nalon, University of Bras?lia, Brazil Renate Schmidt, The University of Manchester, UK -- Elaine. ------------------------------------------------- Elaine Pimentel - DMat/UFMG Address: Departamento de Matematica Universidade Federal de Minas Gerais Av Antonio Carlos, 6627 - C.P. 702 Pampulha - CEP 30.161-970 Belo Horizonte - Minas Gerais - Brazil Phone: 55 31 3409-5970/3409-5994 Fax: 55 31 3409-5692 http://www.mat.ufmg.br/~elaine ------------------------------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: From kirstin.peters at tu-berlin.de Wed Jan 18 06:23:18 2017 From: kirstin.peters at tu-berlin.de (Kirstin Peters) Date: Wed, 18 Jan 2017 12:23:18 +0100 Subject: [TYPES/announce] CONCUR 2017 - First Call for Papers Message-ID: <985796a2-1a6a-b03d-8a62-516460e36bfa@tu-berlin.de> ============================================================================ CONCUR 2017 - First Call for Papers 28th International Conference on Concurrency Theory September 5-8, 2017, Berlin, Germany https://www.concur2017.tu-berlin.de/ ============================================================================ The purpose of the CONCUR conferences is to bring together researchers, developers, and students in order to advance the theory of concurrency, and promote its applications. INVITED SPEAKERS - Hongseok Yang (University of Oxford, UK) - Azahdeh Farzan (University of Toronto, Canada) - Madan Musuvathi (Microsoft Research, USA) - Jean-Francois Raskin (Universit? libre de Bruxelles, Belgium) CO-LOCATED EVENTS 14th International Conference on Quantitative Evaluation of SysTems (QEST 2017) 15th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS 2017) 14th European Performance Engineering Workshop (EPEW 2017) There will be co-located workshops and tutorials, which will take place during the week of September 4-9. ============================================================================ IMPORTANT DATES (AoE in 2017) Paper Submission: April 21 (firm deadline) Paper Notification: June 16 Camera Ready Copy Due: July 7 CONCUR 2017: September 5-8 TOPICS Submissions are solicited in semantics, logics, verification and analysis of concurrent systems. The principal topics include (but are not limited to): - Basic models of concurrency such as abstract machines, domain-theoretic models, game-theoretic models, process algebras, graph transformation systems, Petri nets, hybrid systems, mobile and collaborative systems, probabilistic systems, real-time systems, biology-inspired systems, and synchronous systems; - Logics for concurrency such as modal logics, probabilistic and stochastic logics, temporal logics, and resource logics; - Verification and analysis techniques for concurrent systems such as abstract interpretation, atomicity checking, model checking, race detection, pre-order and equivalence checking, run-time verification, state-space exploration, static analysis, synthesis, testing, theorem proving, type systems, and security analysis; - Distributed algorithms and data structures: design, analysis, complexity, correctness, fault tolerance, reliability, availability, consistency, self-organization, self-stabilization, protocols. - Theoretical foundations of architectures, execution environments, and software development for concurrent systems such as geo-replicated systems, communication networks, multiprocessor and multi-core architectures, shared and transactional memory, resource management and awareness, compilers and tools for concurrent programming, programming models such as component-based, object- and service-oriented. PAPER SUBMISSION CONCUR 2017 solicits high quality papers reporting research results and/or experience related to the topics mentioned above. All papers must be original, unpublished, and not submitted for publication elsewhere. Each paper will undergo a thorough review process. If necessary, the paper may be supplemented with a clearly marked appendix, which will be reviewed at the discretion of the program committee. The CONCUR 2017 proceedings will be published by LIPIcs. Papers must be submitted electronically as PDF files via EasyChair (https://www.easychair.org/conferences/?conf=concur2017). Papers must not exceed 14 pages (excluding references and clearly marked appendices) using the LIPIcs style. https://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/ ============================================================================ PROGRAM CHAIRS - Roland Meyer (Technische Universit?t Braunschweig, Germany) - Uwe Nestmann (Technische Universit?t Berlin, Germany) STEERING COMMITTEE Jos Baeten (Centrum Wiskunde & Informatica (CWI), The Netherlands) Pedro R. D'Argenio (Universidad Nacional de C?rdoba, Argentina) Javier Esparza (Technische Universit?t M?nchen, Germany) Joost-Pieter Katoen (RWTH Aachen University, Germany) Kim G. Larsen (Aalborg University, Denmark) Ugo Montanari (Universit? di Pisa, Italy) Catuscia Palamidessi (?cole Polytechnique, France) ============================================================================ -------------- next part -------------- An HTML attachment was scrubbed... URL: From mikael.mayer at epfl.ch Wed Jan 18 07:37:55 2017 From: mikael.mayer at epfl.ch (mikael.mayer at epfl.ch) Date: Wed, 18 Jan 2017 07:37:55 -0500 Subject: [TYPES/announce] CAV 2017: Call for Papers In-Reply-To: References: Message-ID: CAV 2017: 29th International Conference on Computer-Aided Verification Important Dates: All deadlines are AOE (Anywhere on Earth). Papers: Paper submission: January 24, 2017 (Tuesday) Author response period: March 20-22, 2017 (Monday ? Wednesday) Author notification: April 12, 2017 (Wednesday) Final version: May 5, 2017 (Friday) Conference: Workshops: July 22-23, 2017 Main conference: July 24-28, 2017 Submission URL http://cav2017.mpi-sws.org/ Scope CAV 2017 is the 29th in a series dedicated to the advancement of the theory and practice of computer-aided formal analysis and synthesis methods for hardware and software systems. CAV considers it vital to continue spurring advances in hardware and software verification while expanding to domains such as cyber-physical, social, and biological systems. The conference covers the spectrum from theoretical results to concrete applications, with an emphasis on practical verification tools and the algorithms and techniques that are needed for their implementation. The proceedings of the conference will be published in the Springer LNCS series. A selection of papers will be invited to a special issue of Formal Methods in System Design and the Journal of the ACM. Topics of interest include but are not limited to: Algorithms and tools for verifying models and implementations Algorithms and tools for system synthesis Mathematical and logical foundations of verification and synthesis Specifications and correctness criteria for programs and systems Deductive verification using proof assistants Hardware verification techniques Program analysis and software verification Software synthesis Hybrid systems and embedded systems verification Compositional and abstraction-based techniques for verification Probabilistic and statistical approaches to verification Verification methods for parallel and concurrent systems Testing and run-time analysis based on verification technology Decision procedures and solvers for verification and synthesis Applications and case studies in verification and synthesis Verification in industrial practice New application areas for algorithmic verification and synthesis Formal models and methods for security Formal models and methods for biological systems Paper Submission NEW this year: There is no separate registration deadline. Full papers should be uploaded by the submission deadline. Tool papers require a concurrent artifact submission together with the paper submission. Artifact evaluation occurs concurrently with the review process and the PC gets access to the artifact evaluation during the PC discussions. Submissions on a wide range of topics are sought, particularly ones that identify new research directions. CAV 2017 is not limited to topics discussed in previous instances of the conference. Authors concerned about the appropriateness of a topic may communicate with the conference chairs prior to submission. As explained below, CAV 2017 will follow a lightweight double-blind review process. Submissions that are not ?blinded? will be rejected without review. Simultaneous submission to other conferences with proceedings or submission of material that has already been published elsewhere is not allowed. The review process will include a feedback/rebuttal period where authors will have the option to respond to reviewer comments. The PC chairs may solicit further reviews after the rebuttal period. Papers must be submitted in PDF format here https://cav2017.mpi-sws.org/ Submissions will be in two categories: Regular Papers and Tool Papers. Regular Papers Regular Papers should not exceed 16 pages in LNCS format, not counting references and appendices. Authors can include a clearly marked appendix at the end of their submissions, that is exempt from the page limit restrictions. However, the reviewers are not obliged to read the contents of these appendices. These papers should contain original research and sufficient detail to assess the merits and relevance of the contribution. Papers will be evaluated on basis of a combination of correctness, technical depth, significance, novelty, clarity, and elegance. We welcome papers on theory, case studies, and comparisons with existing experimental research, as well as combinations of new theory with experimental evaluation. A strong theoretical paper is not required to have an experimental component. On the other hand, strong papers reproducing and comparing existing results experimentally do not require new theoretical insights. We encourage authors to provide any supplementary material that is required to support the claims made in the paper, such as detailed proofs or experimental data. These materials should be uploaded at submission time, as a single pdf or a tarball, not via a URL. It will be made available to reviewers only after they have submitted their first-draft reviews and hence need not be anonymized. Reviewers are under no obligation to look at the supplementary material but may refer to it if they have questions about the material in the body of the paper. Tool Papers Tool Papers should not exceed 6 pages, not counting references. These papers should describe system and implementation aspects of a tool with a large (potential) user base (experiments not required, rehash of theory strongly discouraged). Papers describing tools that have already been presented (in any conference) will be accepted only if significant and clear enhancements to the tool are reported and implemented. Note that tool papers require the submission of an artifact for evaluation by the submission deadline. Artifacts will be evaluated concurrently with the review process and the program committee will have access to the artifact evaluation while making their decision. In special cases, where an artifact cannot be submitted, the authors should contact the program chairs to find alternate modes of artifact evaluation. Lightweight Double-Blind Reviewing Process CAV 2017 will employ a lightweight double-blind reviewing process. This means that committee members will not have access to authors? names or affiliations as they review a paper; however, authors? names will be revealed once reviews have been submitted. To facilitate this, submitted papers must adhere to two rules: Author names and institutions must be omitted, and references to authors? own related work should be in the third person (e.g., not ?We build on our previous work?? but rather ?We build on the work of ??). The purpose of this process is to help the PC and external reviewers come to an initial judgement about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission, makes the job of reviewing the paper more difficult, or interferes with the process of disseminating new ideas. For example, important background references should *not* be omitted or anonymized, even if they are written by the same authors and share common ideas, techniques, or infrastructure. Authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For instance, authors may post drafts of their papers on the web or give talks on their research ideas. Artifact Submission and Evaluation Authors of accepted regular papers will be invited to submit (but are not required to submit) the relevant artifact for evaluation by the artifact evaluation committee. Authors of all tool papers are required to submit their artifact to the artifact evaluation committee at the paper submission time. Unlike regular papers, the results of the artifact evaluation for tool papers will be available to the program committee during the online discussions. To submit an artifact, please prepare a virtual machine (VM) image of your artifact and keep it accessible through an HTTP link throughout the evaluation process. As the basis of the VM image, please choose commonly used OS versions that have been tested with the virtual machine software and that evaluators are likely to be accustomed to. We encourage you to use https://www.virtualbox.org and save the VM image as an Open Virtual Appliance (OVA) file. Please include the prepared link in the appropriate field of the paper submission form. In addition, please supply at submission time a link to a short plain-text file describing the OS and parameters of the image, as well as the host platform on which you prepared and tested your virtual machine image (OS, RAM, number of cores, CPU frequency). Please describe how to proceed after booting the image, including the instructions for locating the full documentation for evaluating the artifact. If you are not in a position to prepare the artifact as above, please contact PC chairs for an alternative arrangement. It is to the advantage of authors to prepare an artifact that is easy to evaluate by the artifact evaluation committee and that yields expected results. We next provide some guidelines. Document in detail how to reproduce most of the experimental results of the paper using the artifact; keep this process simple through easy-to-use scripts and provide detailed documentation assuming minimum expertise of users. Ensure the artifact is in the state ready to run. It should work without a network connection. It should not require the user to install additional software before running. It should use reasonably modest resources (RAM, number of cores), so that the results can be reproduced on various hardware platforms including laptops. The evaluation should take reasonable amount of time to complete. When possible include source code within your virtual machine image and point to the most relevant and interesting parts of the source code tree. Members of the artifact evaluation committee and the program committee are asked to use submitted artifact for the sole purpose of evaluating the contribution associated with the artifact. Invited speakers * Chris Hawblitzel, Microsoft Research:Chris Hawblitzel, Microsoft Research Fast verification of fast cryptography for secure sockets * Marta Kwiatkowska, OxfordMarta Kwiatkowska, Oxford * Viktor Vafeiadis, MPI-SWSViktor Vafeiadis, MPI-SWS Formal reasoning under weak memory consistency Organization Conference co-chairs Viktor Kuncak, EPFL, Switzerland Rupak Majumdar, Max Planck Institute for Software Systems, Germany Workshop Chair Eva Darulov?, Max Planck Institute for Software Systems, Germany Sponsorship Chair Barbara Jobstmann, EPFL and Cadence CAV Fellowship Chair Thomas Wahl, Northeastern University Publicity Chair Mika?l Mayer, EPFL CAV Award Committee Tom Ball (Chair), Microsoft research Kim G. Larsen, Aalborg University Natarajan Shankar, SRI International Pierre Wolper, Liege University Program Committee Aws Albarghouthi Christel Baier Per Bjesse Jasmin Blanchette Sergiy Bogomolov Ahmed Bouajjani Rohit Chadha Bor-Yuh Evan Chang Swarat Chaudhuri Wei-Ngan Chin Hana Chockler Alessandro Cimatti Isil Dilig Dino Distefano Cezara Dragoi Michael Emmi Javier Esparza Georgios Fainekos Azadeh Farzan Aarti Gupta Gerard Holzmann Marieke Huisman Radu Iosif Franjo Ivancic Stefan Kiefer Zachary Kincaid Barbara K?nig Daniel Kr?ning Viktor Kuncak(Co-chair) Rustan Leino Rupak Majumdar (Co-chair) Kenneth McMillan Alexander Nadel Madhusudan Parthasarathy Corina Pasareanu Nadia Polikarpova Pavithra Prabhakar Arjun Radhakrishna Zvonimir Rakamaric Andrey Rybalchenko Roopsha Samanta Rahul Sharma Anna Slobodova Ana Sokolova Fabio Somenzi Zhendong Su Serdar Tasiran Emina Torlak Willem Visser Mahesh Viswanathan Yakir Vizel Tomas Vojnar Thomas Wahl Bow-Yaw Wang Georg Weissenbacher Verena Wolf Lenore Zuck Damien Zufferey Steering Committee Orna Grumberg, Technion, Israel Aarti Gupta, Princeton University, USA Daniel Kroening, University of Oxford, UK Kenneth McMillan, Microsoft Research, USA Artifact Evaluation Committee Ayca Balkan, UCLA Stephanie Balzer, CMU James Bornholt, University of Washington Simon Cruanes, INRIA Nancy Matthias Dangl University of Passau Marko Doko, MPI-SWS Chuchu Fan, UIUC Pietro Ferrara, Julia Johannes Hoelzl, TU Munich Lars Hupel, TU Munich Swen Jacobs, Saarland University Moa Johansson, Chalmers Dejan Jovanovic, SRI Ralf Jung, MPI-SWS Ivan Kuraj, MIT Andreas Lochbihler, ETH Zurich Jose Morales, IMDEA Van Chan Ngo, CMU Zvonimir Pavlinovic, NYU Markus Rabe, UC Berkeley Mukund Raghothaman, UPenn Andrew Reynolds, University of Iowa Nima Roohi, UIUC Christian Schilling, University of Freiburg Muralidaran Vijayaraghavan, MIT Nicolas Voirol, EPFL cavconference.org/2017 -------------- next part -------------- An HTML attachment was scrubbed... URL: From viktor at mpi-sws.org Thu Jan 19 06:13:03 2017 From: viktor at mpi-sws.org (Viktor Vafeiadis) Date: Thu, 19 Jan 2017 12:13:03 +0100 Subject: [TYPES/announce] Postdoc opening on weak memory concurrency at MPI-SWS Message-ID: *** Postdoc opening on weak memory concurrency at MPI-SWS *** Applications are invited for a full-time postdoctoral research position at the Max Planck Institute for Software Systems (MPI-SWS) based at Kaiserslautern, Germany, under the supervision of Viktor Vafeiadis (http://www.mpi-sws.org/~viktor/). The initial postdoc appointment is for two years, starting anytime, with an option to extend to a third year (depending on performance). The position is relatively independent in that it is not tied to a specific project and there is considerable freedom to choose a research topic. Nevertheless, the postdoc is expected to collaborate closely with other researchers in the group. Thus, the main topics of interest are: - weak memory model semantics - manual or automated verification of concurrent programs - efficient compilation and/or optimisation of concurrent programs - verification or testing of compilers for concurrent programs - static and/or dynamic analysis under weak memory consistency. The successful candidate will have a strong background in at least one of the following areas: - weak memory model semantics - concurrent separation logic - interactive theorem proving (e.g., Coq or Isabelle) - static analysis of concurrent programs - compilation (esp. for concurrent programs) Qualified candidates are encouraged to contact me directly by e-mail (viktor AT mpi-sws DOT org) and in addition to submit a formal online application at: https://apply.mpi-sws.org/ The application consists of a CV, a research statement, and a list of referees. Application deadline: Friday, 10 February. From mikael.mayer at epfl.ch Thu Jan 19 08:25:03 2017 From: mikael.mayer at epfl.ch (mikael.mayer at epfl.ch) Date: Thu, 19 Jan 2017 08:25:03 -0500 Subject: [TYPES/announce] CAV 2017 Award In-Reply-To: References: Message-ID: CAV Award The CAV award is given annually at the CAV conference for fundamental contributions to the field of Computer-Aided Verification. The award comes with a cash prize of US$10,000 shared equally among recipients. Call for Nominations for the 2016 CAV Award Anyone can submit a nomination. The Award Committee can originate a nomination. Anyone, with the exception of members of the Award Committee, is eligible to receive the Award. A nomination must state clearly the contribution(s), explain why the contribution is fundamental or the series of contributions is outstanding, and be accompanied by supporting letters and other evidence of worthiness. The deadline for nominations for the 2017 award is 10 February 2017. Nominations should include a proposed citation (up to 25 words), a succinct (100-250 words) description of the contribution(s), and a detailed statement to justify the nomination. The cited contribution(s) must have been made not more recently than five years ago and not over twenty years ago. In addition, the contribution(s) should not yet have received recognition via a major award, such as the ACM Turing or Kanellakis Awards. The nominee may have received such an award for other contributions. Nominations should be submitted by e-mail to a member of the committee. For previous winners of the award, please see the main CAV award page http://i-cav.org/cav-award. Award Committee - Tom Ball (Chair), Microsoft Research - Kim G. Larsen , Aalborg University - Natarajan Shankar , SRI International - Pierre Wolper , Liege University cavconference.org/2017/cav-award/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From dilian at csc.kth.se Thu Jan 19 10:55:23 2017 From: dilian at csc.kth.se (Dilian Gurov) Date: Thu, 19 Jan 2017 16:55:23 +0100 Subject: [TYPES/announce] CSL 2017: Second Call For Papers In-Reply-To: <974c32cb-5138-00d9-143b-6be1c34259f8@csc.kth.se> References: <974c32cb-5138-00d9-143b-6be1c34259f8@csc.kth.se> Message-ID: <91efab52-d827-0166-8b61-7ac74040c6f7@csc.kth.se> ================================================================= SECOND CALL FOR PAPERS 26th EACSL Annual Conference on Computer Science Logic (CSL 2017) August 20-24, 2017, Stockholm, Sweden https://www.csl17.conf.kth.se ================================================================= AIM AND SCOPE Computer Science Logic (CSL) is the annual conference of the European Association for Computer Science Logic (EACSL). It is an interdisciplinary conference, spanning across both basic and application oriented research in mathematical logic and computer science and is intended for computer scientists whose research involves logic, as well as for logicians working on issues essential for computer science. CSL 2017 is the 26th EACSL annual conference. It will be co-organised by Stockholm University and KTH Royal Institute of Technology, and hosted by Stockholm University. CSL 2017 will be co-located with, and immediately preceded by, the Logic Colloquium 2017 (LC 2017). There will be a joint session of CSL 2017 and LC 2017 in the morning of August 20, as well as CSL-affiliated workshops during August 25-26. IMPORTANT DATES: --------------------------------------------------------------- Abstract submission for contributed papers: March 24, 2017 Paper submission: March 31, 2017 Notification: May 31, 2017 Abstract submission for short presentations: June 4, 2017 Notification on short presentations: June 14, 2017 --------------------------------------------------------------- TOPICS OF INTEREST for CSL 2017 include (but are not limited to): ----------------------------------------------------------------- ? automata and games, game semantics ? automated deduction and interactive theorem proving ? bounded arithmetic and propositional proof complexity ? categorical logic and topological semantics ? computational proof theory ? constructive mathematics and type theory ? decision procedures ? domain theory ? equational logic and rewriting ? finite model theory ? higher-order logic ? lambda calculus and combinatory logic ? linear logic and other substructural logics ? logic programming and constraints ? logical aspects of computational complexity ? logical aspects of quantum computing ? logic in database theory ? logical foundations of programming paradigms ? logical foundations of cryptography and information hiding ? logics for multi-agent systems ? modal and temporal logic ? model checking and logic-based verification ? nonmonotonic reasoning ? SAT solving and automated induction ? satisfiability modulo theories ? specification, extraction and transformation of programs ? verification and program analysis ----------------------------------------------------------------- INVITED SPEAKERS ----------------------------------------------------------------- LC-CSL joint session highlight speakers: ? Phokion Kolaitis, University of California Santa Cruz and IBM Research - Almaden ? Wolfgang Thomas, RWTH Aachen CSL plenary speakers: ? Laura Kov?cs, Vienna University of Technology ? Stephan Kreutzer, Technische Universit?t Berlin ? Meena Mahajan, Institute of Mathematical Sciences, Chennai ? Margus Veanes, Microsoft Research ----------------------------------------------------------------- SPECIAL AND AFFILIATED EVENTS ----------------------------- In addition to the plenary and contributed talks CSL 2017, the conference will also include the following events: ? Joint session of CSL 2017 and LC 2017 in the morning of August 20, consisting of four plenary highlight talks, offered by speakers from both conferences. ? Presentation of the Alonzo Church award for Outstanding Contributions to Logic and Computation, ? Presentation of the EACSL Ackermann award for Outstanding Dissertation on Logic in Computer Science, ? CSL-affiliated workshops, to be held as co-located events on August 25 and (possibly) 26, including: ? Workshop on Logical Aspects of Multi-Agent Systems LAMAS 2017 (August 25) ? Workshop on Logic and Automata Theory (in memory of Zoltan Ezik) (August 25) ? Workshop on Logic and Algorithms in Computational Linguistics LACompLing 2017 (August 26) SUBMISSIONS ----------- The CSL 2017 conference proceedings will be published in Leibniz International Proceedings in Informatics (LIPIcs). Authors are invited to submit contributed papers of no more than 15 pages in LIPIcs style (including references), presenting not previously published work, fitting the scope of the conference. The submission of contributed papers will be in two stages: * abstracts, due by March 24, 2017 (AoE); * full papers, due by March 31, 2017 (AoE). The submissions must be done via the EasyChair page for the conference: https://easychair.org/conferences/?conf=CSL 2017. Submitted papers must be in English and must provide sufficient detail to allow the Programme Committee to assess the merits of the paper. Full proofs may appear in a clearly marked technical appendix which will be read at the reviewers' discretion. Authors are strongly encouraged to include a well written introduction which is directed at all members of the PC. Papers may not be submitted concurrently to another conference with refereed proceedings. The PC chairs should be informed of closely related work submitted to a conference or a journal. Papers authored or co-authored by members of the PC are not allowed. In addition, there will be an opportunity for short oral presentations at the conference. Abstracts for such oral presentations must be submitted through the Easychair submission webpage, under the category ``short presentations'', by June 4, 2017. They will not be included in the proceedings. PROGRAMME COMMITTEE ------------------- ? Parosh Aziz Abdulla (University of Uppsala), ? Lars Birkedal (University of Aarhus), ? Nikolaj Bjorner (Microsoft Research), ? Maria Paola Bonacina (Universit? degli Studi di Verona), ? Patricia Bouyer-Decitre (LSV, ENS Cachan), ? Agata Ciabattoni (University of Viena), ? Thierry Coquand (University of Gothenburg), ? Mads Dam (KTH, Stockholm), PC co-chair ? Ugo Dal Lago (University of Bologna), ? Anuj Dawar (Cambridge University), ? Valentin Goranko (Stockholm University), PC co-chair ? Maribel Fernandez (King's College London), ? Martin Grohe (RWTH Aachen), ? Lauri Hella (University of Tampere), ? Joost-Pieter Katoen (RWTH Aachen), ? Orna Kupferman (University of Jerusalem), ? Leonid Libkin (University of Edinburgh), ? Angelo Montanari (University of Udine), ? Catuscia Palamidessi (Paris, INRIA), ? Frank Pfenning (Carnegie Mellon University, Pittsburgh) ? Ram Ramanujam (Institute of Mathematical Sciences, Chennai), ? Jean-Francois Raskin (University of Bruxelles), ? Thomas Schwentick (TU Dortmund University), ? Viorica Sofronie-Stokkermans (University of Koblenz-Landau), ? Thomas Streicher (University of Darmstadt), ? Jean-Marc Talbot (University of Aix-Marseille), ? Luca Vigan? (King's College London), ? Ron van der Meyden (UNSW Australia), ? Lijun Zhang (Chinese Academy of Sciences, Beijing). ORGANISING COMMITTEE -------------------- ? Mads Dam (OC co-chair), Department of Theoretical Computer Science, KTH ? Valentin Goranko (OC co-chair), Department of Philosophy, Stockholm University ? Dilian Gurov (Workshops chair), Department of Theoretical Computer Science, KTH ? Roussanka Loukanova, Department of Mathematics, Stockholm University ? Peter LeFanu Lumsdaine, Department of Mathematics, Stockholm University ? Anders Lundstedt, Department of Philosophy, Stockholm University ? Erik Palmgren (OC co-chair), Department of Mathematics, Stockholm University ? Henning Strandin, Department of Philosophy, Stockholm University CONTACTS AND ENQUIRIES ---------------------- With enquiries on organising matters, send email to: CSL 2017philosophy.su.se With enquiries on scientific and programme issues, send email to: CSL 2017pcgmail.com From detlef.plump at york.ac.uk Wed Jan 18 14:53:35 2017 From: detlef.plump at york.ac.uk (Detlef Plump) Date: Wed, 18 Jan 2017 19:53:35 +0000 Subject: [TYPES/announce] ICGT 2017: Final Call for Papers Message-ID: ============================================ Final Call for Papers 10th International Conference on Graph Transformation ICGT 2017 Marburg (Germany), 18-19 July 2017 Part of STAF 2017 https://sites.google.com/site/gratra2017/ ============================================ Aims and Scope --------------------------------- Dynamic structures are a major cause for complexity when it comes to model and reason about systems. They occur in software architectures, models, pointer structures, databases, networks, etc. As collections of interrelated elements, which may be added, removed, or change state, they form a fundamental modelling paradigm as well as a means to formalise and analyse systems. Applications include architectural reconfigurations, model transformations, refactoring, and evolution of a wide range of artefacts, where change can happen either at design time or at run time. Based on the observation that these structures can be represented as graphs and their modifications as graph transformations, theory and applications of graphs, graph grammars and graph transformation systems have been studied in our community for more than 40 years. The conference aims at fostering interaction within this community as well as attracting researchers from other areas, either in contributing to the theory of graph transformation or by applying graph transformation to established or novel areas. The 10th International Conference on Graph Transformation (ICGT 2017) will be held in Marburg, Germany, as part of STAF 2017 (Software Technologies: Applications and Foundations). The conference takes place under the auspices of EATCS, EASST, and IFIP WG 1.3. Proceedings will be published by Springer in the Lecture Notes in Computer Science (LNCS) series, and a special issue has been confirmed with the Journal of Logic and Algebraic Methods in Programming (Elsevier). Topics of Interest --------------------------------- Topics of interest include (but are not limited to): - General models of graph transformation (e.g., high-level, adhesive, node, edge, and hyperedge replacement systems) - Analysis and verification of graph transformation systems - Graph theoretical properties of graph languages - Automata on graphs and parsing of graph languages - Logical aspects of graph transformation - Computational models based on graph transformation - Structuring and modularization of graph transformation - Hierarchical graphs and decompositions of graphs - Parallel, concurrent, and distributed graph transformation - Term graph rewriting - Graph transformation and Petri nets - Model-driven development and model transformation - Model checking, program verification, simulation and animation - Syntax, semantics and implementation of programming languages, domain-specific languages, and visual languages - Graph transformation languages and tool support - Efficient algorithms (pattern matching, graph traversal, etc.) - Applications and case studies of graph transformation in software engineering, including software architectures, refactoring, business processes, access control and service-orientation - Application to computing paradigms such as bio-inspired, quantum, ubiquitous, and visual computing Important Dates ---------------------------------- Abstract submission: February 17, 2017 Paper submission: February 24, 2017 Notification: April 7, 2017 Camera-ready version: April 21, 2017 Conference: July 18-19, 2017 Submission Guidelines --------------------------------- Papers can be submitted at http://www.easychair.org/confe rences/?conf=icgt2017 using Springer's LNCS format ( http://www.springer.com/lncs), and should contain original research. Simultaneous submission to other conferences with proceedings or submission of material that has already been published elsewhere is not allowed. All submissions will be peer reviewed by members of the program committee and external subreviewers. Papers are solicited in three categories: - Research papers (16 pages max) are evaluated with respect to their originality, significance, and technical soundness. Additional material intended for reviewers may be included in a clearly marked appendix. - Case studies (12 pages max) describe applications of graph transformations in any application domain. - Tool presentation papers (12 pages max) demonstrate the main features and functionality of graph-based tools. These papers may have an appendix with a detailed demo description (up to 5 pages), which will be reviewed but not included in the proceedings. Special Issue --------------------------------- A special issue of the Journal of Logic and Algebraic Methods in Programming (Elsevier) will be devoted to extended versions of the best ICGT'17 papers. Keynote Speaker --------------------------------- We are pleased to announce Georg Gottlob (University of Oxford) as invited speaker. Organization --------------------------------- Program chairs - Detlef Plump (University of York, UK) - Juan de Lara (Universidad Aut?noma de Madrid, Spain) Program committee - Anthony Anjorin (University of Paderborn, Germany) - Paolo Baldan (University of Padova, Italy) - G?bor Bergmann (Budapest University of Technology and Economics, Hungary) - Paolo Bottoni (Sapienza University of Rome, Italy) - Andrea Corradini (University of Pisa, Italy) - Juergen Dingel (Queen's University, Canada) - Rachid Echahed (CNRS, Laboratoire LIG, France) - Maribel Fernandez (King's College London, UK) - Holger Giese (Hasso Plattner Institute, University of Potsdam, Germany) - Joel Greenyer (Leibniz University of Hannover, Germany) - Annegret Habel (University of Oldenburg, Germany) - Reiko Heckel (University of Leicester, UK) - Berthold Hoffmann (University of Bremen, Germany) - Dirk Janssens (University of Antwerp, Belgium) - Barbara K?nig (University of Duisburg-Essen, Germany) - Leen Lambers (Hasso Plattner Institute, University of Potsdam, Germany) - Yngve Lamo (Bergen University College, Norway) - Mark Minas (Universit?t der Bundeswehr M?nchen, Germany) - Mohamed Mosbah (LaBRI, University of Bordeaux, France) - Fernando Orejas (Technical University of Catalonia, Spain) - Francesco Parisi-Presicce (Sapienza University of Rome, Italy) - Arend Rensink (University of Twente, The Netherlands) - Leila Ribeiro (University Federal do Rio Grande do Sul, Brazil) - Andy Sch?rr (Technical University of Darmstadt, Germany) - Uwe Wolter (University of Bergen, Norway) - Albert Z?ndorf (University of Kassel, Germany) Contact --------------------------------- icgt2017 at easychair.org -------------- next part -------------- An HTML attachment was scrubbed... URL: From bart at unica.it Thu Jan 19 04:12:43 2017 From: bart at unica.it (Massimo Bartoletti) Date: Thu, 19 Jan 2017 10:12:43 +0100 Subject: [TYPES/announce] CfP: 10th Interaction and Concurrency Experience (ICE 2017) Message-ID: ICE 2017 10th Interaction and Concurrency Experience June 22, 2017, Neuch?tel, Switzerland Satellite workshop of DisCoTec 2017 http://ice2017.unica.it === Highlights === - Distinctive selection procedure - ICE welcomes full papers to be included in the proceedings - ICE also welcomes oral communications of already published or preliminary work - Submission deadlines: April 3 (abstract) and April 10 (full) - Invited talks: TBA - Publication in EPTCS (to be confirmed) - Special issue in the Journal of Logical and Algebraic Methods in Programming (Elsevier) (to be confirmed) === Important Dates === April 3, 2017.........................Abstract submission April 10, 2017........................Full paper submission April 10-May 19, 2017.................Reviews and PC discussion May 19, 2017..........................Notification to authors June 22, 2017.........................ICE in Neuch?tel July 15, 2017.........................Camera-ready for post-proceedings === Scope === Interaction and Concurrency Experiences (ICEs) is a series of international scientific meetings oriented to theoretical computer science researchers with special interest in models, verification, tools, and programming primitives for complex interactions. The general scope of the venue includes theoretical and applied aspects of interactions and the synchronization mechanisms used among components of concurrent/distributed systems, related to several areas of computer science in the broad spectrum ranging from formal specification and analysis to studies inspired by emerging computational models. We solicit contributions relevant to Interaction and Concurrency, including but not limited to: * Formal semantics * Process algebras and calculi * Models and languages * Protocols * Logics and types * Expressiveness * Model transformations * Tools, implementations, and experiments * Specification and verification * Coinductive techniques * Tools and techniques for automation * Synthesis techniques === Selection Procedure === Since its first edition in 2008, the distinguishing feature of ICE has been an innovative paper selection mechanism based on an interactive, friendly, and constructive discussion amongst authors and PC members in an online forum. During the review phase, each submission is published in a dedicated discussion forum. The discussion forum can be accessed by the authors of the submission and by all PC members not in conflict with the submission (the forum preserves anonymity). The forum is used by reviewers to ask questions, clarifications, and modifications from the authors, allowing them better to explain and to improve all aspects of their submission. The evaluation of the submission will take into account not only the reviews, but also the outcome of the discussion. As witnessed by the past eight editions of ICE, this procedure considerably improves the accuracy of the reviews, the fairness of the selection, the quality of camera-ready papers, and the discussion during the workshop. This year we will adopt a light double-blind reviewing process, detailed below. === Submission Guidelines === We invite two types of submissions: - Research papers, original contributions that will be published in the workshop post-proceedings. Research papers must not be simultaneously submitted to other conferences/workshops with refereed proceedings. The page limit for research papers is 16 pages + 2 pages of references. - Oral communications, that will be presented at the workshop, but will not appear in the post-proceedings. This type of contribution includes e.g. previously published contributions, preliminary work, and position papers. There is no strict page limit for this kind of submission but submissions of at most five pages would be appreciated. A one page summary of previously published work also perfectly fits this category. Authors of research papers must omit their names and institutions from the title page, they should refer to their other work in the third person and omit acknowledgements that could reveal their identity or affiliation. The purpose is to avoid any bias based on authors? identity characteristics, such as gender, seniority, or nationality, in the review process. Our goal is to facilitate an unbiased approach to reviewing by supporting reviewers? access to works that do not carry obvious references to the authors? identities. As mentioned above, this is a lightweight double-blind process. Anonymization should not be a heavy burden for authors, and should not make papers weaker or more difficult to review. Advertising the paper on alternate forums (e.g., on a personal web-page, pre-print archive, email, talks, discussions with colleagues) is permitted, and authors will not be penalized by for such advertisement. Papers in the ?Communications? category need not be anonymized. For any questions concerning the double blind process, feel free to consult the ICEcreamers. We are keen to enhance the balanced, inclusive and diverse nature of the ICE community, and would particularly encourage female colleagues and members of other underrepresented groups to submit their work. Submissions must be made electronically in PDF format via EasyChair (https://easychair.org/conferences/?conf=ice2017). === Publications === Accepted research papers and communications must be presented at the workshop by one of the authors. Accepted research papers will be published after the workshop in Electronic Proceedings in Theoretical Computer Science (http://eptcs.org/). We plan to invite authors of selected papers and brief announcements to submit their work ina special issue in the Journal of Logical and Algebraic Methods in Programming (Elsevier). Such contributions will be regularly peer-reviewed according to the standard journal policy, but they will be handled in a shorter time than regular submissions. A list of published and in preparation special issues of previous ICE editions is reported below. === Invited Speakers === TBA === Program Committee === 1. Lacramioara Astefanoaei (Technical University of Munich, DE) 2. Eduard Baranov (?cole Polytechnique F?d?rale de Lausanne, CH) 3. Franco Barbanera (University of Catania, IT) 4. Henning Basold (Radboud University Nijmegen, NL) 5. Stefano Calzavara (University Ca? Foscari Venezia, IT) 6. Marco Carbone (IT University of Copenhagen, DK) 7. Vincenzo Ciancia (ISTI CNR Pisa, IT) 8. Matteo Cimini (Indiana University, USA) 9. Tiziana Cimoli (University of Cagliari, IT) 10. Ornela Dardha (University of Glasgow, IT) 11. Tobias Heindel (University of Copenhagen, DK) 12. Anastasia Mavridou (?cole Polytechnique F?d?rale de Lausanne, CH) 13. Christos Kloukinas (City University London, UK) 14. Ivan Lanese (University of Bologna, IT) 15. Michael Lienhardt (University of Turin, IT) 16. Alberto Lluch Lafuente (Technical University of Denmark, DK) 17. Julien Lange (Imperial College London, UK) 18. Jean Marie Madiot (INRIA Paris, FR) 19. Hern?n Melgratti (University of Buenos Aires, AR) 20. Fabrizio Montesi (University of Southern Denmark, DK) 21. Dominic Orchard (University of Kent, UK) 22. Johannes ?man Pohjola (Chalmers University, SE) 23. Jurriaan Rot (Radboud University Nijmegen, NL) 24. Alceste Scalas (Imperial College London, UK) 25. Ana Sokolova (University of Salzburg, AT) 26. Anke St?ber (Uppsala University, SE) 27. Hugo Torres Vieira (IMT Lucca, IT) 28. Roberto Zunino (University of Trento, IT) === ICEcreamers === Massimo Bartoletti (University of Cagliari, IT; PC co-chair) Laura Bocchi (University of Kent, UK) Ludovic Henrio (CNRS, Sophia Antipolis, FR) Sophia Knight (Uppsala University, SE; PC co-chair) === Steering Committee === Simon Bliudze (?cole Polytechnique F?d?rale de Lausanne, CH) Filippo Bonchi (CNRS, Ecole Normale Sup?rieure de Lyon, FR) Roberto Bruni (University of Pisa, IT) Alexandra Silva (University College London, UK) Paola Spoletini (Kennesaw State University, US) Emilio Tuosto (University of Leicester, UK) === Previous editions === The previous eight editions of ICE have been held on * July 6, 2008 in Reykjavik, Iceland, co-located with ICALP'08. The post-proceedings were published in ENTCS (vol. 229-3). * August 31, 2009 in Bologna, Italy, co-located with CONCUR'09. The post-proceedings were published in EPTCS (vol. 12) and selected papers appeared in a joint special issue of MSCS (with EXPRESS?09 and SOS?09, Vol. 22, Number 2). * June 10, 2010 in Amsterdam, The Netherlands, co-located with DisCoTec'10. The post-proceedings were published in EPTCS (vol. 38) and selected papers appeared in a joint special issue of SACS (with CAMPUS'10 and CS2BIO'10, Vol. XXI). * June 9, 2011 in Reykjavik, Iceland, co-located with DisCoTec'11. The post-proceedings were published in EPTCS (vol. 59) and selected papers appeared in a special issue of SACS (Vol. XXII). * June 16, 2012 in Stockholm, Sweden, co-located with DisCoTec'12. The post-proceedings were published in EPTCS (vol. 104) and selected papers appeared in a special issue of SCP (vol. 100). * June 6, 2013 in Florence, Italy, co-located with DisCoTec?13. The post-proceedings were published in EPTCS (vol. 131) and selected papers appeared in a special issue of SCP (vol. 109). * June 6, 2014 in Berlin, Germany, co-located with DisCoTec?14. The post-proceedings were published in EPTCS (vol. 166) and selected papers appeared in a special issue of JLAMP (Vol. 85, Number 3). * June 4-5, 2015 in Grenoble, France, co-located with DisCoTec?15. The post-proceedings were published in EPTCS (vol. 189) and selected papers appeared in a special issue of JLAMP (Vol. 86, Number 1). * June 21-22, in Heraklion, Greece, co-located with DisCoTec?16. The post-proceedings were published in EPTCS (vol. 223) and a special issue of JLAMP is in preparation. -------------- next part -------------- An HTML attachment was scrubbed... URL: From bcpierce at cis.upenn.edu Thu Jan 19 17:18:11 2017 From: bcpierce at cis.upenn.edu (Benjamin C. Pierce) Date: Thu, 19 Jan 2017 17:18:11 -0500 Subject: [TYPES/announce] [CSF-attendees] DeepSpec Summer School, July 13-28, 2017 -- call for applications Message-ID: <4F28FF1B-BCDC-45B2-BFBD-9C997EB3A885@cis.upenn.edu> The first DeepSpec Summer School on Verified Systems will be held in Philadelphia from July 17 to 28, 2017, preceded by an introductory Coq Intensive from July 13 to 15. Applications are now being accepted ! Overview Can critical systems be built with zero bugs in critical components such as hardware, operating systems, compilers, or crypto? It may seem a pipe dream, but in fact the past decade has seen explosive advances in the technology required to realize it. This summer school aims to give participants a wide-ranging overview of several ambitious projects currently underway in this space. Participants will complete the summer school with a thorough understanding of the conceptual underpinnings of these projects plus considerable hands-on experience with state-of-the-art tools for building verified systems. Dates The summer school will open with a three-day intensive course on Coq fundamentals, for participants who are new to Coq. The main lectures take place during the weeks of July 17 and 24. July 13-15 (Thu-Sat) Coq intensive July 17-21 Week 1 July 24-28 Week 2 Lecturers and Topics Andrew Appel Verified functional algorithms Adam Chlipala Program-specific proof automation Frans Kaashoek & Nickolai Zeldovich Certifying software with crashes Xavier Leroy The structure of a verified compiler Benjamin Pierce Property-based random testing with QuickChick Zhong Shao CertiKOS: Certified kit operating systems Stephanie Weirich Language specification and variable binding Steve Zdancewic Vellvm: Verifying the LLVM Prerequisites The DeepSpec summer school is aimed at a wide range of participants, including graduate students, academics, and industrial engineers and researchers. The Coq proof assistant will serve as a lingua franca for all the lectures. Participants who are not already familiar with Coq at the level of Software Foundations should plan on attending the Coq Intensive before the summer school. Costs and Financial Aid The total cost (for lectures, meals, and dormitory lodging) is expected to be roughly $2000 per participant. Substantial subsidies are available, courtesy of the NSF (thank you!), for students requiring financial assistance to attend. More details will be announced when applications open. Applications Applications are now?open (here) ! Applications received by Feb 15 will be given equal consideration; applications received after Feb 15 will be considered on a space-available basis. -------------- next part -------------- An HTML attachment was scrubbed... URL: From tmoldere at vub.ac.be Fri Jan 20 08:39:29 2017 From: tmoldere at vub.ac.be (Tim Molderez) Date: Fri, 20 Jan 2017 14:39:29 +0100 Subject: [TYPES/announce] 2017: Final call for workshop, symposium, demo & poster submissions Message-ID: <30a1693e-35ab-c450-1f55-73baedbf30ff@vub.ac.be> ----------------------------------------------------------------------- 2017 : The Art, Science, and Engineering of Programming April 3-6, 2017, Brussels, Belgium http://2017.programming-conference.org ----------------------------------------------------------------------- Final call for submissions to all co-located events at the 2017 conference: - ELS 2017 - 10th European Lisp Symposium - Modularity 2017 Invited talks - International Symposium on Modularity - **Updated** ACM Student Research Competition / 2017 Posters - **NEW** 2017 Demos - **NEW** CoCoDo 2017 - Raincode Labs Compiler Coding Dojo - LASSY 2017 - 2nd Workshop on Live Adaptation of Software SYstems - **NEW** MiniPLoP 2017 - Mini Pattern Languages of Programs writers' workshop - **Updated** MOMO 2017 - 2nd Workshop on Modularity in Modelling - MoreVMs 2017 - 1st Workshop on Modern Language Runtimes, Ecosystems, and VMs - PASS 2017 - 1st Workshop on Programming Across the System Stack - PX 2017 - 2nd Workshop on Programming Experience - ProWeb 2017 - 1st Workshop on Programming Technology for the Future Web - Salon des Refus?s 2017 - 1st edition of the Salon des Refus?s workshop All co-located events will take place during April 3-4 2017. CFPs for each of these events are listed below. (apart from Modularity 2017, which is invitation-based) **************************************************************** ELS 2017 - 10th European Lisp Symposium Submissions: Mon 30 Jan 2017 Notifications: Mon 27 Feb 2017 Symposium date: Mon Apr 3 - Tue Apr 4 2017 http://2017.programming-conference.org/track/els-2017 **************************************************************** The purpose of the European Lisp Symposium is to provide a forum for the discussion and dissemination of all aspects of design, implementation and application of any of the Lisp and Lisp-inspired dialects, including Common Lisp, Scheme, Emacs Lisp, AutoLisp, ISLISP, Dylan, Clojure, ACL2, ECMAScript, Racket, SKILL, Hop and so on. We encourage everyone interested in Lisp to participate. The 10th European Lisp Symposium invites high quality papers about novel research results, insights and lessons learned from practical applications and educational perspectives. We also encourage submissions about known ideas as long as they are presented in a new setting and/or in a highly elegant way. Topics include but are not limited to: * Context-, aspect-, domain-oriented and generative programming * Macro-, reflective-, meta- and/or rule-based development approaches * Language design and implementation * Language integration, inter-operation and deployment * Development methodologies, support and environments * Educational approaches and perspectives * Experience reports and case studies ******************************************************************** ACM Student Research Competition / 2017 Posters Submissions **extended** : Mon 30 Jan 2017 http://2017.programming-conference.org/track/programming-posters ******************************************************************** The ACM Student Research Competition (SRC), sponsored by Microsoft Research, offers a unique forum for ACM student members at the undergraduate and graduate levels to present their original research before a panel of judges and conference attendees. The SRC gives visibility to up-and-coming young researchers, and offers them an opportunity to discuss their research with experts in their field, get feedback, and to help sharpen communication and networking skills. ACM?s SRC program covers expenses up to $500 for all students invited to an SRC. See our website for requirements and further details. Please note that, while the SRC involves a poster session, there also is a regular poster session that isn't part of a competition. Submissions for this regular session are due March 3rd. *********************************************************************** ?Programming? 2017 Demos Submissions: Fri 3 Mar 2017 http://2017.programming-conference.org/track/programming-2017-Demos *********************************************************************** Demonstrations will be selected on the basis of technical merit, relevance, and novelty of presentation at . They can include work in progress, commercial or in-house applications, proofs of concept, results of academic or industrial research, or any other innovative programming tools or systems. We encourage authors of accepted papers to co-located workshops and main conferences also submit a demo proposal. We hope that this will give them the opportunity to show their work in action, and increase the visibility of their results. We suggest to cite the paper in the demo abstract. **************************************************************** CoCoDo 2017 - Raincode Labs Compiler Coding Dojo Coding dojo date: Tue 4 Apr 2017 https://cocodo.github.io **************************************************************** CoCoDo is a coding dojo where you can enjoy an entire day of compiler programming under gentle guidance of field experts. Compiler construction comprises, but is not limited to, lexical analysis, syntactic analysis, preprocessing, context handling, code generation, code optimisation, virtual machines, interpreters, smell detection, clone management, portability, migration, refactoring, domain-specific language design, linking and loading, assembling and disassembling, generics and reflection, numerous paradigms and so much more. If you are interested in participating, please contact Vadim Zaytsev: vadim at raincodelabs.com ****************************************************************** LASSY 2017 - 2nd Workshop on Live Adaptation of Software SYstems Submissions: Fri 3 Feb 2017 Notifications: Fri 3 Mar 2017 Workshop date: Mon 3 Apr 2017 http://2017.programming-conference.org/track/LASSY-2017-papers ****************************************************************** When developing current-day software systems, their deployment and usage environments should be considered carefully, in order to understand the adaptations those systems might need to undergo to interact with other systems and with their environment. Moreover, due to the portability, mobility and increasingly evolutionary nature of software systems, such adaptations should be enacted even while the system is running. Developing such software systems can prove challenging, and many seemingly different techniques to address this concern have been proposed over the last couple of years. The intention of the LASSY workshop is to congregate all topics relevant to dynamic adaptation and run-time evolution of software systems, ranging from a computer science perspective covering the domains of programming languages, model-driven software development, software and service composition, context-aware databases, software variability, requirements engineering, UI adaptation and other domains, to a human perspective covering sociological or ethical implications of dynamic software systems. The workshop provides a space for discussion and collaboration between researchers working on the problem of enabling live adaptations to software systems, across the development stack. Topics of Interest: * Design and Implementation of Live Adaptive Software Systems * Context-, aspect-, feature-, role- and agent-oriented programming * Context representation and discovery * Context-aware model-driven software development * Context-aware data management * Software variability and dynamic product lines * Self-adaptive, self-explanatory systems * Inconsistency management, verification, and validation * Middleware and Runtime of Live Adaptive Software Systems * Dynamic software evolution, upgrades and configuration * Dynamic software and service composition mechanisms * Dynamic software architecture and middleware approaches * Dynamic user interface adaptation and multimodal user interfaces * Impact and Assessment of Live Adaptive Software Systems * User acceptance and usability issues * Human, sociological, ethical and legal aspects * Privacy and security aspects of dynamic adaptability * Live adaptation in smart environments (e.g. smart rooms, smart robot cells, smart factories, smart cities) * Self-adaptation and emergence in SoS and CPSoS ********************************************************************** MiniPLoP 2017 - Mini Pattern Languages of Programs writers' workshop Workshop date: Mon 3 Apr 2017 http://2017.programming-conference.org/track/MiniPLoP-2017-papers ********************************************************************** Software developers and those involved with programming have long observed that certain patterns recur and endure across different applications and systems. The growing interest in Design Patterns, Architectural Patterns, Analysis Patterns, Pedagogical Patterns, Agile Patterns, and so on, represents an effort to catalog and better communicate knowledge, providing handbooks of proven solutions to common problems. The MiniPLoP writers' workshop brings together researchers, educators, and practitioners whose interests span a remarkably broad range of topics and who share an interest in exploring the power of the pattern form. MiniPLoP invites you to add your expertise to the growing corpus of patterns. MiniPLoP focuses on improving the expression of patterns. You will have the opportunity to refine and extend your patterns or pattern ideas with the help from knowledgeable and sympathetic fellow pattern enthusiasts. You will also be able to discuss applications of patterns in industry and academia. Techniques for Pattern Mining will also be presented. Highlights include group discussions on patterns, an introduction to pattern writing, an international keynote, and the writers? workshop. This MiniPLoP at 2017 has the goal to help beginners learn more about the pattern community. If you have some patterns or pattern ideas you would like to have brainstormed or workshopped, please contact the organizers at: miniplop2017 at hillside.net **************************************************************** MOMO 2017 - 2nd Workshop on Modularity in Modelling Abstract submissions (optional) **extended** : Sun Feb 5 2017 Paper submissions **extended** : Sun Feb 12 2017 Notifications: Wed Feb 22 2017 Workshop date: Mon 3 Apr 2017 http://www.momo2017.ece.mcgill.ca/cfp.htm **************************************************************** Extending the time-honored practice of separation of concerns, Model-Driven Engineering (MDE) promotes the use of separate models to address the various concerns in the development of complex software-intensive systems. The main objective is to choose the right level of abstraction to modularize a concern, specify its properties and reason about the system under development depending on stakeholder and development needs. While some of these models can be defined with a single modelling language, a variety of heterogeneous models and languages are typically used in the various phases of software development. Furthermore, Domain-Specific Modelling Languages designed to address particular concerns are also increasingly used. Despite the power of abstraction of modelling, models of real-world problems and systems quickly grow to such an extent that managing the complexity by using proper modularization techniques becomes necessary. As a result, many (standard) modelling notations have been extended with aspect-oriented mechanisms and advanced composition operators to support advanced separation of concerns, to combine (possibly heterogeneous) models modularizing different concerns, to execute an application based on modularized models, and to reason over global properties of modularized models. The Second International Modularity in Modelling Workshop brings together researchers and practitioners interested in the theoretical and practical challenges resulting from applying modularity, advanced separation of concerns, and advanced composition at the modelling level. It is intended to provide a forum for presenting new ideas and discussing the impact of the use of modularization in the context of MDE at different levels of abstraction. We are interested in submissions on all topics related to modularity and modelling including but not limited to: * Modularization Support in Modelling Languages and Tools * Model Interfaces * Homogeneous Model Composition Operators * Heterogeneous Model Composition Operators * Visualization of Modularized and Composed Models * Effects of Using Modularization and Composition in Modelling * On Verification and Validation * On Reuse * On the Model-Driven Software Development Process (Requirements Engineering, Software Architecture, Software Design, Implementation) * On Maintenance * Experience Reports / Empirical Evaluations of Applying Modularization and Composition in Modelling * Feature-Oriented, Aspect-Oriented and Concern-Oriented Modelling * Modularization support and composition operators for specific modelling notations * Modelling essential characteristics of specific (crosscutting) concerns * Multi-View Modelling: avoiding inconsistencies, avoiding Redundancies * Support for Detecting and/or Resolution of Feature Interactions * Domain-Specific Modelling * Modularization for Domain-Specific Languages * Composition for Domain-Specific Languages * Domain-specific Aspect Models ****************************************************************************** MoreVMs 2017 - 1st Workshop on Modern Language Runtimes, Ecosystems, and VMs Submissions: Wed 15 Feb 2017 Notifications: Wed 1 Mar 2017 Workshop date: Mon 3 Apr 2017 http://2017.programming-conference.org/track/MoreVMs-2017-papers ****************************************************************************** The main goal of the workshop is to bring together both researchers and practitioners and facilitate effective sharing of their respective experiences and ideas on how languages and runtimes are utilized and where they need to improve further. We welcome presentation proposals in the form of extended abstracts discussing experiences, work-in-progress, as well as future visions from the academic as well as industrial perspective. Relevant topics include, but are definitely not limited to, the following: * Extensible VM design (compiler- or interpreter-based VMs) * Reusable runtime components (e.g. interpreters, garbage collectors, intermediate representations) * Static and dynamic compiler techniques * Techniques for compilation to high-level languages such as JavaScript * Runtimes and mechanisms for interoperability between languages * Tooling support (e.g. debugging, profiling, etc.) * Programming language development environments and virtual machines * Case studies of existing language implementations, virtual machines, and runtime components (e.g. design choices, tradeoffs, etc.) * Language implementation challenges and trade-offs (e.g. performance, completeness, etc.) * Surveys and applications usage reports to understand runtime usage in the wild * Surveys on frameworks and their impact on runtime usage * New research ideas on how we want to build languages in the future ************************************************************************** PASS 2017 - 1st Workshop on Programming Across the System Stack Submissions: Mon 13 Feb 2017 Notifications: Mon 27 Feb 2017 Workshop date: Tue 4 Apr 2017 http://2017.programming-conference.org/track/PASS-2017#Call-for-Papers ************************************************************************** The landscape of computation platforms has changed dramatically in recent years. Emerging systems - such as wearable devices, smartphones, unmanned aerial vehicles, Internet of things, cloud computing servers, heterogeneous clusters, and data centers - pose a distinct set of system-oriented challenges ranging from data throughput, energy efficiency, security, real-time guarantees, to high performance. In the meantime, code quality, such as modularity or extensibility, remains a cornerstone in modern software engineering, bringing in crucial benefits such as modular reasoning, program understanding, and collaborative software development. Current methodologies and software development technologies should be revised in order to produce software to meet system-oriented goals, while preserving high internal code quality. The role of the Software Engineer is essential, having to be aware of the implications that each design, architecture and implementation decision has on the application system ecosystem. This workshop is driven by one fundamental question: How does internal code quality interact with system-oriented goals? We welcome both positive and negative responses to this question. An example of the former would be modular reasoning systems specifically designed to promote system-oriented goals, whereas an example of the latter would be anti-patterns against system-oriented goals during software development. Areas of interest include but are not limited to: * Energy-aware software engineering (e.g. energy efficiency models, energy efficiency as a quality attribute) * Modularity support (e.g., programming language design, development tools or verification) for applications in resource-constrained or real-time systems * Emerging platforms (e.g., Internet of Things and wearable devices) * Security support (e.g., compositional information flow, compositional program analysis) * Software architecture for reusability and adaptability in systems and their interactions with applications * Empirical studies (patterns and anti-patterns) on the relationship between internal code quality and system-oriented goals * Software engineering techniques to balance the trade-off between internal code quality and efficiency * Memory bloats and long-tail performance problems across modular boundaries * Program optimization across modular boundaries * Internal code quality in systems software * Reasoning across applications, compilers, and virtual machines **************************************************************** PX 2017 - 2nd Programming Experience Workshop Submissions: Sat 4 Feb 2017 Notifications: Mon 27 Feb 2017 Workshop date: Mon 3 Apr 2017 http://programming-experience.org/px17 **************************************************************** Imagine a software development task: some sort of requirements and specification including performance goals and perhaps a platform and programming language. A group of developers head into a vast workroom. In that room they discover they need to explore the domain and the nature of potential solutions?they need exploratory programming. The Programming Experience Workshop is about what happens in that room when one or a couple of programmers sit down in front of computers and produce code, especially when it?s exploratory programming. Do they create text that is transformed into running behavior (the old way), or do they operate on behavior directly (?liveness?); are they exploring the live domain to understand the true nature of the requirements; are they like authors creating new worlds; does visualization matter; is the experience immediate, immersive, vivid and continuous; do fluency, literacy, and learning matter; do they build tools, meta-tools; are they creating languages to express new concepts quickly and easily; and curiously, is joy relevant to the experience? Correctness, performance, standard tools, foundations, and text-as-program are important traditional research areas, but the experience of programming and how to improve and evolve it are the focus of this workshop, and in this edition we would like to focus on exploratory programming. The technical topics include: * Exploratory programming * Live programming * Authoring * Representation of active content * Visualization * Navigation * Modularity mechanisms * Immediacy * Literacy * Fluency * Learning * Tool building * Language engineering ************************************************************************* ProWeb 2017 - 1st Workshop on Programming Technology for the Future Web Submissions: Wed 15 Feb 2017 Notifications: Wed 1 Mar 2017 Workshop date: Tue 4 Apr 2017 http://2017.programming-conference.org/track/proweb-2017-papers ************************************************************************* Full-fledged web applications have become ubiquitous on desktop and mobile devices alike. Whereas ?responsive? web applications already offered a more desktop-like experience, there is an increasing demand for ?rich? web applications (RIAs) that offer collaborative and even off-line functionality ?Google docs being the prototypical example. Long gone are the days that web servers merely had to answer incoming HTTP request with a block of static HTML. Today?s servers react to a continuous stream of events coming from JavaScript applications that have been pushed to clients. As a result, application logic and data is increasingly distributed. Traditional dichotomies such as ?client vs. server? and ?offline vs. online? are fading. The 1st International Workshop on Programming Technology for the Future Web, or ProWeb17, is a forum for researchers and practitioners to share and discuss new technology for programming these and future evolutions of the web. We welcome submissions introducing programming technology (i.e., frameworks, libraries, programming languages, program analyses and development tools) for implementing web applications and for maintaining their quality over time, as well as experience reports about the use of state-of-the-art programming technology. Relevant topics include, but are not limited to: * Quality on the new web: static and dynamic program analyses; code, design test and process metrics; development and migration tools; automated testing and test generation; contract systems, type systems, and web service API conformance checking; ? * Hosting languages on the web: new runtimes; transpilation or compilation to JavaScript, WebAssembly, asm.js, ? * Designing languages for the web: multi-tier (or tierless) programming; reactive programming; frameworks for multi-tier or reactive programming on the web; ? * Distributed data sharing, replication and consistency: cloud types, CRDTs, eventual consistency, offline storage, peer-to-peer communication, ? * Security on the web: client-side and server-side security policies; policy enforcement; proxies and membranes; vulnerability detection; dynamic patching, ? * Surveys and case studies using state-of-the-art web technology (e.g., WebAssembly, WebSocket, LocalStorage, AppCache, ServiceWorkers, Meteor, deepstream.io, Angular.js, React and React Native, Swarm.js, Caja, TypeScript, Proxies, ClojureScript, Amber Smalltalk, Scala.js, ?) * Ideas on and experience reports about: how to reconcile the need for quality with the need for agility on the web; how to master and combine the myriad of tier-specific technologies required to develop a web application, ? * Position statements on what the future of the web will look like **************************************************************** Salon des Refus?s 2017 Submissions: Wed 1 Feb 2017 Notifications: Fri 17 Feb 2017 Workshop date: Tue 4 Apr 2017 https://refuses.github.io **************************************************************** Salon des Refus?s (?exhibition of rejects?) was an 1863 exhibition of artworks rejected from the official Paris Salon. The jury of Paris Salon required near-photographic realism and classified works according to a strict genre hierarchy. Paintings by many, later famous, modernists such as ?douard Manet were rejected and appeared in what became known as the Salon des Refus?s. This workshop aims to be the programming language research equivalent of Salon des Refus?s. We provide a venue for exploring new ideas and new ways of doing computer science. Many interesting ideas about programming might struggle to find space in the modern programming language research community, often because they are difficult to evaluate using established evaluation methods (be it proofs, measurements or controlled user studies). As a result, new ideas are often seen as ?unscientific?. This workshop provides a venue where such interesting and thought-provoking ideas can be exposed to critical evaluation. Submissions that provoke interesting discussion among the program committee members will be published together with an attributed review that presents an alternative position, develops additional context or summarizes discussion from the workshop. This means of engaging with papers not just enables explorations of novel programming ideas, but also encourages new ways of doing computer science. Topics of interest The scope of the workshop is determined more by the format of submissions than by the specific area of programming language or computer science research that we are interested in. We welcome submissions in a format that makes it possible to think about programming in a new way, including, but not limited to: * Thought experiments ? we believe that thought experiments, analogies and illustrative metaphors can provide novel insights and inspire fruitful programming language ideas. * Experimentation ? we find prejudices in favour of theory, as far back as there is institutionalized science, but programming can often be seen more as experimentation than as theorizing. We welcome interesting experiments even if there is yet no overarching theory that explains why they happened. * Paradigms ? all scientific work is rooted in a scientific paradigm that frame what questions can be asked. We encourage submissions that reflect on existing paradigms or explore alternative scientific paradigms. * Metaphors, myths and analogies ? any description of formal, mathematical, quantitative or even poetical nature still represents just an analogy. We believe that fruitful ideas can be learned from less common forms of analogies as well as from the predominant, formal and mathematical ones. * From jokes to science fiction ? a story or an artistic performance may explore ideas and spark conversations that provide crucial inspiration for development of new computer science thinking. From kaposi.ambrus at gmail.com Fri Jan 20 10:44:44 2017 From: kaposi.ambrus at gmail.com (Ambrus Kaposi) Date: Fri, 20 Jan 2017 16:44:44 +0100 Subject: [TYPES/announce] TYPES 2017 call for contributions Message-ID: CALL FOR CONTRIBUTIONS 23rd International Conference on Types for Proofs and Programs, TYPES 2017 and EUTYPES Cost Action CA15123 meeting Budapest, Hungary, 29 May - 1 June 2017 http://types2017.elte.hu BACKGROUND The TYPES meetings are a forum to present new and on-going work in all aspects of type theory and its applications, especially in formalised and computer assisted reasoning and computer programming. The TYPES areas of interest include, but are not limited to: * foundations of type theory and constructive mathematics; * applications of type theory; * dependently typed programming; * industrial uses of type theory technology; * meta-theoretic studies of type systems; * proof assistants and proof technology; * automation in computer-assisted reasoning; * links between type theory and functional programming; * formalizing mathematics using type theory. We encourage talks proposing new ways of applying type theory. In the spirit of workshops, talks may be based on newly published papers, work submitted for publication, but also work in progress. The EUTypes Cost Action CA15123 (eutypes.cs.ru.nl) focuses on the same research topics as TYPES and partially sponsors the TYPES Conference: May 31 - June 1 are supported by and organised under the auspices of EUTypes. INVITED SPEAKERS * Edwin Brady (University of St Andrews) * Sara Negri (University of Helsinki) * Jakob Rehof (TU Dortmund) CONTRIBUTED TALKS We solicit contributed talks. Selection of those will be based on extended abstracts/short papers of 2 pp formatted with easychair.cls. The submission site is https://easychair.org/conferences/?conf=types2017. Important dates: * submission of 2 pp abstract: 13 March 2017 * notified of acceptance/rejection: 10 April 2017 * camera-ready version of abstract: 2 May 2017 Camera-ready versions of the accepted contributions will be published in an informal book of abstracts for distribution at the workshop. POST-PROCEEDINGS Similarly to TYPES 2011 and TYPES 2013-2016, we intend to publish a post-proceedings volume in the Leibniz International Proceedings in Informatics (LIPIcs) series (subject to successful negotiation with Dagstuhl Publishing). Submission to that volume would be open for everyone. Tentative submission deadline: September 2017. PROGRAMME COMMITTEE * Andreas Abel (Chalmers University Gothenburg) * Thorsten Altenkirch (University of Nottingham) * Jose Espirito Santo (University of Minho) * Fredrik Forsberg (University of Strathclyde) * Silvia Ghilezan (University of Novi Sad) * Hugo Herbelin (INRIA Paris-Rocquencourt) * Martin Hofmann (Ludwig Maximilian University of Munich) * Ambrus Kaposi (E?tv?s Lor?nd University) (co-chair) * Tam?s Kozsik (E?tv?s Lor?nd University) (co-chair) * Assia Mahboubi (INRIA Paris) * Alexandre Miquel (University of the Republic, Urugay) * Leonardo de Moura (Microsoft Research, Redmond, USA) * Keiko Nakata (FireEye, Dresden) * Andrew Polonsky (University Paris Diderot) * Simona Ronchi Della Rocca (Universit? di Torino) * Aleksy Schubert (University of Warsaw) * Wouter Swierstra (Utrecht University) * Tarmo Uustalu (Tallinn University of Technology) TYPES STEERING COMMITTEE Marc Bezem, Herman Geuvers (chair), Hugo Herbelin, Zhaohui Luo, Ralph Matthes, Bengt Nordstr?m, Andrew Polonsky, Aleksy Schubert, Tarmo Uustalu. ABOUT TYPES The TYPES meetings from 1990 to 2008 were annual workshops of a sequence of five EU funded networking projects. From 2009 to 2015, TYPES has been run as an independent conference series. From 2016, TYPES is partially supported by COST Action EUTypes CA15123. Previous TYPES meetings were held in Antibes (1990), Edinburgh (1991), B?stad (1992), Nijmegen (1993), B?stad (1994), Torino (1995), Aussois (1996), Kloster Irsee (1998), L?keberg (1999), Durham (2000), Berg en Dal near Nijmegen (2002), Torino (2003), Jouy-en-Josas near Paris (2004), Nottingham (2006), Cividale del Friuli (2007), Torino (2008), Aussois (2009), Warsaw (2010), Bergen (2011), Toulouse (2013), Paris (2014), Tallinn (2015), Novi Sad (2016). CONTACT Email: info at types2017.elte.hu Organisers: Ambrus Kaposi, Tam?s Kozsik, Andr?s Kov?cs and the Department of Programming Languages and Compilers at the Faculty of Informatics, E?tv?s Lor?nd University, Budapest. -------------- next part -------------- An HTML attachment was scrubbed... URL: From georg.weissenbacher at tuwien.ac.at Fri Jan 20 09:27:45 2017 From: georg.weissenbacher at tuwien.ac.at (Georg Weissenbacher) Date: Fri, 20 Jan 2017 15:27:45 +0100 Subject: [TYPES/announce] CfP: FMCAD 2017 - Formal Methods in Computer Aided Design Message-ID: CALL FOR PAPERS International Conference on Formal Methods in Computer-Aided Design (FMCAD) Vienna, Austria, October 2-6, 2017 http://www.fmcad.org/FMCAD17 IMPORTANT DATES Abstract Submission: May 01, 2017 Paper Submission: May 08, 2017 Author Response Period: June 19-23, 2017 Author Notification: July 14, 2017 Camera-Ready Version: Aug 09, 2017 All deadlines are 11:59 pm AoE (Anywhere on Earth) FMCAD Tutorial Day: October 2, 2017 FMCAD Regular Program: October 3-6, 2017 Part of the FMCAD 2017 program: - Symposium in memoriam of Helmut Veith - FMCAD Student Forum Co-located event: MEMOCODE 2017 CONFERENCE SCOPE AND PUBLICATION FMCAD 2017 is the seventeenth in a series of conferences on the theory and applications of formal methods in hardware and system verification. FMCAD provides a leading forum to researchers in academia and industry for presenting and discussing groundbreaking methods, technologies, theoretical results, and tools for reasoning formally about computing systems. FMCAD covers formal aspects of computer-aided system design including verification, specification, synthesis, and testing. FMCAD employs a rigorous peer-review process. Accepted papers are distributed through both ACM and IEEE digital libraries. In addition, published articles are made available freely on the conference page; the authors retain the copyright. There are no publication fees. At least one of the authors is required to register for the conference and present the accepted paper. A small number of outstanding FMCAD submissions will be considered for inclusion in a Special Issue of the journal on Formal Methods in System Design (FMSD). TOPICS OF INTEREST FMCAD welcomes submission of papers reporting original research on advances in all aspects of formal methods and their applications to computer- aided design. Topics of interest include (but are not limited to): -- Model checking, theorem proving, equivalence checking, abstraction and reduction, compositional methods, decision procedures at the bit- and word-level, probabilistic methods, combinations of deductive methods and decision procedures. -- Synthesis and compilation for computer system descriptions, modeling, specification, and implementation languages, formal semantics of languages and their subsets, model-based design, design derivation and transformation, correct-by-construction methods. -- Application of formal and semi-formal methods to functional and non-functional specification and validation of hardware and software, including timing and power modeling, verification of computing systems on all levels of abstraction, system-level design and verification for embedded systems, cyber-physical systems, automotive systems and other safety-critical systems, hardware-software co-design and verification, and transaction-level verification. -- Experience with the application of formal and semi-formal methods to industrial-scale designs; tools that represent formal verification enablement, new features, or a substantial improvement in the automation of formal methods. -- Application of formal methods to verifying safety, correctness, connectivity, and security properties of networks and distributed systems. SUBMISSIONS Submissions must be made electronically in PDF format via EasyChair: https://easychair.org/conferences/?conf=fmcad17 Two categories of papers are invited: Regular papers, and Tool & Case Study papers. Regular papers are expected to offer novel foundational ideas, theoretical results, or algorithmic improvements to existing methods, along with experimental impact validation where applicable. Tool & Case Study papers are expected to report on the design, implementation or use of verification (or related) technology in a practically relevant context (which need not be industrial), and its impact on design processes. Both Regular and Tool & Case study papers must use the IEEE Transactions format on letter-size paper with a 10-point font size. Regular papers can be up to 8 pages in length and tool papers up to 4 pages, although there is no requirement to fill all pages in either category. Authors will be required to select the appropriate paper category at abstract submission time. Submissions may contain an optional appendix, which will not appear in the final version of the paper. The reviewers should be able to assess the quality and the relevance of the results in the paper without reading the appendix. Submissions in both categories must contain original research that has not been previously published, nor is concurrently submitted for publication. Any partial overlap with published or concurrently submitted papers must be clearly indicated. If experimental results are reported, authors are strongly encouraged to provide the reviewers access to their data at submission time, so that results can be independently verified. FMCAD 2017 COMMITTEES PROGRAM CHAIRS: Daryl Stewart, ARM Georg Weissenbacher, TU Wien STUDENT FORUM CHAIR: Keijo Heljanko, Aalto University LOCAL ARRANGEMENTS CHAIR & WEBMASTER: Jens Katelaan, TU Wien PUBLICATION CHAIR: Mitra Tabaei Befrouei, TU Wien PROGRAM COMMITTEE Jade Alglave University College London and Microsoft Research Christel Baier Technical University of Dresden Roderick Bloem Graz University of Technology Hana Chockler King's College London Andreas Griesmayer ARM Arie Gurfinkel University of Waterloo Ziyad Hanna Cadence Design Systems Fei He Tsinghua University Alan J. Hu University of British Columbia Warren A. Hunt Jr. University of Texas Alexander Ivrii IBM Barbara Jobstmann EPFL and Cadence Design Systems Dejan Jovanovic SRI International Gerwin Klein Data61 and UNSW Australia Igor Konnov TU Wien Rebekah Leslie-Hurd Intel Ines Lynce INESC-ID/IST, Universidade de Lisboa Ken McMillan Microsoft Research Charles Morisset Newcastle University Lee Pike Galois Inc. Mitra Purandare IBM Ajitha Rajan University of Edinburgh Ahmed Rezine Link?ping University Sean Safarpour Synopsys Roopsha Samanta Purdue University Martina Seidl Johannes Kepler University Linz Natasha Sharygina USI Lugano Anna Slobodova Centaur Technology Ana Sokolova University of Salzburg Daryl Stewart ARM Murali Talupur FormalSim Michael Tautschnig Queen Mary University of London Thomas Wahl Northeastern University Chao Wang University of Southern California Georg Weissenbacher TU Wien Florian Zuleger TU Wien FMCAD STEERING COMMITTEE Armin Biere, Johannes Kepler University in Linz, Austria Alan Hu, University of British Columbia, Canada Warren A. Hunt Jr., University of Texas at Austin, USA Vigyan Singhal, Oski Tech From tarmo at cs.ioc.ee Sat Jan 21 15:06:25 2017 From: tarmo at cs.ioc.ee (Tarmo Uustalu) Date: Sat, 21 Jan 2017 22:06:25 +0200 Subject: [TYPES/announce] ETAPS 2017 call for participation Message-ID: <20170121220625.3267d15b@cs.ioc.ee> ****************************************************************** CALL FOR PARTICIPATION ETAPS 2017 20th European Joint Conferences on Theory And Practice of Software ETAPS 2017 Uppsala, Sweden, 22-29 April 2017 http://www.etaps.org/2017 ****************************************************************** -- ABOUT ETAPS -- ETAPS is the primary European forum for academic and industrial researchers working on topics relating to software science. ETAPS, established in 1998, is a confederation of five main annual conferences, accompanied by satellite workshops. ETAPS 2017 is the twentieth event in the series. -- MAIN CONFERENCES (24-28 April) -- * ESOP: European Symposium on Programming (PC chair Hongseok Yang, University of Oxford, UK) * FASE: Fundamental Approaches to Software Engineering (PC chairs Marieke Huisman, Universiteit Twente, The Netherlands, and Julia Rubin, University of British Columbia, Canada) * FoSSaCS: Foundations of Software Science and Computation Structures (PC chairs Javier Esparza, Technische Universit?t M?nchen, Germany, Andrzej Murawski, University of Warwick, UK) * POST: Principles of Security and Trust (PC chairs Matteo Maffei, Universit?t des Saarlandes, Germany, Mark D. Ryan, University of Birmingham, UK) * TACAS: Tools and Algorithms for the Construction and Analysis of Systems (PC chairs Axel Legay, INRIA Rennes, France, and Tiziana Margaria, LERO, Ireland) TACAS '17 hosts the 6th Competition on Software Verification (SV-COMP). -- INVITED SPEAKERS -- * Unifying speakers: Michael Ernst (University of Washington, USA) Kim G. Larsen (Aalborg University, DK) * FoSSaCS invited speaker: Joel Ouaknine (University of Oxford, UK) * TACAS invited speaker: Dino Distefano (Facebook and Queen Mary University of London, UK) -- UNIFYING PUBLIC LECTURE Serge Abiteboul (DI, INRIA Paris & ENS Cachan, France) -- INVITED TUTORIALS V?ronique Cortier (LORIA, CRNS, France) Kenneth McMillan (Microsoft Research Redmond, USA) -- CONTRIBUTED PAPERS -- See the accepted paper lists at the conference website. -- SATELLITE EVENTS (22-23 April, 29 April) -- 17 satellite workshops and other events will take place before or after ETAPS 2017. Check their calls for papers and consider contributing! DICE-FOPARA, GaLoP, GaM, SynCop-PV, VerifyThis (22-23 April) FESCA, SNR (22 April) HotSpot, MBT, QAPL, SannellaFest (23 April) BX, CREST, LiVe, MARS, PLACES, VPT (29 April) -- REGISTRATION -- Early registration is until Sunday, 12 March 2017 (23:59 GMT+1). http://www.etaps.org/2017/registration -- ACCOMMODATION -- The organizers have negotiated special rates from several hotels in Uppsala. To benefit from those, follow the instructions on the conference website. The offers expire on different dates. -- HOST CITY -- Uppsala city holds a rich history, having for long periods been the political, religious and academic centre of Sweden. Uppsala University is over 500 years old and ranked among the top 100 in the World and has hosted many great scientists over the years, for instance Carl von Linn?, Anders Celsius and Anders Jonas ?ngstr?m. The proximity to the capital of Sweden, Stockholm, provides additional benefits as a potential site for arranging both pre- and post congress tours, as well as for excursions or tourism. -- HOST INSTITUTION -- ETAPS 2017 is hosted by the Department of Information Technology, Uppsala University. -- ORGANIZERS Parosh Abdulla (General chair), Mohamed Faouzi Atig, Andreina Francisco, Kaj Lampka, Philipp R?mmer, Konstantinos Sagonas, Bj?rn Victor, Wang Yi, Tjark Weber, Yunyun Zhu From bogom.s at gmail.com Sun Jan 22 19:45:55 2017 From: bogom.s at gmail.com (Sergiy Bogomolov) Date: Mon, 23 Jan 2017 11:45:55 +1100 Subject: [TYPES/announce] 2nd CfP: Workshop SNR affiliated with ETAPS 2017 Message-ID: <000001d27512$11102ea0$33308be0$@gmail.com> CALL FOR PAPERS SNR 2017 ======== 3rd International Workshop on Symbolic and Numerical Methods for Reachability Analysis April 22, 2017, Uppsala, Sweden Affiliated with ETAPS 2017 http://snr2017.pages.ist.ac.at/ Important Dates =============== Abstract submission: January 27, 2017 Paper submission: February 3, 2017 Notification: March 10, 2017 Final version: March 24, 2017 Workshop date: April 22, 2017 Scope ===== Hybrid systems are complex dynamical systems that combine discrete and continuous components. Reachability questions, regarding whether a system can run into a certain subset of its state space, stand at the core of verification and synthesis problems for hybrid systems. There are several successful methods for hybrid systems reachability analysis. Some methods explicitly construct flow-pipes that over-approximate the set of reachable states over time, where efficient computation of such over-approximations requires symbolic representations such as support functions. Other methods based on satisfiability checking technologies, symbolically encode reachability properties as logical formulas, while solving such formulas requires numerically-driven decision procedures. Last but not least, also automated deduction and the usage of theorem provers led to efficient analysis approaches. The goal of this workshop is to bring together researchers working with different reachability analysis techniques and to seek for synergies between the different approaches. The SNR workshop solicits papers broadly in the area of analysis and synthesis of continuous and hybrid systems. The scope of the workshop includes, but is not restricted to, the following topics with application to continuous and hybrid systems: - Reachability analysis - Flow-pipe construction; symbolic state set representations - Logical frameworks for reasoning - Bounded model checking - Automated deduction - Invariant generation - Symbolic execution - Trajectory generation; counterexample computation - Abstraction techniques - Reliable integration - Simulation - Reachability analysis for planning and synthesis - Domain-specific approaches in biology, robotics, etc. - Stochastic/probabilistic hybrid systems Submission Information ====================== The workshop solicits - long research papers (not exceeding 15 pages excluding references), - short research papers (not exceeding 6 pages excluding references) and - work-in-progress papers (not exceeding 6 pages excluding references). Research papers must present original unpublished work which is not submitted elsewhere. In order to foster the exchange of ideas, we also encourage work-in-progress papers, which present recent or on-going work. The papers should be written in English and formatted according to the EPTCS guidelines (http://style.eptcs.org/). Papers can be submitted using the EasyChair system: https://easychair.org/conferences/?conf=snr2017 All submissions will undergo a peer-reviewing process. Accepted research papers will be presented at the workshop and published in the Electronic Proceedings in Theoretical Computer Science (EPTCS, http://www.eptcs.org/). Accepted work-in-progress papers will be presented at the workshop but will not be included in the proceedings. Invited Speakers ================ TBA Workshop Co-Chairs ================== Erika Abraham (RWTH Aachen University, Germany) Sergiy Bogomolov (Australian National University, Australia) Publicity Chair =============== Przemyslaw Daca (Institute of Science and Technology Austria, Austria) Program Committee ================= Matthias Althoff (Technische Universitaet Muenchen, Germany) Stanley Bak (United States Air Force Research Lab, USA) Franck Cassez (Macquarie University, Australia) Xin Chen (University of Colorado at Boulder, USA) Thao Dang (CNRS/VERIMAG, France) Martin Fraenzle (University of Oldenburg, Germany) Goran Frehse (Verimag, France) Antoine Girard (L2S, CNRS, France) Thomas Heinz (Robert Bosch GmbH, Germany) Hui Kong (Institute of Science and Technology Austria, Austria) Oleksandr Letychevskyi (Glushkov Institute of Cybernetics, Ukraine) Nikolaj Nikitchenko (Kyiv National Taras Shevchenko University, Ukraine) Maria Prandini (Politecnico di Milano, Italy) Stefan Ratschan (Academy of Sciences, Czech Republic) Rajarshi Ray (National Institute of Technology Meghalaya, India) Stavros Tripakis (Aalto University, Finland, and UC Berkeley, USA) Vladimir Ulyantsev (ITMO University, Russia) Edmund Widl (Austrian Institute of Technology, Austria) Paolo Zuliani (University of Newcastle, UK) -------------- next part -------------- An HTML attachment was scrubbed... URL: From bogom.s at gmail.com Sun Jan 22 21:28:55 2017 From: bogom.s at gmail.com (Sergiy Bogomolov) Date: Mon, 23 Jan 2017 13:28:55 +1100 Subject: [TYPES/announce] CfP: 4th International Workshop on Applied Verification for Continuous and Hybrid Systems (CPSWeek 2017) Message-ID: <0f4501d27520$759a85b0$60cf9110$@gmail.com> Call for Submissions ----------------------------------------------------------------------- 4th International Workshop on Applied Verification for Continuous and Hybrid Systems CMU campus alongside CPSWeek, Pittsburgh, USA, April 17, 2017 http://cps-vo.org/group/ARCH The workshop on applied verification for continuous and hybrid systems (ARCH) brings together researchers and practitioners, and establishes a curated set of benchmarks submitted by academia and industry. Verification of continuous and hybrid systems is increasing in importance due to new cyber-physical systems that are safety- or operation-critical. This workshop addresses verification techniques for continuous and hybrid systems with a special focus on the transfer from theory to practice. Topics include, but are not limited to - Proposals for new benchmark problems (not necessarily yet solvable) - Tool presentations - Tool executions and evaluations based on ARCH benchmarks - Experience reports including open issues for industrial success - Reports on results of our friendly competition Submission Guidelines ----------------------------------------------------------------------- Submissions consist of papers of ideally 3-8 pages (pdf ) and optional files (e.g. models or traces) submitted through the ARCH?17 EasyChair web site (http://www.easychair.org/conferences/?conf=arch17). Authors have to use the EasyChair template (http://www.easychair.org/publications/for_authors).The extended abstract should be classified in its title as benchmark proposal, tool presentation, benchmark results, or experience report. Submissions receive at least 3 anonymous reviews, including one from industry and one from academia. Details on the evaluation criteria can be found at http://cps-vo.org/group/ARCH/CallForSubmissions. Submission deadline: February 15, 2017 Notification: March 7, 2017 Final Version: March 31, 2017 Workshop: April 17, 2017 (different from other CPS Week workshops; this year free of charge!) Website: http://cps-vo.org/group/ARCH (includes forums, archive, wiki, etc.) Prize ----------------------------------------------------------------------- The paper with the most promising benchmark results receives a prize of 500 Euros sponsored by Robert Bosch GmbH, Germany. The winner is preselected by the program committee and determined by an audience voting. Organizers ----------------------------------------------------------------------- Program chairs: Matthias Althoff, Technische Universit?t M?nchen, Germany Goran Frehse, UJF-Verimag, France Local chair: Sebastian Scherer, Carnegie Mellon University, USA Publicity chair: Sergiy Bogomolov, Australian National University, Australia Evaluation chair: Taylor T. Johnson, Vanderbilt University, USA Program Committee (tentative) ----------------------------------------------------------------------- Academia: Pieter Collins (Maastricht Univ.) Alexandre Donze (UC Berkeley) Ian Mitchell (Univ. British Colombia) Sayan Mitra (UI Urbana Champaign) Andre Platzer (CarnegieMellon Univ.) Nacim Ramdani (Universit? d?Orl?ans) Aditya Zutshi (Duke University) Xin Chen (RWTH Aachen University) Sicun Gao (Massachusetts Institute of Technology) Stanley Bak (Air Force Research Lab) Industry: Ajinkya Bhave (Siemens PLM) Jyotirmoy Deshmukh (Toyota) Luca Parolini (BMW) Alessandro Pinto (United Technologies) Matthias Woehrle (Bosch) William Hung (Synopsys Inc) Olivier Bouissou (MathWorks) Daniel Bryce (SIFT) Aaron Fifarek (Linquest) -------------- next part -------------- An HTML attachment was scrubbed... URL: From elaine at mat.ufmg.br Mon Jan 23 14:19:20 2017 From: elaine at mat.ufmg.br (Elaine Pimentel) Date: Mon, 23 Jan 2017 16:19:20 -0300 Subject: [TYPES/announce] ITP 2017 -- SECOND CALL FOR PAPERS Message-ID: *** Apologies for multiple copies, please redistribute *** SECOND CALL FOR PAPERS ITP 2017 8th International Conference on Interactive Theorem Proving Brasilia, Brazil September 26-29, 2017 http://itp2017.cic.unb.br SUBMISSION DEADLINES * April 3, 2017 (abstracts) * April 10, 2017 (full papers) GENERAL INFORMATION The ITP conference series is concerned with all topics related to interactive theorem proving, ranging from theoretical foundations to implementation aspects and applications in program verification, security, and formalization of mathematics. ITP is the evolution of the TPHOLs conference series to the broad field of interactive theorem proving. TPHOLs meetings took place every year from 1988 until 2009. The eighth ITP conference, ITP 2017, will be held at Universidade de Brasilia, September 26-29, 2017. SCOPE OF CONFERENCE ITP welcomes submissions describing original research on all aspects of interactive theorem proving and its applications. Suggested topics include but are not limited to the following: * formal aspects of hardware and software * formalizations of mathematics * improvements in theorem prover technology * user interfaces for interactive theorem provers * formalizations of computational models * verification of security algorithms * use of theorem provers in education * industrial applications of interactive theorem provers * concise and elegant worked examples of formalizations (proof pearls) PUBLICATION DETAILS The proceedings of the symposium will be published in the Springer's LNCS series. PAPER SUBMISSIONS All submissions must be original, unpublished, and not submitted concurrently for publication elsewhere. Furthermore, when appropriate, submissions are expected to be accompanied by verifiable evidence of a suitable implementation, such as the source files of a formalization for the proof assistant used. Submissions should be no more than 16 pages in length and are to be submitted in PDF via EasyChair at the following address: https://easychair.org/conferences/?conf=itp2017 Submissions must conform to the LNCS style in LaTeX. Authors of accepted papers are expected to present their paper at the conference and will be required to a sign copyright release form. In addition to regular papers, described above, there will be a rough diamond section. Rough diamond submissions are limited to 6 pages and may consist of an extended abstract. They will be refereed and be expected to present innovative and promising ideas, possibly in an early form and without supporting evidence. Accepted diamonds will be published in the main proceedings and will be presented as short talks. After the conference the authors of selected papers will be invited to submit revised papers for a special issue of the Journal of Automated Reasoning. IMPORTANT DATES Abstract submission deadline: April 3, 2017 Full paper submission deadline: April 10, 2017 Author notification: June 2, 2017 Camera-ready papers: June 30, 2017 Workshops & Tutorials: September 23-25, 2017 Conference: September 26-29, 2017 INVITED SPEAKERS Moa Johansson, Chalmers University of Technology, Sweden Leonardo de Moura, Microsoft Research Cezary Kaliszyk, Universitaet Innsbruck, Austria (joint with TABLEAUX and FroCos) Katalin Bimbo, University of Alberta, Canada (joint with TABLEAUX and FroCos) Jasmin Blanchette, Inria and LORIA, Nancy, France (joint with TABLEAUX and FroCos) WORKSHOPS AND TUTORIALS There will be a three-day programme of four workshops and four tutorials from 23-25 September. Workshops: 12th Logical and Semantic Frameworks with Applications (LSFA 2017) Sandra Alves, Renata Wassermann, Flavio L. C. de Moura 23 and 24 September 2017 Proof eXchange for Theorem Proving (PxTP) Catherine Dubois, Bruno Woltzenlogel Paleo 23 and 24 September 2017 EPS - Encyclopedia of Proof Systems Giselle Reis, Bruno Woltzenlogel Paleo 24 and 25 September 2017 DaLi - Dynamic Logic: new trends and applications Mario Benevides, Alexandre Madeira 24 September 2017 Tutorials: General methods in proof theory for modal and substructural logics Bjoern Lellmann, Revantha Ramanayake 23 September 2017 From proof systems to complexity bounds Anupam Das 24 September 2017 Proof Compressions and the conjecture NP =3D PSPACE Lew Gordeev, Edward Hermann Haeusler 25 September 2017 PVS for Computer Scientists Cesar Munoz, Mauricio Ayala-Rincon, Mariano Moscato 25 September 2017 Details will be published in separate calls and on the conference website. PROGRAM COMMITTEE CHAIRS Mauricio Ayala-Rincon, U. Brasilia Cesar Munoz, NASA PROGRAM COMMITTEE Maria Alpuente, T.U. Valencia Vander Alves, U. Brasilia June Andronick, Data61, CSIRO, UNSW Jeremy Avigad, Carnegie Mellon U. Sylvie Boldo, INRIA LRI Ana Bove, Chalmers & Gothenburg U. Adam Chlipala, MIT Gilles Dowek, INRIA, ENS Cachan Aaron Dutle, NASA Amy Felty, U. Ottawa Marcelo Frias, I.T. Buenos Aires Ruben Gamboa, U. Wyoming Herman Geuvers, Radboud U. Elsa Gunter, U. Illinois U.C. John Harrison, Intel Corporation Nao Hirokawa, JAIST Matt Kaufmann, U. Texas Austin Mark Lawford, McMaster U. Andreas Lochbihler, ETH Zurich Assia Mahboubi, INRIA Panagiotis Manolios, Northeastern U. Gopalan Nadathur, U. Minnesota Keiko Nakata, SAP Potsdam Adam Naumowicz, U. Bialystok Tobias Nipkow, T.U. Munich Scott Owens, U. Kent Sam Owre, SRI Lawrence Paulson, U. Cambridge Leila Ribeiro, U.F. Rio Grande do Sul Claudio Sacerdoti Coen, U. Bologna Augusto Sampaio, U.F. Pernambuco Monika Seisenberger, Swansea U. Christian Sternagel, U. Innsbruck Sofiene Tahar, Concordia U. Christian Urban, King's College London Josef Urban, Czech T.U. Prague CONTACT INFORMATION itp2017 at easychair.org http://itp2017.cic.unb.br -- Elaine. ------------------------------------------------- Elaine Pimentel - DMAT/UFRN Address: Departamento de Matem?tica Universidade Federal do Rio Grande do Norte Campus Universit?rio - Av. Senador Salgado Filho, s/n? Lagoa Nova, CEP: 59.078-970 - Natal - RN Phone: +55 84 3215-3820 <(84)%203215-3820> http://sites.google.com/site/elainepimentel/ Lattes: http://lattes.cnpq.br/3298246411086415 -------------------------------------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: From dreyer at mpi-sws.org Tue Jan 24 07:34:31 2017 From: dreyer at mpi-sws.org (Derek Dreyer) Date: Tue, 24 Jan 2017 13:34:31 +0100 Subject: [TYPES/announce] Cornell, Maryland, Max Planck Pre-doctoral Research School 2017: Call for applications Message-ID: The Cornell, Maryland, Max Planck Pre-doctoral Research School 2017: "Software Systems, Social Systems, Security and Privacy" http://cmmrs.mpi-sws.org August 8-13, 2017 Saarbruecken, Germany Applications are requested from undergraduate students or Master's students in computer science, computer engineering, or a related discipline to The Cornell, Maryland, Max Planck Pre-doctoral Research School. The first of this new annual series of week-long schools will focus on security and privacy, social systems, distributed systems, machine learning, programming languages, and verification. Leading researchers will engage with attendees in their areas of expertise. The curriculum will include lectures, projects, and interaction with faculty from participating institutions. The small, selected group of attendees will be exposed to state-of-the-art research in computer science, have the opportunity to interact one-on-one with internationally leading scientists from three of the foremost academic institutions in research and higher learning in the US and in Europe, and network with like-minded students. They will get a sense of what it is like to pursue an academic or industrial research career in computer science and have a head start when applying for graduate school. The confirmed speakers include: Lorenzo Alvisi, Hal Daum? III, Derek Dreyer, Krishna Gummadi, Mike Hicks, and Vitaly Shmatikov. For full consideration, applications should be received by February 7, 2017. Travel and accommodation will be covered for accepted students. Further information about the school and how to apply can be found at http://cmmrs.mpi-sws.org. From tobias.grosser at inf.ethz.ch Tue Jan 24 04:33:21 2017 From: tobias.grosser at inf.ethz.ch (Tobias Grosser) Date: Tue, 24 Jan 2017 10:33:21 +0100 Subject: [TYPES/announce] PLDI workshop and proposal deadline Message-ID: <1485250401.1979527.857599080.60973723@webmail.messagingengine.com> Reminder! The final deadline for PLDI W&T proposals is coming up on January 30. Please see the PLDI website for more information. http://conf.researchr.org/track/pldi-2017/pldi-2017-workshops-and-tutorials. Tobias Grosser PLDI Publicity Chair From wasowski at itu.dk Tue Jan 24 05:07:36 2017 From: wasowski at itu.dk (Andrzej Wasowski) Date: Tue, 24 Jan 2017 10:07:36 +0000 Subject: [TYPES/announce] Assistant Professor Position in the H2020 ROSIN Project Message-ID: Context: This position is in applied program analysis, and requires prerequisites in building program analysis tools, and programming language semantics (which obviously includes types). In this sense, some audience of the Types mailing list may find it relevant. *** Assistant Professor Position in the H2020 ROSIN Project IT University of Copenhagen, Denmark https://candidate.hr-manager.net/ApplicationInit.aspx?cid=119&ProjectId=180826&MediaId=5 *** The IT University of Copenhagen invites applications for an Assistant Professor position in the area of code scanning and program analysis. The proposed starting date is 15 March 2017 or soon thereafter. Job description An up to 46 months Assistant Professor position within code scanning and program analysis is available at the Computer Science Department at the IT University of Copenhagen. This post-doc takes place within the context of the European H2020 ICT Project ROSIN. The position includes an up to 20% teaching load. Robot technology is foreseen to have profound impact on society in the not too distant future. Today, many robots are programmed using the open-source Robotics Operating System (ROS, http://www.ros.org/) framework. However, at present no automatic analysis or code scanning tools are used for open-source robotic components, and specifically none are yet integrated into ROS?s development process. This post-doc position is aimed at changing this. The idea is to develop code scanning and program analysis techniques and apply existing scanning and analysis technologies to key components of the ROS infrastructure. In the project there is both space for applying and appropriating QA technologies for ROS and for developing own tools. However, it is of key importance that the tools and solutions can be adopted by practitioners. The research activities of the Assistant Professor will focus on the development and/or usage of code scanning techniques and technologies, the application of and evaluation of code scanning to key components of the ROS infrastructure, and on automated unit test generation. Also, the candidate will engage in reaching out to the ROS community to learn about what kind of analyses are needed and would be most effective for robotics developers. Moreover, the candidate will disseminate key insights. The successful candidate is expected to hold a Ph.D. in computer science or similar and the preferred candidate has experience with: - code scanning, bug finding, or program analysis techniques - usage of code scanning or program analysis technology - It is considered an advantage to have experience in: designing and executing controlled experiments software testing robotics programming, mechatronics General information The IT University of Copenhagen (ITU) is a teaching and research-based tertiary institution concerned with information technology (IT) and the opportunities it offers. The IT University has more than 70 full-time academics. Research and teaching in information technology span all academic activities which involve computers including computer science, information and media sciences, humanities and social sciences, business impact and the commercialisation of IT. Questions about the positions can be directed to Associate Professor Claus Brabrand, IT University of Copenhagen, brabrand at itu.dk or tel. 7218 5076 and Professor Andrzej Wasowski, IT University of Copenhagen, wasowski at itu.dk or tel. 7218 5086. The Assistant Professorship is a temporary position for up to 4 years with the possibility of extension. The position requires academic qualifications at PhD level. Salary Appointment and salary will be in accordance with the Ministry of Finance?s agreement with the Danish Confederation of Professional Associations (AC). Application The application must be in English and must include: - A motivated application, including a cogent argument for how qualified you are for the position and brief statements of research and teaching plans - A full CV, including name, address, phone number, e-mail, previous and present employment and academic background - Documentation of academic degrees (copy of degree certificates etc.) - Copies of 3-5 publications relevant to the position. - A numbered list of publications. The enclosed publications should be marked with an asterisk (*) - Documentation of pedagogical experience and teaching record within one or more of the teaching areas listed for the position The applicant will be assessed according to the Appointment Order from the Ministry of Science, Technology and Innovation of 25 April 2008. The IT University may use shortlisting in connection to the recruitment process. In case of shortlisting, the Head of Department selects applicants for assessment on the advice of the hiring committee after the application deadline. All applicants are notified whether their application has been passed for assessment. The shortlisting of candidates for assessment is based on the criteria in the job posting. Application procedure You can only apply for this position through our e-recruitment system. Apply by pushing the button "Apply for position" in the job announcement on our website: http://en.itu.dk/About-ITU/Vacancies The IT University uses tests in connection with the recruitment process. Application deadline: 19 February, at 23:59 CET. Applications received after the application deadline will not be taken into consideration. If you submit an application, it is your responsibility to ensure that it arrives before the deadline, so please allow sufficient time for upload of publications and other documents. The IT University invites all qualified researchers regardless of age, gender, religious affiliation or ethnic background to apply for the positions. -- prof. Andrzej W?sowski, PhD, http://www.itu.dk/~wasowski IT University, Langgaards Vej 7, 2300 Copenhagen, Denmark Room: 4D05, phone: +45 7218 5086, skype: wasowski_andrzej From serge.autexier at dfki.de Tue Jan 24 05:27:36 2017 From: serge.autexier at dfki.de (Serge Autexier) Date: Tue, 24 Jan 2017 11:27:36 +0100 (CET) Subject: [TYPES/announce] First Call for Papers - 10th Conference on Intelligent Computer Mathematics - CICM 2017 - Abstract Submission Deadline 15. March 2017 Message-ID: <20170124102736.E9185E9209C@mbp-autexier.informatik.uni-bremen.de> Call for Papers 10th Conference on Intelligent Computer Mathematics - CICM 2017 - July 17-21, 2016 University of Edinburgh, Scotland http://www.cicm-conference.org/2017 ---------------------------------------------------------------------- Digital and computational solutions are becoming the prevalent means for the generation, communication, processing, storage and curation of mathematical information. Separate communities have developed to investigate and build computer based systems for computer algebra, automated deduction, and mathematical publishing as well as novel user interfaces. While all of these systems excel in their own right, their integration can lead to synergies offering significant added value. The Conference on Intelligent Computer Mathematics (CICM) offers a venue for discussing and developing solutions to the great challenges posed by the integration of these diverse areas. CICM has been held annually as a joint meeting since 2008, co-locating related conferences and workshops to advance work in these subjects. Previous meetings have been held in Birmingham (UK 2008), Grand Bend (Canada 2009), Paris (France 2010), Bertinoro (Italy 2011), Bremen (Germany 2012), Bath (UK 2013), Coimbra (Portugal 2014), Washington DC (USA 2015) and Bialystok (Poland 2016). This is a call for papers for CICM 2017, which will be held in Edinburgh, Scotland, July 17-21, 2016. CICM 2017 also invites work-in- progress papers. The principal tracks of the conference will be: * Track: Calculemus (chair: Matthew England) All topics in the intersection of computer algebra systems and automated reasoning systems including: - Automated theorem proving in computer algebra systems. - Computer algebra and symbolic computation in theorem proving systems. - Theory, design and implementation of interdisciplinary systems for computer mathematics. - Case studies and applications that involve a mix of computation and reasoning. - Case studies in formalization of mathematical theories that include non-trivial computations. - Representation of mathematics in computer algebra systems. - Input languages, programming languages, types and constraint languages, and modeling languages for mathematical assistant systems. * Track: Digital Mathematical Libraries (DML) (chair: Olaf Teschke) All topics related to the formation of a Global Digital Mathematics Library (GDML) network, ranging from experiences from existing DMLs, policies and standards facilitating interoperability, to development and integration of new techniques for content creation, preservation, enhancement and retrieval of the corpus, including: - DML creation and maintenance (content aggregation, validation, curation, enhancement). - DML architecture and representations (organization, workflows, policies, standards). - DML access and applications (retrieval, interfaces, interoperability). - DML collections and systems (experiences from various existing DMLs). * Track: Mathematical Knowledge Management (MKM) (chair: Florian Rabe) - Knowledge representation using, e.g., formal logics, computational systems, narrative document formats, or databases - Solutions to create, store, disseminate, discover, or manipulate mathematical knowledge - Corpora of knowledge inlcuding documents, theories, theorems, proofs, models, algorithms, exercises, or examples - Methods, systems, frameworks, case studies, challenges, benchmarks, or applications for mathematical knowledge - Comparisons, evaluations, or integrations of MKM solutions * Track: Systems & Projects (chair: Osman Hasan) - Systems: Stand-alone; plugins, libraries, or extensions of existing systems; or integrations of existing systems - Data: Formalizations; harvests or new processing of existing data; or case studies, test cases, or benchmark suites for systems - Projects: finished, ongoing or new - Survey papers * Track: Doctoral Programme (chair: TBD) The overall programme is organized by the General Program Chair Herman Geuvers. The local arrangements will be coordinated by Jacques Fleuriot. The publicity chair is Serge Autexier. We plan to have proceedings of the conference as in previous years with Springer Verlag as a volume in Lecture Notes in Artificial Intelligence (LNAI). *Important Dates* Conference submissions - Abstract submission deadline: 15. March 2017 - Submission deadline: 22. March 2017 - Reviews sent to authors: 26. April 2017 - Rebuttals due: 30. April 2017 - Notification of acceptance: 12. May 2017 - Camera ready copies due: 26. May 2017 - Conference: 17.-21. July 2017 Workshop Proposals - Submission deadline: 10. February 2017 - Notification of acceptance: 15. February 2017 More details on the conference are available from http://www.cicm-conference.org/2017 From viktor at mpi-sws.org Tue Jan 24 03:51:21 2017 From: viktor at mpi-sws.org (Viktor Vafeiadis) Date: Tue, 24 Jan 2017 09:51:21 +0100 Subject: [TYPES/announce] Open faculty position @ Lisbon, Portugal Message-ID: <3EED8BEB-B5A8-46BB-AA26-289E5C0F964F@mpi-sws.org> The Computer Science and Engineering Department of the Instituto Superior T?cnico of the Universidade de Lisboa is carrying out an open search process for possible candidates to future openings for faculty career positions. This open search is targeted at possible candidates who have an interest in enrolling at the base level of the university professional career, in all scientific areas of the Department, namely: ? Architecture and Operating Systems. ? Computer Graphics and Multimedia. ? Artificial Intelligence. ? Programming Methodology and Technology. ? Information Systems. Possible candidates should send to the email address cse-facultysearch at dei.tecnico.ulisboa.pt a zip file containing the following materials: ? Curriculum Vitae ? Teaching and research statement ? Contact (including email address) of three researchers or professionals from the area who can be contacted to provide reference letters, attesting to the scientific, pedagogical, and professional qualities of the possible candidate. These materials should preferably be sent by February 28, 2017, for being considered for the 2017 open search process. For any additional questions please contact the Department at dei at tecnico.ulisboa.pt. From discotec.publicity.chair at gmail.com Tue Jan 24 17:37:27 2017 From: discotec.publicity.chair at gmail.com (Ivan Lanese) Date: Tue, 24 Jan 2017 23:37:27 +0100 Subject: [TYPES/announce] DisCoTec 2nd CfP Message-ID: ************************************************************************ Call for Papers DisCoTec 2017 12th International Federated Conference on Distributed Computing Techniques http://2017.discotec.org Neuch?tel, Switzerland, 19-22 June 2017 ************************************************************************ The DisCoTec series of federated conferences is one of the major events sponsored by the International Federation for Information Processing (IFIP). The main conferences are: * COORDINATION * DAIS * FORTE This year IFIP offers some travel grants for students and an award for the best paper of DisCoTec. All conferences share the same deadlines: * Important Dates * - February 3, 2017: Submission of abstract - February 10, 2017: Submission of papers - April 10, 2017: Notification of acceptance - April 24, 2017: Final version - June 19-22, 2017: Conference and workshops * General Chair * Pascal Felber, University of Neuchatel, Switzerland * Organisation Chair * Valerio Schiavoni, University of Neuchatel, Switzerland * Publicity Chair * Ivan Lanese, University of Bologna/INRIA, Italy * Workshops Chair * Romain Rouvoy, University of Lille, France * Steering Board * Farhad Arbab (CWI, Amsterdam, Netherlands) Rocco De Nicola (IMT Lucca, Italy) Kurt Geihs (University of Kasel, Germany) Michele Loreti (University of Florence, Italy) Elie Najm (Telecom Paris Tech -- Chair) Rui Oliveira (University do Minho, Portugal) Jean-Bernard Stefani (INRIA Grenoble, France) Uwe Nestmann (TU Berlin, Germany) * Publication * Each paper will undergo a thorough process of review and the conference proceedings will be published by Springer-Verlag in the LNCS series. ************************************************************************ COORDINATION 2017 19th IFIP International Conference on Coordination Models and Languages ************************************************************************ * Scope * Modern information systems rely increasingly on combining concurrent, distributed, mobile, adaptive, reconfigurable and heterogeneous components. New models, architectures, languages and verification techniques are necessary to cope with the complexity induced by the demands of today's software development. Coordination languages have emerged as a successful approach, in that they provide abstractions that cleanly separate behaviour from communication, therefore increasing modularity, simplifying reasoning, and ultimately enhancing software development. Building on the success of the previous editions, this conference provides a well-established forum for the growing community of researchers interested in models, languages, architectures, and implementation techniques for coordination. Topics of interest encompass all areas of coordination, including (but not limited to) coordination related aspects of: - Theoretical models and foundations for coordination: component composition, concurrency, mobility, dynamic, spatial and probabilistic aspects of coordination, emergent behaviour, types, semantics; - Specification, refinement, and analysis of architectures: patterns and styles, verification of functional and non-functional properties, including performance aspects; - Coordination, architectural, and interface definition languages: implementation, interoperability, heterogeneity; - Middlewares and coordination; - Dynamic software architectures: distributed mobile code, configuration, reconfiguration, networked computing, parallel, high-performance and cloud computing; - Nature- and bio-inspired approaches to coordination; - Coordination of multiagent and collective systems: models, languages, infrastructures, self-adaptation, self-organisation, distributed solving, collective intelligence and emerging behaviour; - Coordination and modern distributed computing: Web services, peer-to-peer networks, grid computing, context-awareness, ubiquitous computing, mobile computing; - Programming languages, middleware, tools, and environments for the development of coordinated applications; - Programming methodologies and verification of coordinated applications; - Industrial relevance of coordination and software architectures: programming in the large, domain-specific software architectures and coordination models, case studies; - Interdisciplinary aspects of coordination. * Program Committee Chairs * - Jean-Marie Jacquet, University of Namur, Belgium - Mieke Massink, CNR-ISTI, Italy ************************************************************************ DAIS 2017 17th IFIP International Conference on Distributed Applications and Interoperable Systems ************************************************************************ * Scope * The DAIS conference series addresses all aspects of distributed applications, including their design, implementation and operation, the supporting middleware, appropriate software engineering methodologies and tools, as well as experimental studies and practice reports. This time we welcome particular contributions on architectures, models, technologies and platforms for large scale and complex distributed applications and services that are related to the latest trends towards bridging the physical/virtual worlds based on flexible and versatile service architectures and platforms. Submissions will be judged on their originality, significance, clarity, relevance, and technical correctness. The topics of interest to the conference include, but are not limited to: - Novel and innovative distributed applications and systems, particularly in areas of middleware, data store, cloud computing, edge and fog computing, big data systems, data center and internet-scale systems, social networking, cyber-physical systems, mobile computing, software-defined network (SDN), service-oriented computing, and peer-to-peer systems; - Novel architectures and mechanisms, particularly in areas of pub/sub systems, language-based approaches, overlay protocols, virtualization, resource allocation, blockchains, parallelization, and bio-inspired distributed computing; - System issues and design goals, including self-management, security and practical applications of cryptography, trust and privacy, cooperation incentives and fairness, fault-tolerance and dependability, scalability and elasticity, and tail-performance and energy-efficiency; - Engineering and tools, including model-driven engineering, domain-specific languages, design patterns and methods, profiling and learning, testing and validation, and distributed debugging. * Program Committee Chairs * - Lydia Y. Chen, IBM Research Zurich Lab, Switzerland - Hans P. Reiser, University of Passau, Germany ************************************************************************ FORTE 2017 37th IFIP International Conference on Formal Techniques for Distributed Objects, Components and Systems ************************************************************************ * Scope * FORTE 2017 is a forum for fundamental research on theory, models, tools, and applications for distributed systems. The conference solicits original contributions that advance the science and technologies for distributed systems, with special interest in the areas of: - Component- and model-based design - Object technology, modularity, software adaptation - Service-oriented, ubiquitous, pervasive, grid, cloud, and mobile computing systems - Software quality, reliability, availability, and safety; - Security, privacy, and trust in distributed systems; - Adaptive distributed systems, self-stabilization; - Self-healing/organizing; - Verification, validation, formal analysis, and testing of the above. Contributions that combine theory and practice and that exploit formal methods and theoretical foundations to present novel solutions to problems arising from the development of distributed systems are encouraged. FORTE covers distributed computing models and formal specification, testing and verification methods. The application domains include all kinds of application-level distributed systems, telecommunication services, Internet, embedded and real-time systems, as well as networking and communication security and reliability. Topics of interest include but are not limited to: - Languages and semantic foundations: new modeling and language concepts for distribution and concurrency, semantics for different types of languages, including programming languages, modeling languages, and domain-specific languages; real-time and probability aspects; - Formal methods and techniques: design, specification, analysis, verification, validation, testing and runtime verification of various types of distributed systems including communications and network protocols, service-oriented systems, adaptive distributed systems, cyber-physical systems and sensor networks; - Foundations of security: new principles for qualitative and quantitative security analysis of distributed systems, including formal models based on probabilistic concepts; - Applications of formal methods: applying formal methods and techniques for studying quality, reliability, availability, and safety of distributed systems; - Practical experience with formal methods: industrial applications, case studies and software tools for applying formal methods and description techniques to the development and analysis of real distributed systems. * Program Committee Chairs * - Ahmed Bouajjani, University Paris Diderot, France - Alexandra Silva, University College London, UK -------------- next part -------------- An HTML attachment was scrubbed... URL: From christian.retore at lirmm.fr Tue Jan 24 18:53:04 2017 From: christian.retore at lirmm.fr (Christian RETORE) Date: Wed, 25 Jan 2017 00:53:04 +0100 Subject: [TYPES/announce] call for papers: quantifiers and determiners (QUAD, ESSLLI 2017 Workshop) Message-ID: <2A1AEB90-4574-46F1-B509-29666F20A412@lirmm.fr> QUAD: QUantifiers And Determiners http://www.lirmm.fr/quad Toulouse, Monday July 17 --- Friday July 21: 17:00-18:30 As part of ESSLLI 2017 Christian Retor?, LIRMM & universit? de Montpellier, Mark Steedman, University of Edinburgh Schedule: deadline for submissions: 17 Mars 2017 submission website: https://easychair.org/conferences/?conf=quad2017 notification to authors: 15 April 2017 final version due: 19 May 2017 conference: 17-21 July 2017 Presentation: The compositional interpretation of determiners relies on quantifiers ? in a general acceptation of this later term which includes generalised quantifiers, generics, definite descriptions i.e. any operation that applies to one or several formulas with a free variable, binds it and yields a formula or possibly a generic term (the operator is then called a subnector, following Curry). There is a long history of quantification in the Ancient and Medieval times at the border between logic and philosophy of language, before the proper formalisation of quantification by Frege. A common solution for natural language semantics is the so-called theory of generalised quantifiers. Quantifiers like ? some, exactly two, at most three, the majority of, most of, few, many, ? ? are all described in terms of functions of two predicates viewed as subsets. Nevertheless, many mathematical and linguistic questions remain open. On the mathematical side, little is known about generalised , generalised and vague quantifiers, in particular about their proof theory. On the other hand, even for standard quantifiers, indefinites and definite descriptions, there exist alternative formulations with choice functions and generics or subnectors (Russell?s iota, Hilbert-Bernays, eta, epsilon, tau). The computational aspects of these logical frameworks are also worth studying, both for computational linguistic software and for the modelling of the cognitive processes involved in understanding or producing sentences involving quantifiers. On the linguistic side, the relation between the syntactic structure and its semantic interpretation, quantifier raising, underspecification, scope issues,? are not fully satisfactory. Furthermore extension of linguistic studies to various languages have shown how complex quantification is in natural language and its relation to phenomena like generics, plurals, and mass nouns. Finally, and this can be seen as a link between formal models of quantification and natural language, there by now exist psycholinguistic experiments that connect formal models and their computational properties to the actual way human do process sentences with quantifiers, and handle their inherent ambiguity, complexity, and difficulty in understanding. All those aspects are connected in the didactics of mathematics and computer science: there are specific difficulties to teach (and to learn) how to understand, manipulate, produce and prove quantified statements, and to determine the proper level of formalisation between bare logical formulas and written or spoken natural language. This workshop aims at gathering mathematicians, logicians, linguists, computer scientists to present their latest advances in the study of quantification. Among the topics that wil be addressed are the following : ? new ideas in quantification in mathematical logic, both model theory and proof theory: ? choice functions, ? subnectors (Russell?s iota, Hilbert?s epsilon and tau), ? higher order quantification, ? quantification in type theory ? studies of the lexical, syntactic and semantic of quantification in various languages ? semantics of noun phrases ? generic noun phrases ? semantics of plurals and mass nouns ? experimental study of quantification and generics ? computational applications of quantification and polarity especially for question-answering. ? quantification in the didactics of mathematics and computer science. Submissions: The program committee is looking for contributions introducing new viewpoints on quantification and determiners, the novelty being either in the mathematical logic framework or in the linguistic description or in the cognitive modelling. Submitting purely original work is not mandatory, but authors should clearly mention that the work is not original, and why they want to present it at this workshop (e.g. new viewpoint on already published results) Submissions should be - 12pt font (at least) - 1inch/2.5cm margins all around (at least) - less than 2 pages (references exluded) - with an abstract of less then 100 words and they should be submitted in PDF by easychair here: https://easychair.org/conferences/?conf=quad2017 In case the committee thinks it is more appropriate, some papers can be accepted as a poster with a lightning talk. Final versions of accepted papers may be slightly longer. They will be published on line. We also plan to publish postproceedings Programme committee: ? Christian Retor? (Universit? de Montpellier & LIRMM-CNRS) ? Mark Steedman (University of Edinburgh) ? Vito Michele Abrusci (Universit? di Roma tre) ? Mathias Baaz (University of Technology, Vienna) ? Daisukke Bekki (Ochanomizu University, Tokyo) ? Oliver Bott (Universit?t T?bingen) ? Francis Corblin (Universit? Paris Sorbonne) ? Martin Hakl (Massachusetts Institute of Technology, Cambridge MA) ? Makoto Kanazawa (National Institute of Informatics, Tokyo) ? Dan Lassiter (Stanford University) ? Zhaohui Luo (Royal Holloway College, London) ? Alda Mari (CNRS Institut Jean Nicod, Paris) ? Wilfried Meyer-Viol (King?s college, London) ? Michel Parigot (CNRS IRIF, Paris) ? Anna Szabolcsi (New-York University) ? Jakub Szymanik (Universiteit van Amsterdam) ? Dag Westerstahl (Stockholm University) ? Bruno Woltzenlogel Paleo (University of Technology, Vienna) ? Richard Zach (University of Calgary) ? Roberto Zamparelli (Universit? di Trento) http://www.lirmm.fr/quad ? Christian Retor? http://www.lirmm.fr/~retore ? Christian Retor? http://www.lirmm.fr/~retore ? Christian Retor? http://www.lirmm.fr/~retore From ayoub.nouri at univ-grenoble-alpes.fr Tue Jan 24 06:34:22 2017 From: ayoub.nouri at univ-grenoble-alpes.fr (Ayoub Nouri) Date: Tue, 24 Jan 2017 12:34:22 +0100 Subject: [TYPES/announce] MT-CPS'17: 2nd International Workshop on Monitoring and Testing of Cyber-Physical Systems Message-ID: MT-CPS'17 2nd International Workshop on Monitoring and Testing of Cyber-Physical Systems Pittsburgh, PA, USA 21st April 2017 Co-located with CPS Week https://sites.google.com/asu.edu/mt-cps-2017 DESCRIPTION Cyber-physical systems (CPS) are integrations of heterogeneous collaborative entities that interact between themselves and with their physical environment. CPS exhibit complex and unpredictable behaviors, thus making their correctness and robustness analysis a challenging task. In order to address their full complexity, there is an emergent need for formal, yet efficient and scalable methods for the verification and analysis of CPS. Light-weight verification techniques, such as monitoring and testing, achieve both rigor and efficiency by enabling the evaluation of systems according to the properties of their individual behaviours. The MT CPS workshop aims at bringing together researchers and practitioners interested in the problems of detecting, testing, measuring and extracting qualitative and quantitative properties from CPS behaviors. Topics of interest include (but are not limited to): ? Specification languages for monitoring and testing ? Runtime verification and monitoring ? Black-box and white-box testing ? Measuring and statistical information gathering ? Simulation-based verification and parameter synthesis ? Diagnostics, error localization and repair ? Combination of static and dynamic analyses ? Applications and case studies WORKSHOP FORMAT MT CPS workshop is intended to be a forum for exchanging the latest scientific trends between researchers and practitioners interested in the field of light-weight verification and analysis of CPS. As a consequence, the workshop will *NOT* have formal proceedings. We encourage submission of abstracts that address any of the aforementioned topics of interest and cover recently published results as well as work in progress. IMPORTANT DATES ? *Abstract submission deadline:* February 20, 2017 ? *Notification:* March 6, 2017 ? *Early registration:* March 10, 2017 ? *Workshop:* April 21, 2017 Program Chairs * Houssam Abbas , University of Pennsylvania * Jyotirmoy Deshmukh , Toyota Technical Center * Georgios Fainekos , Arizona State University * BaekGyu Kim , Toyota InfoTechnology Center Program Committee * Houssam Abbas , University of Pennsylvania, USA * Ezio Bartocci , Vienna University of Technology, Austria * Mauricio Castillo-Effen , General Electric * Thao Dang , VERIMAG, France * Jyotirmoy Deshmukh , Toyota Technical Center, USA * Georgios Fainekos , Arizona State University, USA * Sebastian Fischmeister , University of Waterloo, Canada * Ichiro Hasuo , University of Tokyo, Japan * BaekGyu Kim , Toyota InfoTechnology Center, USA * Oded Maler , VERIMAG, France * Konstantinos Mamouras , University of Pennsylvania, USA * Sajed Miremadi , Volvo Car Corporation * Sergio Mover , University of Colorado, USA * Dejan Nickovic , AIT Austrian Institute of Technology GmbH, Austria * Jens Oehlerking , Robert Bosch GmbH * Kristin Yvonne Rozier , Iowa State University, USA * Erik Seligman , Intel, USA * Oleg Sokolsky , University of Pennsylvania, USA * Vishnu Vithala , Boeing * Qiming Zhao, Denso SUBMISSION INSTRUCTIONS Abstracts are submitted via https://easychair.org/conferences/?conf=mtcps2 . Abstracts should be in PDF form, up to 2 pages in length with 1-inch margins and at least 10-point font size, and may contain up to two figures. Abstracts should list the full names, affiliations, and contact information of all authors, and the submission should indicate whether the abstract will be presented as a poster, orally, or both. Abstracts will be reviewed by the Program Committee. Those that are selected for oral and poster presentations will be distributed to workshop participants and posted on the workshop website. PC CHAIRS Houssam Abbas, University of Pennsylvania, USA Jyotirmoy Deshmukh, Toyota Technology Center, USA Georgios Fainekos, Arizona State University, USA BaekGyu Kim, Toyota InfoTechnology Center, USA -- Ayoub Nouri Postdoc researcher, Verimag 700, avenue centrale 38401 Saint Martin d?H?res France ----------------------------------- ayoub.nouri at univ-grenoble-alpes.fr -------------- next part -------------- An HTML attachment was scrubbed... URL: From james.cheney at gmail.com Wed Jan 25 08:57:38 2017 From: james.cheney at gmail.com (James Cheney) Date: Wed, 25 Jan 2017 13:57:38 +0000 Subject: [TYPES/announce] TaPP 2017 - Call for Papers Message-ID: 9th International Workshop on Theory and Practice of Provenance Call for Papers TaPP 2017 continues the tradition of providing a genuine workshop environment for discussing and developing new ideas and exploring connections between disciplines and between academic research on provenance and practical applications. TaPP will take place June 22-23, 2017 in Seattle, WA, USA on the University of Washington campus. We invite innovative and creative contributions, including papers outlining new challenges for provenance research, promising formal approaches to provenance, innovative use of provenance, experience-based insights, resourceful experiments, and visionary (and possibly risky) ideas. Proposals for tutorials, panel or group discussions, reports on early stage research, or any other activities that will create a successful workshop are encouraged. Topics of interest include, but are not limited to, the following: ? Provenance management system prototypes and commercial solutions ? Provenance analytics, querying, and reasoning about provenance ? Visualizing provenance information ? Performance aspects of provenance capture, storage, and analytics ? Standardization of provenance models and representations ? Security and privacy implications of provenance ? Applications of provenance in real life settings ? Human interaction with provenance ? Retroactive reconstruction of provenance ? Using provenance for evaluating data quality and trust in data ? Novel methods for capturing provenance ? Integrating provenance information ? Interoperability among provenance-aware systems ? Provenance discovery Important Dates: Abstract Registration Due: March 13, 2017 Paper submission deadline: March 20, 2017 Acceptance Notification: May 1, 2017 Camera-ready deadline: TBD (All deadlines are 23:59:59 UTC-11) Submission Instructions: ? Not published or under review elsewhere ? Formatted according to the ACM SIGPLAN two-column format ( http://www.sigplan.org/Resources/Author/ ) ? Typically 4 pages, and no longer than 8 pages. An extra 4 pages of supporting material may be submitted, but the reviewers will not be obliged to read them ? "Short papers" of 4 pages or less need not make an original research contribution and will be evaluated on the basis of originality, relevance, and contribution to the workshop ? Proposals for tutorials, demos, discussions or other activities should be submitted as short papers As in previous years, contributions to TaPP will be published online as open access; authors retain copyright to their submissions and full-length papers based on TaPP contributions may be submitted to other venues. Further instructions, including a link to the submission site, will be available shortly at http://batesa.web.engr.illinois.edu/tapp17/ Best regards, Bill Howe and Adam Bates TaPP 2017 Program Chairs -------------- next part -------------- An HTML attachment was scrubbed... URL: From dreyer at mpi-sws.org Thu Jan 26 17:48:47 2017 From: dreyer at mpi-sws.org (Derek Dreyer) Date: Thu, 26 Jan 2017 23:48:47 +0100 Subject: [TYPES/announce] Postdoc positions available for ERC "RustBelt" project on foundations of Rust Message-ID: I am pleased to announce the availability of 2 postdoc positions for the project "RustBelt: Logical Foundations for the Future of Safe Systems Programming", funded by a 2015 ERC Consolidator Grant. http://plv.mpi-sws.org/rustbelt This 5-year project concerns the development of rigorous formal foundations for the Rust programming language. The project summary appears below. Although the main high-level goal of the project is to build logical foundations for the Rust programming language, the project also serves to fund technical work on two other major research efforts that feed into the main goal: 1. The development of *Iris*, a simplifying and unifying framework for higher-order concurrent separation logic in Coq (see the Iris web page at http://iris-project.org/). 2. Our ongoing study of improved semantics and logics for relaxed memory models (see e.g. our work on GPS [OOPSLA'14, PLDI'15] and the "promising" semantics [POPL'17]). I am seeking exceptional candidates who are interested (and who preferably have a proven track record) in one or more of the following topics: - Rust - substructural/ownership type systems - verification of concurrent programs - weak/relaxed memory models - interactive theorem proving in Coq - compiler verification Successful applicants will join the Foundations of Programming group, led by me, at the Max Planck Institute for Software Systems (MPI-SWS) in Saarbruecken, Germany. Previous postdocs in the group have included Andreas Rossberg, Chung-Kil Hur, Neel Krishnaswami, Aaron Turon, and Jacques-Henri Jourdan. *Application deadline*: MARCH 1. If you are interested in joining the RustBelt team and want to learn more about the project, please contact me directly at dreyer at mpi-sws.org. To apply for a postdoc position, please submit a CV, research statement, and list of references to https://apply.mpi-sws.org. For further information, see the project web page at: http://plv.mpi-sws.org/rustbelt/ Best regards, Derek Dreyer ---------------- Summary of the RustBelt project proposal: A longstanding question in the design of programming languages is how to balance safety and control. C-like languages give programmers low-level control over resource management at the expense of safety, whereas Java-like languages give programmers safe high-level abstractions at the expense of control. Rust is a new language developed at Mozilla Research that marries together the low-level flexibility of modern C++ with a strong "ownership-based" type system guaranteeing type safety, memory safety, and data race freedom. As such, Rust has the potential to revolutionize systems programming, making it possible to build software systems that are safe by construction, without having to give up low-level control over performance. Unfortunately, none of Rust's safety claims have been formally investigated, and it is not at all clear that they hold. To rule out data races and other common programming errors, Rust's core type system prohibits the aliasing of mutable state, but this is too restrictive for implementing some low-level data structures. Consequently, Rust's standard libraries make widespread internal use of "unsafe" blocks, which enable them to opt out of the type system when necessary. The hope is that such "unsafe" code is properly encapsulated, so that Rust's language-level safety guarantees are preserved. But due to Rust's reliance on a weak memory model of concurrency, along with its bleeding-edge type system, verifying that Rust and its libraries are actually safe will require fundamental advances to the state of the art. In this project, we aim to equip Rust programmers with the first formal tools for verifying safe encapsulation of "unsafe" code. Any realistic languages targeting this domain in the future will encounter the same problem, so we expect our results to have lasting impact. To achieve this goal, we will build on recent breakthrough developments by the PI and collaborators in concurrent program logics and semantic models of type systems. From maffei at cs.uni-saarland.de Thu Jan 26 08:30:42 2017 From: maffei at cs.uni-saarland.de (Matteo Maffei) Date: Thu, 26 Jan 2017 14:30:42 +0100 Subject: [TYPES/announce] CSF 2017: Second Call for Papers Message-ID: <09826E6C-4990-4BB8-AF60-5EACABACDB8A@cs.uni-saarland.de> CSF 2017 Second Call for Papers 30th IEEE Computer Security Foundations Symposium http://csf2017.tecnico.ulisboa.pt/ August 22-25, 2017 Santa Barbara, California, USA Co-located with CRYPTO The Computer Security Foundations Symposium is an annual conference for researchers in computer security. CSF seeks papers on foundational aspects of computer security, such as formal security models, relationships between security properties and defenses, principled techniques and tools for design and analysis of security mechanisms, as well as their application to practice. While CSF welcomes submissions beyond the topics listed below, the main focus of CSF is foundational security: submissions that lack foundational aspects risk rejection. This year, CSF will use a light form of double-blind reviewing; see below. ***************************************************** KEYNOTE SPEAKERS Mart?n Abadi, Google C?dric Fournet, Microsoft Research Elaine Shi, Cornell University ***************************************************** TOPICS New results in computer security are welcome. We also encourage challenge/vision papers, which may describe open questions and raise fundamental concerns about security. Possible topics for all papers include, but are not limited to: access control, accountability, anonymity and privacy, authentication, computer-aided cryptography, data and system integrity, database security, decidability and complexity, distributed systems security, electronic voting, formal methods and verification, decision theory, hardware-based security, information flow, intrusion detection, language-based security, network security, data provenance, mobile security, security metrics, security protocols, software security, socio-technical security, trust management, usable security, web security. ***************************************************** SPECIAL SESSIONS This year, we strongly encourage papers in three foundational areas of research we would like to promote at CSF: PRIVACY (Chair: Paul Syverson). CSF 2017 will include a special session on privacy foundations and invites submissions on innovations in privacy theory or practice; definitions, models, and frameworks for both communications privacy and data privacy; principled analysis of deployed or proposed privacy protection mechanisms; and foundational aspects of theoretical or practical privacy technologies. SECURITY ECONOMICS (Chair: Yevgeniy Vorobeychik). There is an interplay between important system properties including privacy, security, efficiency, flexibility, and usability. Diverse systems balance these properties differently, and as such provide varied benefits (for users) for different costs (for builders and attackers). In short, securing systems is ultimately an economic question. CSF 2017 will include a special session on security economics, where we invite submissions on foundational work in this area. Topics include, but are not limited to, risk management and cyber-insurance, investments in information security, security metrics, decision and game theory for security, and cryptocurrencies. COMPUTER-AIDED CRYPTOGRAPHY (Chair: Peter Schwabe). Modern cryptography is built on firm theoretical foundations. However, cryptography proofs are often intricate and the gap from model to code is usually large, which opens the door to bugs and vulnerabilities. Computer-aided formal methods can provide assurance of the security of cryptographic protocols, primitives and their implementations in software and hardware. We invite submissions on foundational work in this area. Topics include, but are not limited to, verification of cryptographic protocols and primitives, verification of cryptographic software and hardware, tools to automate formal verification, and formal proofs of side-channel countermeasures. CSF 2017 is co-located with CRYPTO 2017, making this special session of interest to many attendees. These papers will be reviewed under the supervision of the special session chairs. They will be presented at the conference, and will appear in the CSF proceedings, without any distinction from the other papers. Proceedings, published by the IEEE Computer Society Press (pending approval), will be available at the symposium, and selected papers will be invited for submission to the Journal of Computer Security. ***************************************************** IMPORTANT DATES Papers due: February 17, 2017 Author response period: April 5-8, 2017 Notification: April 21, 2017 Final papers due: June 5, 2017 Symposium: August 22-25, 2017 ***************************************************** PROGRAM COMMITTEE Nataliia Bielova, Inria Jeremiah Blocki, Purdue University Stefano Calzavara, Universit? Ca' Foscari Venezia Kostas Chatzikokolakis, CNRS & ?cole Polytechnique Adam Chlipala, MIT Stephen Chong, Harvard University (Program Co-Chair) Mads Dam, KTH St?phanie Delaune, CNRS, IRISA Bill Harris, Georgia Institute of Technology Limin Jia, Carnegie Mellon University Aniket Kate, Purdue University Boris Koepf, IMDEA Software Institute (Program Co-Chair) Markulf Kohlweiss, Microsoft Research Ralf Kuesters, University of Trier Pasquale Malacaria, Queen Mary University of London Catherine Meadows, US Naval Research Laboratory Daniel Le M?tayer, Inria Carroll Morgan, University of New South Wales and Data61 Toby Murray, University of Melbourne and Data61 Peter Schwabe, Radboud University (Session chair, Computer-Aided Cryptography) Zhong Shao, Yale University Ben Smyth, Huawei Alley Stoughton Pierre-Yves Strub, ?cole Polytechnique Paul Syverson, Naval Research Laboratory (Session chair, Privacy) Peter Thiemann, University of Freiburg Yevgeniy Vorobeychik, Vanderbilt University (Session chair, Security Economics) ***************************************************** PAPER SUBMISSION INSTRUCTIONS Submitted papers must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal or a conference with published proceedings. Papers must be submitted using the two-column IEEE Proceedings style available for various document preparation systems at the IEEE Conference Publishing Services page. All papers should be at most 12 pages long, not counting bibliography and well-marked appendices. Committee members are not required to read appendices, and so the paper must be intelligible without them. Following the recent history of other top-quality conferences and symposia in security, CSF'17 will employ a light form of double-blind reviewing. To facilitate this, submitted papers must (a) omit any reference to the authors' names or the names of their institutions, and (b) reference the authors' own related work in the third person (e.g., not "We build on our previous work ..." but rather "We build on the work of ..."). Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult (e.g., important background references should not be omitted or anonymized). Please see the conference site for answers to frequently asked questions (FAQ) that address many common concerns. When in doubt, contact the program chairs. Papers failing to adhere to any of the instructions above will be rejected without consideration of their merits. Papers intended for one of the special sessions should select the "Privacy", "Security Economics", or "Computer-Aided Cryptography" option, as appropriate. At least one coauthor of each accepted paper is required to attend CSF to present the paper. Please see http://csf2017.tecnico.ulisboa.pt/ for a link to the submission website. ***************************************************** PC Chairs Boris Koepf, IMDEA Software Institute Stephen Chong, Harvard University General Chair Pedro Adao, University of Lisbon Publications Chair Deepak Garg, Max Planck Institute for Software Systems Publicity Chair Matteo Maffei, TU Vienna -------------- next part -------------- An HTML attachment was scrubbed... URL: From marina.lenisa at uniud.it Wed Jan 25 12:11:48 2017 From: marina.lenisa at uniud.it (Marina Lenisa) Date: Wed, 25 Jan 2017 17:11:48 +0000 Subject: [TYPES/announce] GaLoP 2017 Message-ID: Final Call for Papers __________________________________________________________ 12th Workshop on Games for Logic and Programming Languages (GaLoP 2017) Uppsala, Sweden, 22-23 April http://www.gamesemantics.org GaLoP is an annual international workshop on game-semantic models for logics and programming languages and their applications. This is an informal workshop that welcomes work in progress, overviews of more extensive work, programmatic or position papers and tutorials. GaLoP XII will be held in Uppsala, Sweden, on 22-23 April 2017 as a satellite workshop of ETAPS (http://www.etaps.org/). Areas of interest include: * Games and other interaction-based denotational and operational models; * Game-based program analysis and verification; * Logics for games and games for logics; * Algorithmic aspects of game semantics; * Categorical aspects of game semantics; * Programming languages and full abstraction; * Higher-order automata and Petri nets; * Geometry of interaction; * Ludics; * Epistemic game theory; * Logics of dependence and independence; * Computational linguistics; * Games and multi-valued logics. There will be no formal proceedings but the possibility of a special issue in a journal will be considered. (The 2005, 2008, 2011 and 2014 workshops led to special issues in Annals of Pure and Applied Logic.) // Submission Instructions // Please submit an abstract (up to one page, excluding bibliography) of your proposed talk on the EasyChair submission page below. Supplementary material may be submitted, and will be considered at the discretion of the PC. https://easychair.org/conferences/?conf=galop2017 // Important Dates // Submission: 30 January 2017 Notification: 20 February 2017 Workshop: 22-23 April 2017 // Tutorial // Lauri Hella // Invited talks // Andreas Blass Dan Ghica Erich Gr?del Martin Hyland (TBC) // Programme Committee // Dietmar Berwanger Esfandiar Haghverdi Juha Kontinen (Co-Chair) Jim Laird Marina Lenisa (Co-Chair) Pierre Lescanne Luke Ong Jouko V??n?nen __________________________________ -------------- next part -------------- An HTML attachment was scrubbed... URL: From n.yoshida at imperial.ac.uk Fri Jan 27 04:54:32 2017 From: n.yoshida at imperial.ac.uk (Yoshida, Nobuko) Date: Fri, 27 Jan 2017 09:54:32 +0000 Subject: [TYPES/announce] A Postdoc position in Imperial College London Message-ID: Department of Computing, Imperial College London Research Associate (Post-doc, Full Time) ?36,070 to ?43,350 per annum Fixed-term: the starting date: as soon as possible the ending date: 19 May 2020 Professor Nobuko Yoshida, Imperial College London A post is funded by EPSRC, the UK science funding agency and the titles of the projects are "From Data Types to Session Types: A Basis for Concurrency and Distribution" and "Application Customisation: Enhancing Design Quality and Developer Productivity". The goal is to further develop the theory and practice of session types for structuring concurrent and distributed software. The project has particular emphasis on putting theory into practice, by embedding session types in a range of programming languages and applying them to case studies; or developing the links between session types and other areas of theoretical computer science. The research programme includes collaboration with several companies and organisations: Amazon, Cognizant, Red Hat, ThoughtWorks, as well as November Group LLC and Weaveworks. The focus of Imperial College London Group is theories and applications of (Multiparty) Session Types (JACM,POPL'08), which include: -- Erlang (CC'17), Go (CC'16,POPL'17), Haskell (POPL'16), Scala (ECOOP'16), Java (FASE'16,FASE'17), MPI (OOPSLA'15,CC'15), C (FPL'16) and Python (FOAC,LMCS,FMSD); or -- automata/model checking (POPL'15,CONCUR'15,TACAS'16,FoSSaCs'17), linear logic (CONCUR'15) and bisimulations (CONCUR'15,ESOP'16,LMCS) For more details, see http://mrg.doc.ic.ac.uk Candidates for the post-doc position will need to have expertise in either: 1. programming language design and implementation; or 2. formal semantics, type theory and concurrency theory Different positions will be suitable for different points on the theory/practice spectrum. We will be especially interested in candidates with a combination of theoretical and practical skills. The contact person is Professor Nobuko Yoshida, Imperial College London (N.Yoshida at imperial.ac.uk) Details: http://www.jobs.ac.uk/job/AWU532/research-associate -------------- next part -------------- An HTML attachment was scrubbed... URL: From aleks.nanevski at imdea.org Fri Jan 27 08:11:04 2017 From: aleks.nanevski at imdea.org (Aleksandar Nanevski) Date: Fri, 27 Jan 2017 14:11:04 +0100 Subject: [TYPES/announce] Multiple Research Positions, ERC MATHADOR Project, IMDEA, Software Institute, Madrid, Spain Message-ID: Applications are invited for multiple positions (PhD/Postdoc/Scientific Programmer) at the IMDEA Software Institute, Madrid, Spain. The positions are available from April 2017. The successful candidate will work under the supervision of Aleks Nanevski (http://software.imdea.org/~aleks/). The topic of the research, to be determined based on the common interests of the candidate and the supervisor, will be in the areas of software verification, logics for concurrent programs, and language-based security. The research will be funded by Aleks' ERC Consolidator award "MATHADOR: Type and Proof Structures for Concurrent Software Verification", which aims to investigate the type-theoretic foundations for verification of concurrent software. PhD candidates should have an excellent MSc or BSc degree in computer science or a related subject, with an interest in the above areas, and a strong commitment to research. An MSc or a BSc thesis is a plus. PhD positions are for four years. Postdoc candidates should have, or expect shortly to obtain, a PhD in computer science. The ideal candidate will have expertise in program semantics and program logics, concurrent or distributed computing, type theory or interactive theorem proving, as they apply to the above areas. Postdoc positions are initially for one year, with possible extension up to three years. Scientific programmer candidates should hold a BSc or MSc degree in computer science, with experience in and passion for functional programming, and strong interest and willingness to learn interactive theorem proving (eg., Coq). The scientific programmer position is initially for one year, with possible extension up to five years. All positions require good teamwork and communication skills, including excellent spoken and written English. Salaries at IMDEA Software Institute are internationally competitive. Interested applicants are encouraged to contact Aleks directly (aleks dot nanevski at imdea dot org). Formal applications should be submitted online at https://careers.imdea.org/software/ and mention this announcement in the submitted materials. (For the scientific programmer position, please select the "Research Engineer" option). Review of applications will begin immediately. From elaine at mat.ufmg.br Fri Jan 27 04:52:47 2017 From: elaine at mat.ufmg.br (Elaine Pimentel) Date: Fri, 27 Jan 2017 06:52:47 -0300 Subject: [TYPES/announce] FroCoS 2017 - Second Call for Papers Message-ID: *** Apologies for multiple copies, please redistribute *** SECOND CALL FOR PAPERS FroCoS 2017 11th International Symposium on Frontiers of Combining Systems Brasilia, Brazil September 25-29th, 2017 http://frocos2017.cic.unb.br Submission Deadlines: 24th April 2017 (abstracts) 28th April 2017 (full papers) GENERAL INFORMATION The 11th International Symposium on Frontiers of Combining Systems (FroCoS 2017) will be held in Brasilia, Brazil, between September 25 to September 29, 2017. Its main goal is to disseminate and promote progress in research areas related to the development of techniques for the integration, combination, and modularization of formal systems together with their analysis. FroCoS 2017 will be co-located with the 26th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2017) and the 8th International Conference on Interactive Theorem Proving (ITP 2017). The local organization of all events will be organised by Claudia Nalon (USB, Brazil), Daniele Nantes (UnB, Brazil), Elaine Pimentel (UFRN, Brazil) and Joao Marcos (UFRN, Brazil). SCOPE OF CONFERENCE In various areas of computer science, such as logic, computation, program development and verification, artificial intelligence, knowledge representation, and automated reasoning, there is an obvious need for using specialized formalisms and inference systems for selected tasks. To be usable in practice, these specialized systems must be combined with each other and integrated into general purpose systems. This has led---in many research areas---to the development of techniques and methods for the combination and integration of dedicated formal systems, as well as for their modularization and analysis. The International Symposium on Frontiers of Combining Systems (FroCoS) traditionally focusses on these types of research questions and activities. Like its predecessors, FroCoS 2017 seeks to offer a common forum for research in the general area of combination, modularization, and integration of systems, with emphasis on logic-based ones, and of their practical use. Typical topics of interest include (but are not limited to): * combinations of logics (such as higher-order, first-order, temporal, modal, description or other non-classical logics); * combination and integration methods in SAT and SMT solving; * combination of decision procedures, satisfiability procedures, constraint solving techniques, or logical frameworks; * combinations and modularity in ontologies; * integration of equational and other theories into deductive systems; * hybrid methods for deduction, resolution and constraint propagation; * hybrid systems in knowledge representation and natural language semantics; * combined logics for distributed and multi-agent systems; * logical aspects of combining and modularizing programs and specifications; * integration of data structures into constraint logic programming and deduction; * combinations and modularity in term rewriting; * applications of methods and techniques to the verification and analysis of information systems. INVITED SPEAKERS - Katalin Bimbo (University of Alberta, Canada) (joint with TABLEAUX and ITP) - Jasmin Blanchette (Inria and LORIA, Nancy, France) (joint with TABLEAUX and ITP) - Cezary Kaliszyk (University of Innsbruck, Austria) (joint with TABLEAUX and ITP) - Cesare Tinelli (University of Iowa, USA) - Renata Wassermann (University of Sao Paulo, Brazil) PUBLICATION DETAILS The proceedings of the symposium will be published in the Springer LNAI/LNCS series. PAPER SUBMISSIONS The program committee seeks high-quality submissions describing original work, written in English, not overlapping with published or simultaneously submitted work to a journal or conference with archival proceedings. Selection criteria include accuracy and originality of ideas, clarity and significance of results, and quality of presentation. The page limit in Springer LNCS style is 16 pages. Papers must be edited in LaTeX using the llncs style and must be submitted electronically as PDF files via the EasyChair system at the following address: https://easychair.org/conferences/?conf=frocos2017 For each accepted paper, at least one of the authors is required to attend the symposium and present the work. Prospective authors must register a title and an abstract five days before the paper submission deadline. Further information about paper submissions is available at the conference website that can be found at the beginning of this call for papers. WORKSHOPS AND TUTORIALS Proposals for Workshops and Tutorial sessions have been solicited in a separate call, which can be found at http://frocos2017.cic.unb.br/#cfw. IMPORTANT DATES 24th April 2017: Abstract submission deadline 28th April 2017: Full paper submission deadline 9th June 2017: Author notification 23rd June 2017: Camera-ready version due September 25-29, 2017: FroCoS Conference PROGRAM COMMITTEE Carlos Areces, FaMAF - Universidad Nacional de Cordoba Alessandro Artale, Free University of Bolzano-Bozen Mauricio Ayala-Rincon, Universidade de Brasilia Franz Baader, TU Dresden Peter Baumgartner, National ICT Australia Christoph Benzmueller, Freie Universitaet Berlin Thomas Bolander, Technical University of Denmark Marcelo Coniglio, State University of Campinas Clare Dixon, University of Liverpool [co-chair] Francois Fages, Inria Paris-Rocquencourt Marcelo Finger, Universidade de Sao Paulo [co-chair] Pascal Fontaine, LORIA, INRIA, University of Lorraine Didier Galmiche, LORIA, University of Lorraine Vijay Ganesh, University of Waterloo Silvio Ghilardi, Universita degli Studi di Milano Juergen Giesl, RWTH Aachen Laura Giordano, Universita del Piemonte Orientale Agi Kurucz, Kings College, London Till Mossakowski, Otto-von-Guericke-University Magdeburg Claudia Nalon, University of Brasilia Elaine Pimentel, Universidade Federal do Rio Grande do Norte Silvio Ranise, Fondazione Bruno Kessler-Irst Christophe Ringeissen, LORIA-INRIA Uli Sattler, University of Manchester Roberto Sebastiani, University of Trento Guillermo Simari, Universidad Nacional del Sur in Bahia Blanca Viorica Sofronie-Stokkermans, University Koblenz-Landau Andrzej Szalas, University of Warsaw Rene Thiemann, University of Innsbruck Ashish Tiwari, SRI International Christoph Weidenbach, Max Planck Institute for Informatics -- Elaine. ------------------------------------------------- Elaine Pimentel - DMAT/UFRN Address: Departamento de Matem?tica Universidade Federal do Rio Grande do Norte Campus Universit?rio - Av. Senador Salgado Filho, s/n? Lagoa Nova, CEP: 59.078-970 - Natal - RN Phone: +55 84 3215-3820 <(84)%203215-3820> http://sites.google.com/site/elainepimentel/ Lattes: http://lattes.cnpq.br/3298246411086415 -------------------------------------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: From Klaus.Havelund at jpl.nasa.gov Fri Jan 27 08:08:40 2017 From: Klaus.Havelund at jpl.nasa.gov (Havelund, Klaus (348B)) Date: Fri, 27 Jan 2017 13:08:40 +0000 Subject: [TYPES/announce] [fm-announcements] SPIN 2017 - final call for papers, deadline Feb 10 Message-ID: SPIN 2017 24th International Symposium on Model Checking of Software Santa Barbara, CA, USA, July 13-14, 2017 http://conf.researchr.org/home/spin-2017 Collocated with ISSTA ________________________________ The SPIN symposium aims at bringing together researchers and practitioners interested in automated tool-based techniques for the analysis of software as well as models of software, for the purpose of verification and validation. The symposium specifically focuses on concurrent software, but does not exclude analysis of sequential software. Submissions are solicited on theoretical results, novel algorithms, tool development, empirical evaluation, and education. History: The SPIN symposium originated as a workshop focusing on explicit state model checking, specifically as related to the Spin model checker. However, over the years it has evolved to a broadly scoped symposium for software analysis using any automated techniques, including model checking, automated theorem proving, and symbolic execution. An overview of the previous SPIN symposia (and early workshops) can be found at: http://spinroot.com/spin/symposia. SPIN 2017 will be organized as an ACM SIGSOFT event, collocated with the International Symposium on Software Testing and Analysis (ISSTA 2017): http://conf.researchr.org/home/issta-2017. The RERS Verification Challenge In addition there will be a one-day Rigorous Examination of Reactive Systems verification challenge Workshop (RERS 2017): http://www.rers-challenge.org/2017. ________________________________ SPIN 2017 Topics of interest include, but are not limited to: * Formal verification techniques for automated analysis of software * Formal analysis for modeling languages, such as UML/state charts * Formal specification languages, temporal logic, design-by-contract * Model checking * Automated theorem proving, including SAT and SMT * Verifying compilers * Abstraction and symbolic execution techniques * Static analysis and abstract interpretation * Combination of verification techniques * Modular and compositional verification techniques * Verification of timed and probabilistic systems * Automated testing using advanced analysis techniques * Combination of static and dynamic analyses * Derivation of specifications, test cases, or other useful material via formal analysis * Case studies of interesting systems or with interesting results * Engineering and implementation of software verification and analysis tools * Benchmark and comparative studies for formal verification and analysis tools * Formal methods education and training * Insightful surveys or historical accounts on topics of relevance to the symposium ________________________________ Keynote Speakers ________________________________ * Domagoj Babic, Google, Inc. * Byron Cook, Amazon Web Services * Gerard Holzmann, Nimble Research ________________________________ Submission Guidelines ________________________________ The contributions to SPIN 2017 will be published as ACM Proceedings, and should be submitted in the ACM Conference Format: https://www.acm.org/publications/proceedings-template. Submissions must be original and should not have been published previously or be under consideration for publication while being evaluated for this symposium. Authors are required to adhere to the ACM Policy and Procedures on Plagiarism and the ACM Policy on Prior Publication and Simultaneous Submissions. We are soliciting two categories of papers: * Full Research Papers describing fully developed work and complete results (10 pages); * Short Papers presenting tools, technology, experiences with lessons learned, new ideas, work in progress with preliminary results, and novel contributions to formal methods education (4 pages). Papers should be submitted via the EasyChair SPIN 2017 submission website: https://easychair.org/conferences/?conf=spin2017. Best Paper awards will be given and announced at the conference. A selection of papers will be invited to a special issue of the International Journal on Software Tools for Technology Transfer (STTT). ________________________________ Important Dates ________________________________ * Paper Submission: February 10, 2017 (23:59:59 Anywhere on Earth) * Author Notification: April 15, 2017 * Camera-Ready Paper: May 20, 2017 * Symposium: July 13-14, 2017 ________________________________ Organization ________________________________ * Hakan Erdogmus, Program Co-Chair, Carnegie Mellon University, USA * Klaus Havelund, Program Co-Chair, NASA/Caltech Jet Propulsion Laboratory, USA * Corina Pasareanu, Awards Chair, NASA Ames Research Center, USA * Yli?s Falcone, Publicity Chair, Univ. Grenoble Alpes, Inria, France ________________________________ Program Committee ________________________________ * Erika Abraham, RWTH Aachen University, Germany * Christel Baier, Technical University of Dresden, Germany * Tom Ball, Microsoft Research, USA * Ezio Bartocci, Vienna University of Technology, Austria * Dirk Beyer, Ludwig-Maximilians-Universit?t M?nchen (LMU Munich), Germany * Armin Biere, Johannes Kepler University, Austria * Dragan Bosnacki, Eindhoven University of Technology, Netherlands * Zmago Brezocnik, University of Maribor, Slovenia * Sagar Chaki, Software Engineering Institute CMU, USA * Alessandro Cimatti, Fondazione Bruno Kessler, Italy * Lucas Cordeiro, University of Oxford, UK * Patrice Godefroid, Microsoft Research, USA * Susanne Graf, VERIMAG Laboratory, France * Radu Grosu, Vienna University of Technology, Austria * Arie Gurfinkel, University of Waterloo, USA * Gerard Holzmann, NASA/Caltech Jet Propulsion Laboratory, USA * Rajeev Joshi, NASA/Caltech Jet Propulsion Laboratory, USA * Sarfraz Khurshid, The University of Texas at Austin, USA * Kim Larsen, Aalborg University, Denmark * Stefan Leue, University of Konstanz, Germany * Alice Miller, University of Glasgow, Scotland * Corina Pasareanu, NASA Ames Research Center, USA * Doron Peled, Bar Ilan University, Israel * Neha Rungta, Amazon Web Services, USA * Theo Ruys, RUwise, Netherlands * Scott Smolka, Stony Brook University, USA * Scott Stoller, Stony Brook University, United States * Jun Sun, Singapore University of Technology and Design, Singapore * Oksana Tkachuk, NASA Ames Research Center, USA * Stavros Tripakis, University of California, Berkeley, USA * Willem Visser, Stellenbosch University, South Africa * Farn Wang, National Taiwan University, Taiwan * Michael Whalen, University of Minnesota, USA * Anton Wijs, Eindhoven University of Technology, Netherlands -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- --- To opt-out from this mailing list, send an email to fm-announcements-request at lists.nasa.gov with the word 'unsubscribe' as subject or in the body. You can also make the request by contacting fm-announcements-owner at lists.nasa.gov From vv at di.fc.ul.pt Sat Jan 28 11:49:52 2017 From: vv at di.fc.ul.pt (Vasco T. Vasconcelos) Date: Sat, 28 Jan 2017 16:49:52 +0000 Subject: [TYPES/announce] Postdoc position at the University of Lisbon Message-ID: <1333EF59-7252-4979-8ECA-3A523DA01587@di.fc.ul.pt> *** Post-doc opening on Communication Contracts for Distributed Systems Development *** We welcome applications for a fulltime postdoctoral research position at the University of Lisbon. The position is funded by the research project "CONFIDENT - Communication Contracts for Distributed Systems Development", http://gloss.di.fc.ul.pt/content/confident , a three year collaborative project between a team at the Faculty of Sciences (including Vasco T. Vasconcelos and Ant?nia Lopes) and another at T?cnico (Paulo Mateus and Pedro Ad?o). The objective of the project is the development of tools and technology for describing, testing, statically verifying, and inferring communication contracts for the effective construction and evolution of complex distributed systems, notably RESTful applications. Particular attention will be given to the validation of security requirements of APIs. We plan to integrate the theory of behavioural type systems into a notion of communication contracts, effective in driving the software development life cycle of RESTful applications. We seek applicants with strong interest in some of the following topics: programming language design and implementation, programming logics and types, language-based security, verification and testing, concurrency and distribution. The contract is for one year, extensible for a second year. Applicable administrative rules may be found at the FCT site, http://www.fct.pt/apoios/bolsas/index.phtml.en . Applications should include a curriculum vitae in pdf format, contact details for three referees, and should be sent to LaSIGE - Large-Scale Informatics Systems Laboratory http://www.lasige.di.fc.ul.pt Email: Pedro Gon?alves, pgoncalves at di.fc.ul.pt Phone: +351 21 750 05 32 Interested applicants are encouraged to contact Vasco T. Vasconcelos directly. Application deadline: 28th February 2017. -------------- next part -------------- An HTML attachment was scrubbed... URL: From phaller at kth.se Sat Jan 28 10:18:33 2017 From: phaller at kth.se (Philipp Haller) Date: Sat, 28 Jan 2017 15:18:33 +0000 Subject: [TYPES/announce] =?windows-1252?q?PLACES_2017_=96_Deadline_Extens?= =?windows-1252?q?ion?= Message-ID: <898743c8b96442a7987c3f0f32f3fa6f@exdb01.ug.kth.se> [Please forward to anyone interested. Apologies for multiple mailing.] PLACES 2017 ? Deadline Extension http://places17.by.di.fc.ul.pt/ 10th Workshop on Programming Language Approaches to Concurrency- and Communication-cEntric Software Co-located with ETAPS 2017, Uppsala, Sweden *********************************************************** Modern hardware platforms, from the very small to the very large, increasingly provide parallel computing resources which software may use to maximise performance. Many applications therefore need to make effective use of tens, hundreds, and even thousands of compute nodes. Computation in such systems is thus inherently concurrent and communication-centric. Effectively programming such applications is challenging; performance, correctness, and scalability are difficult to achieve. Various programming paradigms and methods have emerged to aid this task, including structured imperative concurrent programming, stream-based programming, concurrent functions with asynchronous message passing, automatic parallelisation, and the use of types to describe communications and data structures (such as session and linear types), to name but a few. To fully exploit a (possibly heterogeneous) parallel computing environment often requires these approaches to be combined, depending on the shape of the data and control flow. All the while, the underlying runtime environment must ensure seamless execution without relying on differences in available resources such as the number of cores. The development of effective programming methodologies for this increasingly parallel landscape therefore demands exploration and understanding of a wide variety of foundational and practical ideas. This workshop offers a forum where researchers from different fields can exchange new ideas on this key challenge to modern and future programming? where concurrency and distribution are the norm rather than a marginal concern. Submissions are invited in the general area of programming language approaches to concurrency, communication and distribution, ranging from foundational issues, through language implementations, to applications (such as scientific computing) and case studies. Specific topics include, but are not limited to: * Design and implementation of programming languages with first class support for concurrency and communication * Behavioural types, including session types * Concurrent data types, objects and actors * Verification and program analysis methods for concurrent and distributed software * Runtime systems for scalable management of concurrency and resource allocation * High-level programming abstractions addressing security concerns in concurrent and distributed programming * Multi- and many-core programming models, including methods for harnessing GPUs and other accelerators * Memory models for concurrent programming on relaxed-memory architectures * Integration of sequential and concurrent programming techniques * Use of message passing in systems software * Interface languages for communication and distribution * Novel programming methodologies for sensor networks * Programming language approaches to web services * Concurrency and communication in event processing and business process management Papers are welcome which present novel and valuable ideas as well as experiences. Submissions should be (at most) 6-page extended abstracts in EPTCS format and may include an appendix of up to 4 pages. An abstract should be registered via the EasyChair submission site (https://easychair.org/conferences/?conf=places17) by January 29th (anywhere-on-Earth) with the paper submitted by February 5th (anywhere-on-Earth). There will be a post-proceedings special issue in JLAMP (Journal of Logic and Algebraic Methods) after the workshop which will be open to anyone (with a further round of reviewing). Abstract submission: 12 February 2017 Paper submission: 19 February 2017 Notification: 8 March 2017 ETAPS early-registration deadline: 12 March 2017 PLACES workshop: 29 April 2017 Submission deadlines are "anywhere on Earth". COMMITTEES Programme chairs: Philipp Haller and Vasco T. Vasconcelos Programme committee: * Sebastian Burckhardt, Microsoft Research * Ilaria Castelani, INRIA Sophia Antipolis * Marco Carbone, ITU * Silvia Crafa, University of Padova * Patrick Eugster, TU Darmstadt * Ganesh L Gopalakrishnan, University of Utah * Philipp Haller, KTH * Dimitrios Kouzapas, University of Glasgow * Sam Lindley, University of Edinburgh * Luca Padovani, Univ Torino * Aleksandar Prokopec, Oracle Labs * Peter Thiemann, University of Freiburg * Vasco T. Vasconcelos, University of Lisbon Organising committee: Simon Gay, Alan Mycroft, Vasco T. Vasconcelos, and Nobuko Yoshida From feret at ens.fr Sun Jan 29 06:09:37 2017 From: feret at ens.fr (Jerome Feret) Date: Sun, 29 Jan 2017 12:09:37 +0100 Subject: [TYPES/announce] CMSB 2017 - 1st Call for Presentations Message-ID: <2a4b1d85a4b199c903a97197a04606f9.squirrel@www.mail.ens.fr> (Apologies for multiple copies) CALL FOR SUBMISSIONS (Papers, tools, posters, tutorials, presentations) CMSB 2017 15th International Conference on Computational Methods in Systems Biology http://www.cmsb2017.tu-darmstadt.de 27th-29th September 2017 Technische Universit?t Darmstadt (Germany) Description CMSB 2017 solicits original research articles, posters, tutorials, and tool papers, on the analysis of biological systems, networks, data, and corresponding application domains. The conference brings together computer scientists, biologists, mathematicians, engineers, and physicists interested in a system-level understanding of biological processes. Topics of interest include, but are not limited to: - formalisms for modelling biological processes - models and their biological applications - frameworks for model verification, validation, analysis and simulation of biological systems - high-performance Computational Systems Biology and parallel implementations - model inference from experimental data - model integration from biological databases - multi-scale modelling and analysis methods - methods for synthetic biology and biomolecular computing In particular, the conference is open to theoretical works with potential applications to modelling and systems biology, as well as applications of existing framework to new models or that may provide new insights to existing models. Contributions should be submitted to one of the following categories: A) Regular papers B) Tool papers C) Posters D) Tutorials E) Presentation only The proceedings of CMSB 2017 will be published as a volume in Springer's Lecture Notes in Computer Science / Lecture Notes in Bioinformatics series (LNCS/LNBI). After the conference, a selection of papers will be invited to be extended an submitted to a special issue of the journal IEEE/ACM Transactions on Computational Biology and Bioinformatics. Invited Speakers To be announced later. Call for Submissions: A) CALL FOR REGULAR PAPERS: Regular papers should describe original work that has not been previously published and is not under review for publication elsewhere. Papers must be written in English and must conform the LNCS style. They have to be submitted electronically as PDF files via EasyChair. The limit for submissions is 15 pages excluding bibliography and well-marked appendices. Each submission will be refereed rigorously by at least three reviewers. The reviewers are not required to read the appendices, and thus papers must be intelligible without them. Important Dates - Abstract presubmission: April 07, 2017 - Paper submission: April 14, 2017 - Paper notification: June 15, 2017 - Camera-ready: June 30, 2017 Replicability and reproducibility: A paper may come with benchmarks, software, models, and so on. In order to encourage the development of reproducible results, the authors of accepted papers will be suggested to submit supplementary materials, so that the committee can evaluate the reproducibility of their work. B) CALL FOR TOOL PAPERS: Tool papers should present new tools, new tool components or novel extensions to existing tools supporting the modelling and analysis of biological systems. Each submission should be original and not published previously in a tool paper form. Papers must be written in English and must conform the LNCS style. They have to be submitted electronically as PDF files via EasyChair. The limit for submissions is 6 pages. Appendices will not be counted in the page limit. Papers must include information on methods, tool availability, maturity, selected experimental results. Authors should make their tools and benchmarks available at the time of submission for evaluation by the committee. Each submission must be accompanied by a supplementary PDF file illustrating the usage of the tool (e.g. screenshots, step-by-step guide, short tutorial) and, if applicable, how the tool demo will be conducted during the conference presentation. Presenters of accepted tool papers will be encouraged to include a showcase/running demo of the tool in their talk. Important Dates - Abstract presubmission: April 07, 2017 - Paper submission: April 14, 2017 - Paper notification: June 15, 2017 - Camera-ready: June 30, 2017 C) CALL FOR POSTERS: CMSB 2017 solicits original poster abstracts on the computational modeling and analysis of biological systems, pathways, networks, data, and corresponding application domains. We especially encourage poster submission from experimental biologists! Poster abstracts must conform the LNCS style. They have to be submitted electronically as PDF files via EasyChair. The limit for submissions is 2 pages. Important Dates Poster submission: June 1, 2017 Poster notification: June 10, 2017 D) CALL FOR TUTORIALS: CMSB 2017 will host a number of tutorials. Tutorials provide intensive courses on topics ranging from thoughts on the past, current, or future development of computational methods in systems biology to presentations and/or demonstrations of new tools and technologies. A slot in the tutorial track will normally be either 1 hour or 1 hour and a half. A short abstract (less than 2 pages) conforming the LNCS style shall be sent directly to the PC chairs (cmsb2017 at easychair.org) Important Dates - Tutorial submission: March 01, 2017 - Tutorial notification: May 01, 2017 E) CALL FOR PRESENTATIONS: Not all potential speakers are interested in publications in a proceedings. CMSB will host some oral presentations without full paper submission. We welcome submissions of work that was already published in a journal or that is currently under review or will soon be submitted. The submission should contain (i) a one-page abstract (11 point type, single spaced) summarizing the primary results and their relevance and (ii) the actual manuscript that was published or is soon to be published. The program committee will use the manuscript only to assess the merit for an oral presentation at CMSB. Both documents have to be submitted as a single PDF file via EasyChair. Only the one-page abstract will appear in the proceedings at the conference. Submissions unaccompanied by adequate documentation will not be eligible for oral presentation. Important dates - Presentation submission: April 14, 2017 - Presentation notification: June 15, 2017 - Camera-ready (one-page abstract): June 30, 2017 ************************************************* PC co-Chairs - J?r?me Feret (Inria & ?cole normale sup?rieure, France) - Heinz K?ppl (Technische Universitat Darmstadt, Germany) Tool Track Chair - Pierre Boutillier (Harvard Medical School, USA) Local Organisation Chair - Heinz K?ppl (Technische Universitat Darmstadt, Germany) Program Committee - John Albeck (University of California, Davis, USA) - Ezio Bartocci (TU Wien, Austria) - Guillaume Beslon (INSA-Lyon & Inria, France) - Luca Bortolussi (University of Trieste, Italy) - J?r?mie Bourdon (LS2N, Nantes, France) - Luca Cardelli (Microsoft Research, Cambridge, UK) - Vincent Danos (CNRS & ?cole normale sup?rieure, France & University of Edinburgh, UK) - Jo?lle Despeyroux (Inria Sophia Antipolis, France) - James Faeder (University of Pittsburgh, USA) - Fran?ois Fages (Inria, France) - J?r?me Feret (Inria & Ecole normale sup?rieure, France) - Tomas Gedeon (Montana State University, USA) - Manoj Gopalkrishnan (Indian Institute of Technology, Bombay, India) - Calin Guet (IST, Austria) - Monika Heiner (Brandenburg TU Cottbus-Senftenberg, Germany) - Heinz K?ppl (Technische Universitat Darmstadt, Germany) - Jean Krivine (IRIF, Paris Diderot Univ., France) - Reinhard Laubenbacher (University of Connecticut Health Center & Jackson Laboratory for Genomic Medicine, USA) - Axel Legay (IRISA/Inria, France) - Stefan Legewie (IMB Mainz, Germany) - Pietro Li? (University of Cambridge, UK) - Oded Maler (VERIMAG, CNRS and Univ. of Grenoble-Alpes, France) - Nicola Paoletti (Stony Brook University, USA) - Lo?c Paulev? (CNRS/LRI, France) - Tatjana Petrov, (IST, Austria) - Ovidiu Radulescu (University of Montpellier 2, France) - Marc Riedel (University of Minnesota, USA) - Olivier Roux (LS2N & Ecole Centrale de Nantes, France) - David ?afr?nek (Masaryk University, Czech Republic) - Guido Sanguinetti (University of Edinburgh, UK) - Carolyn Talcott (SRI International, USA) - Fabian J. Theis (Helmholtz Zentrum M?nchen, Germany) - Adelinde Uhrmacher (Universit?t Rostock, Germany) - Verena Wolf (Saarland University, Saarbr?cken, Germany) - Jean Yang (Carnegie Mellon University, Pittsburgh, USA) - Paolo Zuliani (Newcastle University, UK) Steering Committee - Finn Drablos (NTNU, Norway) - Fran?ois Fages (Inria, France) - David Harel (Weizmann Institute of Science, Israel) - Monika Heiner (Brandenburg University of Technology, Cottbus, Germany) - Tommaso Mazza (IRCCS Casa Sollievo della Sofferenza Mendel, Italy) - Satoru Miyano (University of Tokyo, Japan) - Gordon Plotkin (University of Edinburgh, UK) - Corrado Priami, (CoSBi / University of Trento, Italy) - Carolyn Talcott, (SRI International, USA) - Adelinde Uhrmacher, (University of Rostock, Germany) From swarat at rice.edu Mon Jan 30 10:57:14 2017 From: swarat at rice.edu (Swarat Chaudhuri) Date: Mon, 30 Jan 2017 10:57:14 -0500 Subject: [TYPES/announce] Postdoctoral position on statistical program analysis and synthesis at Rice University Message-ID: Postdoctoral position on statistical program analysis and synthesis at Rice University ----------------------------------------------------------------- Rice University's Department of Computer Science is looking to hire a postdoctoral researcher for a project at the interface of formal methods and statistical machine learning. More precisely, our goal is to build methods for program analysis and synthesis that are guided by knowledge automatically learned from large datasets of programs and related artifacts (such as tests and documentation). Ideal applicants will have a background in formal methods and/or programming languages, interest (but not necessarily a background) in machine learning, and experience with building systems of significant size. The postdoc will work with Professors Swarat Chaudhuri and Chris Jermaine. The duration of the position is two years, starting May 2017. Compensation will be highly competitive and commensurate with experience. To apply, send a CV and names of 3 references to Swarat Chaudhuri (swarat at rice.edu). From thao.dang at imag.fr Sun Jan 29 20:18:47 2017 From: thao.dang at imag.fr (THAO DANG) Date: Mon, 30 Jan 2017 02:18:47 +0100 (CET) Subject: [TYPES/announce] FORMATS 2017 - Call for Papers - Submission 21 April 2017 Message-ID: <1467524779.2596451.1485739127695.JavaMail.zimbra@univ-grenoble-alpes.fr> [ Apologies for cross posting ] --------------------------------------------------------------------- FORMATS 2017 15th International Conference on Formal Modeling and Analysis of Timed Systems First Call for Papers http://formats17.ulb.be FORMATS'17 takes place in Berlin, Germany, where it is part of QONFEST and is colocated with CONCUR'17 and QEST'17. --------------------------------------------------------------------- ------------------ Objectives ------------------ Control and analysis of the timing of computations is crucial to many domains of system engineering, be it, e.g., for ensuring timely response to stimuli originating in an uncooperative environment, or for synchronising components in VLSI. Reflecting this broad scope, timing aspects of systems from a variety of domains have been treated independently by different communities in computer science and control. Researchers interested in semantics, verification and performance analysis study models such as timed automata and timed Petri nets, the digital design community focuses on propagation and switching delays, while designers of embedded controllers have to take account of the time taken by controllers to compute their responses after sampling the environment, as well as of the dynamics of the controlled process during this span. Timing-related questions in these separate disciplines do have their particularities. However, there is a growing awareness that there are basic problems (of both scientific and engineering level) that are common to all of them. In particular, all these sub-disciplines treat systems whose behaviour depends upon combinations of logical and temporal constraints; namely, constraints on the temporal distances between occurrences of successive events. Often, these constraints cannot be separated, as the intrinsic dynamics of processes couples them, necessitating models, methods, and tools facilitating their combined analysis. Reflecting this, FORMATS'17 promotes submissions on hybrid discrete-continuous systems, and will promote a special session on this topic. ------------------ Topics ------------------ The aim of FORMATS is to promote the study of fundamental and practical aspects of timed systems, and to bring together researchers from different disciplines that share interests in modelling and analysis of timed systems and, as a generalisation, of hybrid systems. Typical topics include (but are not limited to): * Foundations and Semantics : Theoretical foundations of timed systems and languages; new models and logics or analysis and comparison of existing models (like automata, Petri nets, max-plus models, network calculus, or process algebras involving quantitative time; hybrid automata; probabilistic automata and logics). * Methods and Tools : Techniques, algorithms, data structures, and software tools for analysing or synthesising timed or hybrid systems and for resolving temporal constraints (scheduling, worst-case execution time analysis, optimisation, model checking, testing, constraint solving, etc.) * Applications : Adaptation and specialisation of timing technology in application domains in which timing plays an important role (real-time software, embedded control, hardware circuits, and problems of scheduling in manufacturing and telecommunications). ------------------ Paper Submission ------------------ FORMATS'17 solicits high-quality papers reporting research results and/or experience reports related to the topics mentioned above. Submitted papers must contain original, unpublished contributions, not submitted for publication elsewhere. The papers should be submitted electronically in PDF, following the Springer LNCS style guidelines. Submissions should not exceed 15 pages in length (not including the bibliography which is thus not restricted), but may be supplemented with a clearly marked appendix, which will be reviewed at the discretion of the program committee. Each paper will undergo a thorough review process. Papers are to be submitted electronically via the EasyChair online submission system, to be made available from the conference webpage. As traditional, publication of the proceedings of FORMATS'17 will be hosted by Springer in the Lecture Notes in Computer Science series. ------------------ Important Dates ------------------ Abstract Submission: 21 April, 2017 Paper Submission: 28 April, 2017 Notification: 10 June, 2017 Final paper due: 30 June, 2017 Conference: 5-7 September, 2017 ------------------ General Chair of QONFEST ------------------ Katinka Wolter, (FU Berlin) Uwe Nestermann, (TU Berlin) ------------------ Program Committee Chairs ------------------ Alessandro Abate (Oxford, UK) Gilles Geeraerts (ULB, BE) ------------------ Publicity Chair ------------------ Thao Dang, (CNRS/CNRS, France) ------------------ Program Committee ------------------ Erika Abraham Etienne Andr? Bernard Berthomieu Sergiy Bogomolov Patricia Bouyer Thomas Brihaye Uli Fahrenberg Martin Fr?nzle Jane Hillston David Jansen Jan K?et?nsk? Giuseppe Lipari Nicolas Markey Dejan Nickovic Jens Oehlerking Pavithra Prabhakar Karin Quaas Jan Reineke Olivier H. Roux Sibylle Schupp Ana Sokolova Oleg Sokolsky Jir? Srba Nathalie Sznajder Stavros Tripakis Majid Zamani ------------------ Steering Committee ------------------ Rajeev Alur, (U. Pennsylvania, USA) Eugene Asarin, (U. Paris Diderot, France) Martin Fr?nzle (U. Oldenburg, Germany) Thomas A. Henzinger, (IST Austria) Joost-Pieter Katoen, (RWTH Aachen, Germany) Kim G. Larsen, (U. Aalborg, Denmark) Oded Maler, (VERIMAG, CNRS-UGA, France) Lothar Thiele, (ETH Zurich, Switzerland) Wang Yi, (U. Uppsala, Sweden) ------------------ Invited speakers ---------------- To be announced on the conference webpage -------------- next part -------------- An HTML attachment was scrubbed... URL: From westbrook at galois.com Mon Jan 30 19:55:55 2017 From: westbrook at galois.com (Eddy Westbrook) Date: Mon, 30 Jan 2017 16:55:55 -0800 Subject: [TYPES/announce] Research Positions at Galois Message-ID: All, Galois is hiring! We're looking for researchers, principal investigators, software engineers, and project leads, including those with expertise in functional programming, formal methods, machine learning, embedded systems, computer security, or networking. We have two offices: one in Portland, OR, and one in Arlington, VA and positions are available at both locations. For more info or to submit your resume, please see our website: http://galois.com/careers . -Eddy Westbrook -------------- next part -------------- An HTML attachment was scrubbed... URL: From bcpierce at cis.upenn.edu Mon Jan 30 16:54:12 2017 From: bcpierce at cis.upenn.edu (Benjamin C. Pierce) Date: Mon, 30 Jan 2017 16:54:12 -0500 Subject: [TYPES/announce] DeepSpec Summer School on Verified Systems -- apply now! Message-ID: <4C503C19-7A57-4F8C-AAC2-B222F95DC870@cis.upenn.edu> The first DeepSpec Summer School on Verified Systems will be held in Philadelphia from July 17 to 28, 2017, preceded by an introductory Coq Intensive from July 13 to 15. Applications are now open: http://deepspec.org/events/ss17detail.html Overview Can critical systems be built with no bugs in hardware, operating systems, compilers, crypto, and other key components? It may seem a pipe dream, but the past decade has seen remarkable advances in the technology required to realize it. This summer school aims to give participants a wide-ranging overview of several ambitious projects currently underway in this space. Participants will gain a thorough understanding of the conceptual underpinnings of these projects plus considerable hands-on experience with the state-of-the-art tools being used to build them. Dates The summer school will open with a three-day intensive course on the fundamentals of the Coq proof assistant, for participants who are new to Coq. The main lectures take place during the weeks of July 17 and 24. Lecturers and Topics Andrew Appel Verified functional algorithms Adam Chlipala Program-specific proof automation Frans Kaashoek & Nickolai Zeldovich Certifying software with crashes Xavier Leroy The structure of a verified compiler Benjamin Pierce Property-based random testing with QuickChick Zhong Shao CertiKOS: Certified kit operating systems Stephanie Weirich Language specification and variable binding Steve Zdancewic Vellvm: Verifying the LLVM More information To apply, or for more information, please visit http://deepspec.org/events/ss17detail.html . Applications received by Feb 15 will be given equal consideration; applications received after Feb 15 will be considered on a space- and funds-available basis. Subscribe or unsubscribe from the High Confidence Software and Systems mailing list here: http://cps-vo.org/hcss/mailing -------------- next part -------------- An HTML attachment was scrubbed... URL: From f.van.raamsdonk at vu.nl Tue Jan 31 16:28:29 2017 From: f.van.raamsdonk at vu.nl (Raamsdonk, F. van) Date: Tue, 31 Jan 2017 21:28:29 +0000 Subject: [TYPES/announce] International School on Rewriting 2017: First Call for Participation Message-ID: <32F3CB55-02A6-4E2E-9DFB-E3B5AFF04ECE@vu.nl> First Call for Participation 9th INTERNATIONAL SCHOOL ON REWRITING (ISR 2017) July 3-7, 2017, Eindhoven, The Netherlands http://www.win.tue.nl/~hzantema/isr.html Early registration deadline: May 15, 2017 The 9th International School on Rewriting (ISR 2017) is aimed at master and PhD students, researchers, and practitioners interested in the study of rewriting concepts and their applications. The school features lectures by renowned researchers in rewriting, and is organized in two parallel tracks: the Basic Track and the Advanced Track. The BASIC TRACK is intended for students who enter the field. The basic track can, if desired, be round off with an examination of 3EC. The teachers of the Basic Track are Aart Middeldorp (University of Innsbruck) Sarah Winkler (University of Innsbruck) The ADVANCED TRACK consists of eight shorter courses, showing different areas of rewriting research and applications. The teachers and courses of the Advanced Track are: Beniamino Accatoli (INRIA) The Complexity of Beta-Reduction Carsten Fuhs (University of London) Proving Program Termination via Term Rewriting Thomas Genet (IRISA, France) Tree Automata for Reachability in Rewriting Philippe Malbos (University of Lyon), and Samuel Mimram (Ecole Polytechnique) Two-dimensional Rewriting Techniques and Applications Temur Kutsia (University of Linz) Solving Equational Problems: Matching and Unification Julian Nagele (University of Innsbruck), and Vincent van Oostrom (University of Innsbruck) Commutation Christian Sternagel (University of Innsbruck), and Ren? Thiemann (University of Innsbruck) Formalizing Rewriting in Isabelle Johannes Waldmann (RWTH Leipzig) Weighted Automata and Rewriting There will be the opportunity for participants to present their own research. Registration: You can register for ISR 2017 by sending an email to h.zantema at tue.nl. Please mention your full name, institution, and the track you wish to attend. It is appreciated if you mention the subjects you are particularly interested in. Registration fee: The registration fee is 250 euro for early registrations (before May 15, 2017), and 300 euro for late registrations (starting May 16, 2107). Registrations includes access to the lectures, printed copies of or electronic access to material provided by the lecturers, coffee breaks and lunches on Monday-Friday, and the excursion and dinner on Wednesday. If you have any questions, please feel free to contact the organisers: Hans Zantema, email: h.zantema at tue.nl Femke van Raamsdonk, email: f.van.raamsdonk at vu.nl Margje Mommers-Lenders, email: wsinset at tue.nl ==================================================================== International Schools on Rewriting are promoted by the IFIP Working Group 1.6 Term Rewriting. Rewriting is a branch of computer science whose origins go back to the origins of computer science itself (with Thue, Church, Post, and many other prominent researchers). It has strong links with mathematics, algebra, and logic, and it is the basis of well-known programming paradigms like functional and equational programming. In these programming paradigms and corresponding languages, the notions of reduction, pattern matching, confluence, termination, strategy, etc., are essential. Rewriting provides a solid framework for understanding, using, and teaching all these notions. Rewriting techniques are also used in many other areas of software engineering (scripting, prototyping, automated transformation of legacy systems, refactoring, web services, etc.) Rewriting techniques play a relevant role in computing research, education, and industry. From maurizio.proietti at iasi.cnr.it Tue Jan 31 03:47:37 2017 From: maurizio.proietti at iasi.cnr.it (Maurizio Proietti) Date: Tue, 31 Jan 2017 09:47:37 +0100 Subject: [TYPES/announce] VPT 2017 @ETAPS - Extended Deadlines Message-ID: *************************************************************** CALL FOR PAPERS Fifth International Workshop on Verification and Program Transformation April 29th, 2017, Uppsala, Sweden http://refal.botik.ru/vpt/vpt2017 Co-located with the 20th European Joint Conferences on Theory and Practice of Software (ETAPS 2017) http://www.etaps.org/index.php/2017/workshops *************************************************************** EXTENDED DEADLINES * February 10th, 2017: Abstract submission deadline * February 16th, 2017: Paper submission deadline *************************************************************** Invited Speakers Javier Esparza, Technische Universit?t M?nchen, Germany Manuel Hermenegildo, IMDEA Software Institute, Madrid, Spain Alexey Khoroshilov, Linux Verification Center, ISPRAS, Moscow, Russia *************************************************************** The Fifth International Workshop on Verification and Program Transformation (VPT 2017) aims to bring together researchers working in the areas of Program Verification and Program Transformation. The workshop solicits research, position, application, and system description papers with a special emphasis on case studies, demonstrating viability of the interactions between the research fields of program transformation and program verification in a broad sense. Also papers in related areas, such as program testing and program synthesis are welcomed. Topics of interest include, but are not limited to: * Verification by Program Transformation * Verification Techniques in Program Transformation and Synthesis * Verification and Certification of Programs Transformations * Program Analysis and Transformation * Program Testing and Transformation * Verifiable Computing and Program Transformation * Case studies *Important Dates* * February 10th, 2017: Abstract submission deadline * February 16th, 2017: Paper submission deadline * March 8th, 2017: Acceptance notification * March 31st, 2017: Camera ready version (for the pre-proceedings) * April 29th, 2017: Workshop *Submission Guidelines* Authors should submit an electronic copy of the paper in PDF, formatted in the Electronic Proceedings in Theoretical Computer Science LaTeX Style (http://style.eptcs.org/), via the Easychair submission website for VPT 2017: https://easychair.org/conferences/?conf=vpt2017 Papers must describe original work that has not been published, or currently submitted, to a journal, conference, or workshop with refereed proceedings. Also papers that already appeared in unpublished or informally published workshop proceedings may be submitted. Each submission must include on its first page the paper title; authors and their affiliations; contact author's email; abstract; and three to four keywords that will be used to assist the PC in selecting appropriate reviewers for the paper. Page numbers should appear on the manuscript to help the reviewers in writing their report. Submissions should not exceed 15 pages including references but excluding well-marked appendices not intended for publication. Reviewers are not required to read the appendices, and thus papers should be intelligible without them. *Proceedings* Revised versions of all the accepted papers, taking into account the feedback received at the workshop, will be published in a volume of the Electronic Proceedings in Theoretical Computer (EPTCS) series after the workshop. If the workshop will attract sufficiently many high quality papers, a special issue of a journal on the topic of the workshop will be considered. The special issue will be open to high quality papers accepted for presentation in previous editions of the workshop. *Program Committee* * Emanuele De Angelis, University of Chieti-Pescara, Italy * John Gallagher, Roskilde University, Denmark * Miguel Gomez-Zamalloa, Complutense University of Madrid, Spain * Nikos Gorogiannis, Middlesex University, UK * Geoff W. Hamilton, Dublin City University, Republic of Ireland * Alexei Lisitsa, The University of Liverpool, UK (co-chair) * David Monniaux, VERIMAG, CNRS - University of Grenoble, France * Jorge A. Navas, SRI International, USA * Andrei P. Nemytykh, Program Systems Institute of RAS, Russia (co-chair) * Maurizio Proietti, IASI-CNR, Rome, Italy (co-chair) * Philipp Ruemmer, Uppsala University, Sweden * Hirohisa Seki, Nagoya Institute of Technology, Japan * Harald Sondergaard, The University of Melbourne, Australia * Morten H. Sorensen, Formalit, Denmark *Organisers* Guglielmo De Angelis (IASI-CNR, Rome, Italy) Alexei Lisitsa (The University of Liverpool, UK) Andrei P. Nemytykh (Program Systems Institute of RAS, Russia) Maurizio Proietti (IASI-CNR, Rome, Italy) *Contacts* Alexei Lisitsa, a.lisitsa at csc.liv.ac.uk Andrei P. Nemytykh, nemytykh at math.botik.ru Maurizio Proietti, maurizio.proietti at iasi.cnr.it -- Maurizio Proietti IASI-CNR Via dei Taurini 19, 00185 Roma, Italy Phone: +39 0649937114 Fax: +39 06 4993 7106, +39 06 4993 7137 maurizio.proietti at iasi.cnr.it http://www.iasi.cnr.it/~proietti -------------- next part -------------- An HTML attachment was scrubbed... URL: From icfp.publicity at googlemail.com Tue Jan 31 19:19:38 2017 From: icfp.publicity at googlemail.com (Lindsey Kuper) Date: Tue, 31 Jan 2017 16:19:38 -0800 Subject: [TYPES/announce] Second Call for Papers: ICFP 2017 Message-ID: <5891299a8d995_f913fec02463bf072cb@landin.mail> ICFP 2017 The 22nd ACM SIGPLAN International Conference on Functional Programming Oxford, United Kingdom http://icfp17.sigplan.org/ Second Call for Papers ### Important dates Submissions due: Monday, February 27, Anywhere on Earth https://icfp17.hotcrp.com Author response: Monday, April 17, 2017, 15:00 (UTC) - Thursday, April 20, 2017, 15:00 (UTC) Notification: Monday, 1 May, 2017 Final copy due: Monday, 5 June 2017 Early registration: TBA Conference: Monday, 4 September - Wednesday, 6 September, 2017 ### Updates for Second Call for Papers This revision, published January 31, 2017, includes the following updates: * A link to the list of frequently asked questions about the double-blind review process. * A new requirement for citations in author-year format. This follows a decision for PACMPL that was made after the original version of this call was distributed. As such, author-year format will be required for final (accepted) versions of papers in ICFP 2017, but not for submissions. * Additional guidance for authors using LaTeX. * A clarification about the expectations for author attendance in the event of visa-related problems. ### New this year Those familiar with previous ICFP conferences should be aware of two significant changes that are being introduced in 2017: 1. Papers selected for ICFP 2017 will be published as the ICFP 2017 issue of a new journal, Proceedings of the ACM on Programming Languages (PACMPL), which replaces the previous ICFP conference proceedings. The move to PACMPL will have two noticeable impacts on authors: * A new, two-phase selection and reviewing process that conforms to ACM?s journal reviewing guidelines. * A new, single-column format for submissions. 2. Authors of papers that are conditionally accepted in the first phase of the reviewing process will have the option to submit materials for Artifact Evaluation. Further details on each of these changes are included in the following text. ### Scope ICFP 2017 seeks original papers on the art and science of functional programming. Submissions are invited on all topics from principles to practice, from foundations to features, and from abstraction to application. The scope includes all languages that encourage functional programming, including both purely applicative and imperative languages, as well as languages with objects, concurrency, or parallelism. Topics of interest include (but are not limited to): * *Language Design*: concurrency, parallelism, and distribution; modules; components and composition; metaprogramming; type systems; interoperability; domain-specific languages; and relations to imperative, object-oriented, or logic programming. * *Implementation*: abstract machines; virtual machines; interpretation; compilation; compile-time and run-time optimization; garbage collection and memory management; multi-threading; exploiting parallel hardware; interfaces to foreign functions, services, components, or low-level machine resources. * *Software-Development Techniques*: algorithms and data structures; design patterns; specification; verification; validation; proof assistants; debugging; testing; tracing; profiling. * *Foundations*: formal semantics; lambda calculus; rewriting; type theory; monads; continuations; control; state; effects; program verification; dependent types. * *Analysis and Transformation*: control-flow; data-flow; abstract interpretation; partial evaluation; program calculation. * *Applications*: symbolic computing; formal-methods tools; artificial intelligence; systems programming; distributed-systems and web programming; hardware design; databases; XML processing; scientific and numerical computing; graphical user interfaces; multimedia and 3D graphics programming; scripting; system administration; security. * *Education*: teaching introductory programming; parallel programming; mathematical proof; algebra. Submissions will be evaluated according to their relevance, correctness, significance, originality, and clarity. Each submission should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. The technical content should be accessible to a broad audience. ICFP 2017 also welcomes submissions in two separate categories --- Functional Pearls and Experience Reports --- that must be marked as such at the time of submission and that need not report original research results. Detailed guidelines on both categories are given at the end of this call. Please contact the program chair if you have questions or are concerned about the appropriateness of a topic. ### Preparation of submissions ICFP 2017 will employ a lightweight double-blind reviewing process, as described below. **Deadline**: The deadline for submissions is Monday, February 27, 2017, Anywhere on Earth (). This deadline will be strictly enforced. **Formatting**: (NOTE: NEW FORMAT REQUIREMENTS FOR ICFP 2017) Submissions must be in PDF format, printable in black and white on US Letter sized paper, and interpretable by common PDF tools. All submissions must adhere to the "ACM Large" template that is available (in both LaTeX and Word formats) from . For authors using LaTeX, a lighter-weight package, including only the essential files, is available from ; the appropriate template for ICFP 2017 authors is in the file `acmart-pacmpl-template.tex`. As documented in the template, submissions should be prepared using the `acmlarge` and `anonymous` options. The use of the `review` option is also strongly encouraged but not required. (The `review` option will add line numbers, which will make it easier for reviewers to reference specific parts of your paper in their comments, but should have absolutely no other effect on the typesetting.) Details of available technical support for LaTeX-specific questions is available at . There is a limit of 24 pages for a full paper or 12 pages for an Experience Report; in either case, the bibliography will not be counted against these limits. These page limits have been chosen to allow essentially the same amount of content with the new single-column format as was possible with the two-column format used in past ICFP conferences. Submissions that exceed the page limits or, for other reasons, do not meet the requirements for formatting, will be summarily rejected. **Citations**: As part of PACMPL, ICFP 2017 papers are expected to use author-year citations for references to other work. Author-year citations may be used as either a noun phrase, such as "The lambda calculus was originally conceived by Church (1932)", or a parenthetic phase, such as "The lambda calculus (Church 1932) was intended as a foundation for mathematics". A useful test for correct usage it to make sure that the text still reads correctly when the parenthesized portions of any references are omitted. Take care with prepositions; in the first example above, "by" is more appropriate than "in" because it allows the text to be read correctly as a reference to the author. Sometimes, readability may be improved by putting parenthetic citations at the end of a clause or a sentence, such as "A foundation for mathematics was provided by the lambda calculus (Church 1932)". In LaTeX, use `\citet{Church-1932}` for citations as a noun phrase, "Church (1932)", and `\citep{Church-1932}` for citations as a parenthetic phrase, "(Church 1932)"; for details, see Sections 2.3--2.5 of the natbib documentation (). **Submission**: Submissions will be accepted at (in preparation at the time of writing). Improved versions of a paper may be submitted at any point before the submission deadline using the same web interface. **Author Response Period**: Authors will have a 72-hour period, starting at 15:00 UTC on Monday, April 17, 2017, to read reviews and respond to them. **Supplementary Materials**: Authors have the option to attach supplementary material to a submission, on the understanding that reviewers may choose not to look at it. The material should be uploaded at submission time, as a single pdf or a tarball, not via a URL. This supplementary material may or may not be anonymized; if not anonymized, it will only be revealed to reviewers after they have submitted their review of the paper and learned the identity of the author(s). **Authorship Policies**: All submissions are expected to comply with the ACM Policies for Authorship that are detailed at . **Republication Policies**: Each submission must adhere to SIGPLAN's republication policy, as explained on the web at . **Resubmitted Papers**: Authors who submit a revised version of a paper that has previously been rejected by another conference have the option to attach an annotated copy of the reviews of their previous submission(s), explaining how they have addressed these previous reviews in the present submission. If a reviewer identifies him/herself as a reviewer of this previous submission and wishes to see how his/her comments have been addressed, the program chair will communicate to this reviewer the annotated copy of his/her previous review. Otherwise, no reviewer will read the annotated copies of the previous reviews. ### Review Process This section outlines the two-stage process with lightweight double-blind reviewing that will be used to select papers for presentation at ICFP 2017. A [list of frequently asked questions and answers](http://icfp17.sigplan.org/track/icfp-2017-papers#Submission-and-Reviewing-FAQ) that address common concerns is available on the conference website and will be updated as necessary to clarify and expand on this process. **ICFP 2017 will employ a two-stage review process.** The first stage in the review process will assess submitted papers using the criteria stated above and will allow for feedback and input on initial reviews through the author response period mentioned previously. At the PC meeting, a set of papers will be conditionally accepted and all other papers will be rejected. Authors will be notified of these decisions on May 1, 2017. Authors of conditionally accepted papers will be provided with committee reviews (just as in previous conferences) along with a set of mandatory revisions. After five weeks (June 5, 2017), the authors will provide a second submission. The second and final reviewing phase assesses whether the mandatory revisions have been adequately addressed by the authors and thereby determines the final accept/reject status of the paper. The intent and expectation is that the mandatory revisions can be addressed within five weeks and hence that conditionally accepted papers will in general be accepted in the second phase. The second submission should clearly identify how the mandatory revisions were addressed. To that end, the second submission must be accompanied by a cover letter mapping each mandatory revision request to specific parts of the paper. The cover letter will facilitate a quick second review, allowing for confirmation of final acceptance within two weeks. Conversely, the absence of a cover letter will be grounds for the paper?s rejection. This process is intended as a refinement of the review process that has been used in previous ICFP conferences. By incorporating a second stage, the process will conform to ACM?s journal reviewing guidelines for PACMPL. **ICFP 2017 will employ a lightweight double-blind reviewing process.** To facilitate this, submitted papers must adhere to two rules: 1. **author names and institutions must be omitted**, and 2. **references to authors' own related work should be in the third person** (e.g., not "We build on our previous work ..." but rather "We build on the work of ..."). The purpose of this process is to help the PC and external reviewers come to an initial judgement about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult (e.g., important background references should not be omitted or anonymized). In addition, authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For instance, authors may post drafts of their papers on the web or give talks on their research ideas. ### Information for Authors of Accepted Papers * As a condition of acceptance, final versions of all papers must adhere to the new ACM Large format. The page limits for final versions of papers will be increased to ensure that authors have space to respond to reviewer comments and mandatory revisions. * Authors of accepted submissions will be required to agree to one of the three ACM licensing options: copyright transfer to ACM; retaining copyright but granting ACM exclusive publication rights; or open access on payment of a fee. Further information about ACM author rights is available from . * At least one author of each accepted submission will be expected to attend and present their paper at the conference. (ICFP welcomes all authors, regardless of nationality. If any author of an accepted submission has visa-related difficulties in travelling to the conference, we will make arrangements to enable remote participation, and not require them to attend the conference in order to present their talk.) The schedule for presentations will be determined and shared with authors after the full program has been selected. Presentations will be videotaped and released online if the presenter consents. * We intend that the proceedings will be freely available for download from the ACM Digital Library in perpetuity via the OpenTOC mechanism. * ACM Author-Izer is a unique service that enables ACM authors to generate and post links on either their home page or institutional repository for visitors to download the definitive version of their articles from the ACM Digital Library at no charge. Downloads through Author-Izer links are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to the definitive version of an ACM article should reduce user confusion over article versioning. After an article has been published and assigned to the appropriate ACM Author Profile pages, authors should visit to learn how to create links for free downloads from the ACM DL. * **AUTHORS TAKE NOTE: The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to *two weeks prior* to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work.** ### Artifact Evaluation Authors of papers that are conditionally accepted in the first phase of the review process will be encouraged (but not required) to submit supporting materials for Artifact Evaluation. These items will then be reviewed by a committee, separate from the program committee, whose task is to assess how the artifacts support the work described in the associated paper. Papers that go through the Artifact Evaluation process successfully will receive a seal of approval printed on the papers themselves. Authors of accepted papers will be encouraged to make the supporting materials publicly available upon publication of the proceedings, for example, by including them as "source materials" in the ACM Digital Library. An additional seal will mark papers whose artifacts are made available, as outlined in the ACM guidelines for artifact badging. Participation in Artifact Evaluation is voluntary and will not influence the final decision regarding paper acceptance. Further information about the motivations and expectations for Artifact Evaluation can be found at . ### Special categories of papers In addition to research papers, ICFP solicits two kinds of papers that do not require original research contributions: Functional Pearls, which are full papers, and Experience Reports, which are limited to half the length of a full paper. Authors submitting such papers should consider the following guidelines. #### Functional Pearls A Functional Pearl is an elegant essay about something related to functional programming. Examples include, but are not limited to: * a new and thought-provoking way of looking at an old idea * an instructive example of program calculation or proof * a nifty presentation of an old or new data structure * an interesting application of functional programming techniques * a novel use or exposition of functional programming in the classroom While pearls often demonstrate an idea through the development of a short program, there is no requirement or expectation that they do so. Thus, they encompass the notions of theoretical and educational pearls. Functional Pearls are valued as highly and judged as rigorously as ordinary papers, but using somewhat different criteria. In particular, a pearl is not required to report original research, but, it should be concise, instructive, and entertaining. A pearl is likely to be rejected if its readers get bored, if the material gets too complicated, if too much specialized knowledge is needed, or if the writing is inelegant. The key to writing a good pearl is polishing. A submission that is intended to be treated as a pearl must be marked as such on the submission web page, and should contain the words "Functional Pearl" somewhere in its title or subtitle. These steps will alert reviewers to use the appropriate evaluation criteria. Pearls will be combined with ordinary papers, however, for the purpose of computing the conference's acceptance rate. #### Experience Reports The purpose of an Experience Report is to help create a body of published, refereed, citable evidence that functional programming really works --- or to describe what obstacles prevent it from working. Possible topics for an Experience Report include, but are not limited to: * insights gained from real-world projects using functional programming * comparison of functional programming with conventional programming in the context of an industrial project or a university curriculum * project-management, business, or legal issues encountered when using functional programming in a real-world project * curricular issues encountered when using functional programming in education * real-world constraints that created special challenges for an implementation of a functional language or for functional programming in general An Experience Report is distinguished from a normal ICFP paper by its title, by its length, and by the criteria used to evaluate it. * Both in the proceedings and in any citations, the title of each accepted Experience Report must begin with the words "Experience Report" followed by a colon. The acceptance rate for Experience Reports will be computed and reported separately from the rate for ordinary papers. * Experience Report submissions can be at most 12 pages long, excluding bibliography. * Each accepted Experience Report will be presented at the conference, but depending on the number of Experience Reports and regular papers accepted, authors of Experience reports may be asked to give shorter talks. * Because the purpose of Experience Reports is to enable our community to accumulate a body of evidence about the efficacy of functional programming, an acceptable Experience Report need not add to the body of knowledge of the functional-programming community by presenting novel results or conclusions. It is sufficient if the Report states a clear thesis and provides supporting evidence. The thesis must be relevant to ICFP, but it need not be novel. The program committee will accept or reject Experience Reports based on whether they judge the evidence to be convincing. Anecdotal evidence will be acceptable provided it is well argued and the author explains what efforts were made to gather as much evidence as possible. Typically, more convincing evidence is obtained from papers which show how functional programming was used than from papers which only say that functional programming was used. The most convincing evidence often includes comparisons of situations before and after the introduction or discontinuation of functional programming. Evidence drawn from a single person's experience may be sufficient, but more weight will be given to evidence drawn from the experience of groups of people. An Experience Report should be short and to the point: it should make a claim about how well functional programming worked on a particular project and why, and produce evidence to substantiate this claim. If functional programming worked in this case in the same ways it has worked for others, the paper need only summarize the results --- the main part of the paper should discuss how well it worked and in what context. Most readers will not want to know all the details of the project and its implementation, but the paper should characterize the project and its context well enough so that readers can judge to what degree this experience is relevant to their own projects. The paper should take care to highlight any unusual aspects of the project. Specifics about the project are more valuable than generalities about functional programming; for example, it is more valuable to say that the team delivered its software a month ahead of schedule than it is to say that functional programming made the team more productive. If the paper not only describes experience but also presents new technical results, or if the experience refutes cherished beliefs of the functional-programming community, it may be better off submitted it as a full paper, which will be judged by the usual criteria of novelty, originality, and relevance. The program chair will be happy to advise on any concerns about which category to submit to. ### Organizers General Chair: Jeremy Gibbons (University of Oxford, UK) Program Chair: Mark Jones (Portland State University, USA) Artifact Evaluation Chair: Ryan R. Newton (Indiana University, USA) Industrial Relations Chair: Ryan Trinkle (Obsidian Systems LLC, USA) Programming Contest Organiser: Sam Lindley (University of Edinburgh, UK) Publicity and Web Chair: Lindsey Kuper (Intel Labs, USA) Student Research Competition Chair: Ilya Sergey (University College London, UK) Video Chair: Jose Calderon (Galois, Inc., USA) Workshops Co-Chair: Andres L?h (Well-Typed LLP) Workshops Co-Chair: David Christiansen (Indiana University, USA) Program Committee: Bob Atkey (University of Strathclyde, Scotland) Adam Chlipala (MIT, USA) Dominique Devriese (KU Leuven, Belgium) Martin Erwig (Oregon State, USA) Matthew Flatt (University of Utah, USA) Ronald Garcia (University of British Columbia, Canada) Kathryn Gray (University of Cambridge, England) John Hughes (Chalmers University and Quvik, Sweden) Chung-Kil Hur (Seoul National University, Korea) Graham Hutton (University of Nottingham, England) Alan Jeffrey (Mozilla Research, USA) Ranjit Jhala (University of California, San Diego, USA) Shin-ya Katsumata (Kyoto University, Japan) Lindsey Kuper (Intel Labs, USA) Dan Licata (Wesleyan University, USA) Ben Lippmeier (Digital Asset, Australia) Gabriel Scherer (Northeastern University, USA) Alexandra Silva (University College London, England) Nikhil Swamy (Microsoft Research, USA) Sam Tobin-Hochstadt (Indiana University, USA) Nicolas Wu (University of Bristol, England) Beta Ziliani (CONICET and FAMAF, Universidad Nacional de C?rdoba, Argentina) From fsen2017 at ipm.ir Tue Jan 31 13:53:59 2017 From: fsen2017 at ipm.ir (Marjan Sirjani) Date: Tue, 31 Jan 2017 13:53:59 -0500 Subject: [TYPES/announce] CfPart: FSEN 2017 Message-ID: <89c03f16-ecb4-a63e-f34c-cac49c028f22@ipm.ir> ###################################################################### FSEN 2017 Call for Participation Seventh International Conference on Fundamentals of Software Engineering 2017 Theory and Practice (FSEN'17) http://fsen.ir/2017/ Tehran, Iran 26 - 28 April, 2017 ###################################################################### For information on registration and accepted papers check the conference homepage. Keynote Speakers ---------------- Thomas A. Henzinger, IST, Austria Philippa Gardner, Imperial College London, UK Leon van der Torre, University of Luxembourg, Luxembourg From m.stannett at sheffield.ac.uk Mon Jan 30 13:50:01 2017 From: m.stannett at sheffield.ac.uk (Mike Stannett) Date: Mon, 30 Jan 2017 18:50:01 +0000 Subject: [TYPES/announce] Fwd: Call for Papers - Physics and Computation 2017 In-Reply-To: References: Message-ID: ============================================================ CALL FOR PAPERS The 8th International Worksop on PHYSICS AND COMPUTATION (P&C 2017) Submission deadline: 5 Mar, 2017 Notification of acceptance: 19 Apr, 2017 Final versions of papers due: 8 May 2017 A co-located workshop of UCNC 2017, June 5-9, 2017, University of Arkansas Fayetteville, Arkansas, USA SUBMISSIONS https://easychair.org/conferences/?conf=pc2017 ============================================================ The 8th International Workshop on Physics and Computation (P&C 2017) will be held as a satellite workshop of UCNC 2017, which takes place this year from 5-9 June 2017 in Fayetteville, Arkansas, USA (http://ucnc2017.uark.edu/). TOPICS include, but are not restricted to: * Axiomatisation of physics: completeness, decidability, reduction * Dynamical systems: computability, complexity * Molecular computation and reaction-diffusion models * Multiple-substrate computation * Nanoscale algorithms * New approaches to physical computation * Novel models of computation * Philosophy of physics and computation * Physical Church-Turing thesis * Quantum computation, logics and information * Randomness and computation: quantum, dynamical and physical randomness * Relativistic computation: reasoning, complexity, hypercomputation * Theory of measurement: axiomatisation, complexity * Type theories of physical computation INVITED SPEAKERS * To be confirmed SUBMISSIONS Authors are invited to submit original papers (12 pages maximum) to the workshop EasyChair site. Extended abstracts (4?5 pages) may also be submitted, although preference will be given to full papers. PROCEEDINGS Accepted papers will be made available online in a pre- proceedings before the workshop begins. Authors of selected papers will be invited to submit revised and extended versions of their papers, subject to additional review, for publication in a special issue of the International Journal of Unconventional Computing (IJUC). PROGRAMME COMMITTEE * Selim Akl (Queen's) * Pablo Arrighi (Aix-Marseille) * Edwin Beggs (Swansea) * Selmer Bringsjord (Rensselaer) * Cristian Calude (Auckland) * F?lix Costa (Lisboa) * Jerome Durand-Lose (Orl?ans) * Marian Gheorghe (Bradford) * Jerzy G?recki (Institute of Physical Chemistry, Polish Academy of Sciences) * Viv Kendon (Durham University) * Judit Madar?sz (Renyi Mathematical Institute, Hungarian Academy of Sciences) * Mike Stannett (Sheffield) * Karl Svozil (Vienna) * Gergely Sz?kely (Renyi Mathematical Institute, Hungarian Academy of Sciences) FURTHER INFORMATION For further information, please contact the wokshop organiser: Mike Stannett Email: m.stannett(at)sheffield.ac.uk ============================================================ -------------- next part -------------- An HTML attachment was scrubbed... URL: From S.A.Owens at kent.ac.uk Wed Feb 1 05:32:19 2017 From: S.A.Owens at kent.ac.uk (Scott Owens) Date: Wed, 1 Feb 2017 10:32:19 +0000 Subject: [TYPES/announce] Post Doc in weak memory at the University of Kent Message-ID: <8AD8E5DB-FC08-47ED-AFD1-8E6DA6377C15@kent.ac.uk> Hi all, I?m looking to hire a post doc to work in the general area of weak memory models. The post is funded for 18 months at the University of Kent in Canterbury, England. To apply, see the formal job advertisement here: http://www.jobs.ac.uk/job/AWW579/research-associate/. This post is part of the EPSRC-funded project, "Verifying concurrent algorithms on weak memory models." The goal of the project is to advance the understanding of weak memory ? as found in multi-core hardware of POWER, ARM, and x86 architectures ? to support reasoning formally about the implementations of concurrent algorithms. The successful candidate will work closely with the project?s PI, Dr Scott Owens, and will have significant input into the direction of the project. They will also have the opportunity to work with project partners in Prof. John Derrick?s group at the University of Sheffield, and locally with Dr Mark Batty at the University of Kent. Scott Owens From barbara_koenig at uni-due.de Wed Feb 1 08:37:56 2017 From: barbara_koenig at uni-due.de (Barbara Koenig) Date: Wed, 01 Feb 2017 14:37:56 +0100 Subject: [TYPES/announce] STAF Doctoral Symposium 2017 - Call for Papers Message-ID: ********************************************************************** Call for Papers for the STAF Doctoral Symposium July 17, 2017 Affiliated with STAF 2017 in Marburg ********************************************************************** http://www.informatik.uni-marburg.de/staf2017/index.php/call-doctoral-symposium/ ********************************************************************** The goal of the Doctoral Symposium is to provide a forum in which PhD students can present their work in progress. The symposium supports students by providing independent and constructive feedback about their already completed and, more importantly, planned research work. The symposium will be accompanied by prominent experts who will actively participate in critical discussions. Relevant fields within Software Engineering include (but are not limited to): * Models: reasoning, execution, management, testing and validation * Model transformations: paradigms, algorithms, development, applications, tools * Graph transformation and graph theories * Domain Specific Languages * Proofs and Testing: verification, debugging, experiments, case studies * Model-Driven Engineering Any topic of interest for the conferences that will take place within STAF 2017 is highly welcomed. ---------------------------------------------------------------------- Submission Process Submissions exclusively authored by the PhD student are invited from students who have settled on a PhD topic. We do accept papers on both initial stage (first or second year) and mature stage (third year, or later) of research. The authors shall clearly indicate their stage of research maturity in a footnote to be added to the paper title. Each submission will be reviewed by at least 3 experts based on originality, significance, correctness and clarity. Submissions should describe research-in-progress that is meant to lead to a PhD dissertation, using the following structure: * Problem: The problem the research intends to solve, the target audience of this research, and a motivation of why the problem is important and needs to be solved. * Related work: A review of the relevant related work with an emphasis of how the proposed approach is different and what advantages it has over the existing state of the art. * Proposed solution: A description of the proposed solution and which other work (e.g., in the form of methods or tools) it depends on. * Preliminary work: A description of the work to-date and results achieved so far. * Expected contributions: A list of the expected contributions to both theory and practice. * Plan for evaluation and validation: A description of how it will be shown that the work does indeed solve the targeted problem and is superior to the existing state of the art (e.g., prototyping, industry case studies, user studies, experiments). * Current status: The current status of the work and a planned timeline for completion. Contributions must not exceed 5 pages in Springer LNCS format and must be submitted via EasyChair (https://easychair.org/conferences/?conf=staf2017workshops, choose "STAF 2017 Doctoral Symposium" as track). All accepted submissions to the Doctoral Symposium at STAF 2017 will be published in a post-conference volume of CEUR and will be submitted for inclusion in DBLP. ---------------------------------------------------------------------- Important Dates: May 22, 2017 Paper submission deadline June 2, 2017 Author notification July 17, 2017 STAF 2017 Doctoral Symposium ---------------------------------------------------------------------- Co-Chairs Davide Di Ruscio University of L'Aquila, Italy Barbara K?nig Universit?t Duisburg-Essen, Germany ---------------------------------------------------------------------- From rl.stpuu at gmail.com Thu Feb 2 16:43:15 2017 From: rl.stpuu at gmail.com (Roussanka Loukanova) Date: Thu, 2 Feb 2017 22:43:15 +0100 Subject: [TYPES/announce] Logic Colloquium 2017: First Announcement and Call for Submissions Message-ID: Logic Colloquium 2017: First Announcement and Call for Submissions August 14-20, 2017, Stockholm, Sweden https://www.lc17.conf.kth.se The Logic Colloquium 2017 (LC2017) is the 2017 Annual European summer meeting of the Association for Symbolic Logic (ASL) and will be held during August 14-20, 2017 at the main campus of Stockholm University. The Logic Colloquium 2017 is organised and hosted jointly by the Departments of Mathematics and Philosophy at Stockholm University, and is also supported by the KTH Royal Institute of Technology. LC2017 will be co-located with two other logic-related events, all taking place at Stockholm University: - the 3rd Nordic Logic Summer School, NLS2017, August 7-12 - the 26th EACSL Annual Conference on Computer Science Logic, CSL2017, August 20-24. There will be a joint session of CSL2017 and LC2017 in the morning of August 20. Further information about all events can be found at: https://www.lis17.conf.kth.se The programme of LC2017 will also include special sessions, which will be announced later. INVITED SPEAKERS ------------------------------ Plenary speakers: - David Aspero (University of East Anglia) - Alessandro Berarducci (Pisa) - Elisabeth Bouscaren (Paris 11) - Christina Brech (Sao Paulo) - Sakae Fuchino (Kobe University) - Denis Hirschfeldt (University of Chicago) - Wilfrid Hodges (British Academy) - Emil Jerabek (Prague) - Per Martin-L?f (Stockholm University) - Dag Prawitz (Stockholm University) - Sonja Smets (University of Amsterdam) Tutorial speakers: - Patricia Bouyer-Decitre (LSV ENS Cachan) - Mai Gehrke (Paris 7) LC2017 invited highlight speakers for the joint LC-CSL session: - Veronica Becher (Buenos Aires) - Pierre Simon (UC Berkeley) SUBMISSIONS OF CONTRIBUTED TALKS --------------------- Abstracts of contributed talks must be submitted as pdf files via this EasyChair page: https://easychair.org/conferences/?conf=lc2017 (If you do not have an EasyChair-account yet, you can create one at the submission site.) The abstracts must be prepared according to the ASL instructions here: http://www.aslonline.org/rules_abstracts.html Please enter Title and Abstract as plain text. As the first keyword, put the AMS 2010 classification: 03xxx Abstracts of contributed talks submitted by ASL members, which are accepted and prepared according to the ASL Rules for Abstracts will be published in The Bulletin of Symbolic Logic. Upon notification of acceptance, authors will be requested to submit the LaTex source files. ASL will provide some student grants for participation at the LC2017. IMPORTANT DATES -------------------------------------------------------- Abstract submission for contributed talks: May 5, 2017 Notification: TBA -------------------------------------------------------- PROGRAMME COMMITTEE ------------------- - Rod Downey (University of Wellington) - Mirna Dzamonja (PC chair, University of East Anglia) - Ali Enayat (University of Gothenburg) - Fernando Ferreira (University of Lisbon) - Valentin Goranko (Stockholm University) - Martin Hils (University of M?nster) - Sara Negri (University of Helsinki) - Assaf Rinot (Bar-Ilan University) - Igor Walukiewicz (University of Bordeaux) ORGANISING COMMITTEE -------------------- - Mads Dam, Department of Theoretical Computer Science, KTH - Valentin Goranko (OC co-chair), Department of Philosophy, Stockholm University - Sven-Ove Hansson, Department of Philosophy, KTH Royal Institute of Technology - Eric Johannesson, Department of Philosophy, Stockholm University - Vera Koponen, Department of Mathematics, Uppsala University - Roussanka Loukanova, Department of Mathematics, Stockholm University - Peter LeFanu Lumsdaine, Department of Mathematics, Stockholm University - Peter Pagin, Department of Philosophy, Stockholm University - Anders Lundstedt, Department of Philosophy, Stockholm University - Erik Palmgren (OC co-chair), Department of Mathematics, Stockholm University - Dag Westerst?hl, Department of Philosophy, Stockholm University CONTACTS AND ENQUIRIES -------------------- For enquiries on scientific and programme issues, send email to: Mirna Dzamonja (M.Dzamonja at uea.ac.uk) For enquiries on organising matters, send email to: lc2017 at philosophy.su.se From madeira at ua.pt Thu Feb 2 16:55:24 2017 From: madeira at ua.pt (Alexandre Madeira) Date: Thu, 2 Feb 2017 21:55:24 +0000 Subject: [TYPES/announce] =?utf-8?q?Workshop_DaL=C3=AD?= Message-ID: Workshop DaL? ? Dynamic Logic: new trends and applications Bras?lia, 24 September, 2017 (co-located with FROCOS TABLEAUX and ITP 2017) workshop.dali.di.uminho.pt Building on the pioneer intuitions of Floyd-Hoare logic, Dynamic Logic was intro- duced in the 70?s by Pratt as a suitable logic to reason about, and verify, classic imperative programs. Since then, the original intuitions grew to an entire family of logics, which became increasingly popular for assertional reasoning about a wide range of computational systems. Simultaneously, their object (i.e. the very notion of a program) evolved in unexpected ways. This leads to dynamic logics tailored to specific programming paradigms and extended to new computing domains, including probabilistic, continuous and quantum computation. Both its theoretical relevance and practical potential make Dynamic Logic a topic of interest in a number of scientific venues, from wide-scope software engineering conferences to modal logic specific events. However, no specific event is exclusively dedicated to it. This workshop aims at filling fill such a gap, joining an heteroge- neous community of colleagues, from Academia to Industry, from Mathematics to Computer Science. forum for disseminating and sharing new trends and applications of Dynamic Logic. The event is promoted by the project DaL? - Dynamic logics for cyber-physical systems: towards contract based design (POCI-01-0145-FEDER-016692), a R&D project supported by the Portuguese Foundation for Science and Technology (http: //dali.di.uminho.pt). ***** Topics ***** We invite submissions on the general field of Dynamic Logic, its variants and applications, including, but not restricted to: - Dynamic logic,foundations and applications - Logics with regular modalities - Modal/temporal/epistemic logics - Kleene and action algebras and their variants - Quantum dynamic logic - Coalgebraic modal/dynamic logics - Graded and fuzzy dynamic logics - Dynamic logics for cyber-physical systems - Dynamic epistemic logic - Complexity and decidability of variants of dynamic logics and temporal logics - Model checking, model generation and theorem proving for dynamic logics ***** Submissions and publications **** Authors are invited to submit original papers (un-published and not submitted for publication elsewhere) up to 15 pages in lncs style. Accepted papers will be published in a Springer?s Lecture Notes of Computer Science volume. Submissions with work in progress (abstracts with 2-5 pag) are also welcomed for short presentations. They are subject of a light reviewing and will be available at conference in a informal booklet. Both kind of submissions should be done via the EasyChair link https://easychair.org/conferences/?conf=dali17. Extended versions of the DaL? contributions will be invited to a special issue in the Journal of Logical and Algebraic Methods in Programming, Elsevier. ***** Important Dates **** - May 26, 2017: Abstract deadline - June 2, 2017: Full paper deadline - July 14, 2017: Author notification **** Invited Speakers **** - Alexandru Baltag, UVA, NL - Edward Hermann Haeusler, PUC-Rio, BR **** PC Chairs **** - Alexandre Madeira (UM & UA, PT) - M?rio Benevides (UFRJ, BR) **** Program Committee: **** - Carlos Areces (U. Cordoba, AR) - Phillippe Balbiani (U. Toulouse, FR) - Alexandru Baltag (Uva, NL) - Lu?s S. Barbosa (U.Minho, PT) - Johan van Benthem (U.Stanford & U.Tsinghua) - Patrick Blackburn (U. Roskilde, DK) - St?phane Demri (ENS Cachan, FR) - Hans van Ditmarsch (LORIA, Nancy, FR) - Francicleber M. Ferreira (UFC, BR) - Valentin Goranko (U. Stockholm, SE) - Edward H. Hauesler (PUC-Rio, BR) - Rolf Hennicker (LMU, Munchen, DE) - Andreas Herzig (Toulouse, FR) - Dexter Kozen (Cornell, USA) - Clemens Kupke (U.Strathclyde, UK) - Bruno Vieira Lopes (UFF, BR) - Paulo Mateus (IST, PT) - Manuel A. Martins (U.Aveiro, PT) - Carlos Olarte (UFRN, BR) - Jos? N. Oliveira (U. Minho, PT) - Andr? Platzer (CMU, USA) - Eug?nio Rocha (U. Aveiro, PT) - Val?ria de Paiva (NC, USA) - Regivan Santiago (UFRN, BR) - Luis Menasche Schechter (UFRJ, BR) - Alexandra Silva (UCL, UK) - Tinko Tinchev (U. Sofia, BG) - Petrucio Viana (UFF, BR) - Yde Venema (ILLC, NL) - Renata Wassermann (USP, BR) From mogel at itu.dk Fri Feb 3 04:40:33 2017 From: mogel at itu.dk (=?utf-8?B?UmFzbXVzIEVqbGVycyBNw7hnZWxiZXJn?=) Date: Fri, 3 Feb 2017 09:40:33 +0000 Subject: [TYPES/announce] Postdoc position at IT University of Copenhagen Message-ID: <5D1CCCC4-F685-46C3-A089-F806934ED0AF@itu.dk> Dear all, I would like to advertise a 2-year postdoc position available at the IT University of Copenhagen, Denmark. The suggested starting date is August 2017, but this is negotiable. The position is part of my research project Type Theories for Reactive Programming funded by Villum Fonden, and running for 5 years involving 2 PhDs and 2 postdoc positions in total. I include a short description of the goals of the project below. Applicants should have experience with category theory and denotational semantics. Knowledge of models of (dependent) type theory or functional reactive programming is an advantage, but is not required. The deadline for application is February 28. Further information on the position and how to apply can be found here: http://bit.ly/2kl7zRy I encourage all interested in applying to contact me in advance. Rasmus M?gelberg ------------------------- Project description Type theories are formal systems that can be viewed both as programming languages and logical systems for formalised mathematics. From a computer science perspective, this is useful because it allows for programs, their specifications, and the proofs that these satisfy the specification to be expressed in the same formalism. The logical interpretation of type theories means that all programs must terminate. For this reason, programming and reasoning about non-terminating reactive programs in type theory remains a challenge. This is unfortunate since these include many of the most critical programs in use today. In this project, we aim to design a new type theory useful for programming with and reasoning about reactive programs. We build on recent progress in guarded recursion and functional reactive programming, using modalities to capture productivity in types. The project also involves the development of Guarded Cubical Type Theory, an extension of Cubical Type Theory with guarded recursive types. These can be used for smooth programming with coinductive types and construction of models of advanced programming languages. This part of the project is a collaboration with professor Lars Birkedal at Aarhus University. Type theories are formal systems that can be viewed both as programming languages and logical systems for formalised mathematics. From a computer science perspective, this is useful because it allows for programs, their specifications, and the proofs that these satisfy the specification to be expressed in the same formalism. The logical interpretation of type theories means that all programs must terminate. For this reason, programming and reasoning about non-terminating reactive programs in type theory remains a challenge. This is unfortunate since these include many of the most critical programs in use today. In this project, we aim to design a new type theory useful for programming with and reasoning about reactive programs. We build on recent progress in guarded recursion and functional reactive programming, using modalities to capture productivity in types. The project also involves the development of Guarded Cubical Type Theory, an extension of Cubical Type Theory with guarded recursive types. These can be used for smooth programming with coinductive types and construction of models of advanced programming languages. This part of the project is a collaboration with professor Lars Birkedal at Aarhus University. - See more at: https://candidate.hr-manager.net/ApplicationInit.aspx?cid=119&ProjectId=180828&MediaId=5#sthash.uggmBukd.dpu Project description Type theories are formal systems that can be viewed both as programming languages and logical systems for formalised mathematics. From a computer science perspective, this is useful because it allows for programs, their specifications, and the proofs that these satisfy the specification to be expressed in the same formalism. The logical interpretation of type theories means that all programs must terminate. For this reason, programming and reasoning about non-terminating reactive programs in type theory remains a challenge. This is unfortunate since these include many of the most critical programs in use today. In this project, we aim to design a new type theory useful for programming with and reasoning about reactive programs. We build on recent progress in guarded recursion and functional reactive programming, using modalities to capture productivity in types. The project also involves the development of Guarded Cubical Type Theory, an extension of Cubical Type Theory with guarded recursive types. These can be used for smooth programming with coinductive types and construction of models of advanced programming languages. This part of the project is a collaboration with professor Lars Birkedal at Aarhus University. - See more at: https://candidate.hr-manager.net/ApplicationInit.aspx?cid=119&ProjectId=180828&MediaId=5#sthash.uggmBukd.dpuf Project description Type theories are formal systems that can be viewed both as programming languages and logical systems for formalised mathematics. From a computer science perspective, this is useful because it allows for programs, their specifications, and the proofs that these satisfy the specification to be expressed in the same formalism. The logical interpretation of type theories means that all programs must terminate. For this reason, programming and reasoning about non-terminating reactive programs in type theory remains a challenge. This is unfortunate since these include many of the most critical programs in use today. In this project, we aim to design a new type theory useful for programming with and reasoning about reactive programs. We build on recent progress in guarded recursion and functional reactive programming, using modalities to capture productivity in types. The project also involves the development of Guarded Cubical Type Theory, an extension of Cubical Type Theory with guarded recursive types. These can be used for smooth programming with coinductive types and construction of models of advanced programming languages. This part of the project is a collaboration with professor Lars Birkedal at Aarhus University. - See more at: https://candidate.hr-manager.net/ApplicationInit.aspx?cid=119&ProjectId=180828&MediaId=5#sthash.uggmBukd.dpu Project description Type theories are formal systems that can be viewed both as programming languages and logical systems for formalised mathematics. From a computer science perspective, this is useful because it allows for programs, their specifications, and the proofs that these satisfy the specification to be expressed in the same formalism. The logical interpretation of type theories means that all programs must terminate. For this reason, programming and reasoning about non-terminating reactive programs in type theory remains a challenge. This is unfortunate since these include many of the most critical programs in use today. In this project, we aim to design a new type theory useful for programming with and reasoning about reactive programs. We build on recent progress in guarded recursion and functional reactive programming, using modalities to capture productivity in types. The project also involves the development of Guarded Cubical Type Theory, an extension of Cubical Type Theory with guarded recursive types. These can be used for smooth programming with coinductive types and construction of models of advanced programming languages. This part of the project is a collaboration with professor Lars Birkedal at Aarhus University. - See more at: https://candidate.hr-manager.net/ApplicationInit.aspx?cid=119&ProjectId=180828&MediaId=5#sthash.uggmBukd.dpufProject description Type theories are formal systems that can be viewed both as programming languages and logical systems for formalised mathematics. From a computer science perspective, this is useful because it allows for programs, their specifications, and the proofs that these satisfy the specification to be expressed in the same formalism. The logical interpretation of type theories means that all programs must terminate. For this reason, programming and reasoning about non-terminating reactive programs in type theory remains a challenge. This is unfortunate since these include many of the most critical programs in use today. In this project, we aim to design a new type theory useful for programming with and reasoning about reactive programs. We build on recent progress in guarded recursion and functional reactive programming, using modalities to capture productivity in types. The project also involves the development of Guarded Cubical Type Theory, an extension of Cubical Type Theory with guarded recursive types. These can be used for smooth programming with coinductive types and construction of models of advanced programming languages. This part of the project is a collaboration with professor Lars Birkedal at Aarhus University. - See more at: https://candidate.hr-manager.net/ApplicationInit.aspx?cid=119&ProjectId=180828&MediaId=5#sthash.uggmBukd.dpuf -------------- next part -------------- An HTML attachment was scrubbed... URL: From Richard.Moot at labri.fr Wed Feb 1 10:57:23 2017 From: Richard.Moot at labri.fr (Richard Moot) Date: Wed, 1 Feb 2017 16:57:23 +0100 Subject: [TYPES/announce] Call for International Conference for Computational Semantics (IWCS) Workshop Proposals Message-ID: CALL FOR IWCS WORKSHOP PROPOSALS 12th International Conference on Computational Semantics (IWCS) LIRMM & Universite de Montpellier, France 20th-22nd September 2017 (workshops on 19th) http://www.lirmm.fr/iwcs2017/workshops/index.html Proposal deadline: 10th February 2017 The International Conference for Computational Semantics (IWCS) invites proposals for one-day or half-day workshops, to be held in conjunction with the 2017 IWCS conference. IWCS 2017 will take place on 20th-22nd September 2017 at LIRMM, Universite de Montpellier, France. Workshops will take place on the day immediately preceding the conference: 19th September 2017. The aim of the IWCS conference is to bring together researchers interested in any aspects of the computation, annotation, extraction, and representation of meaning in natural language, whether this is from a lexical or structural semantic perspective. IWCS embraces both symbolic and statistical approaches to computational semantics, and everything in between. TOPICS OF INTEREST Topics of interest for the workshops include all subdomains of computational semantics relevant to the main conference, including but not limited to: - representation of meaning - syntax-semantics interface - representing and resolving semantic ambiguity - shallow and deep semantic processing and reasoning - hybrid symbolic and statistical approaches to representing semantics - alternative approaches to compositional semantics - inference methods for computational semantics - recognizing textual entailment - deep learning and semantics - learning by reading - methodologies and practices for semantic annotation - machine learning of semantic structures - statistical semantics - computational aspects of lexical semantics - semantics and ontologies - semantic web and natural language processing - semantic aspects of language generation - semantic relations in discourse and dialogue - semantics and pragmatics of dialogue acts - multimodal and grounded approaches to computing meaning - semantics-pragmatics interface SUBMISSION INFORMATION Proposals for workshops should contain: - A title and brief (2-page max) description of the workshop topic and content. - An estimate of the audience size. - The names, postal addresses, and email addresses of the organizers, with one-paragraph statements of their research interests and areas of expertise. - A list of potential members of the program committee, with an indication of which members have already agreed. - A description of special requirements for technical needs. Proposals should be submitted by email to iwcs2017 at gmail.com as soon as possible, but no later than 10th February 2017. Notification of acceptance of workshop proposals will occur no later than 17th February 2017. AFTER ACCEPTANCE Organizers of accepted workshops must provide descriptions of their workshops, for inclusion in the conference registration material, by 1st April 2017. The description must be provided in two formats: an ASCII version that can be included with the email announcement, and an HTML version that can be included on the conference home page. These descriptions should be mailed to: iwcs2017 at gmail.com The final workshop materials must be received by the IWCS organizers by 4th September 2017. This includes the detailed proceedings (camera-ready versions of papers), which will be made available electronically, as well as a short workshop program, which will be printed together with the main conference program. FINANCES Workshops must be financially self-supporting. The IWCS organizers will establish registration rates so as to provide the room, audio-visual equipment, internet access, snacks for breaks, and the workshop proceedings. IMPORTANT DATES 10th February 2017 Workshop proposal submissions due 17th February 2017 Workshop proposal notification of acceptance 1st April 2017 Workshop description mailed to IWCS organizers 4 September 2017 Workshop material due to IWCS organizers 19th September 2017 Workshop date -------------- next part -------------- An HTML attachment was scrubbed... URL: From caterina.urban at inf.ethz.ch Fri Feb 3 04:49:23 2017 From: caterina.urban at inf.ethz.ch (Urban Caterina) Date: Fri, 3 Feb 2017 09:49:23 +0000 Subject: [TYPES/announce] SAS 2017 - First Call For Papers Message-ID: ---------------------------------------------------------------------- SAS 2017 24th Static Analysis Symposium New York City, NY, August 30th-September 1st, 2017 http://staticanalysis.org/sas2017 ---------------------------------------------------------------------- OBJECTIVE Static Analysis is widely recognized as a fundamental tool for program verification, bug detection, compiler optimization, program understanding, and software maintenance. The series of Static Analysis Symposia has served as the primary venue for the presentation of theoretical, practical, and application advances in the area. The 24th International Static Analysis Symposium, SAS 2017, will be held at New York University, New York City, NY, USA. Previous symposia were held in Edinburgh, Saint-Malo, Munich, Seattle, Deauville, Venice, Perpignan, Los Angeles, Valencia, Kongens Lyngby, Seoul, London, Verona, San Diego, Madrid, Paris, Santa Barbara, Pisa, Aachen, Glasgow, and Namur. TOPICS The technical program for SAS 2017 will consist of invited lectures and presentations of refereed papers. Contributions are welcomed on all aspects of static analysis, including, but not limited to: - Abstract domains - Abstract interpretation - Automated deduction - Data flow analysis - Debugging - Deductive methods - Emerging applications - Model checking - Program optimization and transformation - Program synthesis - Program verification - Security analysis - Tool environments and architectures - Theoretical frameworks - Type checking PAPER SUBMISSION Submissions can address any programming paradigm, including concurrent, constraint, functional, imperative, logic, object-oriented, aspect, multi-core, distributed, and GPU programming. Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal or a conference with refereed proceedings. Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should clearly identify what has been accomplished and why it is significant. Paper submissions should not exceed 18 pages in Springer's Lecture Notes in Computer Science LNCS format, excluding bibliography and well-marked appendices. Program Committee members are not required to read the appendices, and thus papers must be intelligible without them. Submissions are handled online through easychair: https://easychair.org/conferences/?conf=sas2017 ARTIFACT SUBMISSION As in previous years, we are encouraging authors to submit a virtual machine image containing any artifacts and evaluations presented in the paper. The goal of the artifact submissions is to strengthen our field's scientific approach to evaluations and reproducibility of results. The virtual machines will be archived on a permanent Static Analysis Symposium website to provide a record of past experiments and tools, allowing future research to better evaluate and contrast existing work. Artifact submission is optional. We accept only virtual machine images that can be processed with Virtual Box. Details on what to submit and how will be sent to the corresponding authors by mail shortly after the paper submission deadline. The submitted artifacts will be used by the program committee as a secondary evaluation criteria whose sole purpose is to find additional positive arguments for the paper's acceptance. Submissions without artifacts are welcome and will not be penalized. IMPORTANT DATES - Abstract submission: April 14, 2017 (anywhere on earth) - Full paper submission: April 20, 2017 (anywhere on earth) - Artifact submission: April 25, 2017 (anywhere on earth) - Author notification: June 12, 2017 - Final version due: July 5, 2017 - Conference: August 30 - September 1, 2017 CONFERENCE VENUE The conference will be held in the Forbes Building of the New York University, 60 Fifth Avenue, New York City. RADHIA COUSOT AWARD Since 2014, the program committee of each SAS conference selects a paper for the Radhia Cousot Young Researcher Best Paper Award, in memory of Radhia Cousot, and her fundamental contributions to static analysis, as well as being one of the main promoters and organizers of the SAS series of conferences. SPECIAL ISSUE Full versions of a selection of accepted papers, to be determined by the program committee, will be invited for submission to Formal Methods in System Design journal. INVITED SPEAKERS Alex Aiken (Stanford University, USA) Francesco Logozzo (Facebook, USA) Peter M?ller (ETH Zurich, Switzerland) AFFILIATED EVENTS - NSAD: The 7th Workshop on Numerical and Symbolic Abstract Domains - SASB: The 8th Workshop on Static Analysis and Systems Biology - TAPAS: The 8th Workshop on Tools for Automatic Program Analysis PROGRAM CHAIR Francesco Ranzato (University of Padova, IT) PROGRAM COMMITTEE Elvira Albert (Complutense University of Madrid, ES) Jade Alglave (University College London, UK) Josh Berdine (Facebook, UK) Aleksandar Chakarov (University of Colorado Boulder, USA) Liqian Chen (National University of Defense Technology, CN) Maria Christakis (University of Kent, UK) Pierre Ganty (Imdea, ES) Alberto Griggio (FBK, IT) Arie Gurfinkel (University of Waterloo, CA) Thomas Jensen (INRIA, FR) Laura Kovacs (Vienna University of Technology, AT) Ana Milanova (Rensselaer Polytechnic Institute, USA) Anders Moeller (Aarhus University, DK) Kedar Namjoshi (Bell Labs Nokia, USA) Andreas Podelski (University of Freiburg, DE) Xavier Rival (CNRS/ENS/INRIA, FR) Ilya Sergey (University College London, UK) Harald Sondergaard (The University of Melbourne, AU) Fausto Spoto (University of Verona/Julia, IT) Caterina Urban (ETH Zurich, CH) David Van Horn (University of Maryland, USA) Arnaud J. Venet (Google, USA) Eran Yahav (Technion, IL) LOCAL CHAIR Patrick Cousot (New York University, USA) PUBLICITY CHAIR Caterina Urban (ETH Zurich, CH) From rl.stpuu at gmail.com Fri Feb 3 18:57:39 2017 From: rl.stpuu at gmail.com (Roussanka Loukanova) Date: Sat, 4 Feb 2017 00:57:39 +0100 Subject: [TYPES/announce] CfP - Logic, Information, Language, Memory, Reasoning 2017 (LogInfoLangMR'17) New Deadline Feb 13, 2017 Message-ID: ========================================================================= CALL FOR PAPERS Special Session on Logic, Information, Language, Memory, Reasoning 2017 (LogInfoLangMR?17) http://www.dcai-conference.net/special-sessions/loginfolangmr 14th International Conference on Distributed Computing and Artificial Intelligence 2017 (DCAI'17) Polytechnic of Porto, Porto (Portugal) June 21-23, 2017 * Submission deadline: February 13, 2017 * ========================================================================= DESCRIPTION ===== We are in the reality of systems that model human language, reasoning, and use advanced techniques for saving and accessing information. Prominently, computational processing of human language is an interdisciplinary area of research and development of computerized systems. In nature, relations between information, language, reasoning, and memory have many, interdependent facets that can be heterogeneous. Theories, applications, and technologies strive to meet adequate treatment of natural phenomena of information, language, and information exchange. Furthermore, integrated approaches from mathematics and computer science provide support for reliable, advanced, applications. We welcome submissions of papers on the following topics, without limiting to them, across theories, applications, methods, approaches, and technologies: - Logic for applications to language processing - Classic and new theories of formal and natural languages - Computational processing of natural language --- approaches, theories, methods, computerized systems - Computational morphology, syntax, semantics, and syntax-semantics interfaces - Multilingual Processing - Speech Processing - Logic for reasoning systems --- theories and applications - Logic in data science - Information theories - Integration of data and reasoning - Models of computation - Mathematics for linguistics and cognitive science - Interdisciplinary approaches to computation, language, reasoning, memory, data - Computational theories and applications in life sciences - Computational neuroscience of information, language, memory, reasoning - Computational aspects of information, languages, and memory in nature IMPORTANT DATES ===== Submission dates: 13th February, 2017 Notification date: 13th March, 2017 Paper ready deadline: 27th March, 2017 Conference dates: 21st-23rd June, 2017 SUBMISSION INSTRUCTIONS ===== DCAI Special Session papers must be formatted according to the Springer LNCS Template, with a maximum length of 8 pages, including figures and references. All proposed papers must be submitted in electronic form (PDF format) using the Paper Submission Page: http://www.dcai-conference.net/special-sessions PUBLICATION: ===== Accepted papers will be included in DCAI Proceedings. At least one of the authors will be required to register and attend the symposium to present the paper in order to include the paper in the conference proceedings. All accepted papers will be published by Advances in Intelligent Systems and Computing series of Springer Verlag. For more details, see: http://www.dcai-conference.net/special-sessions CO-CHAIRS: ===== Roussanka Loukanova, Stockholm University, Sweden Kristina Liefke, Ludwig-Maximilians-University Munich, Germany CONTACT: ===== Roussanka Loukanova (rloukanova at gmail.com) Kristina Liefke (Kristina.Liefke at lrz.uni-muenchen.de) From bogom.s at gmail.com Sat Feb 4 04:39:34 2017 From: bogom.s at gmail.com (Sergiy Bogomolov) Date: Sat, 4 Feb 2017 20:39:34 +1100 Subject: [TYPES/announce] CfP: DEADLINE EXTENSION for 3rd International Workshop on Symbolic and Numerical Methods for Reachability Analysis (ETAPS 2017) Message-ID: <000201d27eca$9bb771f0$d32655d0$@gmail.com> CALL FOR PAPERS SNR 2017 -- DEADLINE EXTENSION UNTIL FEBRUARY 17 ======== 3rd International Workshop on Symbolic and Numerical Methods for Reachability Analysis April 22, 2017, Uppsala, Sweden Affiliated with ETAPS 2017 http://snr2017.pages.ist.ac.at/ Important Dates =============== Paper submission: February 17, 2017 Notification: March 10, 2017 Final version: March 24, 2017 Workshop date: April 22, 2017 Scope ===== Hybrid systems are complex dynamical systems that combine discrete and continuous components. Reachability questions, regarding whether a system can run into a certain subset of its state space, stand at the core of verification and synthesis problems for hybrid systems. There are several successful methods for hybrid systems reachability analysis. Some methods explicitly construct flow-pipes that over-approximate the set of reachable states over time, where efficient computation of such over-approximations requires symbolic representations such as support functions. Other methods based on satisfiability checking technologies, symbolically encode reachability properties as logical formulas, while solving such formulas requires numerically-driven decision procedures. Last but not least, also automated deduction and the usage of theorem provers led to efficient analysis approaches. The goal of this workshop is to bring together researchers working with different reachability analysis techniques and to seek for synergies between the different approaches. The SNR workshop solicits papers broadly in the area of analysis and synthesis of continuous and hybrid systems. The scope of the workshop includes, but is not restricted to, the following topics with application to continuous and hybrid systems: - Reachability analysis - Flow-pipe construction; symbolic state set representations - Logical frameworks for reasoning - Bounded model checking - Automated deduction - Invariant generation - Symbolic execution - Trajectory generation; counterexample computation - Abstraction techniques - Reliable integration - Simulation - Reachability analysis for planning and synthesis - Domain-specific approaches in biology, robotics, etc. - Stochastic/probabilistic hybrid systems Submission Information ====================== The workshop solicits - long research papers (not exceeding 15 pages excluding references), - short research papers (not exceeding 6 pages excluding references) and - work-in-progress papers (not exceeding 6 pages excluding references). Research papers must present original unpublished work which is not submitted elsewhere. In order to foster the exchange of ideas, we also encourage work-in-progress papers, which present recent or on-going work. The papers should be written in English and formatted according to the EPTCS guidelines (http://style.eptcs.org/). Papers can be submitted using the EasyChair system: https://easychair.org/conferences/?conf=snr2017 All submissions will undergo a peer-reviewing process. Accepted research papers will be presented at the workshop and published in the Electronic Proceedings in Theoretical Computer Science (EPTCS, http://www.eptcs.org/). Accepted work-in-progress papers will be presented at the workshop but will not be included in the proceedings. Invited Speakers ================ TBA Workshop Co-Chairs ================== Erika Abraham (RWTH Aachen University, Germany) Sergiy Bogomolov (Australian National University, Australia) Publicity Chair =============== Przemyslaw Daca (Institute of Science and Technology Austria, Austria) Program Committee ================= Matthias Althoff (Technische Universitaet Muenchen, Germany) Stanley Bak (United States Air Force Research Lab, USA) Franck Cassez (Macquarie University, Australia) Xin Chen (University of Colorado at Boulder, USA) Thao Dang (CNRS/VERIMAG, France) Martin Fraenzle (University of Oldenburg, Germany) Goran Frehse (Verimag, France) Antoine Girard (L2S, CNRS, France) Thomas Heinz (Robert Bosch GmbH, Germany) Hui Kong (Institute of Science and Technology Austria, Austria) Oleksandr Letychevskyi (Glushkov Institute of Cybernetics, Ukraine) Nikolaj Nikitchenko (Kyiv National Taras Shevchenko University, Ukraine) Maria Prandini (Politecnico di Milano, Italy) Stefan Ratschan (Academy of Sciences, Czech Republic) Rajarshi Ray (National Institute of Technology Meghalaya, India) Stavros Tripakis (Aalto University, Finland, and UC Berkeley, USA) Vladimir Ulyantsev (ITMO University, Russia) Edmund Widl (Austrian Institute of Technology, Austria) Paolo Zuliani (University of Newcastle, UK)" -------------- next part -------------- An HTML attachment was scrubbed... URL: From alexandra.silva at ucl.ac.uk Sat Feb 4 13:04:36 2017 From: alexandra.silva at ucl.ac.uk (Alexandra Silva) Date: Sat, 4 Feb 2017 13:04:36 -0500 Subject: [TYPES/announce] TbILLC 2017: 1st Call for Papers Message-ID: <201702041804.v14I4aJE032507@sympathy.seas.upenn.edu> 1st Call for Papers THE TWELFTH INTERNATIONAL TBILISI SYMPOSIUM ON LANGUAGE, LOGIC AND COMPUTATION 18-22 September, 2017 Kakheti, Georgia http://events.illc.uva.nl/Tbilisi/Tbilisi2017/ *********************************************************************** CALL FOR PAPERS The Twelfth International Tbilisi Symposium on Language, Logic and Computation will be held on 18-22 September 2017 in Kakheti, Georgia. The Programme Committee invites submissions for contributions on all aspects of language, logic and computation. Work of an interdisciplinary nature is particularly welcome. Areas of interest include, but are not limited to: * Natural language syntax, semantics, and pragmatics * Linguistic typology and semantic universals * Language evolution and learnability * Historical linguistics, history of logic * Natural logic, inference and entailment in natural language * Logic, games, and formal pragmatics * Logics for artificial intelligence * Constructive, modal and algebraic logic * Algorithmic game theory * Computational social choice * Formal models of multiagent systems * Information retrieval, query answer systems * Distributional and probabilistic models of information and meaning Authors can submit an abstract of three pages (including references) at the EasyChair conference system here: https://easychair.org/conferences/?conf=tbillc2017 PROGRAMME The programme will include the following tutorials and a series of invited lecturers. Tutorials: Language: Jakub Szymanik (University of Amsterdam) Logic: Sam van Gool (City College of New York) Computation: TBA Invited speakers: Language: Gemma Boleda (Universitat Pompeu Fabra) Ruth Kempson (King's College, London) Logic: Alexander Kurz (University of Leicester) Eric Pacuit (University of Maryland, tbc) Computation: Dexter Kozen (Cornell University) Alex Simpson (University of Ljubljana) Workshops There will also be a workshop on "Language entitled Signs and gestures -- exploring the divide between sign language and speech-accompanying gestures" organised by by Daniel Hole (University of Stuttgart). More information will be available on the TbiLLC website: http://events.illc.uva.nl/Tbilisi/Tbilisi2017/ Programme Committee Samson Abramsky (Oxford University) Kata Balogh (University of Duesseldorf) Guram Bezhanishvili (New Mexico State University) Nick Bezhanishvili (ILLC, University of Amsterdam) Rajesh Bhatt (UMass Amherst) Filippo Bonchi (University of Pisa) Valeria De Paiva (University of Birmingham) David Gabelaia (TSU, Razmadze Mathematical Institute) Brunella Gerla (University of Insubria) Nina Gierasimczuk (ILLC, University of Amsterdam) Helle Hvid Hansen (Delft University of Technology) Daniel Hole (University of Stuttgart) George Metcalfe (University of Bern) Alessandra Palmigiano (Delft University of Technology) Wiebke Petersen (Chair, University of Duesseldorf) Mehrnoosh Sadrzadeh (Queen Mary University of London) Alexandra Silva (Chair, University College London) Sonja Smets (ILLC, University of Amsterdam) Rui Soares Barbosa (University of Oxford) Luca Spada (University of Salerno) Carla Umbach (Zentrum f??r Allgemeine Sprachwissenschaft, ZAS, Berlin) Galit W. Sassoon (Bar Ilan University) Henk Zeevat (ILLC, University of Amsterdam) PUBLICATION INFORMATION Post-proceedings of the symposium will be published in the LNCS series of Springer. IMPORTANT DATES Submission deadline: 15 March 2017 Notification: 15 May 2017 Final abstracts due: 15 June 2017 Registration deadline: 1 August 2017 Symposium: September 18-22, 2017 Programme and submission details can be found at: http://events.illc.uva.nl/Tbilisi/Tbilisi2017/ From alexandra.silva at ucl.ac.uk Sun Feb 5 09:57:38 2017 From: alexandra.silva at ucl.ac.uk (Alexandra Silva) Date: Sun, 5 Feb 2017 09:57:38 -0500 Subject: [TYPES/announce] FORTE 2017: Deadline Extension Message-ID: <201702051457.v15Evc6j007700@sympathy.seas.upenn.edu> * Highlights * Deadline extension -- abstracts due Feb 17th, full papers Feb 24th. We welcome four kinds of submissions: Full papers (15 pages), Short Papers & Tool demos (7 pages), Posters (3 pages) We are delighted to announce our invited speaker : Rupak Majumdar (MPI-SWS) ********************************************************************************* FORTE 2017 37th IFIP International Conference on Formal Techniques for Distributed Objects, Components and Systems ********************************************************************************* * Scope * FORTE 2017 is a forum for fundamental research on theory, models, tools, and applications for distributed systems. The conference solicits original contributions that advance the science and technologies for distributed systems, with special interest in the areas of: - Component- and model-based design - Object technology, modularity, software adaptation - Service-oriented, ubiquitous, pervasive, grid, cloud, and mobile computing systems - Software quality, reliability, availability, and safety; - Security, privacy, and trust in distributed systems; - Adaptive distributed systems, self-stabilization; - Self-healing/organizing; - Verification, validation, formal analysis, and testing of the above. Contributions that combine theory and practice and that exploit formal methods and theoretical foundations to present novel solutions to problems arising from the development of distributed systems are encouraged. FORTE covers distributed computing models and formal specification, testing and verification methods. The application domains include all kinds of application-level distributed systems, telecommunication services, Internet, embedded and real-time systems, as well as networking and communication security and reliability. Topics of interest include but are not limited to: - Languages and semantic foundations: new modeling and language concepts for distribution and concurrency, semantics for different types of languages, including programming languages, modeling languages, and domain-specific languages; real-time and probability aspects; - Formal methods and techniques: design, specification, analysis, verification, validation, testing and runtime verification of various types of distributed systems including communications and network protocols, service-oriented systems, adaptive distributed systems, cyber-physical systems and sensor networks; - Foundations of security: new principles for qualitative and quantitative security analysis of distributed systems, including formal models based on probabilistic concepts; - Applications of formal methods: applying formal methods and techniques for studying quality, reliability, availability, and safety of distributed systems; - Practical experience with formal methods: industrial applications, case studies and software tools for applying formal methods and description techniques to the development and analysis of real distributed systems. * Important Dates * - February 17, 2017: Submission of abstract - February 24, 2017: Submission of papers - April 10, 2017: Notification of acceptance - April 24, 2017: Final version - June 19-22, 2017: Conference and workshops * Submission and publication * Contributions must be written in English and report on original, unpublished work, not submitted for publication elsewhere (cf. IFIP???s codes of conduct). The submissions must be prepared using Springer???s LNCS style. Submissions not adhering to the specified constraints may be rejected without review. Papers must be submitted electronically in pdf via the FORTE???17 interface of the EasyChair system (https://easychair.org/conferences/?conf=forte2017). We solicit four kinds of submissions: - Full papers (up to 15 pages): Describing thorough and complete research results, tools or experience reports. - Short papers (up to 7 pages): Describing research results that are not fully developed, or manifestos, calls to action, personal views on FORTE related research, on the current state of the art, or on prospects for the years to come. - Tool demonstration papers (up to 7 pages): focus on the usage aspects of tools. Theoretical foundations and experimental evaluation are not required, however, a motivation as to why the tool is interesting and significant should be provided. Papers may have an appendix of up to 5 additional pages with details on the actual demonstration. - Posters (up to 3 pages): Students can submit descriptions of posters that will be presented at the conference - during a students poster session. Neither the descriptions or the posters will be published in the proceedings. Each paper will undergo a peer review of at least 3 anonymous reviewers. The conference proceedings will be published by Springer in the LNCS Series. The best papers will be invited after the conference to contribute to a special issue of a top-level journal. * Publication * Each paper will undergo a thorough process of review and the conference proceedings will be published by Springer-Verlag in the LNCS series. * Program Committee Chairs * Ahmed Bouajjani, University Paris Diderot, France Alexandra Silva, University College London, U * Program committee * Elvira Albert, Complutense University of Madrid, Spain Luis Barbosa, University of Minho, Portugal Gilles Barthe, IMDEA Software Institute, Spain Borzoo Bonakdarpour, McMaster University, Canada Franck Cassez, Macquarie University, Australia Hana Chokler, King???s College London, UK Pedro D???Argenio, National University of Cordoba & CONICET, Argentina Frank De Boer, CWI, Netherlands Mariangiola Dezani-Ciancaglini, University of Torino, Italy Cezara Dragoi, INRIA, ENS Paris, France Michael Emmi, Bell Labs Nokia, USA Carla Ferreira, Universidade Nova de Lisboa, Portugal Bart Jacob, Katholieke Universiteit Leuven, Belgium Sophia Knight, Uppsala University, Sweden Annabelle McIver, Macquarie University, Australia Stephan Merz, INRIA Nancy, France Stefan Milius, FAU Erlangen, Germany Catuscia Palamidessi, INRIA Paris, France Corina Pasareanu, NASA Ames, USA Anna Philippou, University of Cyprus, Cyprus Sanjiva Prasad, IIT Delhi, India Ana Sokolova, University of Salzburg, Austria Marielle Stoelinga, University of Twente, Netherlands From francesco.tiezzi at unicam.it Mon Feb 6 10:43:34 2017 From: francesco.tiezzi at unicam.it (Francesco Tiezzi) Date: Mon, 6 Feb 2017 16:43:34 +0100 Subject: [TYPES/announce] COORDINATION 2017 - Deadline Extension Message-ID: [We apologize for multiple copies] ====================================================================== COORDINATION 2017 19th International Conference on Coordination Models and Languages Neuchatel, Switzerland, June 19-21 2017 http://2017.discotec.org ====================================================================== Publications * Publication of the proceedings in the Lecture Notes of Computer Science of Springer-Verlag * Publication of extended versions of selected work is planned in a special issue of an international journal as in previous issues of COORDINATION ====================================================================== IMPORTANT DATES * (Extended) Submission of abstract: February 17, 2017 * (Extended) Submission of papers: February 24, 2017 * Conference: June 19-21, 2017 CONFERENCE GOALS Modern information systems rely increasingly on combining concurrent, distributed, mobile, adaptive, reconfigurable and heterogenous components. New models, architectures, languages and verification techniques are necessary to cope with the complexity induced by the demands of today's software development. Coordination languages have emerged as a successful approach, in that they provide abstractions that cleanly separate behaviour from communication, therefore increasing modularity, simplifying reasoning, and ultimately enhancing software development. Building on the success of the previous editions, this conference provides a well-established forum for the growing community of researchers interested in models, languages, architectures, and implementation techniques for coordination. Topics of interest encompass all areas of coordination, including (but not limited to) coordination related aspects of: * Theoretical models and foundations for coordination: component composition, concurrency, mobility, dynamic, spatial and probabilistic aspects of coordination, emergent behaviour, types, semantics; * Specification, refinement, and analysis of architectures: patterns and styles, verification of functional and non-functional properties, including performance aspects; * Coordination, architectural, and interface definition languages: implementation, interoperability, heterogeneity; * Middlewares and coordination; * Dynamic software architectures: distributed mobile code, configuration, reconfiguration, networked computing, parallel, high-performance and cloud computing; * Nature- and bio-inspired approaches to coordination; * Coordination of multiagent and collective systems: models, languages, infrastructures, self-adaptation, self-organisation, distributed solving, collective intelligence and emerging behaviour; * Coordination and modern distributed computing: Web services, peer-to-peer networks, grid computing, context-awareness, ubiquitous computing, mobile computing; * Programming languages, middleware, tools, and environments for the development of coordinated applications; * Programming methodologies and verification of coordinated applications; * Industrial relevance of coordination and software architectures: programming in the large, domain-specific software architectures and coordination models, case studies; * Interdisciplinary aspects of coordination. PROCEEDINGS The conference proceedings will be published by Springer, in the Lecture Notes in Computer Science (LNCS) series. Extended versions of a selection of the best papers is planned to be published in a special issue of an international journal as in previous issues of COORDINATION. SUBMISSION INSTRUCTIONS Authors are invited to submit full papers electronically in PostScript or PDF using a two-phase online submission process. Registration of the paper information and abstract (max. 250 words) must be completed before February 3, 2017. Submission of the full paper is due no later than February 10, 2017. Submissions are handled through the EasyChair conference management system, accessible from the conference web site: http://2017.discotec.org . Contributions must be written in English and report on original, unpublished work not submitted for publication elsewhere (cf. IFIP?s Author Code of Conduct, see http://www.ifip.org/ under Publications/Links). The submissions must not exceed the total page number limit (see below), including figures and references, prepared using Springer?s LNCS style. Submissions not adhering to the above specified constraints may be rejected without review. Papers should be submitted as PDF or PS via EasyChair. We solicit two kinds of submissions: * Full papers (up to 16 pages + 2 pages references): describing thorough and complete research results and experience reports. * Short papers (up to 8 pages + 1 page references): describing research in progress or opinion papers on the past of Coordination research, on the current state of the art, or on prospects for the years to come. The conference proceedings, formed by accepted submissions of both kinds above, will be published by Springer in the LNCS Series. Extended versions of a selection of the best full papers is planned to be published in a special issue of an international journal as in previous issues of COORDINATION. PROGRAM COMMITTEE Co-Chairs Jean-Marie Jacquet University of Namur, Belgium Jean-Marie.Jacquet at unamur.be staff.info.unamur.be/jmj Mieke Massink CNR-ISTI, Italy Mieke.Massink at isti.cnr.it www.isti.cnr.it/People/M.Massink Members Gul Agha University of Illinois at Urbana-Champaign, USA Farhad Arbab CWI and Leiden University, The Netherlands Jacob Beal Raytheon BBN Technologies, USA Simon Bliudze EPFL, Switzerland Frank de Boer CWI and Leiden University, The Netherlands Antonio Brogi University of Pisa, Italy Roberto Bruni University of Pisa, Italy Vincenzo Ciancia CNR-ISTI, Italy Dave Clarke Uppsala University, Sweden Ferruccio Damiani Universit? di Torino, Italy Wolfgang De Meuter Vrije Universiteit Brussel, Belgium Rocco De Nicola IMT - Institute for Advanced Studies, Italy Erik de Vink Eindhoven University of Technology, The Netherlands Schahram Dustdar TU Wien, Austria Jos? Luiz Fiadeiro Royal Holloway University of London, United Kingdom Stephen Gilmore University of Edinburgh, United Kingdom Paola Inverardi University of l'Aquila, Italy Ramtin Khosravi University of Tehran, Iran Eva Kuhn Vienna University of Technology, Austria Alberto Lluch Lafuente Technical University of Denmark, Denmark Michele Loreti University of Florence, Italy Hernan Melgratti University of Buenos Aires, Argentina Andrea Omicini University of Bologna, Italy Ernesto Pimentel University of Malaga, Spain Gwen Salaun University of Grenoble Alpes, France Marjan Sirjani Reykjavik University, Iceland Vasco T. Vasconcelos University of Lisbon, Portugal Carolyn Talcott SRI International, USA Emilio Tuosto University of Leicester, UK Mirko Viroli University of Bologna, Italy Takuo Watanabe Tokyo Institute of Technology, Japan Danny Weyns Katholieke Universiteit Leuven, Belgium Martin Wirsing Ludwig-Maximilians-Universit?t M?nchen, Germany PUBLICITY CHAIR Francesco Tiezzi University of Camerino, Italy STEERING COMMITTEE Gul Agha University of Illinois at Urbana Champaign, USA Farhad Arbab CWI and Leiden University, The Netherlands Dave Clarke Uppsala University, Sweden Tom Holvoet KU Leuven, Belgium Jean-Marie Jacquet University of Namur, Belgium Christine Julien The University of Texas at Austin, USA Eva K?hn Vienna University of Technology, Austria Alberto Lluch Lafuente Technical University of Denmark, Denmark Wolfgang De Meuter Vrije Universiteit Brussels, Belgium Rocco De Nicola IMT - Institute for Advanced Studies Lucca, Italy Jose Proenca University of Minho, Portugal Rosario Pugliese Universit? di Firenze, Italy Marjan Sirjani Reykjavik University, Iceland Carolyn Talcott SRI International, California, USA Vasco T. Vasconcelos University of Lisbon, Portugal Gianluigi Zavattaro University of Bologna, Italy (Chair) Mirko Viroli University of Bologna, Italy -------------- next part -------------- An HTML attachment was scrubbed... URL: From herbert at doc.ic.ac.uk Mon Feb 6 07:11:13 2017 From: herbert at doc.ic.ac.uk (herbert at doc.ic.ac.uk) Date: Mon, 6 Feb 2017 12:11:13 +0000 Subject: [TYPES/announce] QAPL'17 - Extended Deadline (Regular Papers) & Call for Presentations Message-ID: <91163833-8000-1e57-f3f6-e793a3975f85@imperial.ac.uk> ************************************************************************** 15th Workshop on Quantitative Aspects of Programming Languages and Systems QAPL 2017 Affiliated with ETAPS 2017 Uppsala, Sweden, Sunday 23 April 2017 http://qapl17.doc.ic.ac.uk ************************************************************************** IMPORTANT DATES: For regular papers: Submission (extended): 12 February 2017 (AoE) Notification: 10 March 2017 (AoE) Final version (ETAPS proceedings): 25 March 2017 (AoE) Final version (EPTCS proceedings): TBA For presentation reports: Submission: 12 March 2017 (AoE) Notification: 15 March 2016 (AoE) SUBMISSIONS: In order to encourage participation and discussion, this workshop solicits two types of submissions - regular papers and presentations: 1. Regular paper: Submissions must be original work, and must not have been previously published, nor be under consideration for publication elsewhere. Regular paper submission must not exceed 12 pages (excluding the bibliography), additional technical material, proofs etc. can be provided in a clearly marked appendix which will be read by reviewers at their discretion. Regular papers will be reviewed by the PC. 2. Presentation reports concern recent or ongoing work on relevant topics and ideas, for timely discussion and feedback at the workshop. There is no restriction as for previous/future publication of the contents of a presentation. Typically, a presentation is based on a paper which recently appeared (or which is going to appear) in the proceedings of another recognized conference, or which has not yet been submitted. The (extended) abstract of presentation submissions should not exceed 4 pages. Presentation reports will be selected by the PC Chairs (based on the availability of presentation time). All submissions must be in PDF format and use the EPTCS LaTeX style, see http://style.eptcs.org/. Submissions can be made on the following website: http://www.easychair.org/conferences/?conf=qapl17 The workshop PC will review all regular paper submissions based on their relevance, merit, originality, and technical content. Presentation reports will receive a lightweight review to establish their relevance for the workshop. The authors of accepted submissions of both types are expected to present and discuss their work at the workshop. Accepted regular papers will be published electronically in the pre-proceedings available during the workshop and after the workshop in the Electronic Proceedings in Theoretical Computer Science (EPTCS) as post-proceedings. Short papers will not be included in the EPTCS post-proceedings. From sandra at dcc.fc.up.pt Mon Feb 6 10:02:05 2017 From: sandra at dcc.fc.up.pt (Sandra Alves) Date: Mon, 6 Feb 2017 15:02:05 +0000 Subject: [TYPES/announce] LSFA'17: First Call for Papers Message-ID: <21EF34B4-3286-4DAA-AB7C-5C283B604CBD@dcc.fc.up.pt> (Apologies for multiple copies of this announcement) ============================================================== CALL FOR PAPERS 12th Workshop on Logical and Semantic Frameworks, with Applications 23-24 September 2017, Bras?lia, Brazil Satellite event of TABLEAUX, FroCoS, and ITP 2017 http://lsfa2017.cic.unb.br/ Logical and semantic frameworks are formal languages used to represent logics, languages and systems. These frameworks provide foundations for the formal specification of systems and programming languages, supporting tool development and reasoning. LSFA 2017 aims to be a forum for presenting and discussing work in progress, and therefore to provide feedback to authors on their preliminary research. The proceedings are produced after the meeting, so that authors can incorporate this feedback in the published papers. LSFA 2017 will be a satellite event of TABLEAUX, FroCoS, and ITP -- to be held in Bras?lia, Brazil, between 25 and 29 September 2017. Previous editions took place in Porto (2016), Natal (2015), Bras?lia (2014), Sao Paulo (2013), Rio de Janeiro (2012), Belo Horizonte (2011), Natal (2010), Bras?lia (2009), Salvador (2008), Ouro Preto (2007), and Natal (2006). TOPICS OF INTEREST Topics of interest to this forum include, but are not limited to: * Automated deduction * Applications of logical and/or semantic frameworks * Computational and logical properties of semantic frameworks * Formal semantics of languages and systems * Implementation of logical and/or semantic frameworks * Lambda and combinatory calculi * Logical aspects of computational complexity * Logical frameworks * Process calculi * Proof theory * Semantic frameworks * Specification languages and meta-languages * Type theory SUBMISSION AND PUBLICATION Contributions should be written in English and submitted in the form of full papers with a maximum of 16 pages including references or short papers with a maximum of 6 pages including references. Additional technical material can be provided in a clearly marked appendix which will be read by reviewers at their discretion. Contributions must also be unpublished and not submitted simultaneously for publication elsewhere. The papers should be prepared in LaTeX using ENTCS style (http://www.entcs.org/prelim.html). The submission should be in the form of a PDF file uploaded to Easychair: https://easychair.org/conferences/?conf=lsfa2017 The workshop pre-proceedings, containing the reviewed extended abstracts, will be handed-out at workshop registration. After the workshop the authors of both full and short papers will be invited to submit full versions of their works for the post-proceedings to be published in ENTCS. At least one of the authors should register for the conference. Presentations should be in English. * Submission: 21 June 2017 * Notification: 21 July 2017 * Final pre-proceedings version due: 11 August 2017 * LSFA 2017 23-24 September 2017 According to the quality of proceedings, authors will/would/might be invited to submit an improved version of their paper for a special issue. Previous LSFA special issues have been published in journals such as J. IGPL and TCS (see http://lsfa.cic.unb.br). INVITED SPEAKERS * TBA PROGRAMME COMMITTEE * Sandra Alves, University of Porto - co-chair * Renata Wassermann, University of S?o Paulo - co-chair * Fl?vio L. C. de Moura, Universidade de Bras?lia - local organiser * Carlos Areces, Universidad Nacional de C?rdoba * Mauricio Ayala-Rincon, Universidade de Brasilia * Veronica Becher, Universidad de Buenos Aires * Mario Benevides, Universidade Federal do Rio de Janeiro UFRJ * Walter Carnielli, Centre for Logic, Epistemology and the History of Science ? CLE * Carlos Castro, UT Federico Santa Maria * Kaustuv Chaudhuri, INRIA * Marcelo Coniglio, UNICAMP * Valeria De Paiva, University of Birmingham * Santiago Escobar, Universitat Polit?cnica de Val?ncia * Amy Felty, University of Ottawa * Maribel Fern?ndez, King's College London * Marcelo Finger, Universidade de Sao Paulo * Ichiro Hasuo, University of Tokyo * Edward Hermann Haeusler, PUC-Rio * Delia Kesner, Universit? Paris-Diderot * Bjoern Lellmann, TU Vienna * Vivek Nigam, Universidade Federal da Para?ba * Jorge A. P?rez, University of Groningen and CWI, Amsterdam * Petrucio Viana, Universidade Federal Fluminense * Elaine Pimentel, UFRN * Giselle Reis, CMU-Qatar * Camilo Rocha, Pontificia Universidad Javeriana Cali * Simona Ronchi Della Rocca, Universita' di Torino * Alvaro Tasistro, Universidad ORT Uruguay * Christian Urban, King's College London ORGANISING COMMITTEE * Fl?vio L. C. de Moura (Universidade de Bras?lia) CONTACT * lsfa2017 at easychair.org * http://lsfa2017.cic.unb.br/ ------------------------------------------------- Sandra Alves Assistant Professor, University of Porto, Portugal sandra at dcc.fc.up.pt http://www.dcc.fc.up.pt/~sandra Renata Wassermann Associate Professor, University of S?o Paulo, Brazil renata at ime.usp.br http://www.ime.usp.br/~renata/ -------------------------------------------------------- From m.r.mousavi at hh.se Mon Feb 6 05:02:28 2017 From: m.r.mousavi at hh.se (M.R. Mousavi) Date: Mon, 6 Feb 2017 11:02:28 +0100 Subject: [TYPES/announce] 7th Halmstad Summer School on Testing (June 12 - June 15): Call for Participation Message-ID: =========================================== The 7th Halmstad Summer School on Testing Halmstad University, Sweden (Organised in cooperation with the TOCSYC Network) June 12 - June 15, 2017 http://ceres.hh.se/mediawiki/HSST_2017 =========================================== Scope ======== Software testing accounts for a major part of software development cost and effort, yet the current practice of software testing is often insufficiently structured and disciplined. There have been various attempts in the past decades to bring more rigour and structure into this field, resulting in several industrial-strength processes, techniques and tools for different levels of testing. The 7th Halmstad Summer School on Testing provides an overview of the state of the art in testing, including theory, industrial cases, tools and hands-on tutorials by internationally-renowned researchers. Tutorials ======== Georgios Fainekos (Arizona State University, USA), Specification guided testing and verification for Cyber-Physical Systems. Marie-Claude Gaudel (Universit? de Paris-Sud, France), Testing from Formal Specifications: A Unifying Framework. Alex Groce (Northern Arizona University, USA), TSTL: a Little (Integrated) Language for Testing. Justyna Petke (University College London, UK), Combinatorial Interaction Testing. Franz Wotawa (Graz University of Technology, Austria), Automated debugging ? the past, the now, and the future. Andreas Zeller (Saarland University, Germany), Fuzzing with Inferred Grammars. Registration ========== The registration deadline is April 15, 2017. To apply to the summer school, please fill in the form at: http://bit.ly/HSST_2017 . If you have any dietary requirements, or would like to attend only certain days of the summer school, please indicate in the form . The registration fee is 3100 SEK (approx. 325 EUR) and covers lunches, coffee breaks, and the study material, but it does not include the social event and the social dinner. A ticket to the social event and the social dinner costs 550 SEK and can be requested upon registration. Ph.D. Symposium =============== The deadline for Ph.D. abstract submission is May 15, 2017. We have 8 time slots for Ph.D. presentations, where each student gets to present her/his research project (and possibly results) and receive feedback from our experts. We solicit abstracts of 2 pages, solely authored by a Ph.D. student, in the EasyChair Style in order to make a selection (see: http://www.easychair.org/publications/for_authors ). The abstract should contain a clear overview of the problem description, approach, (existing results, if any,) and future milestone. Abstract submissions can already be made via https://easychair.org/conferences/?conf=hsst2017 . Venue ====== The summer school will be held on the campus of Halmstad University in Halmstad, Sweden. Halmstad is a popular summer destination located on the Swedish west coast. Just a few minutes by bicycle or bus takes you from campus to city centre, sandy beaches or forested Galgberget Hill. Trains take you directly to G?teborg in about an hour, to the Malm?-Copenhagen area in about 2 hours and to Stockholm in 4.5 hours. There are also daily flights from Halmstad Airport to Stockholm Bromma Airport. If you are flying in internationally it is generally easiest to fly into Copenhagen (CPH) airport (also known as Kastrup). The best thing about flying into CPH is that you just buy a train ticket when you arrive at the airport and simply take a train from the airport directly toHalmstad. More travel information can be found at the school page: http://ceres.hh.se/mediawiki/index.php/HSST_2017#Venue Organizers ======== Stella Erlandsson (Local Organization, stella.erlandsson at hh.se) Veronica Gaspes (Organization Chair, veronica.gaspes at hh.se) Mohammad Mousavi (Program Co-Chair, m.r.mousavi at hh.se) Richard Torkar (Program Co-Chair, richard.torkar at cse.gu.se) The abstracts of the tutorials can be found at: http://ceres.hh.se/mediawiki/index.php/HSST_2017 For more information, contact one of the organizers. -------------- next part -------------- An HTML attachment was scrubbed... URL: From afelty at eecs.uottawa.ca Mon Feb 6 13:47:56 2017 From: afelty at eecs.uottawa.ca (Amy Felty) Date: Mon, 6 Feb 2017 13:47:56 -0500 Subject: [TYPES/announce] WiL 2017: Women in Logic Workshop Second Call for Papers (new dates) Message-ID: <9b0fc02f-1af6-2b50-5204-71c9a9d6b32b@eecs.uottawa.ca> Second Call for Papers WiL 2017: Women in Logic Workshop Reykjavik, Iceland June 19, 2017 https://sites.google.com/site/firstwomeninlogicworkshop/ NEW * Submissions can be either a paper or a talk abstract. * Extended submission deadline: 31 March 2017 OVERVIEW Affiliated with the Thirty-Second Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) 20-23 June 2017, Reykjavik, Iceland. We are holding the first Women in Logic (WiL) workshop as a LICS associated workshop this year. The workshop intends to follow the pattern of meetings such as Women in Machine Learning (WiML, http://wimlworkshop.org/) or Women in Engineering (WIE, (http://www.ieee-ras.org/membership/women-in-engineering) that have been taking place for quite a few years. Women are chronically underrepresented in the LICS community; consequently they sometimes feel both conspicuous and isolated, and hence there is a risk that the under-representation is self-perpetuating. The workshop will provide an opportunity for women in the field to increase awareness of one another and one another's work, to combat the feeling of isolation. It will also provide an environment where women can present to an audience comprised of mostly women, replicating the experience that most men have at most LICS meetings; we hope that this will be particularly attractive to early-career women. Topics of interest of this workshop include but are not limited to the usual Logic in Computer Science (LICS) topics. These are listed as automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, decision procedures, description logics, domain theory, finite model theory, formal aspects of program analysis, formal methods, foundations of computability, higher-order logic, lambda and combinatory calculi, linear logic, logic in artificial intelligence, logic programming, logical aspects of bioinformatics, logical aspects of computational complexity, logical aspects of quantum computation, logical frameworks, logics of programs, modal and temporal logics, model checking, probabilistic systems, process calculi, programming language semantics, proof theory, real-time systems, reasoning about security and privacy, rewriting, type systems and type theory, and verification. SUBMISSIONS Contributions should be written in English and can be submitted in the form of full papers (with a maximum of 10 pages), short papers (with a maximum of 5 pages), or talk abstracts (1 page). Papers and abstracts should be prepared in latex using the LICS style (IEEE Proceedings 2-column 10pt). LaTeX style files are available at http://www.ctan.org/tex-archive/macros/latex/contrib/IEEEtran/. Please use IEEEtran.cls version V1.8b, released on 26/08/2015. The submission should be in the form of a PDF file uploaded to the WiL 2017 Easychair page (https://easychair.org/conferences/?conf=wil2017) before the submission deadline of 31 March 2017, anywhere on Earth. PROCEEDINGS We plan to publish a post conference volume at ENTCS or other equally visible outlet. IMPORTANT DATES Paper submission deadline: 31 March 2017 Author notification: 1 May 2017 Contribution for Informal Proceedings: 22 May 2017 INVITED SPEAKERS * Claudia Nalon (University of Brasilia, Brasil) * Catuscia Palamidessi (INRIA Saclay and LIX, France) SCIENTIFIC AND ORGANIZING COMMITTEE * Valeria de Paiva (Chair, Nuance Communications, USA) * Adriana Compagnoni (Stevens Institute of Technology, USA) * Amy Felty (University of Ottawa, Canada) * Anna Ingolfsdottir (Reykjavik University, Iceland) * Ursula Martin (University of Oxford, UK) * Brigitte Pientka (McGill University, Canada) * Alexandra Silva (University College London, UK) * Perdita Stevens (University of Edinburgh, UK) From discotec.publicity.chair at gmail.com Mon Feb 6 18:17:50 2017 From: discotec.publicity.chair at gmail.com (Ivan Lanese) Date: Tue, 7 Feb 2017 00:17:50 +0100 Subject: [TYPES/announce] DisCoTec 2017 - 2 weeks deadline extension Message-ID: ************************************************************************ Call for Papers - 2 weeks deadline extension DisCoTec 2017 12th International Federated Conference on Distributed Computing Techniques http://2017.discotec.org Facebook: https://www.facebook.com/groups/DisCoTecConference/ Neuch?tel, Switzerland, 19-22 June 2017 ************************************************************************ The DisCoTec series of federated conferences is one of the major events sponsored by the International Federation for Information Processing (IFIP). The main conferences are: * COORDINATION * DAIS * FORTE This year IFIP offers some travel grants for students and an award for the best paper of DisCoTec. All conferences share the same deadlines: * Important Dates * - February 17, 2017 (extended): Submission of abstract - February 24, 2017 (extended): Submission of papers - April 10, 2017: Notification of acceptance - April 24, 2017: Final version - June 19-22, 2017: Conference and workshops * General Chair * Pascal Felber, University of Neuchatel, Switzerland * Organisation Chair * Valerio Schiavoni, University of Neuchatel, Switzerland * Publicity Chair * Ivan Lanese, University of Bologna/INRIA, Italy * Workshops Chair * Romain Rouvoy, University of Lille, France * Steering Board * Farhad Arbab (CWI, Amsterdam, Netherlands) Rocco De Nicola (IMT Lucca, Italy) Kurt Geihs (University of Kasel, Germany) Michele Loreti (University of Florence, Italy) Elie Najm (Telecom Paris Tech -- Chair) Rui Oliveira (University do Minho, Portugal) Jean-Bernard Stefani (INRIA Grenoble, France) Uwe Nestmann (TU Berlin, Germany) * Publication * Each paper will undergo a thorough process of review and the conference proceedings will be published by Springer-Verlag in the LNCS series. ************************************************************************ COORDINATION 2017 19th IFIP International Conference on Coordination Models and Languages ************************************************************************ * Scope * Modern information systems rely increasingly on combining concurrent, distributed, mobile, adaptive, reconfigurable and heterogeneous components. New models, architectures, languages and verification techniques are necessary to cope with the complexity induced by the demands of today's software development. Coordination languages have emerged as a successful approach, in that they provide abstractions that cleanly separate behaviour from communication, therefore increasing modularity, simplifying reasoning, and ultimately enhancing software development. Building on the success of the previous editions, this conference provides a well-established forum for the growing community of researchers interested in models, languages, architectures, and implementation techniques for coordination. Topics of interest encompass all areas of coordination, including (but not limited to) coordination related aspects of: - Theoretical models and foundations for coordination: component composition, concurrency, mobility, dynamic, spatial and probabilistic aspects of coordination, emergent behaviour, types, semantics; - Specification, refinement, and analysis of architectures: patterns and styles, verification of functional and non-functional properties, including performance aspects; - Coordination, architectural, and interface definition languages: implementation, interoperability, heterogeneity; - Middlewares and coordination; - Dynamic software architectures: distributed mobile code, configuration, reconfiguration, networked computing, parallel, high-performance and cloud computing; - Nature- and bio-inspired approaches to coordination; - Coordination of multiagent and collective systems: models, languages, infrastructures, self-adaptation, self-organisation, distributed solving, collective intelligence and emerging behaviour; - Coordination and modern distributed computing: Web services, peer-to-peer networks, grid computing, context-awareness, ubiquitous computing, mobile computing; - Programming languages, middleware, tools, and environments for the development of coordinated applications; - Programming methodologies and verification of coordinated applications; - Industrial relevance of coordination and software architectures: programming in the large, domain-specific software architectures and coordination models, case studies; - Interdisciplinary aspects of coordination. * Program Committee Chairs * - Jean-Marie Jacquet, University of Namur, Belgium - Mieke Massink, CNR-ISTI, Italy ************************************************************************ DAIS 2017 17th IFIP International Conference on Distributed Applications and Interoperable Systems ************************************************************************ * Scope * The DAIS conference series addresses all aspects of distributed applications, including their design, implementation and operation, the supporting middleware, appropriate software engineering methodologies and tools, as well as experimental studies and practice reports. This time we welcome particular contributions on architectures, models, technologies and platforms for large scale and complex distributed applications and services that are related to the latest trends towards bridging the physical/virtual worlds based on flexible and versatile service architectures and platforms. Submissions will be judged on their originality, significance, clarity, relevance, and technical correctness. The topics of interest to the conference include, but are not limited to: - Novel and innovative distributed applications and systems, particularly in areas of middleware, data store, cloud computing, edge and fog computing, big data systems, data center and internet-scale systems, social networking, cyber-physical systems, mobile computing, software-defined network (SDN), service-oriented computing, and peer-to-peer systems; - Novel architectures and mechanisms, particularly in areas of pub/sub systems, language-based approaches, overlay protocols, virtualization, resource allocation, blockchains, parallelization, and bio-inspired distributed computing; - System issues and design goals, including self-management, security and practical applications of cryptography, trust and privacy, cooperation incentives and fairness, fault-tolerance and dependability, scalability and elasticity, and tail-performance and energy-efficiency; - Engineering and tools, including model-driven engineering, domain-specific languages, design patterns and methods, profiling and learning, testing and validation, and distributed debugging. * Program Committee Chairs * - Lydia Y. Chen, IBM Research Zurich Lab, Switzerland - Hans P. Reiser, University of Passau, Germany ************************************************************************ FORTE 2017 37th IFIP International Conference on Formal Techniques for Distributed Objects, Components and Systems ************************************************************************ * Scope * FORTE 2017 is a forum for fundamental research on theory, models, tools, and applications for distributed systems. The conference solicits original contributions that advance the science and technologies for distributed systems, with special interest in the areas of: - Component- and model-based design - Object technology, modularity, software adaptation - Service-oriented, ubiquitous, pervasive, grid, cloud, and mobile computing systems - Software quality, reliability, availability, and safety; - Security, privacy, and trust in distributed systems; - Adaptive distributed systems, self-stabilization; - Self-healing/organizing; - Verification, validation, formal analysis, and testing of the above. Contributions that combine theory and practice and that exploit formal methods and theoretical foundations to present novel solutions to problems arising from the development of distributed systems are encouraged. FORTE covers distributed computing models and formal specification, testing and verification methods. The application domains include all kinds of application-level distributed systems, telecommunication services, Internet, embedded and real-time systems, as well as networking and communication security and reliability. Topics of interest include but are not limited to: - Languages and semantic foundations: new modeling and language concepts for distribution and concurrency, semantics for different types of languages, including programming languages, modeling languages, and domain-specific languages; real-time and probability aspects; - Formal methods and techniques: design, specification, analysis, verification, validation, testing and runtime verification of various types of distributed systems including communications and network protocols, service-oriented systems, adaptive distributed systems, cyber-physical systems and sensor networks; - Foundations of security: new principles for qualitative and quantitative security analysis of distributed systems, including formal models based on probabilistic concepts; - Applications of formal methods: applying formal methods and techniques for studying quality, reliability, availability, and safety of distributed systems; - Practical experience with formal methods: industrial applications, case studies and software tools for applying formal methods and description techniques to the development and analysis of real distributed systems. * Program Committee Chairs * - Ahmed Bouajjani, University Paris Diderot, France - Alexandra Silva, University College London, UK -------------- next part -------------- An HTML attachment was scrubbed... URL: From rocco.denicola at imtlucca.it Tue Feb 7 03:33:25 2017 From: rocco.denicola at imtlucca.it (Rocco De Nicola) Date: Tue, 7 Feb 2017 09:33:25 +0100 Subject: [TYPES/announce] Expression of Interest for Faculty Positions in CS at GSSI - L'Aquila (IT) Message-ID: <0a6bafbd-5ba7-bc11-9837-e6cde07af539@imtlucca.it> Gran Sasso Science Institute ? Computer Science Area Expression of Interest for Faculty Positions Gran Sasso Science Institute (GSSI ? http://www.gssi.it) is a new, ambitious Centre for Advanced Studies and PhD School established in L?Aquila (Italy). The Computer Science Area of GSSI (http://cs.gssi.infn.it/phd-program/information/) invites expressions of interest for permanent positions at the level of Full or Associate Professor, and for tenure track (Ricercatore TD ? B), and temporary (Ricercatore TD ? A) research assistants. Highly qualified candidates with a strong research background in the following fields: cryptography, network security, algorithms, programming languages and software engineering are encouraged to apply. The Institute is particularly interested in (potential) leaders of multi-disciplinary research groups in the above fields. Candidates must have an excellent record of publications, a clear potential to promote and lead research activities, and a specific interest in teaching at the postgraduate level to skilled students recruited internationally. APPLICATIONS Applicants should submit their expression of interest by sending - a motivation letter in which also the position(s) of interest are specified. - a curriculum vitae - a list of publications, - a brief research statement. Applications (and questions regarding the application process) must be submitted in electronic form, preferably by April 1st 2017, to eoi-cs at gssi.it. DISCLAIMER Please note that this is not a permanent job vacancy advertisement. The expressions of interest received will contribute to the decision of the Gran Sasso Science Institute whether or not to open official calls, their number and the selection procedures. ADDITIONAL INFORMATION 1- Duties Teaching post-graduate courses, leading internal seminar and tutoring PhD students. All activities are in English. 2- Salary The salary will be determined on a personal basis, also taking into account past positions covered abroad. Indicative figures of the gross amount for starting (minimum) salary are: - Professor (prima fascia) ? 72.431 - Associate Professor (seconda fascia) ? 50.831 - Assistant Professor, tenure track (ricercatori TD ? B) ? 34.898 - Assistant Professor, no tenure track (ricercatori TD ? A) ? 34.898 Net income may vary depending on income taxes, local taxes, retirement plan, health care deduction and tax exemptions. Professors who have held a tenured position outside Italy for more than three years (at the corresponding level) might be eligible for a partial recognition of past services, depending on specific legal constraints. -- Prof. Rocco De Nicola IMT - School for Advanced Studies Lucca Piazza S. Francesco, 19 - I-55100 Lucca - Italy Tel: +39 0583 4326730 - Mobile +39 329 4309862 -------------- next part -------------- An HTML attachment was scrubbed... URL: From drl at cs.cmu.edu Wed Feb 8 11:11:48 2017 From: drl at cs.cmu.edu (Dan Licata) Date: Wed, 8 Feb 2017 11:11:48 -0500 Subject: [TYPES/announce] Math Research Communities on Homotopy Type Theory, June 4-10, 2017, Snowbird UT Message-ID: <6D1AEA61-BB84-4119-89A6-5576467D8717@cs.cmu.edu> Dear all, This is a reminder that from June 4-10, 2017, there will be a workshop on Homotopy Type Theory, organized as part of the AMS Mathematics Research Communities program and held in the Snowbird Resort in Utah. The goal of the workshop is to bring together advanced graduate students and postdocs having some background in one (or more) areas such as algebraic topology, category theory, mathematical logic, or computer science, with the goal of learning how these areas come together in homotopy type theory, and working together to prove new results. Basic knowledge of just one of these areas will be sufficient to be a successful participant. The organizers are particularly interested in using this workshop as an opportunity to improve the diversity in the HoTT community in all aspects. For more information about the workshop, including the list of sample topics that participants may be working on and the registration information, please see the website: http://www.ams.org/programs/research-communities/2017MRC-1 All accepted into the program will receive financial support (room and board at the Snowbird Resort and up to $650 towards airfare). The application deadline is *March 1st, 2017.* The majority of the positions are allocated to U.S. citizens and people who are affiliated with U.S. institutions, but a smaller number are also open to international participants. If you have any questions, please feel free to contact any of the organizers. Dan Christensen, Chris Kapulkin, Dan Licata, Emily Riehl, Mike Shulman -- You received this message because you are subscribed to the Google Groups "Homotopy Type Theory" group. To unsubscribe from this group and stop receiving emails from it, send an email to HomotopyTypeTheory+unsubscribe at googlegroups.com. For more options, visit https://groups.google.com/d/optout. From Klaus.Havelund at jpl.nasa.gov Tue Feb 7 11:36:45 2017 From: Klaus.Havelund at jpl.nasa.gov (Havelund, Klaus (348B)) Date: Tue, 7 Feb 2017 16:36:45 +0000 Subject: [TYPES/announce] [fm-announcements] SPIN 2017 - Paper Submission: Extended to February 17 Message-ID: SPIN 2017 24th International Symposium on Model Checking of Software Santa Barbara, CA, USA, July 13-14, 2017 http://conf.researchr.org/home/spin-2017 Collocated with ISSTA Paper Submission: Extended to February 17, 2017 (23:59:59 Anywhere on Earth) ________________________________ The SPIN symposium aims at bringing together researchers and practitioners interested in automated tool-based techniques for the analysis of software as well as models of software, for the purpose of verification and validation. The symposium specifically focuses on concurrent software, but does not exclude analysis of sequential software. Submissions are solicited on theoretical results, novel algorithms, tool development, empirical evaluation, and education. History: The SPIN symposium originated as a workshop focusing on explicit state model checking, specifically as related to the Spin model checker. However, over the years it has evolved to a broadly scoped symposium for software analysis using any automated techniques, including model checking, automated theorem proving, and symbolic execution. An overview of the previous SPIN symposia (and early workshops) can be found at: http://spinroot.com/spin/symposia. SPIN 2017 will be organized as an ACM SIGSOFT event, collocated with the International Symposium on Software Testing and Analysis (ISSTA 2017): http://conf.researchr.org/home/issta-2017. The RERS Verification Challenge In addition there will be a one-day Rigorous Examination of Reactive Systems verification challenge Workshop (RERS 2017): http://www.rers-challenge.org/2017. ________________________________ SPIN 2017 Topics of interest include, but are not limited to: * Formal verification techniques for automated analysis of software * Formal analysis for modeling languages, such as UML/state charts * Formal specification languages, temporal logic, design-by-contract * Model checking * Automated theorem proving, including SAT and SMT * Verifying compilers * Abstraction and symbolic execution techniques * Static analysis and abstract interpretation * Combination of verification techniques * Modular and compositional verification techniques * Verification of timed and probabilistic systems * Automated testing using advanced analysis techniques * Combination of static and dynamic analyses * Derivation of specifications, test cases, or other useful material via formal analysis * Case studies of interesting systems or with interesting results * Engineering and implementation of software verification and analysis tools * Benchmark and comparative studies for formal verification and analysis tools * Formal methods education and training * Insightful surveys or historical accounts on topics of relevance to the symposium ________________________________ Keynote Speakers ________________________________ * Domagoj Babic, Google, Inc. * Byron Cook, Amazon Web Services * Gerard Holzmann, Nimble Research ________________________________ Submission Guidelines ________________________________ The contributions to SPIN 2017 will be published as ACM Proceedings, and should be submitted in the ACM Conference Format: https://www.acm.org/publications/proceedings-template (please use the sigconf template). Submissions must be original and should not have been published previously or be under consideration for publication while being evaluated for this symposium. Authors are required to adhere to the ACM Policy and Procedures on Plagiarism and the ACM Policy on Prior Publication and Simultaneous Submissions. We are soliciting two categories of papers: * Full Research Papers describing fully developed work and complete results (10 pages); * Short Papers presenting tools, technology, experiences with lessons learned, new ideas, work in progress with preliminary results, and novel contributions to formal methods education (4 pages). Papers should be submitted via the EasyChair SPIN 2017 submission website: https://easychair.org/conferences/?conf=spin2017. Best Paper awards will be given and announced at the conference. A selection of papers will be invited to a special issue of the International Journal on Software Tools for Technology Transfer (STTT). ________________________________ Important Dates ________________________________ * Paper Submission: Extended to February 17, 2017 (23:59:59 Anywhere on Earth) * Author Notification: Updated to April 20, 2017 * Camera-Ready Paper: May 20, 2017 * Symposium: July 13-14, 2017 ________________________________ Organization ________________________________ * Hakan Erdogmus, Program Co-Chair, Carnegie Mellon University, USA * Klaus Havelund, Program Co-Chair, NASA/Caltech Jet Propulsion Laboratory, USA * Corina Pasareanu, Awards Chair, NASA Ames Research Center, USA * Yli?s Falcone, Publicity Chair, Univ. Grenoble Alpes, Inria, France ________________________________ Program Committee ________________________________ * Erika Abraham, RWTH Aachen University, Germany * Christel Baier, Technical University of Dresden, Germany * Tom Ball, Microsoft Research, USA * Ezio Bartocci, Vienna University of Technology, Austria * Dirk Beyer, Ludwig-Maximilians-Universit?t M?nchen (LMU Munich), Germany * Armin Biere, Johannes Kepler University, Austria * Dragan Bosnacki, Eindhoven University of Technology, Netherlands * Zmago Brezocnik, University of Maribor, Slovenia * Sagar Chaki, Software Engineering Institute CMU, USA * Alessandro Cimatti, Fondazione Bruno Kessler, Italy * Lucas Cordeiro, University of Oxford, UK * Patrice Godefroid, Microsoft Research, USA * Susanne Graf, VERIMAG Laboratory, France * Radu Grosu, Vienna University of Technology, Austria * Arie Gurfinkel, University of Waterloo, USA * Gerard Holzmann, NASA/Caltech Jet Propulsion Laboratory, USA * Rajeev Joshi, NASA/Caltech Jet Propulsion Laboratory, USA * Sarfraz Khurshid, The University of Texas at Austin, USA * Kim Larsen, Aalborg University, Denmark * Stefan Leue, University of Konstanz, Germany * Alice Miller, University of Glasgow, Scotland * Corina Pasareanu, NASA Ames Research Center, USA * Doron Peled, Bar Ilan University, Israel * Neha Rungta, Amazon Web Services, USA * Theo Ruys, RUwise, Netherlands * Scott Smolka, Stony Brook University, USA * Scott Stoller, Stony Brook University, United States * Jun Sun, Singapore University of Technology and Design, Singapore * Oksana Tkachuk, NASA Ames Research Center, USA * Stavros Tripakis, University of California, Berkeley, USA * Willem Visser, Stellenbosch University, South Africa * Farn Wang, National Taiwan University, Taiwan * Michael Whalen, University of Minnesota, USA * Anton Wijs, Eindhoven University of Technology, Netherlands -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- --- To opt-out from this mailing list, send an email to fm-announcements-request at lists.nasa.gov with the word 'unsubscribe' as subject or in the body. You can also make the request by contacting fm-announcements-owner at lists.nasa.gov From m.roggenbach at swansea.ac.uk Tue Feb 7 05:24:24 2017 From: m.roggenbach at swansea.ac.uk (Markus Roggenbach) Date: Tue, 7 Feb 2017 10:24:24 +0000 Subject: [TYPES/announce] Research officer in theoretical foundations of cyber security at Swansea University Message-ID: <6A624610-4D8A-4353-983A-40B2E1075653@swansea.ac.uk> Research officer in theoretical foundations of cyber security at Swansea University Duration: 3 years Available now Application deadline: 24.2.17 URL: http://www.jobs.ac.uk/job/AWX894/research-assistant-officer-in-theoretical-computer-science-theory-of-security/ Within an EPSRC funded project, we have a research position that offers an opportunity to undertake research in the broad area of Trust, Identity, Privacy and Security. To this end we want apply algebra and logic in explorations of topics such as - security and privacy properties for data sharing; - block-chain technologies; - digital identities; - authentication and certification. The position provides an opportunity to enter the important, developing field of formal methods for cyber security. We encourage any candidate with experience in - theory of computation; - formal methods for software development; - logic and AI; or - computer security to apply for our position. A previous track record in cyber security will be valuable, however not be necessary. For informal enquires please contact Prof John Tucker (J.V.Tucker at swansea.ac.uk ) or Prof Markus Roggenbach (M.Roggenbach at swansea.ac.uk ) -------------- next part -------------- An HTML attachment was scrubbed... URL: From mfarrell at cs.nuim.ie Wed Feb 8 05:24:13 2017 From: mfarrell at cs.nuim.ie (Marie Farrell) Date: Wed, 8 Feb 2017 10:24:13 +0000 Subject: [TYPES/announce] Types-announce mailing list submission: ESSLLI student session CFP Message-ID: <667f9575-048a-0d95-3ff5-fa34e1cd4df4@cs.nuim.ie> [apologies for any cross-posting] ************************************************************************************** *Deadline Extension to February 14* *ESSLLI 2017 STUDENT SESSION* Held during the 29th European Summer School in Logic, Language and Information Toulouse, France, July 17-28, 2017 *NEW* *Deadline for submissions: February 14, 2017* https://easychair.org/conferences/?conf=stus2017 *ABOUT:* The Student Session of the 29th European Summer School in Logic, Language, and Information (ESSLLI) will take place in Toulouse, France, July 17th to 28th, 2017 (https://www.irit.fr/esslli2017/). We invite submissions of original, unpublished work from students in any area at the intersection of Logic & Language, Language & Computation, or Logic & Computation. Submissions will be reviewed by several experts in the field, and accepted papers will be presented orally or as posters and selected papers will appear in the Student Session proceedings by Springer. This is an excellent opportunity to receive valuable feedback from expert readers and to present your work to a diverse audience. *ORAL/POSTER PRESENTATIONS:* Note that there are two separate kinds of submissions, one for oral presentations and one for posters. This means that papers are directly submitted either as oral presentations or as poster presentations. Reviewing and ranking will be done separately. We particularly encourage submissions for posters, as they offer an excellent opportunity to present smaller research projects and research in progress. *SUBMISSION GUIDELINES:* Authors must be students, and submissions may be singly or jointly authored. Each author may submit at most one single and one jointly authored contribution. Submissions should not be longer than 8 pages for an oral presentation or 4 pages for a poster presentation (including examples and references). Submissions must be anonymous, without any identifying information. More detailed guidelines regarding submission can be found on the Student Session website: http://www2.sfs.uni-tuebingen.de/esslli-stus-2017/. *SPONSORSHIP AND PRIZES* As in previous years, Springer has kindly agreed to sponsor the ESSLLI student session. The best poster and best talk will be awarded Springer book vouchers of 500? each. *FURTHER INFORMATION:* Please direct inquiries about submission procedures or other matters relating to the Student Session to johannes.wahle at uni-tuebingen.de and karoliina.lohiniva at unige.ch. ESSLLI 2017 will feature a wide range of foundational and advanced courses and workshops in all areas of Logic, Language, and Computation. For further information, including registration information and course listings, and for general inquiries about ESSLLI 2017, please consult the main ESSLLI 2017 page: https://www.irit.fr/esslli2017/. Kind regards, The ESSLLI 2017 Student Session Organization Committee Chairs: Johannes Wahle (Universit?t T?bingen) Karoliina Lohiniva (Universit? de Gen?ve) LoCo co-chairs: Marie Farrell (National University of Ireland Maynooth) Herbert Lange (University of Gothenburg) LoLa co-chairs: Milica Denic (?cole normale sup?rieure de Paris) Mora Maldonado (?cole normale sup?rieure de Paris) LaCo co-chairs: Emmanuele Chersoni (Universit? d'Aix-Marseille) Jennifer Sikos (Universit?t Heidelberg) -------------- next part -------------- An HTML attachment was scrubbed... URL: From rl.stpuu at gmail.com Tue Feb 7 22:52:02 2017 From: rl.stpuu at gmail.com (Roussanka Loukanova) Date: Wed, 8 Feb 2017 04:52:02 +0100 Subject: [TYPES/announce] Third Nordic Logic Summer School (NLS) 2017: Second announcement and call for papers Message-ID: ------------------------------------------------------------ Third Nordic Logic Summer School (NLS) 2017 Stockholm, August 7 - 11, 2017 ------------------------------------------------------------ The third Nordic Logic Summer School is arranged under the auspices of the Scandinavian Logic Society (http://scandinavianlogic.org/). The two previous schools were organized in Nordfjordeid, Norway (2013) and Helsinki (2015). The intended audience is advanced master students, PhD-students, postdocs and experienced researchers wishing to learn the state of the art in a particular subject. The school is co-located with Logic Colloquium 2017 (August 14-20) and Computer Science Logic 2017 (August 21-24). The school will consist of 10 five-hour courses, running in two parallel streams. In addition, there will be short student presentations and poster sessions. The lectures start on: ** Monday August 7, 9:00, and end Friday August 11, 16:15 ** LECTURERS AND COURSES ------------------------------ The following lecturers and course topics are confirmed. * Mirna Dzamonja (University of East Anglia) -- Set Theory * Martin Escardo (Birmingham) -- Topological and Constructive Aspects of Higher-Order Computation * Henrik Forssell (Oslo) -- Categorical Logic * Volker Halbach (Oxford) -- Truth & Paradox * Larry Moss (Indiana University, Bloomington) -- Natural Logic * Anca Muscholl (LaBRI, Universit? Bordeaux) -- Logic in Computer Science - Control and Synthesis, from a Distributed Perspective * Eric Pacuit (University of Maryland) -- Logic and Rationality * Peter Pagin and Dag Westerst?hl (Stockholm University) -- Compositionality * Sara L. Uckelman (Durham) -- Medieval Logic * Andreas Weiermann (Ghent) -- Proof Theory --------------------- Certificates for participation will be provided. There will be possibilities to take official credits for some of the courses. --------------------- VENUE --------------------- Department of Mathematics, Kr?ftriket Campus, Stockholm University. IMPORTANT DATES --------------------- Registration: -- Registration opens: March 6, 2017 Early registration ends: ** May 15, 2017 ** Late registration ends: ** August 4, 2017 ** -- Submission of abstracts for presentations and posters: -- Opening: March 6, 2017 Closing: May 2, 2017 Notification of acceptance: May 9, 2017 -- The early registration fee will be 1900 SEK including VAT (approx. 190 Euros) per participant, and includes coffee breaks and conference materials. Late registration fee is 2600 SEK including VAT. Some participation-fee grants may be available. ACCOMMODATION --------------------- The registration fee does not cover accommodation, but there will be special offers at hostels and hotels (in the range 700 -1200 SEK/night for single rooms) available when the registration opens. SPECIAL OFFER FOR ACCOMMODATION --------------------- There will be offers of inexpensive accommodation via the Stockholm University Housing Office. The cost will be around 300 SEK per person per night, in studio apartments shared by two people. To be able to take part in this offer, participants need to register at the latest May 15. Enquiries may be directed to: logic2017-accommodation [at] math.su.se FURTHER INFORMATION ------------------------- Further information about submissions, registration and accommodation possibilities will (in due time) be available on the NLS webpage: https://www.sls17.conf.kth.se General enquiries: nls2017 [at] philosophy.su.se Accommodation enquiries: logic2017-accommodation [at] math.su.se COMMITTEES ---------------- Program Committee of NLS 2017: Thierry Coquand (G?teborg), Ali Enayat (G?teborg) Mai Gehrke (IRIF, Paris), Nina Gierasimczuk (Copenhagen) Valentin Goranko (Stockholm U), Lauri Hella (Tampere) Lars Kristiansen (Oslo), Juha Kontinen (Helsinki) ?ystein Linnebo (Oslo), Sara Negri (Helsinki) Erik Palmgren (chair, Stockholm U) Local Organizing Committee of NLS 2017: Valentin Goranko (co-chair), Dilian Gurov, Roussanka Loukanova, Peter LeFanu Lumsdaine, Anders Lundstedt, Erik Palmgren (co-chair) ------------------------------------------------------------ From alcaraz at lcc.uma.es Mon Feb 6 17:16:52 2017 From: alcaraz at lcc.uma.es (Cristina Alcaraz) Date: Mon, 06 Feb 2017 23:16:52 +0100 Subject: [TYPES/announce] CFP: Twenty-second European Symposium on Research in Computer Security (ESORICS 2017) Message-ID: <905b2f905a1d67e20792ff8c1bba25bf@lcc.uma.es> ================================================================================ *** Apologies for multiple copies *** C a l l F o r P a p e r s Twenty-second European Symposium on Research in Computer Security (ESORICS 2017) Oslo, Norway -- September 11-15, 2017 ================================================================================ WWW: https://www.ntnu.edu/web/esorics2017/ Overview ------------------------------------ ESORICS is the annual European research event in Computer Security. The Symposium started in 1990 and has been held in several European countries, attracting a wide international audience from both the academic and industrial communities. Papers offering novel research contributions in computer security are solicited for submission to the Symposium. The primary focus is on original, high quality, unpublished research and implementation experiences. We encourage submissions of papers discussing industrial research and development. Important Dates ------------------------------------ * Paper submission deadline: April 19, 2017 * Notification to authors: June 16, 2016 * Camera ready due: July 26, 2016 Topics of Interest ------------------------------------ Topics of interest include, but are not limited to: * access control * accountability * ad hoc networks * anonymity * applied cryptography * authentication * biometrics * data and computation integrity * database security * data protection * digital content protection * digital forensics * distributed systems security * embedded systems security * inference control * information hiding * identity management * information flow control * information security governance and management * intrusion detection * formal security methods * language-based security * network security * phishing and spam prevention * privacy * privacy preserving data mining * risk analysis and management * secure electronic voting * security architectures * security economics * security metrics * security models * security and privacy for big data * security and privacy in cloud scenarios * security and privacy in complex systems * security and privacy in content centric networking * security and privacy in crowdsourcing * security and privacy in the IoT * security and privacy in location services * security and privacy for mobile code * security and privacy in pervasive / ubiquitous computing * security and privacy policies * security and privacy in social networks * security and privacy in web services * security and privacy in cyber-physical systems * security, privacy and resilience in critical infrastructures * security verification * software security * systems security * trust models and management * trustworthy user devices * usable security and privacy * web security * wireless security Paper Submission Guidelines ------------------------------------ Submissions must be made through EasyChair at: https://easychair.org/conferences/?conf=esorics2017 Submitted papers must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal or a conference/workshop with proceedings. The symposium proceedings will be published by Springer in the Lecture Notes in Computer Science series (LNCS). All submissions should follow the LNCS template from the time they are submitted. Submitted papers should be at most 16 pages (using 10-point font), excluding the bibliography and well-marked appendices, and at most 20 pages total. Committee members are not required to read the appendices, so the paper should be intelligible without them. All submissions must be written in English. Submissions are to be made to the Submission web site. Only pdf files will be accepted. Submissions not meeting these guidelines risk rejection without consideration of their merits. Authors of accepted papers must guarantee that their papers will be presented at the conference. Papers must be received by the aforementioned dates, 11:59 p.m. American Samoa time (UTC-11). Organisation Committee ------------------------------------ General Chairs: * Einar Snekkenes, Norwegian University of Science and Technology (NTNU), Norway. Organization Chair: * Laura Georg, Norwegian University of Science and Technology (NTNU), Norway. Workshop Chair: * Sokratis Katsikas, Norwegian University of Science and Technology (NTNU), Norway. Program Committee Chairs: * Dieter Gollman, Technische Universit?t Hamburg-Harburg, Germany * Simon Foley, IMT Atlantique, France Program Committee: Gail-Joon Ahn, Arizona State University, USA Alessandro Armando, University of Genoa, Italy Michael Backes, Saarland University, Germany Giampaolo Bella, Universit? degli studi di Catania, Italy Elisa Bertino, Purdue University, USA Carlo Blundo, Universit? degli studi di Salerno, Italy Rainer B?hme, University of Innsbruck, Austria Colin Boyd, Norwegian University of Science and Technology, Norway Stefan Brunthaler, SBA Research, Austria Tom Chothia, University of Birmingham, UK Sherman S. M. Chow, Chinese University of Hong Kong, Hong Kong Mauro Conti, University of Padua, Italy Cas Cremers, University of Oxford, UK Frederic Cuppens, IMT Atlantique, France Nora Cuppens-Boulahia, IMT Atlantique, France Mads Dam, KTH, Sweden Sabrina De Capitani di Vimercati, Universit? degli studi di Milano, Italy Herve Debar, Telecom SudParis, France Roberto Di Pietro, Nokia Bell Labs, France Josep Domingo-Ferrer, Universitat Rovira i Virgili, Spain Wenliang Du, Syracuse University, USA Pavlos Efraimidis, Democritus University of Thrace, Greece Hannes Federrath, University of Hamburg, Germany Simone Fischer-H?bner, Karlstad University, Sweden Riccardo Focardi, Universit? Ca? Foscari di Venezia, Italy Simon Foley, IMT Atlantique, France Sara Foresti, Universit? degli studi di Milano, Italy Katrin Franke, Norwegian University of Science and Technology, Norway Felix Freiling, Friedrich-Alexander-Universit?t Erlangen-N?rnberg, Germany Joaquin Garcia-Alfaro, Telecom ParisSud, France Dieter Gollmann, Hamburg University of Technology, Germany Dimitris Gritzalis, Athens University of Economics and Business, Greece Stefanos Gritzalis, University of the Aegean, Greece Joshua Guttman, Worcester Polytechnic Institute, USA Gerhard Hancke, City University of Hong Kong, China Marit Hansen, Unabh?ngiges Landeszentrum f?r Datenschutz Schleswig-Holstein, Germany Feng Hao, Newcastle University, UK Cormac Herley, Microsoft Research , USA Xinyi Huang, Fujian Normal University, China Michael Huth, Imperial College, UK Aaron D. Jaggard, U.S. Naval Research Laboratory, USA Sushil Jajodia, George Mason University, USA Limin Jia, Carnegie Mellon University, USA Wouter Joosen, KU Leuven, Belgium Vasilis Katos, Bournemouth University, UK Sokratis Katsikas, Norwegian University of Science and Technology, Norway Florian Kerschbaum, University of Waterloo, Canada Dogan Kesdogan, Universit?t Regensburg, Germany Kwangjo Kim, Korea Advanced Institute of Science and Technology, Korea Steve Kremer, INRIA Nancy-Grand Est, France Marina Krotofil, Honeywell, USA Ralf K?sters, University of Trier, Germany Junzuo Lai, Singapore Management University, Singapore Kwok-yan Lam, Nanyang Technological University, Singapore Costas Lambrinoudakis, University of Piraeus, Greece Peeter Laud, Cybernetica AS, Estonia Adam J. Lee, University of Pittsburgh, USA Gabriele Lenzini, University of Luxembourg, Luxembourg Yingjiu Li, Singapore Management University, Singapore Antonio Lioy, Politecnico di Torino, Italy Peng Liu, The Pennsylvania State University, USA Javier Lopez, University of Malaga, Spain Antonio Ma?a, University of Malaga, Spain Pratyusa K. Manadhata, Hewlett Packard Labs, USA Luigi V. Mancini, "Universita di Roma ""La Sapienza""", Italy Heiko Mantel, TU Darmstadt, Germany Olivier Markowitch, Universit? Libre de Bruxelles, Belgium Fabio Martinelli, IIT-CNR, Italy Sjouke Mauw, University of Luxembourg, Luxembourg Catherine Meadows, Naval Research Laboratory, USA John Mitchell, Stanford University, USA Aikaterini Mitrokotsa, Chalmers University of Technology, Sweden Refik Molva, EURECOM, France Charles Morisset, Newcastle University, UK Rolf Oppliger, eSECURITY Technologies, Switzerland Stefano Paraboschi, Universit? di Bergamo, Italy Dusko Pavlovic, University of Hawaii, USA G?nther Pernul, Universit?t Regensburg, Germany David Pichardie, ENS-IRISA, Rennes Frank Piessens , Katholieke Universiteit Leuven, Belgium Wolter Pieters, Delft University of Technology, The Netherlands Michalis Polychronakis, Stonybrook University, USA Christina P?pper, NYU Abu Dhabi, UAE Joachim Posegga, University of Passau, Germany Christian Probst, Technical University of Denmark, Denmark Kai Rannenberg, Goeth University, Germany Awais Rashid, Lancaster University, UK Indrajiti Ray, Colorado State University, USA Kui Ren, State University of New York at Buffalo, USA Mark Ryan, University of Birmingham, UK Peter Y.A. Ryan, University of Luxembourg, Luxembourg Rene Rydhof Hansen, Aarhus University, Denmark Andrei Sabelfeld, Chalmers University of Technology, Sweden Rei Safavi-Naini, University of Calgary, Canada Pierangela Samarati, Universit? degli studi di Milano, Italy Ravi Sandhu, University of Texas at San Antonio, USA Ralf Sasse, ETH Z?rich, Switzerland Nitesh Saxena, University of Alabama at Birmingham, USA Andreas Schaad, Huawei European Research Center, Germany Steve Schneider, University of Surrey, UK Basit Shafiq, Lahore University of Management Sciences, Pakistan Einar Snekkenes, Norwegian University of Science and Technology, Norway Willy Susilo, University of Wollongong, Australia Krzysztof Szczypiorski, Warsaw University of Technology, Poland Bj?rn Tackmann, IBM Research, Switzerland Qiang Tang, New Jersey Institute of Technology, USA Nils Ole Tippenhauer, Singapore University of Technology and Design, Singapore jaideep Tsochou, Ionion University, Greece Vijay Varadharajan, Macquarie University, Australia Luca Vigan?, King's College London, UK Michael Waidner, Fraunhofer SIT & TU Darmstadt, Germany Cong Wang, City University of Hong Kong, China Ben Smyth, Huawei, France Edgar Weippl, SBA Research, Austria Stephen Wolthusen, Royal Holloway university, UK Christos Xenakis, University of Piraeus, Greece Jeff Yan, Lancaster University, UK Meng Yu, University of Texas at San Antonio, USA Ben Zhao, University of California at Santa Barbara, USA Jianying Zhou, Institute for Infocomm Research, Singapore J?rg Schwenk, Ruhr-Universit?t, Bochum Publicity Chair * Cristina Alcaraz, University of Malaga, Spain From i.phillips at imperial.ac.uk Thu Feb 9 14:41:53 2017 From: i.phillips at imperial.ac.uk (Iain Phillips) Date: Thu, 9 Feb 2017 19:41:53 +0000 Subject: [TYPES/announce] RC 2017 Call For Papers :: Deadline Extended Message-ID: <401596dc-fd91-c7d8-a7f1-bf8bc07a4e1b@imperial.ac.uk> CALL FOR PAPERS ================ 9th International Conference on Reversible Computation (RC-2017) July 6-7, 2017, Pride Plaza Hotel, Kolkata, India http://www.reversible-computation.org Research in reversible computation has drawn the attention of researchers over the years. Reversible computation has a growing number of promising application areas such as low power design, testing and verification, database recovery, discrete event simulation, reversible specification formalisms, reversible programming languages, process algebras, quantum computation, etc. Initial implementations of reversible and quantum circuits have been reported recently and are seen as promising alternatives to CMOS technology. The 9th Conference on Reversible Computation will take place during July 6-7, 2017, in Kolkata, India and will be jointly organised by: (a) Indian Institute of Technology, Kharagpur, (b) Indian Institute of Engineering Science and Technology (IIEST), (c) University of Calcutta, (d) Indian Statistical Institute Calcutta, and (e) Jadavpur University. Previous editions of this event took place as workshop in York (2009), Bremen (2010), Gent (2011), Copenhagen (2012) and was upgraded to a conference subsequently and held in Victoria (2013), Kyoto (2014), Grenoble (2015), and Bologna (2016). The conference will bring together researchers, academicians and students from computer science, electrical engineering, mathematics, and physics to discuss new developments and directions for future research in reversible computation. This particularly includes applications of reversibility in quantum computation. Research papers, tool demonstrations, work-in-progress reports and poster presentations are within the scope of the conference. Invited talks by leading international experts will complete the program. A summer school shall be conducted on July 5, 2017 specifically targeting the beginners in this area. The Conference Banquet dinner shall be organised on July 6th evening, while a Social Event followed by dinner shall be organised on July 7 evening, which are open to all the conference delegates. Contributions, not necessarily restricted to the following topics, in Reversible Computation are invited from prospective authors: a) Architectures b) Algorithms c) Circuit Design d) Debugging e) Fault Tolerance and Error Correction f) Hardware g) Information Theory h) Physical Realisations i) Programming Languages j) Quantum Computation k) Software l) Synthesis m) Theoretical Results n) Testing o) Verification SUBMISSION AND PUBLICATION: Interested researchers are invited to submit full research papers and tutorials (16 pages maximum), as well as work-in-progress or tool demonstration papers (6 pages maximum) in Springer LNCS format through the Conference website. All submitted papers will be peer-reviewed by at least three reviewers for technical merit, originality, significance and relevance to the scope of the conference. All accepted papers will be included in the conference proceedings and published by Springer as an Lecture Notes in Computer Science volume. IMPORTANT DATES: * Abstract Submission: February 14, 2017 (EXTENDED) * Full-paper Submission: February 20, 2017 (EXTENDED) * Notification to Authors: March 20, 2017 * Camera-ready Copy: April 10, 2017 * Author Registration: April 7, 2017 Organising Committee: a) General Chairs - Indranil Sen Gupta, Indian Institute of Technology Kharagpur, India - Rolf Drechsler, University of Bremen/DFKI, Germany b) Program Chairs - Iain Phillips, Imperial College, London, UK - Hafizur Rahaman, IIEST Shibpur, India c) Organising Chair - Amlan Chakrabarti, University of Calcutta, India d) Finance Chair - Chandan Giri, IIEST Shibpur, India From andrei at inf.unibe.ch Thu Feb 9 07:34:05 2017 From: andrei at inf.unibe.ch (Andrei Chis) Date: Thu, 9 Feb 2017 13:34:05 +0100 Subject: [TYPES/announce] 1st CfP: SLE 2017 (10th ACM SIGPLAN International Conference on Software Language Engineering) Message-ID: ======================================================================== **Call for Papers** 10th ACM SIGPLAN International Conference on Software Language Engineering (SLE 2017) 23-24 October 2017, Vancouver, Canada (Co-located with SPLASH 2017) General chair: Benoit Combemale, University of Rennes 1, France Program co-chairs: Marjan Mernik, University of Maribor, Slovenia Bernhard Rumpe, RWTH Aachen University, Germany Artifact evaluation chairs Tanja Mayerhofer, TU Wien, Austria Laurence Tratt, King's College London, UK http://conf.researchr.org/track/sle-2017/sle-2017-papers http://www.sleconf.org/2017 Follow us on twitter: https://twitter.com/sleconf ======================================================================== Software Language Engineering (SLE) is the application of systematic, disciplined, and measurable approaches to the development, use, deployment, and maintenance of software languages. The term "software language" is used broadly, and includes: general-purpose programming languages; domain-specific languages (e.g. BPMN, Simulink, Modelica); modeling and metamodeling languages (e.g. SysML and UML); data models and ontologies (e.g. XML-based and OWL-based languages and vocabularies). ### Important Dates Fri 2 Jun 2017 - Abstract Submission Fri 9 Jun 2017 - Paper Submission Fri 4 Aug 2017 - Author Notification Thu 10 Aug 2017 - Artifact Submission Fri 1 Sep 2017 - Artifact Notification Fri 8 Sep 2017 - Camera Ready Deadline Sun 22 Oct - SLE workshops Mon 23 Oct - Tue 24 Oct 2017 - SLE Conference ### Topics of Interest SLE aims to be broad-minded and inclusive about relevance and scope. We solicit high-quality contributions in areas ranging from theoretical and conceptual contributions to tools, techniques, and frameworks in the domain of language engineering. Topics relevant to SLE cover generic aspects of software languages development rather than aspects of engineering a specific language. In particular, SLE is interested in principled engineering approaches and techniques in the following areas: * Language Design and Implementation * Approaches and methodologies for language design * Static semantics (e.g., design rules, well-formedness constraints) * Techniques for behavioral / executable semantics * Generative approaches (incl. code synthesis, compilation) * Meta-languages, meta-tools, language workbenches * Language Validation * Verification and formal methods for languages * Testing techniques for languages * Simulation techniques for languages * Language Integration and Composition * Coordination of heterogeneous languages and tools * Mappings between languages (incl. transformation languages) * Traceability between languages * Deployment of languages to different platforms * Language Maintenance * Software language reuse * Language evolution * Language families and variability * Domain-specific approaches for any aspects of SLE (design, implementation, validation, maintenance) * Empirical evaluation and experience reports of language engineering tools * User studies evaluating usability * Performance benchmarks * Industrial applications ### Types of Submissions * **Research papers**: These should report a substantial research contribution to SLE or successful application of SLE techniques or both. Full paper submissions must not exceed 12 pages including bibliography in ACM SIGPLAN conference style (http://www.sigplan.org/Resources/Author/). * **Tool papers**: Because of SLE's interest in tools, we seek papers that present software tools related to the field of SLE. Selection criteria include originality of the tool, its innovative aspects, and relevance to SLE. Any of the SLE topics of interest are appropriate areas for tool demonstrations. Submissions must provide a tool description of 4 pages including bibliography in ACM SIGPLAN conference style ( http://www.sigplan.org/Resources/Author/), and a demonstration outline including screenshots of up to 6 pages. Tool demonstrations must have the keywords ?Tool Demo? or ?Tool Demonstration? in the title. The 4-page tool description will, if the demonstration is accepted, be published in the proceedings. The 6-page demonstration outline will be used by the program committee only for evaluating the submission. * **Industrial papers**: These should describe real-world application scenarios of SLE in industry, explained in their context with an analysis of the challenges that were overcome and the lessons which the audience can learn from this experience. Industry paper submissions must not exceed 6 pages including bibliography in ACM SIGPLAN conference style ( http://www.sigplan.org/Resources/Author/). * **New ideas / vision papers**: New ideas papers should describe new, non-conventional SLE research approaches that depart from standard practice. They are intended to describe well-defined research ideas that are at an early stage of investigation. Vision papers are intended to present new unifying theories about existing SLE research that can lead to the development of new technologies or approaches. New ideas / vision papers must not exceed 4 pages including bibliography in ACM SIGPLAN conference style (http://www.sigplan.org/Resources/Author/). ### Artifact evaluation Authors of accepted papers at SLE 2017 are encouraged to submit their experiment results used for underpinning research statements to an artifact evaluation process. This submission is voluntary and will not influence the final decision regarding the papers. Papers that go through the Artifact Evaluation process successfully receive a seal of approval printed on the first page of the paper in the proceedings. Authors of papers with accepted artifacts are encouraged to make these materials publicly available upon publication of the proceedings, by including them as "source materials" in the ACM Digital Library. ### Publications All submitted papers will be reviewed by at least three members of the program committee. All accepted papers, including tool papers, industrial papers and new ideas / vision papers will be published in ACM Digital Library. Selected accepted papers will be invited to a special issue of the Computer Languages, Systems and Structures (COMLAN) journal. ### Awards * **Distinguished paper**: Award for most notable paper, as determined by the PC chairs based on the recommendations of the program committee. * **Distinguished reviewer**: Award for distinguished reviewer, as determined by the PC chairs using feedback from the authors. * **Distinguished artifact**: Award for the artifact most significantly exceeding expectations, as determined by the AEC chairs based on the recommendations of the artifact evaluation committee. ### Program Committee Marjan Mernik (co-chair), University of Maribor, Slovenia Bernhard Rumpe (co-chair), RWTH Aachen University, Germany Mark van den Brand, TU Eindhoven, The Netherlands Ruth Breu, University of Innsbruck, Austria Jordi Cabot, ICREA, Spain Walter Cazzola, University of Milan, Italy Marsha Chechik, University of Toronto, Canada Tony Clark, Middlesex University, UK Tom Dinkelaker, Ericsson, Germany Bernd Fischer, Stellenbosch University, South Africa Sebastian Gerard, CEA, France Jeff Gray, University of Alabama, USA Esther Guerra, Autonomous University of Madrid, Spain Michael Homer, Victoria University of Wellington, New Zealand Ralf L?mmel, University of Koblenz-Landau, Germany Tihamer Levendovszky, Microsoft, USA Gunter Mussbacher, McGill University, Canada Terence Parr, University of San Francisco, USA Jaroslav Porub?n, University of Ko?ice, Slovakia Jan Ringert, Tel Aviv University, Israel Julia Rubin, University of British Columbia, Canada Tony Sloane, Macquarie University, Australia Eugene Syriani, University of Montreal, Canada Emma S?derberg, Google, Denmark Eric Van Wyk, University of Minnesota, USA Jurgen Vinju, CWI, Netherlands Eric Walkingshaw, Oregon State University, USA Andreas Wortmann, RWTH Aachen University, Germany Tian Zhang, Nanjing University, China ### Contact For any question, please contact the organizers via email: sle2017 at inria.fr -------------- next part -------------- An HTML attachment was scrubbed... URL: From georg.moser at uibk.ac.at Thu Feb 9 05:14:03 2017 From: georg.moser at uibk.ac.at (Georg Moser) Date: Thu, 9 Feb 2017 11:14:03 +0100 Subject: [TYPES/announce] DICE-FOPARA 2017 - Second Call for Papers Message-ID: <04eeea50-8218-8443-496d-8c9dc044ee90@uibk.ac.at> ------------------------------------------------------------------------------------------- 8th Workshop on Developments in Implicit Computational complExity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis (DICE-FOPARA 2017) Affiliated with ETAPS 2017 April 22 - 23, 2017, Uppsala, Sweden http://cbr.uibk.ac.at/events/dice-fopara ------------------------------------------------------------------------------------------- OBJECTIVES The first joint international workshop on Developments in Implicit Computational complExity and FOundational and Practical Aspects of Resource Analysis (DICE-FOPARA) will be held in Uppsala, Sweden, from April 22-23, 2017 as part of ETAPS. DICE-FOPARA serves as a forum for presenting results relevant to the implicit computational complexity theory *and* to the analysis of resource consumption by computer programs (e.g. time, space, energy). The workshop aims to bring together the researchers that work on foundational issues with the researchers that focus more on practical results. INVITED SPEAKERS Elvira Albert (Complutense University of Madrid) Kerstin I. Eder (University of Bristol) Lars Kristiansen (University of Oslo) Jan Reinecke (Universit?t Saarland) SUBMISSIONS We ask for submission of *regular papers* describing original work (10-15 pages) or *extended abstracts* (2--6 pages) presenting already published work or work in progress. Regular papers must be prepared using the LaTeX EPTCS class (see http://eptcs.org/). Accepted regular papers will appear in an EPTCS volume. Papers should be submitted electronically via the submission page: https://easychair.org/conferences/?conf=dicefopara2017 IMPORTANT DATES Paper submission February 19, 2017 Notification March 19, 2017 Final versions due March 26, 2017 Workshop date April 22-23, 2017 CONFERENCE VENUE The workshop will be held as a satellite workshop of European Joint Conferences on Theory and Practice of Software 2017 (ETAPS 2017) which takes place in Uppsala, Sweden. PROGRAM COMMITTEE Beniamino Accattoli (Paris) Guillaume Bonfante (Nancy, co-chair) Marko van Eekelen (Nijmegen) Marco Gaboardi (Buffalo) Dan Ghica (Birmingham) Clemens Grelck (Amsterdam) Charles Grellois (Bologna) Nao Hirokawa (JAIST) Jan Hoffmann (CMU) Thomas Jensen (Rennes) Bj?rn Lisper (M?lardalen) Hans-Wolfgang Loidl (Edinburgh) Georg Moser (Innsbruck, co-chair) Kazushige Terui (Kyoto) Simon Wegener (Saarbr?cken) Florian Zuleger (Vienna) From raoul.strackx at cs.kuleuven.be Thu Feb 9 05:00:57 2017 From: raoul.strackx at cs.kuleuven.be (Raoul Strackx) Date: Thu, 9 Feb 2017 11:00:57 +0100 Subject: [TYPES/announce] [ESSoS'17] International Symposium on Engineering Secure Software and Systems (*Deadline approaching: Feb 24th*) Message-ID: <4f2436f4-e1de-a5fb-f57f-88bdc64906cc@cs.kuleuven.be> +----------------------------------------------------------------------+ | | | Call for papers | | | | | | International Symposium on Engineering Secure Software and Systems | | | | ESSoS 2017 | | | | July 3-5, 2017 | | Bonn, Germany | | | | https://distrinet.cs.kuleuven.be/events/essos/2017/calls-papers.html | +----------------------------------------------------------------------+ +----------------------------------------------------------------------+ | *Paper submission*: Friday, February 24, 2017 (firm) | +----------------------------------------------------------------------+ In cooperation with: ACM SIGSAC and SIGSOFT (pending) New this year: co-Located with DIMVA. * Context and motivation * IT security is becoming an increasingly interdisciplinary subject. For example, it is insufficient to simply deploy new security measures but one must pay careful attention to correctly integrate the security measures into existing software. Such an approach involves redesigning and engineering of software to ensure that the built-in security policy is effective in practice. Many security venues put little focus on topics related to software engineering, while many software-engineering venues lack appreciation for more complex topics in software security. ESSoS thus strives to be a venue that welcomes exactly such contributions that are at the border of IT security and software engineering. The program committee is particularly chosen to encompass a broad range of expertise, ranging from software security over software engineering to human subjects such as usable security. * Goal and setup * The goal of this symposium, which will be the ninth in the series, is to bring together researchers and practitioners to advance the state of the art and practice in secure software engineering. Being one of the few conference-level events dedicated to this topic, it explicitly aims to bridge the software engineering and security engineering communities, and promote cross-fertilization. The symposium will feature two days of technical program including two keynote presentations. In addition to academic papers, the symposium encourages submission of high-quality, informative industrial experience papers about successes and failures in secure software engineering and the lessons learned. Furthermore, the symposium also accepts short idea papers that crisply describe a promising direction, approach, or insight. * Topics * The Symposium seeks submissions on subjects related to its goals. This includes a diversity of topics including (but not limited to): - Cloud security, virtualization for security - Mobile devices security - Automated techniques for vulnerability discovery and analysis - Model checking for security - Binary code analysis, reverse-engineering - Programming paradigms, models, and domain-specific languages for security - Operating system security - Verification techniques for security properties - Malware: detection, analysis, mitigation - Security in critical infrastructures - Security by design - Static and dynamic code analysis for security - Web applications security - Program rewriting techniques for security - Security measurements - Empirical secure software engineering - Security-oriented software reconfiguration and evolution - Computer forensics - Processes for the development of secure software and systems - Security testing - Embedded software security - Usable security * Important dates * Paper submission: Friday, February 24, 2017 (firm) Paper acceptance notification: Tuesday, April 18, 2017 Artifact evaluation submission: Friday, April 21, 2017 Poster submission: Friday, April 21, 2017 Poster acceptance notification: Friday, April 28, 2017 Camera-ready: Friday, May 12, 2017 Symposium: Monday to Wednesday, July 3-5, 2017 (DIMVA is held July 6-7, following ESSoS) * Submission and format * The proceedings of the symposium are published by Springer-Verlag in the Lecture Notes in Computer Science Series (http://www.springer.com/computer/lncs, pending approval). Submissions should follow the formatting instructions of Springer LNCS. Submitted papers must present original, unpublished work of high quality. Two types of papers will be accepted: _Full papers (max 14 pages without bibliography/appendices)_ Such papers may describe original technical research with a solid foundation, such as formal analysis or experimental results, with acceptance determined mostly based on novelty and validation. Or they may describe case studies applying existing techniques or analysis methods in industrial settings, with acceptance determined mostly by the general applicability of techniques and the completeness of the technical presentation details. _Idea papers (max 8 pages with bibliography)_ Such papers may crisply describe a novel idea that is both feasible and interesting, where the idea may range from a variant of an existing technique all the way to a vision for the future of security technology. Idea papers allow authors to introduce ideas to the field and get feedback, while allowing for later publication of complete, fully-developed results. Submissions will be judged primarily on novelty, excitement, and exposition, but feasibility is required, and acceptance will be unlikely without some basic, principled validation (e.g., extrapolation from limited experiments or simple formal analysis). In the proceedings, idea papers will clearly identified by means of the "Idea" tag in the title. _Posters_ ESSoS will have a poster session to present ideas, discuss prototypes, and feature ongoing work. Authors of accepted papers and authors with evaluated artifacts are invited to submit a poster as well. Poster abstracts are limited to 1 page. _Approved Artifacts_ Due to the secure software engineering focus, we expect the majority of papers to be based on an accompanying software artifact, data set, or similar. We strongly encourage the authors of accepted papers to submit such artifacts for evaluation. Artifact Evaluation will take place after accepted papers have been announced. Further information will be given closer to the paper-submission deadline. Submissions where the artifact evaluation committee can reproduce the software artifacts and evaluation will receive the ?approved artifact? badge. Authors of approved artifacts are further given the opportunity to demo their artifact at the conference. In addition, the committee will select a best artifact to receive the Distinguished Artifact Award. * Steering committee * Jorge Cuellar (Siemens AG) Wouter Joosen (Katholieke Universiteit Leuven) - chair Fabio Massacci (Universit? di Trento) Gary McGraw (Cigital) Bashar Nuseibeh (The Open University) Daniel Wallach (Rice University University) * Organizing committee * General chair: Michael Meier (University of Bonn, DE) Program co-chairs: Mathias Payer (Purdue university, USA),Eric Bodden (Paderborn University, DE) Doctoral Symposium: TBA Publication chair: Elias Athanasopoulos (University of Cyprus, CY) Publicity chair: Raoul Strackx (Katholieke Universiteit Leuven, BE) Web chair: Ghita Saevels (Katholieke Universiteit Leuven, BE) * Program committee * David Aspinall, University of Edinburgh Domagoj Babic, Google Inc. Alexandre Bartel, University of Luxembourg Amel Bennaceur, The Open University Stefan Brunthaler, Paderborn University Will Enck, NC State University Michael Franz, University of California, Irvine Christian Hammer, University of Potsdam Michael Hicks, University of Maryland Trent Jaeger, The Pennsylvania State University Vassilis P. Kemerlis, Brown University Johannes Kinder, University of London Byoungyoung Lee, Purdue University Yang Liu, University of Oxford Ben Livshits, Microsoft Research Cl?mentine Maurice, Technical University Graz Andy Meneely, Rochester Institute of Technology Mira Mezini, Technical University Darmstadt Alessandro Orso, Georgia Tech Christina P?pper, New York University Abu Dhabi Awais Rashid, Lancaster University Kaveh Razavi, Vrije Universiteit Amsterdam Tamara Rezk, INRIA Angela Sasse, University College London Zhendong Su, University of California, Davis Melanie Volkamer, Karlstad University Xiangyu Zhang, Purdue University From rl.stpuu at gmail.com Wed Feb 8 16:03:56 2017 From: rl.stpuu at gmail.com (Roussanka Loukanova) Date: Wed, 8 Feb 2017 22:03:56 +0100 Subject: [TYPES/announce] CfP: LACompLing2017 - Logic and Algorithms in Computational Linguistics 2017 Message-ID: ============================================================ CALL FOR PAPERS Workshop on Logic and Algorithms in Computational Linguistics 2017 (LACompLing2017) Stockholm, August 18-19, 2017 http://staff.math.su.se/rloukanova/LACompLing17.html * Submission deadline for regular papers: April 14, 2017 * ============================================================ Affiliated with the 26th Annual EACSL Conference on Computer Science Logic CSL'2017 Stockholm, 20--26 August 2017 https://www.csl17.conf.kth.se/ Co-located with: Logic in Stockholm 2017 https://www.lis17.conf.kth.se/ ============================================================ DESCRIPTION ===== Computational linguistics studies natural language in its various manifestations from a computational point of view, both on the theoretical level (modeling grammar modules dealing with natural language form and meaning, and the relation between these two) and on the practical level (developing applications for language and speech technology). Right from the start in the 1950ties, there have been strong links with computer science and logic - one can think of Chomsky's contributions to the theory of formal languages and automata, or Lambek's logical modeling of natural language syntax. The workshop assesses the place of computer science logic in present day computational linguistics. It intends to be a forum for presenting new results as well as work in progress. -------------------------------- SCOPE ===== The workshop focuses on logical approaches to the computational processing of natural language, and on the applicability of methods and techniques from the study of artificial languages (programming/logic) in computational linguistics. The topics of LACompLing2017 include, but are not limited to: - Computational theories of human language - Computational syntax - Computational semantics - Computational syntax-semantics interface - Interfaces between morphology, lexicon, syntax, semantics, speech, text, pragmatics - Computational grammar - Logic and reasoning systems for linguistics - Type theories for linguistics - Models of computation and algorithms for linguistics - Language processing - Parsing algorithms - Generation of language from semantic representations - Large-scale grammars of natural languages - Multilingual processing - Data science in language processing - Machine learning of language - Interdisciplinary methods - Integration of formal, computational, model theoretic, graphical, diagrammatic, statistical, and other related methods - Logic for information extraction or expression in written and spoken language - Language theories based on biological fundamentals of information and languages - Computational neuroscience of language IMPORTANT DATES ===== Submission deadline for regular papers: April 14, 2017 Notification of paper acceptance: May 31, 2017 Deadline for abstracts of short presentations: June 4, 2017 Notifications for short presentations: June 12, 2017 Deadline for final submissions: June 25, 2017 Workshop: August 18-19, 2017 SUBMISSION INSTRUCTIONS ===== - Regular papers: between 10-15 pages, including figures and references, by using LaTeX, with article.sty, the default font size - Abstracts of short presentations: not more than 1 page, by using LaTeX, with article.sty, the default font size - We invite original papers that are not submitted concurrently to another conference or for publication elsewhere - The submissions of proposed papers and abstracts of short presentations have to be in pdf - The camera-ready submissions require the pdf of the papers and their LaTeX sources The submissions are via the EasyChair management system of LACompLing2017: https://easychair.org/conferences/?conf=lacompling2017 PUBLICATIONS ===== - The proceedings of the workshop on Logic and Algorithms in Computational Linguistics 2017 (LACompLing2017) will be published digitally by the DiVA system of Stockholm University: http://su.diva-portal.org - Improved and extended versions of selected papers, which have been presented at the workshop LACompLing2017, will be published by the Journal of Logic, Language and Information, JoLLI, after the workshop. ORGANIZERS ===== Krasimir Angelov, University of Gothenburg, Sweden Valeria de Paiva, Nuance Communications, USA Kristina Liefke, Ludwig-Maximilians-University Munich, Germany Roussanka Loukanova, Stockholm University, Sweden Michael Moortgat, Utrecht University, The Netherlands Reinhard Muskens, Tilburg University, The Netherlands CONTACT ===== Roussanka Loukanova (rloukanova at gmail.com) Valeria de Paiva (valeria.depaiva at gmail.com) -------------------------------- From elaine at mat.ufmg.br Fri Feb 10 07:33:47 2017 From: elaine at mat.ufmg.br (Elaine Pimentel) Date: Fri, 10 Feb 2017 09:33:47 -0300 Subject: [TYPES/announce] TABLEAUX/FroCoS/ITP 2017 -- Call for posters Message-ID: **Call for posters** TABLEAUX/FroCoS/ITP 25-29 SEPTEMBER 2017 BRASILIA BRASIL TABLEAUX/FroCoS/ITP 2017 will have a poster session, which is intended for descriptions of works in progress, student projects and relevant research being published elsewhere. Submissions should be in English, in the form of at most one page abstract, ENTCS format containing title and authors name with affiliation. The files should be sent directly to Elaine Pimentel (elaine.pimentel at gmail.com). The deadline for posters submission is June 15, 2017. The notification will be sent to authors June 30th. Proceedings of this session will not be published. Formatting instructions for posters will be made available soon. For more information please contact the local organizers: Elaine Pimentel (elaine.pimentel at gmail.com) Daniele Nantes (daniele.nantes at gmail.com) http://tableaux2017.cic.unb.br http://frocos2017.cic.unb.br http://itp2017.cic.unb.br -- Elaine. ------------------------------------------------- Elaine Pimentel - DMAT/UFRN Address: Departamento de Matem?tica Universidade Federal do Rio Grande do Norte Campus Universit?rio - Av. Senador Salgado Filho, s/n? Lagoa Nova, CEP: 59.078-970 - Natal - RN Phone: +55 84 3215-3820 <(84)%203215-3820> http://sites.google.com/site/elainepimentel/ Lattes: http://lattes.cnpq.br/3298246411086415 -------------------------------------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: From radugrigore at gmail.com Sat Feb 11 07:10:56 2017 From: radugrigore at gmail.com (Radu Grigore) Date: Sat, 11 Feb 2017 12:10:56 +0000 Subject: [TYPES/announce] Call for Papers: Formal Techniques for Java-like Programs Message-ID: Website: http://2017.ecoop.org/track/FTfJP-2017-papers FTfJP (Formal Techniques for Java-like Programs) is an established workshop, running annually since 1999. It is associated with ECOOP, a flagship European conference on object-oriented programming. For 2017, contributions are sought in two categories: * **Technical Work**. In 6 two-column pages, the paper should present a technical contribution. We welcome both complete and incomplete results, as long as they are substantial enough to stimulate discussion on future research directions. * **Position Paper**. In 2 two-column pages, the paper should advocate a promising research direction. Using this format, we encourage established researchers to set out their vision, and we also encourage beginning researchers to plan their path to a PhD. Both types of contributions will benefit from feedback received at the workshop. Both theory and tools are welcome. Topics include but are not limited to - semantics - types - model checking - program analysis (static or dynamic) - verification (traditional, quantitative, at runtime, ...) - language design (for programs or specifications) - concurrency - security - proof engineering - pearls (proofs or programs) Important dates: - **20 April 2017:** submission deadline - **15 May 2017:** author notification Submissions will be peer reviewed, and will be evaluated based on their *clarity* and based on their *potential to generate interesting discussions*. The format of the workshop encourages interaction. FTfJP is a forum in which a wide range of people share their expertise, from experienced researchers to beginning PhD students. Program Committee: - Nada Amin, EPFL - Alexandre Bartel, University of Luxembourg - Sam Blackshear, Facebook - Bart Jacobs, KU Leuven - Radu Grigore, University of Kent (chair) - James Noble, Victoria University of Wellington - Jens Palsberg, UCLA - Aseem Rastogi, Microsoft Research - Bernhard Scholz, University of Sydney - Malte Schwerhoff, ETH Zurich Accepted papers will be published in the ACM Digital Library, if the authors wish so. The use of [ACM's template][acm] with the SIGPLAN format is required. Submit via [HotCRP][hotcrp]. [acm]: http://www.acm.org/publications/proceedings-template [hotcrp]: https://ftfjp17.hotcrp.com/ -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- An HTML attachment was scrubbed... URL: From catherine.dubois at ensiie.fr Sat Feb 11 10:17:24 2017 From: catherine.dubois at ensiie.fr (dubois) Date: Sat, 11 Feb 2017 16:17:24 +0100 Subject: [TYPES/announce] Computers special issue - Formal Integrated Development Environments - Deadline approaching Message-ID: Journal: Computers Special Issue: Formal Integrated Development Environments Special Issue Editors: Catherine Dubois, Dominique Mery and Paolo Masci Deadline: 1 March, 2017 http://www.mdpi.com/journal/computers/special_issues/f_ide Guest Editors - Professor Catherine Dubois Samovar / ENSIIE Webpage: http://www.ensiie.fr/~dubois/ E-Mail: catherine.dubois at ensiie.fr - Dr. Paolo Masci HASLab/INESC TEC & Universidade do Minho, Braga, Portugal Webpage: http://haslab.uminho.pt/masci/ E-Mail: paolo.masci at inesctec.pt - Professor Dominique Mery LORIA & Universit? de Lorraine, France Webpage: http://www.loria.fr/~mery/ E-Mail: dominique.mery at loria.fr Summary This special issue of Computers is dedicated to Formal Integrated Development Environments (Formal-IDEs) for the rigorous specification, design, analysis, and documentation of high-assurance systems. This special issue welcomes original high-quality contributions that have been neither published in, nor submitted to, any journal or refereed conference. Topics of interest include, but are not limited to, the following: Formal-IDE building: design and integration of languages, development of user-friendly front-ends How to make high-level logical and programming concepts palatable to industrial developers Integration of Object-Oriented and modularity features Integration of static analyzers Integration of automatic proof tools, theorem provers and testing tools Documentation tools Impact of tools on certification Experience reports on developing Formal-IDEs Experience reports on using Formal-IDEs Experience reports on formal methods-based assessments in industrial applications Submission Manuscripts should be submitted online at www.mdpi.com. Manuscripts can be submitted until the deadline. Papers will be published continuously (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website. Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are refereed through a peer-review process. -- Catherine DUBOIS, professor ENSIIE, lab. Samovar (UMR 5157) From gabmeyer at seceng.informatik.tu-darmstadt.de Mon Feb 13 05:24:47 2017 From: gabmeyer at seceng.informatik.tu-darmstadt.de (Sebastian Gabmeyer) Date: Mon, 13 Feb 2017 11:24:47 +0100 Subject: [TYPES/announce] TAP 2017: Final Call for Papers Message-ID: <43e4eb7a-6934-c13e-b9dc-4c340cfc5b49@seceng.informatik.tu-darmstadt.de> ===================================================== Final Call for Papers 11th International Conference on Tests And Proofs TAP 2017 Marburg (Germany), 19-20 July 2017 Part of STAF 2017 http://http://www.seceng.de/tap2017 ===================================================== Aim and Scope ------------- The TAP conference promotes research in verification and formal methods that targets the interplay of proofs and testing: the advancement of techniques of each kind and their combination, with the ultimate goal of improving software and system dependability. Research in verification has recently seen a steady convergence of heterogeneous techniques and a synergy between the traditionally distinct areas of testing (and dynamic analysis) and of proving (and static analysis). Formal techniques, such as model checking, that produce counterexamples when verification fails are a clear example of the duality of testing and proving. The combination of static techniques such as satisfiability modulo theory and predicate abstraction has provided means of proving correctness by complementing exhaustive enumeration testing-like techniques. More practically, testing supports the cost-effective debugging of complex models and formal specifications, and is applicable in conditions that are beyond the reach of formal techniques -- for example, components whose source code is not accessible. Testing and proving are increasingly seen as complementary rather than mutually exclusive techniques. The TAP conference aims to promote research in the intersection of testing and proving by bringing together researchers and practitioners from both areas of verification. Topics of Interest ------------------ TAP's scope encompasses many aspects of verification technology, including foundational work, tool development, and empirical research. Its topics of interest center around the connection between proofs (and other static techniques) and testing (and other dynamic techniques). Papers are solicited on, but not limited to, the following topics: - Verification and analysis techniques combining proofs and tests - Program proving with the aid of testing techniques - Deductive techniques (theorem proving, model checking, symbolic execution, SMT solving, constraint logic programming, etc.) to support testing: generating testing inputs and oracles, supporting coverage criteria, and so on. - Program analysis techniques combining static and dynamic analysis - Specification inference by deductive and dynamic methods - Testing and runtime analysis of formal specifications - Model-based testing and verification - Using model checking to generate test cases - Testing of verification tools and environments - Applications of testing and proving to new domains, such as security, configuration management, and language-based techniques - Bridging the gap between concrete and symbolic reasoning techniques - Innovative approaches to verification such as crowdsourcing and serious games - Case studies, tool and framework descriptions, and experience reports about combining tests and proofs Highlight Topics ---------------- In addition to TAP?s general topics of interests, the 11th edition of TAP will feature two highlight topics on techniques, tools, and experience reports on 1. Testing and proving the correctness of security properties and implementations of cryptographic functions and protocols with a focus on the successful interplay of tests and proofs, and 2. Asserting the correct functioning and testing of verification tools, especially on theorem provers, that form the basis of many verification results for tools and applications our society increasingly depends on. Important Dates --------------- Abstract: 17 February 2017 Paper: 24 February 2017 Notification: 7 April 2017 Camera-Ready Version: 21 April 2017 Conference: 19-20 July 2017 Submission Instructions ----------------------- TAP 2017 accepts papers of three kinds: - Regular research papers: full submissions describing original research, of up to 16 pages (excluding references). - Tool demonstration papers: submissions describing the design and implementation of an analysis/verification tool or framework, of up to 8 pages (excluding references). The tool/framework described in a tool demonstration paper should be available for public use. - Short papers: submissions describing preliminary findings, proofs of concepts, and exploratory studies, of up to 6 pages (excluding references). Organization ------------ Program Chairs - Einar Broch Johnsen - Sebastian Gabmeyer Program Committee - Bernhard K. Aichernig - Elvira Albert - Bruno Blanchet - Jasmin C. Blanchette - Achim D. Brucker - Catherine Dubois - Gordon Fraser - Carlo A. Furia - Sebastian Gabmeyer (chair) - Angelo Gargantini - Alain Giorgetti - Christoph Gladisch - Martin Gogolla - Arnaud Gotlieb - Marieke Huisman - Bart Jacobs - Einar Broch Johnsen (chair) - Nikolai Kosmatov - Laura Kovacs - Martin Leuker - Panagiotis Manolios - Karl Meinke - Andreas Podelski - Andrew J. Reynolds - Martina Seidl - Martin Steffen - Martin Strecker - T. H. Tse - Luca Vigan? - Burkhart Wolff - Stijn de Gouw Contact ------- mailto:tap2017 at easychair.org -- Sebastian Gabmeyer Security Engineering Group Computer Science Department TU Darmstadt & CASED A: Mornewegstrasse 32, 64293 Darmstadt, Germany (4th floor, room 4.3.17) P: +49-6151-16-25621 E: gabmeyer at seceng.informatik.tu-darmstadt.de W: www.seceng.informatik.tu-darmstadt.de/people/dr-sebastian-gabmeyer/ -- Sebastian Gabmeyer Security Engineering Group Computer Science Department TU Darmstadt & CASED A: Mornewegstrasse 32, 64293 Darmstadt, Germany (4th floor, room 4.3.17) P: +49-6151-16-25621 E: gabmeyer at seceng.informatik.tu-darmstadt.de W: www.seceng.informatik.tu-darmstadt.de/people/dr-sebastian-gabmeyer/ From eacsl at kahle.ch Sun Feb 12 04:19:55 2017 From: eacsl at kahle.ch (European Association of Computer Science Logic) Date: Sun, 12 Feb 2017 09:19:55 +0000 Subject: [TYPES/announce] Metafinite 2017 - Call for Presentations Message-ID: Call for Presentations: Workshop on Metafinite model theory and definability and complexity of numeric graph parameters (Metafinite 2017) Affiliated with LICS 2017 June 19 2017, Reykjavik, Iceland http://cs.technion.ac.il/~janos/metafinte2017 AIM: The workshop will bring together three strands of investigation dealing with the model theory and complexity of numeric graph parameters and their generalization to other first order structures. (A) Gurevich and Graedel in 1998 initiated the study of metafinite model theory to study descriptive complexity of numeric parameters. Metafinite model theory found most of its applications in databases and abstract state machines (ASM), but was not widely studied in connection to numeric combinatorial parameters. (B) Courcelle, Makowsky and Rotics initiated a definability theory for graph polynomials in 2000 and proved metatheorems for graph polynomials and numeric structural parameters. (C) Kotek, Makowsky and Ravve questioned wether the Turing model of computation was the right choice to discuss the complexity of numeric graph parameters and proposed alternatives using the Blum-Shub-Smale model of computation. The aim of the workshop is to bring together researchers of these three strands in order to further explore and elaborate on the appropriate framework for the study of numeric structural parameters and polynomials and to investigate further metatheorems. For more background see http://cs.technion.ac.il/~janos/metafinte2017 ORGANIZERS and PC: A. Goodall (Charles University, Prague) J.A. Makowsky (Technion, Haifa) E.V. Ravve (ORT-Braude, Karmiel) KEYNOTE SPEAKERS: Y. Gurevich (Microsoft, Redmond) E. Graedel (RWTH, Aachen) CONFIRMED SPEAKERS: K. Meer (BTU, Cottbus) M. Ziegler (KAIST, Southkorea) T. Kotek (TU, Vienna) N. Labai (TU, Vienna) A. Manuel (CMI, Chennai) T. Colcombet (Paris VII, Paris) SUBMISSION: Proposal for 30 minutes talk are sollicited in the form of an abstract of up to 4 pages in pdf-format. This may include already published material relevant for the workshop, original contributions, as well as work in progress. Submissions are for talks, not for papers. There will be no formal proceedings. Hence submissions should have a single author who is the speaker. The abstract may include a list of coauthors. Proposals for presentation should be sent to cselena at braude.ac.il with subject: Metafinite 2017 PUBLICATION: Accepted presentations will be posted on the workshop homepage. It is planned to publish a special issue in a suitable journal, based on the accepted presentations. The special issue is meant to focus on Metafinite Model Theory and its applications. IMPORTANT DATES (AoE): * Submission: Friday 7 April 2017 * Notification: Monday 24 April 2017 * Final version: Monday 15 May 2017 * Workshop: Monday June 19 2017 CONTACT: For further questions write to Dr. Elena Ravve at cselena at braude.ac.il -------------- next part -------------- An HTML attachment was scrubbed... URL: From alcaraz at lcc.uma.es Mon Feb 13 16:12:45 2017 From: alcaraz at lcc.uma.es (Cristina Alcaraz) Date: Mon, 13 Feb 2017 22:12:45 +0100 Subject: [TYPES/announce] CFP: Twenty-second European Symposium on Research in Computer Security (ESORICS 2017) Message-ID: ================================================================================ *** Apologies for multiple copies *** C a l l F o r P a p e r s Twenty-second European Symposium on Research in Computer Security (ESORICS 2017) Oslo, Norway -- September 11-15, 2017 WWW: https://www.ntnu.edu/web/esorics2017/ ================================================================================ Overview ------------------------------------ ESORICS is the annual European research event in Computer Security. The Symposium started in 1990 and has been held in several European countries, attracting a wide international audience from both the academic and industrial communities. Papers offering novel research contributions in computer security are solicited for submission to the Symposium. The primary focus is on original, high quality, unpublished research and implementation experiences. We encourage submissions of papers discussing industrial research and development. Important Dates ------------------------------------ * Paper submission deadline: April 19, 2017 * Notification to authors: June 16, 2016 * Camera ready due: July 26, 2016 Topics of Interest ------------------------------------ Topics of interest include, but are not limited to: * access control * accountability * ad hoc networks * anonymity * applied cryptography * authentication * biometrics * data and computation integrity * database security * data protection * digital content protection * digital forensics * distributed systems security * embedded systems security * inference control * information hiding * identity management * information flow control * information security governance and management * intrusion detection * formal security methods * language-based security * network security * phishing and spam prevention * privacy * privacy preserving data mining * risk analysis and management * secure electronic voting * security architectures * security economics * security metrics * security models * security and privacy for big data * security and privacy in cloud scenarios * security and privacy in complex systems * security and privacy in content centric networking * security and privacy in crowdsourcing * security and privacy in the IoT * security and privacy in location services * security and privacy for mobile code * security and privacy in pervasive / ubiquitous computing * security and privacy policies * security and privacy in social networks * security and privacy in web services * security and privacy in cyber-physical systems * security, privacy and resilience in critical infrastructures * security verification * software security * systems security * trust models and management * trustworthy user devices * usable security and privacy * web security * wireless security Paper Submission Guidelines ------------------------------------ Submissions must be made through EasyChair at: https://easychair.org/conferences/?conf=esorics2017 Submitted papers must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal or a conference/workshop with proceedings. The symposium proceedings will be published by Springer in the Lecture Notes in Computer Science series (LNCS). All submissions should follow the LNCS template from the time they are submitted. Submitted papers should be at most 16 pages (using 10-point font), excluding the bibliography and well-marked appendices, and at most 20 pages total. Committee members are not required to read the appendices, so the paper should be intelligible without them. All submissions must be written in English. Submissions are to be made to the Submission web site. Only pdf files will be accepted. Submissions not meeting these guidelines risk rejection without consideration of their merits. Authors of accepted papers must guarantee that their papers will be presented at the conference. Papers must be received by the aforementioned dates, 11:59 p.m. American Samoa time (UTC-11). Organisation Committee ------------------------------------ General Chairs: * Einar Snekkenes, Norwegian University of Science and Technology (NTNU), Norway. Organization Chair: * Laura Georg, Norwegian University of Science and Technology (NTNU), Norway. Workshop Chair: * Sokratis Katsikas, Norwegian University of Science and Technology (NTNU), Norway. Program Committee Chairs: * Dieter Gollman, Technische Universit?t Hamburg-Harburg, Germany * Simon Foley, IMT Atlantique, France Program Committee: Gail-Joon Ahn, Arizona State University, USA Alessandro Armando, University of Genoa, Italy Michael Backes, Saarland University, Germany Giampaolo Bella, Universit? degli studi di Catania, Italy Elisa Bertino, Purdue University, USA Carlo Blundo, Universit? degli studi di Salerno, Italy Rainer B?hme, University of Innsbruck, Austria Colin Boyd, Norwegian University of Science and Technology, Norway Stefan Brunthaler, SBA Research, Austria Tom Chothia, University of Birmingham, UK Sherman S. M. Chow, Chinese University of Hong Kong, Hong Kong Mauro Conti, University of Padua, Italy Cas Cremers, University of Oxford, UK Frederic Cuppens, IMT Atlantique, France Nora Cuppens-Boulahia, IMT Atlantique, France Mads Dam, KTH, Sweden Sabrina De Capitani di Vimercati, Universit? degli studi di Milano, Italy Herve Debar, Telecom SudParis, France Roberto Di Pietro, Nokia Bell Labs, France Josep Domingo-Ferrer, Universitat Rovira i Virgili, Spain Wenliang Du, Syracuse University, USA Pavlos Efraimidis, Democritus University of Thrace, Greece Hannes Federrath, University of Hamburg, Germany Simone Fischer-H?bner, Karlstad University, Sweden Riccardo Focardi, Universit? Ca? Foscari di Venezia, Italy Simon Foley, IMT Atlantique, France Sara Foresti, Universit? degli studi di Milano, Italy Katrin Franke, Norwegian University of Science and Technology, Norway Felix Freiling, Friedrich-Alexander-Universit?t Erlangen-N?rnberg, Germany Joaquin Garcia-Alfaro, Telecom ParisSud, France Dieter Gollmann, Hamburg University of Technology, Germany Dimitris Gritzalis, Athens University of Economics and Business, Greece Stefanos Gritzalis, University of the Aegean, Greece Joshua Guttman, Worcester Polytechnic Institute, USA Gerhard Hancke, City University of Hong Kong, China Marit Hansen, Unabh?ngiges Landeszentrum f?r Datenschutz Schleswig-Holstein, Germany Feng Hao, Newcastle University, UK Cormac Herley, Microsoft Research , USA Xinyi Huang, Fujian Normal University, China Michael Huth, Imperial College, UK Aaron D. Jaggard, U.S. Naval Research Laboratory, USA Sushil Jajodia, George Mason University, USA Limin Jia, Carnegie Mellon University, USA Wouter Joosen, KU Leuven, Belgium Vasilis Katos, Bournemouth University, UK Sokratis Katsikas, Norwegian University of Science and Technology, Norway Florian Kerschbaum, University of Waterloo, Canada Dogan Kesdogan, Universit?t Regensburg, Germany Kwangjo Kim, Korea Advanced Institute of Science and Technology, Korea Steve Kremer, INRIA Nancy-Grand Est, France Marina Krotofil, Honeywell, USA Ralf K?sters, University of Trier, Germany Junzuo Lai, Singapore Management University, Singapore Kwok-yan Lam, Nanyang Technological University, Singapore Costas Lambrinoudakis, University of Piraeus, Greece Peeter Laud, Cybernetica AS, Estonia Adam J. Lee, University of Pittsburgh, USA Gabriele Lenzini, University of Luxembourg, Luxembourg Yingjiu Li, Singapore Management University, Singapore Antonio Lioy, Politecnico di Torino, Italy Peng Liu, The Pennsylvania State University, USA Javier Lopez, University of Malaga, Spain Antonio Ma?a, University of Malaga, Spain Pratyusa K. Manadhata, Hewlett Packard Labs, USA Luigi V. Mancini, "Universita di Roma ""La Sapienza""", Italy Heiko Mantel, TU Darmstadt, Germany Olivier Markowitch, Universit? Libre de Bruxelles, Belgium Fabio Martinelli, IIT-CNR, Italy Sjouke Mauw, University of Luxembourg, Luxembourg Catherine Meadows, Naval Research Laboratory, USA John Mitchell, Stanford University, USA Aikaterini Mitrokotsa, Chalmers University of Technology, Sweden Refik Molva, EURECOM, France Charles Morisset, Newcastle University, UK Rolf Oppliger, eSECURITY Technologies, Switzerland Stefano Paraboschi, Universit? di Bergamo, Italy Dusko Pavlovic, University of Hawaii, USA G?nther Pernul, Universit?t Regensburg, Germany David Pichardie, ENS-IRISA, Rennes Frank Piessens , Katholieke Universiteit Leuven, Belgium Wolter Pieters, Delft University of Technology, The Netherlands Michalis Polychronakis, Stonybrook University, USA Christina P?pper, NYU Abu Dhabi, UAE Joachim Posegga, University of Passau, Germany Christian Probst, Technical University of Denmark, Denmark Kai Rannenberg, Goeth University, Germany Awais Rashid, Lancaster University, UK Indrajiti Ray, Colorado State University, USA Kui Ren, State University of New York at Buffalo, USA Mark Ryan, University of Birmingham, UK Peter Y.A. Ryan, University of Luxembourg, Luxembourg Rene Rydhof Hansen, Aarhus University, Denmark Andrei Sabelfeld, Chalmers University of Technology, Sweden Rei Safavi-Naini, University of Calgary, Canada Pierangela Samarati, Universit? degli studi di Milano, Italy Ravi Sandhu, University of Texas at San Antonio, USA Ralf Sasse, ETH Z?rich, Switzerland Nitesh Saxena, University of Alabama at Birmingham, USA Andreas Schaad, Huawei European Research Center, Germany Steve Schneider, University of Surrey, UK Basit Shafiq, Lahore University of Management Sciences, Pakistan Einar Snekkenes, Norwegian University of Science and Technology, Norway Willy Susilo, University of Wollongong, Australia Krzysztof Szczypiorski, Warsaw University of Technology, Poland Bj?rn Tackmann, IBM Research, Switzerland Qiang Tang, New Jersey Institute of Technology, USA Nils Ole Tippenhauer, Singapore University of Technology and Design, Singapore jaideep Tsochou, Ionion University, Greece Vijay Varadharajan, Macquarie University, Australia Luca Vigan?, King's College London, UK Michael Waidner, Fraunhofer SIT & TU Darmstadt, Germany Cong Wang, City University of Hong Kong, China Ben Smyth, Huawei, France Edgar Weippl, SBA Research, Austria Stephen Wolthusen, Royal Holloway university, UK Christos Xenakis, University of Piraeus, Greece Jeff Yan, Lancaster University, UK Meng Yu, University of Texas at San Antonio, USA Ben Zhao, University of California at Santa Barbara, USA Jianying Zhou, Institute for Infocomm Research, Singapore J?rg Schwenk, Ruhr-Universit?t, Bochum Publicity Chair * Cristina Alcaraz, University of Malaga, Spain From lindsey at composition.al Mon Feb 13 21:34:36 2017 From: lindsey at composition.al (Lindsey Kuper) Date: Mon, 13 Feb 2017 18:34:36 -0800 Subject: [TYPES/announce] MAPL Call for Papers Message-ID: The First Workshop on Machine Learning and Programming Languages (MAPL) (https://sites.google.com/view/mapl2017/home, co-located with PLDI) Call for Papers Due to recent algorithmic and computational advances, machine learning has seen a surge of interest in both research and practice. From natural language processing to self-driving cars, machine learning is creating new possibilities that are changing the way we live and interact with computers. However, the impact of these advances on programming languages remains mostly untapped. Yet, incredible research opportunities exist when combining machine learning and programming languages in novel ways. MAPL seeks to bring together programming language and machine learning communities to encourage collaboration and exploration in cross disciplinary research. The workshop will include a combination of peer-reviewed papers and invited events, such as invited talks, panels and/or town hall discussions. MAPL seeks papers on a diverse range of topics related to programming languages and machine learning including: - Programming languages and compilers for machine learning - Deep learning frameworks - Machine learning for compilation and run-time scheduling - Improving programmer productivity via machine learning - Inductive programming - Formal verification of machine learning systems - Probabilistic programming - Collaborative human / computer programming - Interoperability of machine learning frameworks and existing code bases Important Dates: - Submission Deadline: April 3, 2017 - Author Notification: April 24, 2017 - Camera-ready Deadline: May 10, 2017 - Workshop: June 18, 2017 Submissions: Papers must be submitted in PDF and be no more than 8 pages in standard two-column SIGPLAN conference format including figures and tables but not including references. Shorter submissions are welcome. The submissions will be judged based on the merit of the ideas rather than the length. Formal proceedings will be included in the ACM digital archive and available at the workshop. General Chair: Tatiana Shpeisman Program Chair: Justin Gottschlich Program Committee: Raj Barik (Intel Labs) Stefano Ermon (Stanford University) Justin Gottschlich (Program Chair, Intel Labs) Mary Hall (University of Utah) Peter Hawkins (Google) Costin Iancu (Lawrence Berkeley National Lab) Michael O?Boyle (University of Edinburgh) Kunle Olukotun (Stanford University) Tatiana Shpeisman (Intel Labs) Organizing Committee: Raj Barik (Intel Labs) Stefano Ermon (Stanford University) Justin Gottschlich (Intel Labs) Costin Iancu (Lawrence Berkeley National Lab) Kunle Olukotun (Stanford University) Tatiana Shpeisman (Intel Labs) From songfu at shanghaitech.edu.cn Wed Feb 15 02:21:52 2017 From: songfu at shanghaitech.edu.cn (songfu at shanghaitech.edu.cn) Date: Wed, 15 Feb 2017 15:21:52 +0800 Subject: [TYPES/announce] Call for Papers -- SETTA 2017: 3rd Symposium on Dependable Software Engineering: Theories, Tools and Applications Message-ID: <2017021515215257172516@shanghaitech.edu.cn> [Please accept our apologies if you receive multiple copies of this Call for Papers (CFP)] ******************************** Call For Paper ****************************************** SETTA 2017: 3rd Symposium on Dependable Software Engineering: Theories, Tools and Applications October 23-25, 2017, Changsha, China Website: http://lcs.ios.ac.cn/setta2017/ ******************************************************************************************** Important Dates . Abstract submission:April 21, 2017 (AoE) . Full paper submission: April 28, 2017 (AoE) . Notification to authors: July 3, 2017 (AoE) . Camera-ready: July 28, 2017 (AoE) . Conference date: October 23-25, 2017 Objectives The aim of the symposium is to bring together international researchers and practitioners in the field of software technology. Its focus is on formal methods and advanced software technologies, especially for engineering complex, large-scale artifacts like cyber-physical systems, networks of things, enterprise systems, or cloud-based services. Contributions relating to formal methods or integrating them with software engineering, as well as papers advancing scalability or widening the scope of rigorous methods to new design goals are especially welcome. SETTA 2017 is planning to organize a special thematic section, namely Dependability of Smart Cyber-Physical Systems. Topics of interest include, but are not limited to: . Requirements specification and analysis . Formalisms for modeling, design and implementation . Model checking, theorem proving, and decision procedures . Scalable approaches to formal system analysis . Formal approaches to simulation and testing . Integration of formal methods into software engineering practice . Contract-based engineering of components, systems, and systems of systems . Formal and engineering aspects of software evolution and maintenance . Parallel and multi-core programming . Embedded, real-time, hybrid, and cyber-physical systems . Mixed-critical applications and systems . Formal aspects of service-oriented and cloud computing . Safety, security, reliability, robustness, and fault-tolerance . Dependability of smart software and systems . Empirical analysis techniques and integration with formal methods . Applications and industrial experience reports . Tool integration Paper Submission Authors are invited to submit papers on original research, industrial applications, or position papers proposing challenges in fundamental research and technology. The latter two types of submissions are expected to contribute to the development of formal methods either by substantiating the advantages of integrating formal methods into the development cycle or through delineating need for research by demonstrating weaknesses of existing technologies, especially when addressing new application domains. Submissions can take the form of either regular or short papers. Short papers can discuss ongoing research at an early stage, including PhD projects. Papers should be written in English. Regular Papers should not exceed 16 pages and Short Papers should not exceed 6 pages in LNCS format. The proceedings is expected to be published as a volume in Springer's LNCS series, as that of the past editions. The authors of a selected subset of accepted papers will be invited to submit extended versions of their papers to appear in special issues of the reputable journals. Submission Site: https://easychair.org/conferences/?conf=setta2017 Organizers General chair: . Xiangke Liao, National University of Defense Technology, China Program Chairs: . Kim G. Larsen, Aalborg University, Denmark . Oleg Sokolsky, University of Pennsylvania, USA . Ji Wang, National University of Defense Technology, China Publicity Chair: . Fu Song, ShanghaiTech University, China Local Organization Chair: . Wei Dong, National University of Defense Technology, China PC Members: . Erika Abraham, RWTH Aachen University, Germany . Farhad Arbab, CWI and Leiden University, Netherlands . Sanjoy Baruah, University of North Carolina, USA . Michael Butler, University of Southampton, UK . Yunxin Deng, ECNU, China . Deepak D'Souza, Indian Institute of Science, India . Xinyu Feng, University of Science and Technology of China, China . Martin Fraenzle, University of Oldenburg, Germany . Goran Frehse, University of Grenoble Alpes-Laboratoire Verimag, France . Lindsay Groves, University of Wellington, New Zealand . Dimitar Guelev, Bulgarian Academy of Sciences, Bulgaria . Fei He, Tsinghua University, China . Deepak Kapur, University of New Mexico, USA . Kim Larsen, University of Aalborg, Denmark . Axel Legay, IRISA/INRIA, France . Xuandong Li, Nanjing University, China . Shaoying Liu, Hosei University, Japan . Zhiming Liu, Southwest University, China . Xiaoguang Mao, NUDT, China . Markus Muller-Olm, Westfalische Wilhelms-Universitat Munster, Germany . Raja Natarajan, TIFR, India . Jun Pang, University of Luxembourg, Luxembourg . Shengchao Qin, Teesside University, UK . Stefan Ratschan, Czech Academy of Sciences, Czech . Sriram Sankaranarayanan, University of Colorado, USA . Oleg Sokolsky, University of Pennsylvania, USA . Martin Steffen, University of Oslo, Norway . Zhendong Su, UC Davis, USA . Cong Tian, Xidian University, China . Tarmo Uustalu, Tallinn University of Technology, Estonia . Chao Wang, University of Southern California, USA . Farn Wang, National Taiwan University, ROC . Ji Wang, NUDT, China. . Heike Wehrheim, University of Paderborn, Germany . Michael Whalen, University of Minnesota, USA . Wang Yi, Uppsala University, Sweden . Naijun Zhan, ISCAS, China . Lijun Zhang, ISCAS, China . Haibo Zeng, Virginia Tech University, USA Contact email: setta2017 at ios.ac.cn -------------- next part -------------- An HTML attachment was scrubbed... URL: From amal at ccs.neu.edu Wed Feb 15 11:52:59 2017 From: amal at ccs.neu.edu (Amal Ahmed) Date: Wed, 15 Feb 2017 11:52:59 -0500 Subject: [TYPES/announce] Oregon PL Summer School 2017: call for participation Message-ID: <1E36AEB4-4350-41D1-9287-FA09A026944C@ccs.neu.edu> We are pleased to announce the program for the 16th annual Oregon Programming Languages Summer School (OPLSS) to be held from June 26th to July 8th, 2017 at the University of Oregon in Eugene. The registration deadline is April 1st, 2017. Full information on registration and scholarships can be found here: http://www.cs.uoregon.edu/Activities/summerschool This year's program is titled: A Spectrum of Types. The speakers and topics include: Amal Ahmed -- Correct and Secure Compilation for Multi-Language Software Northeastern University Edwin Brady -- Dependent Types in the Idris Programming Language University of St. Andrews Ron Garcia -- Gradual Typing University of British Columbia Robert Harper -- Programming Languages Background Carnegie Mellon University Neel Krishnaswami -- Dependent Types and Linearity University of Cambridge Dan Licata -- Programming Languages Background Wesleyan University Frank Pfenning -- Substructural Type Systems and Concurrent Programming Carnegie Mellon University Sam Tobin-Hochstadt -- Contracts and Gradual Types Indiana University David Van Horn -- Redex, Abstract Machines, and Abstract Interpretation University of Maryland The school has a long and successful tradition (sponsored by the NSF, ACM SIGPLAN, and industry). It covers current research in the theory and practice of programming languages. Material is presented at a tutorial level that will help graduate students and researchers from academia or industry understand the critical issues and open problems confronting the field. Prerequisites are an elementary knowledge of logic and mathematics, as covered in undergraduate classes on discrete mathematics, and some knowledge of programming languages at the level of an undergraduate survey course. A *new feature* this year is the option for students to attend a Review session from June 23rd to 25th -- the three days before the summer school officially begins. The review will cover operational semantics, type systems, and basic proof techniques, and will help graduate and especially undergraduate students who have not had a previous course in this material prepare for the main part of the school. Please contact the organizers if you have questions about whether the review will be helpful given your background. We hope you can join us for this excellent program! Amal Ahmed Dan Licata Zena Ariola -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: logo-small.png Type: image/png Size: 20102 bytes Desc: not available URL: From P.Achten at cs.ru.nl Wed Feb 15 10:21:45 2017 From: P.Achten at cs.ru.nl (Peter Achten) Date: Wed, 15 Feb 2017 16:21:45 +0100 Subject: [TYPES/announce] 1st call for papers: Trends in Functional Programming, 19-21 june 2017, University of Kent, Canterbury Message-ID: <864be742-2ec8-bb32-9372-1eb24d4cdfb6@cs.ru.nl> ----------------------------- C A L L F O R P A P E R S ----------------------------- ======== TFP 2017 =========== 18th Symposium on Trends in Functional Programming 19-21 June, 2017 University of Kent, Canterbury https://www.cs.kent.ac.uk/events/tfp17/index.html The symposium on Trends in Functional Programming (TFP) is an international forum for researchers with interests in all aspects of functional programming, taking a broad view of current and future trends in the area. It aspires to be a lively environment for presenting the latest research results, and other contributions (see below). Authors of draft papers will be invited to submit revised papers based on the feedback receive at the symposium. A post-symposium refereeing process will then select a subset of these articles for formal publication. TFP 2017 will be the main event of a pair of functional programming events. TFP 2017 will be accompanied by the International Workshop on Trends in Functional Programming in Education (TFPIE), which will take place on 22 June. The TFP symposium is the heir of the successful series of Scottish Functional Programming Workshops. Previous TFP symposia were held in * Edinburgh (Scotland) in 2003; * Munich (Germany) in 2004; * Tallinn (Estonia) in 2005; * Nottingham (UK) in 2006; * New York (USA) in 2007; * Nijmegen (The Netherlands) in 2008; * Komarno (Slovakia) in 2009; * Oklahoma (USA) in 2010; * Madrid (Spain) in 2011; * St. Andrews (UK) in 2012; * Provo (Utah, USA) in 2013; * Soesterberg (The Netherlands) in 2014; * Inria Sophia-Antipolis (France) in 2015; * and Maryland (USA) in 2016. For further general information about TFP please see the TFP homepage. (http://www.tifp.org/). == SCOPE == The symposium recognizes that new trends may arise through various routes. As part of the Symposium's focus on trends we therefore identify the following five article categories. High-quality articles are solicited in any of these categories: Research Articles: leading-edge, previously unpublished research work Position Articles: on what new trends should or should not be Project Articles: descriptions of recently started new projects Evaluation Articles: what lessons can be drawn from a finished project Overview Articles: summarizing work with respect to a trendy subject Articles must be original and not simultaneously submitted for publication to any other forum. They may consider any aspect of functional programming: theoretical, implementation-oriented, or experience-oriented. Applications of functional programming techniques to other languages are also within the scope of the symposium. Topics suitable for the symposium include, but are not limited to: Functional programming and multicore/manycore computing Functional programming in the cloud High performance functional computing Extra-functional (behavioural) properties of functional programs Dependently typed functional programming Validation and verification of functional programs Debugging and profiling for functional languages Functional programming in different application areas: security, mobility, telecommunications applications, embedded systems, global computing, grids, etc. Interoperability with imperative programming languages Novel memory management techniques Program analysis and transformation techniques Empirical performance studies Abstract/virtual machines and compilers for functional languages (Embedded) domain specific languages New implementation strategies Any new emerging trend in the functional programming area If you are in doubt on whether your article is within the scope of TFP, please contact the TFP 2017 program chairs, Scott Owens and Meng Wang. == BEST PAPER AWARDS == To reward excellent contributions, TFP awards a prize for the best paper accepted for the formal proceedings. TFP traditionally pays special attention to research students, acknowledging that students are almost by definition part of new subject trends. A student paper is one for which the authors state that the paper is mainly the work of students, the students are listed as first authors, and a student would present the paper. A prize for the best student paper is awarded each year. In both cases, it is the PC of TFP that awards the prize. In case the best paper happens to be a student paper, that paper will then receive both prizes. == SPONSORS == TBD == PAPER SUBMISSIONS == Acceptance of articles for presentation at the symposium is based on a lightweight peer review process of extended abstracts (4 to 10 pages in length) or full papers (20 pages). The submission must clearly indicate which category it belongs to: research, position, project, evaluation, or overview paper. It should also indicate which authors are research students, and whether the main author(s) are students. A draft paper for which ALL authors are students will receive additional feedback by one of the PC members shortly after the symposium has taken place. We use EasyChair for the refereeing process. Papers must be submitted at: https://easychair.org/conferences/?conf=tfp17 Papers must be written in English, and written using the LNCS style. For more information about formatting please consult the Springer LNCS web site: http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0 == IMPORTANT DATES == Submission of draft papers: 5 May, 2017 Notification: 12 May, 2017 Registration: 11 June, 2017 TFP Symposium: 19-21 June, 2017 Student papers feedback: 29 June, 2017 Submission for formal review: 2 August, 2017 Notification of acceptance: 3 November, 2017 Camera ready paper: 2 December, 2017 == PROGRAM COMMITTEE == TBD From ayoub.nouri at univ-grenoble-alpes.fr Wed Feb 15 07:10:29 2017 From: ayoub.nouri at univ-grenoble-alpes.fr (Ayoub Nouri) Date: Wed, 15 Feb 2017 13:10:29 +0100 Subject: [TYPES/announce] 2nd call RV2017: Runtime Verification, September 13 - 16 2017, Seattle USA Message-ID: RV 2017 *2nd Call for Papers and Tutorials* The 17th International Conference on Runtime Verification September 13-16, Seattle, WA, USA http://rv2017.cs.manchester.ac.uk rv2017 at easychair.org Runtime verification is concerned with the monitoring and analysis of the runtime behaviour of software and hardware systems. Runtime verification techniques are crucial for system correctness, reliability, and robustness; they provide an additional level of rigor and effectiveness compared to conventional testing, and are generally more practical than exhaustive formal verification. Runtime verification can be used prior to deployment, for testing, verification, and debugging purposes, and after deployment for ensuring reliability, safety, and security and for providing fault containment and recovery as well as online system repair. Topics of interest to the conference include, but are not limited to: * specification languages * monitor construction techniques * program instrumentation * logging, recording, and replay * combination of static and dynamic analysis * specification mining and machine learning over runtime traces * monitoring techniques for concurrent and distributed systems * runtime checking of privacy and security policies * statistical model checking * metrics and statistical information gathering * program/system execution visualization * fault localization, containment, recovery and repair * integrated vehicle health management (IVHM) Application areas of runtime verification include cyber-physical systems, safety/mission-critical systems, enterprise and systems software, autonomous and reactive control systems, health management and diagnosis systems, and system security and privacy. We welcome contributions exploring the combination of runtime verification techniques with machine learning and static analysis. Whilst these are highlight topics, papers falling into these categories will not be treated differently from other contributions. An overview of previous RV conferences and earlier workshops can be found at: http://www.runtime-verification.org. RV 2017 will be held September 13-16 in Seattle, WA, USA. RV 2017 will feature a tutorial day (September 13), and three conference days (September 14-16). Important Dates *Papers*as well as *tutorial proposals*will follow the following timeline: * Abstract deadline: April 24, 2017 (Anywhere on Earth) * Paper and tutorial deadline: May 1, 2017 (Anywhere on Earth) * Tutorial notification: May 21, 2017 * Paper notification: June 26, 2017 * Conference: September 13-16, 2017 General Information on Submissions All papers and tutorials will appear in the conference proceedings in an LNCS volume. Submitted papers and tutorials must use the LNCS/Springer style detailed here: http://www.springer.de/comp/lncs/authors.html Papers must be original work and not be submitted for publication elsewhere. Papers must be written in English and submitted electronically (in PDF format) using the EasyChair submission page here: https://easychair.org/conferences/?conf=rv17 The page limitations mentioned below include all text and figures, but exclude references. Additional details omitted due to space limitations may be included in a clearly marked appendix, that will be reviewed at the discretion of reviewers, but not included in the proceedings. At least one author of each accepted paper and tutorial must attend RV 2017 to present. Paper Submissions There are three categories of papers which can be submitted: regular, short or tool papers. Papers in each category will be reviewed by at least 3 members of the Program Committee. * *Regular Papers* (up to 15 pages, not including references) should present original unpublished results. We welcome theoretical papers, system papers, papers describing domain-specific variants of RV, and case studies on runtime verification. * *Short Papers* (up to 6 pages, not including references) may present novel but not necessarily thoroughly worked out ideas, for example emerging runtime verification techniques and applications, or techniques and applications that establish relationships between runtime verification and other domains. * *Tool Demonstration Papers* (up to 8 pages, not including references) should present a new tool, a new tool component, or novel extensions to existing tools supporting runtime verification. The paper must include information on tool availability, maturity, selected experimental results and it should provide a link to a website containing the theoretical background and user guide. Furthermore, we strongly encourage authors to make their tools and benchmarks available with their submission. The Program Committee of RV 2017 will give a best paper award, and a selection of accepted regular papers will be invited to appear in a special issue of the Springer Journal on Formal Methods in System Design . Tutorial Submissions Tutorials are two-to-three-hour presentations on a selected topic. Additionally, tutorial presenters will be offered to publish a paper of up to 20 pages in the LNCS conference proceedings, not including references. A proposal for a tutorial must contain the subject of the tutorial, a proposed timeline, a note on previous similar tutorials (if applicable) and the differences to this incarnation, and a brief biography of the presenter. The proposal should not exceed 2 pages. Organization *General Chair* Klaus Havelund , NASA Jet Propulsion Laboratory, USA *Program Chairs* Giles Reger , University of Manchester, UK Shuvendu Lahiri , Microsoft Research, USA *Finance Chair* Oleg Sokolsky , University of Pennsylvania, USA *Publicity Chair* Ayoub Nour i, University of Grenoble Alpes, France *Local Organisation Chairs* Grigory Fedyukovich , University of Washington, USA Rahul Kumar , Microsoft Research, USA *Program Committee* Wolfgang Ahrendt , Chalmers Univ. of Technology/Univ. of Gothenburg, Sweden Cyrille Artho , KTH Royal Institute of Technology, Sweden Howard Barringer , The University of Manchester, UK Ezio Bartocci , Vienna University of Technology, Austria Andreas Bauer , KUKA Systems, Germany Saddek Bensalem , VERIMAG (University of Grenoble Alpes), France Eric Bodden , Fraunhofer SIT and Technische University Darmstadt, Germany Borzoo Bonakdarpour , McMaster University, Canada Christian Colombo , University of Malta, Malta Ylies Falcone , University of Grenoble Alpes, France Grigory Fedyukovich , University of Washington, USA Lu Feng , University of Virginia, USA Patrice Godefroid , Microsoft Research, USA Jean Goubault-Larrecq , CNRS& ENSde Cachan, France Alex Groce , Northern Arizona University, USA Radu Grosu , Vienna University of Technology, Austria Sylvain Hall? , University of Qu?bec at Chicoutimi, Canada Marieke Huisman , University of Twente, Netherlands Franjo Ivancic , Google Bengt Jonsson , Uppsala University, Sweden Felix Klaedtke , NEC Europe Ltd. Rahul Kumar , Microsoft Research, USA Kim Larsen , Aalborg University, Denmark Insup Lee , University of Pennsylvania, USA Axel Legay , Inria Rennes, France Martin Leucker , University of L?beck, Germany Ben Livshits , Microsoft Research, USA David Lo , Singapore Management University, Singapore Francesco Logozzo , Facebook Parthasarathy Madhusudan , University of Illinois at Urbana-Champaign, USA Leonardo Mariani , University of Milan Bicocca, Italy Madanlal Musuvathi , Microsoft Research Ayoub Nouri , University of Grenoble Alpes, France Gordon Pace , University of Malta, Malta Doron Peled , Bar Ilan University, Israel Grigore Rosu , University of Illinois at Urbana-Champaign, USA Veselin Raychev , ETH Zurich, Switzerland Cesar Sanchez , IMDEA Software Institute, Spain Gerardo Schneider, Chalmers Univ. of Technology/Univ. of Gothenburg, Sweden Rahul Sharma , Microsoft Research, USA Julien Signoles , CEA LIST, France Scott Smolka , Stony Brook University, USA Oleg Sokolsky , University of Pennsylvania, USA Bernhard Steffen , University of Dortmund, Germany Scott Stoller , Stony Brook University, USA Volker Stolz , University of Olso, Norway Frits Vaandrager , Radboud University, Netherlands Neil Walkinshaw , University of Leicester, UK Chao Wang , University of Southern California, USA Eugen Zalinescu , Technische Universitat M?nchen, Germany -------------- next part -------------- An HTML attachment was scrubbed... URL: From ezio.bartocci at tuwien.ac.at Wed Feb 15 08:44:37 2017 From: ezio.bartocci at tuwien.ac.at (Ezio Bartocci) Date: Wed, 15 Feb 2017 14:44:37 +0100 Subject: [TYPES/announce] QEST 2017 - Call for papers for the 14th International Conference on Quantitative Evaluation of Systems Message-ID: QEST2017 International Conference on Quantitative Evaluation of SysTems Berlin, September 5th-7th 2017 | www.qest.org/qest2017 Co-located with Concur, EPEW Scope and Topics The International Conference on Quantitative Evaluation of SysTems (QEST) is the leading forum on quantitative evaluation and verification of computer systems and networks. Areas of interest include quantitative specification methods, stochastic models, and metrics for performance, reliability, safety, correctness, and security. QEST is interested in both theoretical and experimental research. QEST welcomes a diversity of modeling formalisms, programming languages and methodologies that incorporate quantitative aspects such as probabilities, approximations and other quantitative aspects. Papers may advance empirical, simulation and analytic methods. Of particular interest are case studies that highlight the role of quantitative specification, modeling and evaluation in the design of systems. Systems of interest include computer hardware and software architectures, communication systems, cyber-physical systems, infrastructural systems, and biological systems. Papers that describe novel tools to support the practical application of research results in all of the above areas are also welcome. Special sessions To encourage submissions of papers in frontier topics, submissions in selected areas are encouraged. Paper submitted to special sessions will be treated as regular submitted papers, they will be peer reviewed, and subject to the same quality requirements. A special session with accepted papers on the selected topics will be organised during the conference. This year selected topics are: Smart Energy Systems over the Cloud <> We solicit contributions dealing with quantitative analysis, verification, and performance evaluation of models of networks of smart devices interconnected physically and over the cloud, and in particular within the technological context of smart energy, dealing with smart buildings, the smart grid, or with modern power networks. Instances of problems of interest are energy management in smart buildings, demand response over smart grids, or frequency control over power networks. We are interested in configurations related to cyber-physical systems, of systems of systems, and of the Internet of things, and on models encompassing continuous and digital components, and uncertainty (either environmental, adversarial, or probabilistic). Machine Learning and Formal Methods <> We call for contributions on the fusion of formal methods and machine learning techniques. In particular, we are interested in the use of machine learning approaches, such as reinforcement learning, learning automata, decision trees, gradient based methods, etc. in (statistical) model checking, controller synthesis, program analysis and synthesis, timed systems, compositional verification, etc. The main aim is to disseminate learning based techniques that have potential of improving theory and practice of formal methods. Special issue A selection of the best papers presented at QEST 2017 will be invited to submit an extended version of their paper for a Special Issue that will appear in the ACM Transactions of Modelling and Computer Simulation. Important Dates Abstract submission: 24 March 2017 Paper and tool submission: 31 March 2017 (AoE) Author notification: 29 May 2017 Final version due: 23 June 2017 Submissions All accepted papers (including tool demonstrations) must be presented at the conference by one of the authors. The QEST 2017 proceedings will be published by Springer in the LNCS Series and indexed by ISI Web of Science, Scopus, ACM Digital Library, dblp, Google Scholar. All submitted papers will be evaluated by at least three reviewers on the basis of their originality, technical quality, scientific or practical contribution to the state of the art, methodology, clarity, and adequacy of references. QEST considers five types of papers with additional reviewing criteria: Theoretical: advance our understanding, apply to non-trivial problems and be mathematically rigorous. Methodological and technical: describe situations that require the development and proposal of new analysis processes and techniques. Application: describes a novel application, and compares with previous results. Tools: should motivate the development of the new tools and the formalisms they support, with a focus on the software architecture and practical capabilities. Tool demonstration: describe a relevant tool, as well as its features, evaluation, or any other information that may demonstrate the merits of the tool. Submissions must be prepared in LaTeX, following Springer's LNCS guidelines . Submitted papers should not exceed 16 pages (4 pages for tool demonstrations). Papers must be unpublished and not be submitted for publication elsewhere. Authors of tool papers (both regular and demonstration) must make their tools and input data available to reviewers; reproducibility of results will be taken into account during the evaluation process, and the conference will include a demo session. Authors should present use cases, distinctive features, and computational/memory requirements through motivating examples. Theoretical background need not be presented in tool demonstration papers; substantial improvements are required for existing tools. Papers should be submitted electronically using the EasyChair online submission system . -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: qest2017-banner.png Type: image/png Size: 97354 bytes Desc: not available URL: From rlc3 at leicester.ac.uk Thu Feb 16 09:05:59 2017 From: rlc3 at leicester.ac.uk (Roy L. Crole) Date: Thu, 16 Feb 2017 14:05:59 +0000 Subject: [TYPES/announce] Midlands Graduate School 2017, Leicester, UK - Registration now open In-Reply-To: <30b2d3dd-6f54-86ca-4fe1-345ebfe3bcc7@le.ac.uk> References: <30b2d3dd-6f54-86ca-4fe1-345ebfe3bcc7@le.ac.uk> Message-ID: Registration is now open for the *The Midlands Graduate School in the Foundations of Computing Science 2017* * April 9-13, Leicester, UK* ( http://www.cs.le.ac.uk/events/mgs2017/ ) The MGS has run very successfully for many years now, and in recent years we have had over 50 participants making for exciting and vibrant schools. We would be delighted to see you in Leicester in 2017. The registration fees include ALL meals; dinners are provided and many members of the lecturing team will be available for discussions during the evenings. Please forward to all those you think will be interested! The organisers: Samuel Balco Roy Crole -- R. L. Crole Associate Professor Department of Informatics University Road University of Leicester Leicester LE1 7RH United Kingdom T: +44 (0)116 252 3404 E: rlc3 at le.ac.uk W: www.cs.le.ac.uk/people/rlc3 Times Higher Awards Winner 2007-2015 -------------- next part -------------- An HTML attachment was scrubbed... URL: From matthias at ccs.neu.edu Thu Feb 16 11:29:58 2017 From: matthias at ccs.neu.edu (Matthias Felleisen) Date: Thu, 16 Feb 2017 11:29:58 -0500 Subject: [TYPES/announce] The Racket Summer School of Semantics and Languages In-Reply-To: <864be742-2ec8-bb32-9372-1eb24d4cdfb6@cs.ru.nl> References: <864be742-2ec8-bb32-9372-1eb24d4cdfb6@cs.ru.nl> Message-ID: The Racket Summer School of Semantics and Languages Imagine yourself confronted with a Mystery Programming Language and charged with the task of figuring out its semantics. What would you do? What if you have a formal executable semantics and want to build a production language for it? If these questions intrigue you, attend the Racket Summer School: http://summer-school.racket-lang.org/2017/ This is not your run-off-the-mill summer school. We will do our best to make it exciting, entertaining, and useful to a broad spectrum of attendees, both academic and industrial. P.S. As soon as you get accepted, we will send you your first problem set. Get ready. From matija.pretnar at fmf.uni-lj.si Wed Feb 15 15:00:14 2017 From: matija.pretnar at fmf.uni-lj.si (Matija Pretnar) Date: Wed, 15 Feb 2017 21:00:14 +0100 Subject: [TYPES/announce] LOLA 2017: Call for talk proposals Message-ID: <510BBAA6-6775-4F34-897C-DE2E85EAD735@fmf.uni-lj.si> CALL FOR TALK PROPOSALS LOLA 2017: Syntax and Semantics of Low-Level Languages ====================================================== Monday, 19 June 2017, Reykjavik, Iceland A satellite workshop of LICS 2017 http://events.cs.bham.ac.uk/lola2017/ Important Dates --------------- - Abstract submission: Wednesday, 19 April 2017 - Author notification: Monday, 1 May 2017 - Workshop: Monday, 19 June 2017 Invited Speakers ---------------- - TBD Context ------- Since the late 1960s it has been known that tools and structures arising in mathematical logic and proof theory can usefully be applied to the design of high-level programming languages, and to the development of reasoning principles for such languages. Yet low-level languages, such as machine code, and the compilation of high-level languages into low-level ones have traditionally been seen as having little or no essential connection to logic. However, a fundamental discovery of this past decade has been that low-level languages are also governed by logical principles. From this key observation has emerged an active and fascinating new research area at the frontier of logic and computer science. The practically- motivated design of logics reflecting the structure of low-level languages (such as heaps, registers and code pointers) and low-level properties of programs (such as resource usage) goes hand in hand with some of the most advanced contemporary research in semantics and proof theory, including classical realizability and forcing, double orthogonality, parametricity, linear logic, game semantics, uniformity, categorical semantics, explicit substitutions, abstract machines, implicit complexity and resource bounded programming. The LOLA workshop, affiliated with LICS 2017, will bring together researchers interested in the relationships and connections between logic and low-level languages and programs. Topics of interest include, but are not limited to: - Typed assembly languages - Certified assembly programming - Certified and certifying compilation - Relaxed memory models - Proof-carrying code - Program optimization - Modal logic and realizability in machine code - Realizability and double orthogonality in assembly code - Parametricity, modules and existential types - General references, Kripke models and recursive types - Continuations and concurrency - Resource analysis and implicit complexity - Closures and explicit substitutions - Linear logic and separation logic - Game semantics, abstract machines and hardware synthesis - Monoidal and premonoidal categories, traces and effects Submission ---------- LOLA is an informal workshop aiming at a high degree of useful interaction amongst the participants, welcoming proposals for talks on work in progress, overviews of larger research programs, position presentations, and short tutorials, as well as more traditional research talks describing new results. The program committee will select the workshop presentations from submitted talk proposals, which may take the form either of a *two page abstract* or of a longer (published or unpublished) paper describing completed work. Authors are invited to submit their contribution by April 28, 2017. Abstracts must be written in English and be submitted as a single PDF file at: https://www.easychair.org/conferences/?conf=lola2017 Submissions will undergo a lightweight review process and will be judged on originality, relevance, interest and clarity. Submission should describe novel works or works that have already appeared elsewhere but that can stimulate the discussion between different communities at the workshop. The workshop will not have formal proceedings and is not intended to preclude later publication at another venue. Program Committee ----------------- - Beniamino Accattoli, INRIA - Michael Greenberg, Pomona College - Patricia Johann, Appalachian State University - Ohad Kammar, University of Oxford - Matija Pretnar, University of Ljubljana (co-chair) - Nikos Tzevelekos, Queen Mary University of London - Noam Zeilberger, University of Birmingham (co-chair) From icfp.publicity at googlemail.com Wed Feb 15 23:43:55 2017 From: icfp.publicity at googlemail.com (Lindsey Kuper) Date: Wed, 15 Feb 2017 20:43:55 -0800 Subject: [TYPES/announce] Final Call for Papers: ICFP 2017 Message-ID: <58a52e0b3a751_1ae73fdf45c55be8652be@landin.local.mail> ICFP 2017 The 22nd ACM SIGPLAN International Conference on Functional Programming Oxford, United Kingdom http://icfp17.sigplan.org/ Final Call for Papers ### Important dates Submissions due: Monday, February 27, Anywhere on Earth https://icfp17.hotcrp.com Author response: Monday, April 17, 2017, 15:00 (UTC) - Thursday, April 20, 2017, 15:00 (UTC) Notification: Monday, 1 May, 2017 Final copy due: Monday, 5 June 2017 Early registration: TBA Conference: Monday, 4 September - Wednesday, 6 September, 2017 ### New this year Those familiar with previous ICFP conferences should be aware of two significant changes that are being introduced in 2017: 1. Papers selected for ICFP 2017 will be published as the ICFP 2017 issue of a new journal, Proceedings of the ACM on Programming Languages (PACMPL), which replaces the previous ICFP conference proceedings. The move to PACMPL will have two noticeable impacts on authors: * A new, two-phase selection and reviewing process that conforms to ACM?s journal reviewing guidelines. * A new, single-column format for submissions. 2. Authors of papers that are conditionally accepted in the first phase of the reviewing process will have the option to submit materials for Artifact Evaluation. Further details on each of these changes are included in the following text. ### Scope ICFP 2017 seeks original papers on the art and science of functional programming. Submissions are invited on all topics from principles to practice, from foundations to features, and from abstraction to application. The scope includes all languages that encourage functional programming, including both purely applicative and imperative languages, as well as languages with objects, concurrency, or parallelism. Topics of interest include (but are not limited to): * *Language Design*: concurrency, parallelism, and distribution; modules; components and composition; metaprogramming; type systems; interoperability; domain-specific languages; and relations to imperative, object-oriented, or logic programming. * *Implementation*: abstract machines; virtual machines; interpretation; compilation; compile-time and run-time optimization; garbage collection and memory management; multi-threading; exploiting parallel hardware; interfaces to foreign functions, services, components, or low-level machine resources. * *Software-Development Techniques*: algorithms and data structures; design patterns; specification; verification; validation; proof assistants; debugging; testing; tracing; profiling. * *Foundations*: formal semantics; lambda calculus; rewriting; type theory; monads; continuations; control; state; effects; program verification; dependent types. * *Analysis and Transformation*: control-flow; data-flow; abstract interpretation; partial evaluation; program calculation. * *Applications*: symbolic computing; formal-methods tools; artificial intelligence; systems programming; distributed-systems and web programming; hardware design; databases; XML processing; scientific and numerical computing; graphical user interfaces; multimedia and 3D graphics programming; scripting; system administration; security. * *Education*: teaching introductory programming; parallel programming; mathematical proof; algebra. Submissions will be evaluated according to their relevance, correctness, significance, originality, and clarity. Each submission should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. The technical content should be accessible to a broad audience. ICFP 2017 also welcomes submissions in two separate categories --- Functional Pearls and Experience Reports --- that must be marked as such at the time of submission and that need not report original research results. Detailed guidelines on both categories are given at the end of this call. Please contact the program chair if you have questions or are concerned about the appropriateness of a topic. ### Preparation of submissions ICFP 2017 will employ a lightweight double-blind reviewing process, as described below. **Deadline**: The deadline for submissions is Monday, February 27, 2017, Anywhere on Earth (). This deadline will be strictly enforced. **Formatting**: (NOTE: NEW FORMAT REQUIREMENTS FOR ICFP 2017) Submissions must be in PDF format, printable in black and white on US Letter sized paper, and interpretable by common PDF tools. All submissions must adhere to the "ACM Large" template that is available (in both LaTeX and Word formats) from . For authors using LaTeX, a lighter-weight package, including only the essential files, is available from ; the appropriate template for ICFP 2017 authors is in the file `acmart-pacmpl-template.tex`. As documented in the template, submissions should be prepared using the `acmlarge` and `anonymous` options. The use of the `review` option is also strongly encouraged but not required. (The `review` option will add line numbers, which will make it easier for reviewers to reference specific parts of your paper in their comments, but should have absolutely no other effect on the typesetting.) Details of available technical support for LaTeX-specific questions is available at . There is a limit of 24 pages for a full paper or 12 pages for an Experience Report; in either case, the bibliography will not be counted against these limits. These page limits have been chosen to allow essentially the same amount of content with the new single-column format as was possible with the two-column format used in past ICFP conferences. Submissions that exceed the page limits or, for other reasons, do not meet the requirements for formatting, will be summarily rejected. **Citations**: As part of PACMPL, ICFP 2017 papers are expected to use author-year citations for references to other work. Author-year citations may be used as either a noun phrase, such as "The lambda calculus was originally conceived by Church (1932)", or a parenthetic phrase, such as "The lambda calculus (Church 1932) was intended as a foundation for mathematics". A useful test for correct usage it to make sure that the text still reads correctly when the parenthesized portions of any references are omitted. Take care with prepositions; in the first example above, "by" is more appropriate than "in" because it allows the text to be read correctly as a reference to the author. Sometimes, readability may be improved by putting parenthetic citations at the end of a clause or a sentence, such as "A foundation for mathematics was provided by the lambda calculus (Church 1932)". In LaTeX, use `\citet{Church-1932}` for citations as a noun phrase, "Church (1932)", and `\citep{Church-1932}` for citations as a parenthetic phrase, "(Church 1932)"; for details, see Sections 2.3--2.5 of the natbib documentation (). **Submission**: Submissions will be accepted at . Improved versions of a paper may be submitted at any point before the submission deadline using the same web interface. **Author Response Period**: Authors will have a 72-hour period, starting at 15:00 UTC on Monday, April 17, 2017, to read reviews and respond to them. **Supplementary Materials**: Authors have the option to attach supplementary material to a submission, on the understanding that reviewers may choose not to look at it. The material should be uploaded at submission time, as a single pdf or a tarball, not via a URL. This supplementary material may or may not be anonymized; if not anonymized, it will only be revealed to reviewers after they have submitted their review of the paper and learned the identity of the author(s). **Authorship Policies**: All submissions are expected to comply with the ACM Policies for Authorship that are detailed at . **Republication Policies**: Each submission must adhere to SIGPLAN's republication policy, as explained on the web at . **Resubmitted Papers**: Authors who submit a revised version of a paper that has previously been rejected by another conference have the option to attach an annotated copy of the reviews of their previous submission(s), explaining how they have addressed these previous reviews in the present submission. If a reviewer identifies him/herself as a reviewer of this previous submission and wishes to see how his/her comments have been addressed, the program chair will communicate to this reviewer the annotated copy of his/her previous review. Otherwise, no reviewer will read the annotated copies of the previous reviews. ### Review Process This section outlines the two-stage process with lightweight double-blind reviewing that will be used to select papers for presentation at ICFP 2017. A [list of frequently asked questions and answers](http://icfp17.sigplan.org/track/icfp-2017-papers#Submission-and-Reviewing-FAQ) that address common concerns is available on the conference website and will be updated as necessary to clarify and expand on this process. **ICFP 2017 will employ a two-stage review process.** The first stage in the review process will assess submitted papers using the criteria stated above and will allow for feedback and input on initial reviews through the author response period mentioned previously. At the PC meeting, a set of papers will be conditionally accepted and all other papers will be rejected. Authors will be notified of these decisions on May 1, 2017. Authors of conditionally accepted papers will be provided with committee reviews (just as in previous conferences) along with a set of mandatory revisions. After five weeks (June 5, 2017), the authors will provide a second submission. The second and final reviewing phase assesses whether the mandatory revisions have been adequately addressed by the authors and thereby determines the final accept/reject status of the paper. The intent and expectation is that the mandatory revisions can be addressed within five weeks and hence that conditionally accepted papers will in general be accepted in the second phase. The second submission should clearly identify how the mandatory revisions were addressed. To that end, the second submission must be accompanied by a cover letter mapping each mandatory revision request to specific parts of the paper. The cover letter will facilitate a quick second review, allowing for confirmation of final acceptance within two weeks. Conversely, the absence of a cover letter will be grounds for the paper?s rejection. This process is intended as a refinement of the review process that has been used in previous ICFP conferences. By incorporating a second stage, the process will conform to ACM?s journal reviewing guidelines for PACMPL. **ICFP 2017 will employ a lightweight double-blind reviewing process.** To facilitate this, submitted papers must adhere to two rules: 1. **author names and institutions must be omitted**, and 2. **references to authors' own related work should be in the third person** (e.g., not "We build on our previous work ..." but rather "We build on the work of ..."). The purpose of this process is to help the PC and external reviewers come to an initial judgement about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult (e.g., important background references should not be omitted or anonymized). In addition, authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For instance, authors may post drafts of their papers on the web or give talks on their research ideas. ### Information for Authors of Accepted Papers * As a condition of acceptance, final versions of all papers must adhere to the new ACM Large format. The page limits for final versions of papers will be increased to ensure that authors have space to respond to reviewer comments and mandatory revisions. * Authors of accepted submissions will be required to agree to one of the three ACM licensing options: copyright transfer to ACM; retaining copyright but granting ACM exclusive publication rights; or open access on payment of a fee. Further information about ACM author rights is available from . * At least one author of each accepted submission will be expected to attend and present their paper at the conference. (ICFP welcomes all authors, regardless of nationality. If any author of an accepted submission has visa-related difficulties in travelling to the conference, we will make arrangements to enable remote participation, and not require them to attend the conference in order to present their talk. In such a case contact us (icfp2017 at cs.ox.ac.uk) for further guidance.) The schedule for presentations will be determined and shared with authors after the full program has been selected. Presentations will be videotaped and released online if the presenter consents. * We intend that the proceedings will be freely available for download from the ACM Digital Library in perpetuity via the OpenTOC mechanism. * ACM Author-Izer is a unique service that enables ACM authors to generate and post links on either their home page or institutional repository for visitors to download the definitive version of their articles from the ACM Digital Library at no charge. Downloads through Author-Izer links are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to the definitive version of an ACM article should reduce user confusion over article versioning. After an article has been published and assigned to the appropriate ACM Author Profile pages, authors should visit to learn how to create links for free downloads from the ACM DL. * **AUTHORS TAKE NOTE: The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to *two weeks prior* to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work.** ### Artifact Evaluation Authors of papers that are conditionally accepted in the first phase of the review process will be encouraged (but not required) to submit supporting materials for Artifact Evaluation. These items will then be reviewed by a committee, separate from the program committee, whose task is to assess how the artifacts support the work described in the associated paper. Papers that go through the Artifact Evaluation process successfully will receive a seal of approval printed on the papers themselves. Authors of accepted papers will be encouraged to make the supporting materials publicly available upon publication of the proceedings, for example, by including them as "source materials" in the ACM Digital Library. An additional seal will mark papers whose artifacts are made available, as outlined in the ACM guidelines for artifact badging. Participation in Artifact Evaluation is voluntary and will not influence the final decision regarding paper acceptance. Further information about the motivations and expectations for Artifact Evaluation can be found at . ### Special categories of papers In addition to research papers, ICFP solicits two kinds of papers that do not require original research contributions: Functional Pearls, which are full papers, and Experience Reports, which are limited to half the length of a full paper. Authors submitting such papers should consider the following guidelines. #### Functional Pearls A Functional Pearl is an elegant essay about something related to functional programming. Examples include, but are not limited to: * a new and thought-provoking way of looking at an old idea * an instructive example of program calculation or proof * a nifty presentation of an old or new data structure * an interesting application of functional programming techniques * a novel use or exposition of functional programming in the classroom While pearls often demonstrate an idea through the development of a short program, there is no requirement or expectation that they do so. Thus, they encompass the notions of theoretical and educational pearls. Functional Pearls are valued as highly and judged as rigorously as ordinary papers, but using somewhat different criteria. In particular, a pearl is not required to report original research, but, it should be concise, instructive, and entertaining. A pearl is likely to be rejected if its readers get bored, if the material gets too complicated, if too much specialized knowledge is needed, or if the writing is inelegant. The key to writing a good pearl is polishing. A submission that is intended to be treated as a pearl must be marked as such on the submission web page, and should contain the words "Functional Pearl" somewhere in its title or subtitle. These steps will alert reviewers to use the appropriate evaluation criteria. Pearls will be combined with ordinary papers, however, for the purpose of computing the conference's acceptance rate. #### Experience Reports The purpose of an Experience Report is to help create a body of published, refereed, citable evidence that functional programming really works --- or to describe what obstacles prevent it from working. Possible topics for an Experience Report include, but are not limited to: * insights gained from real-world projects using functional programming * comparison of functional programming with conventional programming in the context of an industrial project or a university curriculum * project-management, business, or legal issues encountered when using functional programming in a real-world project * curricular issues encountered when using functional programming in education * real-world constraints that created special challenges for an implementation of a functional language or for functional programming in general An Experience Report is distinguished from a normal ICFP paper by its title, by its length, and by the criteria used to evaluate it. * Both in the proceedings and in any citations, the title of each accepted Experience Report must begin with the words "Experience Report" followed by a colon. The acceptance rate for Experience Reports will be computed and reported separately from the rate for ordinary papers. * Experience Report submissions can be at most 12 pages long, excluding bibliography. * Each accepted Experience Report will be presented at the conference, but depending on the number of Experience Reports and regular papers accepted, authors of Experience reports may be asked to give shorter talks. * Because the purpose of Experience Reports is to enable our community to accumulate a body of evidence about the efficacy of functional programming, an acceptable Experience Report need not add to the body of knowledge of the functional-programming community by presenting novel results or conclusions. It is sufficient if the Report states a clear thesis and provides supporting evidence. The thesis must be relevant to ICFP, but it need not be novel. The program committee will accept or reject Experience Reports based on whether they judge the evidence to be convincing. Anecdotal evidence will be acceptable provided it is well argued and the author explains what efforts were made to gather as much evidence as possible. Typically, more convincing evidence is obtained from papers which show how functional programming was used than from papers which only say that functional programming was used. The most convincing evidence often includes comparisons of situations before and after the introduction or discontinuation of functional programming. Evidence drawn from a single person's experience may be sufficient, but more weight will be given to evidence drawn from the experience of groups of people. An Experience Report should be short and to the point: it should make a claim about how well functional programming worked on a particular project and why, and produce evidence to substantiate this claim. If functional programming worked in this case in the same ways it has worked for others, the paper need only summarize the results --- the main part of the paper should discuss how well it worked and in what context. Most readers will not want to know all the details of the project and its implementation, but the paper should characterize the project and its context well enough so that readers can judge to what degree this experience is relevant to their own projects. The paper should take care to highlight any unusual aspects of the project. Specifics about the project are more valuable than generalities about functional programming; for example, it is more valuable to say that the team delivered its software a month ahead of schedule than it is to say that functional programming made the team more productive. If the paper not only describes experience but also presents new technical results, or if the experience refutes cherished beliefs of the functional-programming community, it may be better off submitted it as a full paper, which will be judged by the usual criteria of novelty, originality, and relevance. The program chair will be happy to advise on any concerns about which category to submit to. ### Organizers General Chair: Jeremy Gibbons (University of Oxford, UK) Program Chair: Mark Jones (Portland State University, USA) Artifact Evaluation Chair: Ryan R. Newton (Indiana University, USA) Industrial Relations Chair: Ryan Trinkle (Obsidian Systems LLC, USA) Programming Contest Organiser: Sam Lindley (University of Edinburgh, UK) Publicity and Web Chair: Lindsey Kuper (Intel Labs, USA) Student Research Competition Chair: Ilya Sergey (University College London, UK) Video Chair: Jose Calderon (Galois, Inc., USA) Workshops Co-Chair: Andres L?h (Well-Typed LLP) Workshops Co-Chair: David Christiansen (Indiana University, USA) Program Committee: Bob Atkey (University of Strathclyde, Scotland) Adam Chlipala (MIT, USA) Dominique Devriese (KU Leuven, Belgium) Martin Erwig (Oregon State, USA) Matthew Flatt (University of Utah, USA) Ronald Garcia (University of British Columbia, Canada) Kathryn Gray (University of Cambridge, England) John Hughes (Chalmers University and Quvik, Sweden) Chung-Kil Hur (Seoul National University, Korea) Graham Hutton (University of Nottingham, England) Alan Jeffrey (Mozilla Research, USA) Ranjit Jhala (University of California, San Diego, USA) Shin-ya Katsumata (Kyoto University, Japan) Lindsey Kuper (Intel Labs, USA) Dan Licata (Wesleyan University, USA) Ben Lippmeier (Digital Asset, Australia) Gabriel Scherer (Northeastern University, USA) Alexandra Silva (University College London, England) Nikhil Swamy (Microsoft Research, USA) Sam Tobin-Hochstadt (Indiana University, USA) Nicolas Wu (University of Bristol, England) Beta Ziliani (CONICET and FAMAF, Universidad Nacional de C?rdoba, Argentina) From bogom.s at gmail.com Wed Feb 15 18:37:28 2017 From: bogom.s at gmail.com (Sergiy Bogomolov) Date: Thu, 16 Feb 2017 10:37:28 +1100 Subject: [TYPES/announce] DEADLINE EXTENSION for 4th International Workshop on Applied Verification for Continuous and Hybrid Systems (CPSWeek 2017) Message-ID: <000001d287e4$7bc6e010$7354a030$@gmail.com> Call for Submissions -- DEADLINE EXTENSION UNTIL FEBRUARY 22 ----------------------------------------------------------------------- 4th International Workshop on Applied Verification for Continuous and Hybrid Systems CMU campus alongside CPSWeek, Pittsburgh, USA, April 17, 2017 http://cps-vo.org/group/ARCH The workshop on applied verification for continuous and hybrid systems (ARCH) brings together researchers and practitioners, and establishes a curated set of benchmarks submitted by academia and industry. Verification of continuous and hybrid systems is increasing in importance due to new cyber-physical systems that are safety- or operation-critical. This workshop addresses verification techniques for continuous and hybrid systems with a special focus on the transfer from theory to practice. Topics include, but are not limited to - Proposals for new benchmark problems (not necessarily yet solvable) - Tool presentations - Tool executions and evaluations based on ARCH benchmarks - Experience reports including open issues for industrial success - Reports on results of our friendly competition Submission Guidelines ----------------------------------------------------------------------- Submissions consist of papers of ideally 3-8 pages (pdf ) and optional files (e.g. models or traces) submitted through the ARCH?17 EasyChair web site (http://www.easychair.org/conferences/?conf=arch17). Authors have to use the EasyChair template (http://www.easychair.org/publications/for_authors).The extended abstract should be classified in its title as benchmark proposal, tool presentation, benchmark results, or experience report. Submissions receive at least 3 anonymous reviews, including one from industry and one from academia. Details on the evaluation criteria can be found at http://cps-vo.org/group/ARCH/CallForSubmissions. Submission deadline: February 22, 2017 Notification: March 7, 2017 Final Version: March 31, 2017 Workshop: April 17, 2017 (different from other CPS Week workshops; this year free of charge!) Website: http://cps-vo.org/group/ARCH (includes forums, archive, wiki, etc.) Prize ----------------------------------------------------------------------- The paper with the most promising benchmark results receives a prize of 500 Euros sponsored by Robert Bosch GmbH, Germany. The winner is preselected by the program committee and determined by an audience voting. Organizers ----------------------------------------------------------------------- Program chairs: Matthias Althoff, Technische Universit?t M?nchen, Germany Goran Frehse, UJF-Verimag, France Local chair: Sebastian Scherer, Carnegie Mellon University, USA Publicity chair: Sergiy Bogomolov, Australian National University, Australia Evaluation chair: Taylor T. Johnson, Vanderbilt University, USA Program Committee (tentative) ----------------------------------------------------------------------- Academia: Pieter Collins (Maastricht Univ.) Alexandre Donze (UC Berkeley) Ian Mitchell (Univ. British Colombia) Sayan Mitra (UI Urbana Champaign) Andre Platzer (CarnegieMellon Univ.) Nacim Ramdani (Universit? d?Orl?ans) Aditya Zutshi (Duke University) Xin Chen (RWTH Aachen University) Sicun Gao (Massachusetts Institute of Technology) Stanley Bak (Air Force Research Lab) Industry: Ajinkya Bhave (Siemens PLM) Jyotirmoy Deshmukh (Toyota) Luca Parolini (BMW) Alessandro Pinto (United Technologies) Matthias Woehrle (Bosch) William Hung (Synopsys Inc) Olivier Bouissou (MathWorks) Daniel Bryce (SIFT) Aaron Fifarek (Linquest) -------------- next part -------------- An HTML attachment was scrubbed... URL: From asyropoulos at yahoo.com Thu Feb 16 07:47:12 2017 From: asyropoulos at yahoo.com (Apostolos Syropoulos) Date: Thu, 16 Feb 2017 12:47:12 +0000 (UTC) Subject: [TYPES/announce] CfP: New Worlds of Computation (NWC 2017) References: <1088023264.489602.1487249232473.ref@mail.yahoo.com> Message-ID: <1088023264.489602.1487249232473@mail.yahoo.com> Call for Presentations New Worlds of Computation (NWC 2017) 12-14 Apr. 2017 in Orl?ans?(France) https://nwc2017-jcal.sciencesconf.org The 3rd edition of the International Workshop New Worlds of Computation (NWC 2017) will be held in Orl?ans, France, 12th to 14th April 2017. This edition will be co-located with the Journ?es du?GT Calculabilit?s du GdR Informatique Math?matique, the French days on computabilities. What will computers be made out of in 2030? In 2050? What would be the main paradigm(s)? Would electronics be replaced by some other medium for common computers? For Clouds? For large computers? For dedicated treatments? It would be?presumptuous to say when and by what, all or parts of our electronic devices would be replaced. Nevertheless, researchers explore many directions: optical, quantum, bio-computing, chemo-computing, DNA and the nano world? Would it be analog or digital? The workshop aims at gathering people interested and investigating the alternatives, providing fundamental or applied results. The ambition is to allow the presentation of the newest results as well as foster interactions between different perspectives. The third edition of the workshop will be co-localized with the Journ?es (French days) of the working group in Calculabilit?s (computabilities) from the GdR Informatique Math?matique of the CNRS. This working group will provide?insights on what would be possible or not in future computers. This co-location will permit new encounters and? provide cross-fertilization. The topics involved include natural, unconventional and hyper computations: - analog computation and computable analysis - computation on real, rings? (BSS) - recursion theory - continuous and hybrid computation - cellular automata - collision based computation - quantum computation - DNA computation and tile assembly systems - membrane computing - signal machines - computation on infinite structures or in infinite time - non-Euclidean spaces, non-standard approaches - spatial, optical, fuzzy,? computation Invited Speakers - ADAMATZKY Andrew, University of the West of England, Bristol - FOROUGHMAND-ARAABI Mohammad-Hadi, Sharif University of Technology, Iran - MAYORDOMO Elvira, Universidad de Zaragoza, Espagna - VALARCHER Pierre, Universit? Paris Est Cr?teil Proceedings Proceedings are composed of a booklet collecting the abstracts of the presentations. After the workshop, a special issue of the International Journal on Unconventional Computing will be devoted to extended articles on the results presented at NWC. Submission In order to make a presentation to one or both event, you have to submit a title and an (short textual) abstract. The refereeing process is not meant to be selective but to check the coherence with the topics. It is open to work in progress or presented elsewhere. Presentation slots will be large enough to present? context, results, methodology, proofs, expected progress? PhD student are particularly welcomed. Submission deadline: 22th March 2017 Notifications: 13th and 27th March 2017 There are multiple notification times since the referee process is targeted at verifying that it matches with the topics. The submission process is common to both event. One has to provide: - Title - Abstract - Whose event it is intended to or if for both (i.e. one presentation common to both) To be able to access the submission page, one must be a logged registered user of sciencesconf.org. Registration is free and fast. When all is ready, go to the submission page. Registration Registration is free but compulsory. It includes lunches and banquet. Registration deadline : 10 April 2017 (otherwise on site, but no meal is garanteed). Contact J?r?me Durand-Lose jerome.durand-lose at univ-orleans.fr LIFO, Universit? d'Orl?ans We hope to see you and listen to you in Orl?ans mid-April. J?r?me Durand-Lose Chair The previous editions of the New Worlds of Computation workshop were held in Orl?ans in ?- 2009 : http://www.univ-orleans.fr/lifo/Manifestations/NMC09 - 2011 : http://www.univ-orleans.fr/lifo/evenements/NWC2011 The previous edition of the Journ?es Calculabilit?s were held in Nice in 2016.? ----------------------Apostolos Syropoulos Xanthi, Greece -------------- next part -------------- An HTML attachment was scrubbed... URL: From barbara.kordy at irisa.fr Thu Feb 16 05:04:22 2017 From: barbara.kordy at irisa.fr (Barbara Kordy) Date: Thu, 16 Feb 2017 11:04:22 +0100 Subject: [TYPES/announce] Graphical Models for Security (GraMSec 2017) - CFP Message-ID: CALL FOR PAPERS - GraMSec 2017 The Fourth International Workshop on Graphical Models for Security Santa Barbara, CA, USA - August 21, 2017 http://gramsec.uni.lu Co-located with CSF 2017 SCOPE Graphical security models provide an intuitive but systematic approach to analyze security weaknesses of systems and to evaluate potential protection measures. Cyber security researchers, as well as security professionals from industry and government, have proposed various graphical security modeling schemes. Such models are used to capture different security facets (digital, physical, and social) and address a range of challenges including vulnerability assessment, risk analysis, defense analysis, automated defensing, secure services composition, policy validation and verification. The objective of the GraMSec workshop is to contribute to the development of well-founded graphical security models, efficient algorithms for their analysis, as well as methodologies for their practical usage. TOPICS The workshop seeks submissions from academia, industry, and government presenting novel research on all theoretical and practical aspects of graphical models for security. The topics of the workshop include, but are not limited to: ? Graphical models for threat modeling and analysis ? Graphical models for risk analysis and management ? Graphical models for requirements analysis and management ? Textual and graphical representation for system, organizational, and business security ? Visual security modeling and analysis of socio-technical and cyber-physical systems ? Graphical security modeling for cyber situational awareness ? Graphical models supporting the security by design paradigm ? Methods for quantitative and qualitative analysis of graphical security models ? Formal semantics and verification of graphical security models ? Methods for (semi-)automatic generation of graphical security models ? Enhancement and/or optimization of existing graphical security models ? Scalable evaluation of graphical security models ? Evaluation algorithms for graphical security models ? Dynamic update of graphical security models ? Game theoretical approaches to graphical security modeling ? Attack trees, attack graphs and their variants ? Stochastic Petri nets, Markov chains, and Bayesian networks for security ? UML-based models and other graphical modeling approaches for security ? Software tools for graphical security modeling and analysis ? Case studies and experience reports on the use of graphical security modeling paradigm INVITED SPEAKER To be decided. PAPER SUBMISSION We solicit two types of submissions: ? Regular papers (up to 15 pages, excluding the bibliography and well-marked appendices) describing original and unpublished work within the scope of the workshop. ? Short papers (up to 7 pages, excluding the bibliography and well-marked appendices) describing original and unpublished work in progress. The reviewers are not required to read the appendices, so the papers should be intelligible without them. All submissions must be prepared using the LNCS style: http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0 Each paper will undergo a thorough review process. All accepted (regular and short) papers will be included in the workshop's post-proceedings. As the previous two years, the GraMSec 2017 post-proceedings are planned to be published in the Lecture Notes in Computer Science (LNCS) series of Springer (confirmation pending). Submissions should be made using the GraMSec 2017 EasyChair web site: https://www.easychair.org/conferences/?conf=gramsec17 IMPORTANT DATES ? Submission deadline: Sunday, May 21, 2017 ? Acceptance notification: Friday, July 7, 2017 ? Workshop: Monday, August 21, 2017 GENERAL CHAIR ? Sjouke Mauw, University of Luxembourg, Luxembourg PROGRAM CHAIRS ? Peng Liu, Pennsylvania State University, USA ? Ketil St?len, SINTEF Digital and University of Oslo, Norway PC MEMBERS Mathieu Acher, University Rennes 1, Inria, France Massimiliano Albanese, George Mason University, USA Ludovic Apvrille, T?l?com ParisTech, France Thomas Bauereiss, DFKI, Germany Kristian Beckers, Technical University of Munich, Germany Giampaolo Bella, University of Catania, Italy Stefano Bistarelli, Universit? di Perugia, Italy Marc Bouissou, EDF RD, France Fr?d?ric Cuppens, T?l?com Bretagne, France Nora Cuppens-Boulahia, T?l?com Bretagne, France Binbin Chen, Advanced Digital Sciences Center, Singapore Herv? Debar, T?l?com SudParis, France Harley Eades, Augusta University, USA Mathias Ekstedt, KTH - Royal Institute of Technology, Sweden Ulrik Franke, Swedish Institute of Computer Science - SICS, Sweden Frank Fransen, TNO, The Netherlands Olga Gadyatskaya, University of Luxembourg, Luxembourg Paolo Giorgini, University of Trento, Italy Dieter Gollmann, Hamburg University of Technology, Germany Joshua Guttman, WPI, USA Ren? Rydhof Hansen, Aalborg University, Denmark Maritta Heisel, Universit?t Duisburg-Essen, Germany Hannes Holm, Swedish Defence Research Agency, Sweden Siv Hilde Houmb, Secure-NOK AS, Norway Sushil Jajodia, George Mason University, USA Ravi Jhawar, University of Luxembourg, Luxembourg Henk Jonkers, BiZZdesign, The Netherlands Cristian Johansen, University of Oslo, Norway Florian Kammueller, Middlesex University London, UK Nima Khakzad, TU Delft, The Netherlands Dong Seong Kim, University of Canterbury, New Zealand Barbara Kordy, INSA Rennes, IRISA, France Pascal Lafourcade, Universit? Clermont Auvergne, LIMOS, France Jean-Louis Lanet, Inria, France Per H?kon Meland, SINTEF Digital, Norway Jogesh Muppala, HKUST, Hong Kong, SAR China Simin Nadjm-Tehrani, Link?ping University, Sweden Andreas L. Opdahl, University of Bergen, Norway Xinming Ou, University of South Florida, USA St?phane Paul, Thales Research and Technology, France Wolter Pieters, TU Delft, The Netherlands Ludovic Pi?tre-Cambac?d?s, EDF, FR Sophie Pinchinat, University Rennes 1, IRISA, France Vincenzo Piuri, University of Milan, Italy Marc Pouly, Lucerne University of Applied Sciences and Arts, Switzerland Nicolas Prigent, Sup?lec, France Christian W. Probst, Technical University of Denmark, Denmark David Pym, UCL, UK Sa?a Radomirovic, University of Dundee, UK Indrajit Ray, Colorado State University, USA Arend Rensink, University of Twente, The Netherlands Yves Roudier, Universit? C?te d'Azur, CNRS, I3S, UNS, France Guttorm Sindre, NUST, Norway Mari?lle Stoelinga, University of Twente, The Netherlands Xiaoyan Sun, California State University, USA Axel Tanner, IBM Research - Zurich, Switzerland Alexandre Vernotte, KTH - Royal Institute of Technology, Sweden Luca Vigan?, King's College London, UK Lingyu Wang, Concordia University, Canada Jan Willemson, Cybernetica, Estonia CONTACT For inquiries please send an e-mail to gramsec17 at easychair.org From andrei.paskevich at lri.fr Fri Feb 17 11:10:51 2017 From: andrei.paskevich at lri.fr (Andrei Paskevich) Date: Fri, 17 Feb 2017 17:10:51 +0100 Subject: [TYPES/announce] VSTTE 2017 - First Call for Papers Message-ID: <20170217161050.ohrpah7y7yxuiow7@tikki.lri.fr> 9th Working Conference on Verified Software: Theories, Tools, and Experiments (VSTTE) https://vstte17.lri.fr July 22-23, 2017, Heidelberg, Germany Co-located with the 29th International Conference on Computer-Aided Verification, CAV 2017 Important Dates * Abstract submission: Mon, Apr 24, 2017 * Full paper submission: Mon, May 1, 2017 * Notification: Mon, Jun 5, 2017 * VSTTE: Sat-Sun, Jul 22-23, 2017 * Camera-ready: Mon, Aug 21, 2017 Overview The goal of the VSTTE conference series is to advance the state of the art in the science and technology of software verification, through the interaction of theory development, tool evolution, and experimental validation. We welcome submissions describing significant advances in the production of verified software, i.e., software that has been proved to meet its functional specifications. Submissions of theoretical, practical, and experimental contributions are equally encouraged, including those that focus on specific problems or problem domains. We are especially interested in submissions describing large-scale verification efforts that involve collaboration, theory unification, tool integration, and formalized domain knowledge. We also welcome papers describing novel experiments and case studies evaluating verification techniques and technologies. Topics of interest for VSTTE include education, requirements modeling, specification languages, specification/verification/certification case studies, formal calculi, software design methods, automatic code generation, refinement methodologies, compositional analysis, verification tools (e.g., static analysis, dynamic analysis, model checking, theorem proving, satisfiability), tool integration, benchmarks, challenge problems, and integrated verification environments. Paper Submissions We accept both long (limited to 16 pages) and short (limited to 10 pages) paper submissions. Short submissions also cover Verification Pearls describing an elegant proof or proof technique. Submitted research papers and system descriptions must be original and not submitted for publication elsewhere. Each submission will be evaluated by at least three members of the Program Committee. We expect that one author of every accepted paper will present their work at the conference. Paper submissions must be written in English using the LNCS LaTeX format (http://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines) and must include a cogent and self-contained description of the ideas, methods, results, and comparison to existing work. Papers will be submitted via EasyChair at the VSTTE 2017 conference page (https://www.easychair.org/conferences/?conf=vstte2017). The post-conference proceedings of VSTTE 2017 will be published in the LNCS series. Authors of accepted papers will be requested to sign the copyright transfer form. A selection of best papers will be invited for publication in the Journal of Automated Reasoning. Program Committee * June Andronick (University of New South Wales, Australia) * Christel Baier (TU Dresden, Germany) * Sandrine Blazy (Universit? de Rennes 1, France) * Arthur Chargu?raud (Inria, France) * Ernie Cohen (Amazon Web Services, USA) * Rayna Dimitrova (MPI-SWS, Germany) * Carlo A. Furia (Chalmers University of Technology, Sweden) * Arie Gurfinkel (University of Waterloo, Canada) * Hossein Hojjat (Rochester Institute of Technology, USA) * Marieke Huisman (University of Twente, Netherlands) * Bart Jacobs (KU Leuven, Belgium) * Rajeev Joshi (NASA Jet Propulsion Laboratory, USA) * Zachary Kincaid (Princeton University, USA) * Akash Lal (Microsoft Research, India) * Shuvendu Lahiri (Microsoft Research, USA) * Francesco Logozzo (Facebook, USA) * Peter M?ller (ETH Z?rich, Switzerland) * Jorge A. Navas (SRI International, USA) * Scott Owens (University of Kent, UK) * Andrei Paskevich (Universit? Paris-Sud, France), co-chair * Gerhard Schellhorn (Universit?t Augsburg, Germany) * Peter Schrammel (University of Sussex, UK) * Natarajan Shankar (SRI International, USA) * Mihaela Sighireanu (Universit? Paris-Diderot, France) * Julien Signoles (CEA LIST, France) * Michael Tautschnig (Queen Mary University of London, UK) * Tachio Terauchi (JAIST, Japan) * Oksana Tkachuk (NASA Ames Research Center, USA) * Mattias Ulbrich (Karlsruhe Institute of Technology, Germany) * Thomas Wies (New York University, USA), co-chair From raoul.strackx at cs.kuleuven.be Sun Feb 19 09:17:49 2017 From: raoul.strackx at cs.kuleuven.be (Raoul Strackx) Date: Sun, 19 Feb 2017 15:17:49 +0100 Subject: [TYPES/announce] [ESSoS'17] International Symposium on Engineering Secure Software and Systems (*Deadline in 5 days*) Message-ID: <00615bcf-a13c-ec35-0389-d3ff55ab3876@cs.kuleuven.be> +----------------------------------------------------------------------+ | | | Call for papers | | | | | | International Symposium on Engineering Secure Software and Systems | | | | * 5 days to deadline * | | | | | | ESSoS 2017 | | | | July 3-5, 2017 | | Bonn, Germany | | | | https://distrinet.cs.kuleuven.be/events/essos/2017/calls-papers.html | +----------------------------------------------------------------------+ +----------------------------------------------------------------------+ | *Paper submission*: Friday, February 24, 2017 (firm) | +----------------------------------------------------------------------+ In cooperation with: ACM SIGSAC and SIGSOFT (pending) New this year: co-Located with DIMVA. * Context and motivation * IT security is becoming an increasingly interdisciplinary subject. For example, it is insufficient to simply deploy new security measures but one must pay careful attention to correctly integrate the security measures into existing software. Such an approach involves redesigning and engineering of software to ensure that the built-in security policy is effective in practice. Many security venues put little focus on topics related to software engineering, while many software-engineering venues lack appreciation for more complex topics in software security. ESSoS thus strives to be a venue that welcomes exactly such contributions that are at the border of IT security and software engineering. The program committee is particularly chosen to encompass a broad range of expertise, ranging from software security over software engineering to human subjects such as usable security. * Goal and setup * The goal of this symposium, which will be the ninth in the series, is to bring together researchers and practitioners to advance the state of the art and practice in secure software engineering. Being one of the few conference-level events dedicated to this topic, it explicitly aims to bridge the software engineering and security engineering communities, and promote cross-fertilization. The symposium will feature two days of technical program including two keynote presentations. In addition to academic papers, the symposium encourages submission of high-quality, informative industrial experience papers about successes and failures in secure software engineering and the lessons learned. Furthermore, the symposium also accepts short idea papers that crisply describe a promising direction, approach, or insight. * Topics * The Symposium seeks submissions on subjects related to its goals. This includes a diversity of topics including (but not limited to): - Cloud security, virtualization for security - Mobile devices security - Automated techniques for vulnerability discovery and analysis - Model checking for security - Binary code analysis, reverse-engineering - Programming paradigms, models, and domain-specific languages for security - Operating system security - Verification techniques for security properties - Malware: detection, analysis, mitigation - Security in critical infrastructures - Security by design - Static and dynamic code analysis for security - Web applications security - Program rewriting techniques for security - Security measurements - Empirical secure software engineering - Security-oriented software reconfiguration and evolution - Computer forensics - Processes for the development of secure software and systems - Security testing - Embedded software security - Usable security * Important dates * Paper submission: Friday, February 24, 2017 (firm) Paper acceptance notification: Tuesday, April 18, 2017 Artifact evaluation submission: Friday, April 21, 2017 Poster submission: Friday, April 21, 2017 Poster acceptance notification: Friday, April 28, 2017 Camera-ready: Friday, May 12, 2017 Symposium: Monday to Wednesday, July 3-5, 2017 (DIMVA is held July 6-7, following ESSoS) * Submission and format * The proceedings of the symposium are published by Springer-Verlag in the Lecture Notes in Computer Science Series (http://www.springer.com/computer/lncs, pending approval). Submissions should follow the formatting instructions of Springer LNCS. Submitted papers must present original, unpublished work of high quality. Two types of papers will be accepted: _Full papers (max 14 pages without bibliography/appendices)_ Such papers may describe original technical research with a solid foundation, such as formal analysis or experimental results, with acceptance determined mostly based on novelty and validation. Or they may describe case studies applying existing techniques or analysis methods in industrial settings, with acceptance determined mostly by the general applicability of techniques and the completeness of the technical presentation details. _Idea papers (max 8 pages with bibliography)_ Such papers may crisply describe a novel idea that is both feasible and interesting, where the idea may range from a variant of an existing technique all the way to a vision for the future of security technology. Idea papers allow authors to introduce ideas to the field and get feedback, while allowing for later publication of complete, fully-developed results. Submissions will be judged primarily on novelty, excitement, and exposition, but feasibility is required, and acceptance will be unlikely without some basic, principled validation (e.g., extrapolation from limited experiments or simple formal analysis). In the proceedings, idea papers will clearly identified by means of the "Idea" tag in the title. _Posters_ ESSoS will have a poster session to present ideas, discuss prototypes, and feature ongoing work. Authors of accepted papers and authors with evaluated artifacts are invited to submit a poster as well. Poster abstracts are limited to 1 page. _Approved Artifacts_ Due to the secure software engineering focus, we expect the majority of papers to be based on an accompanying software artifact, data set, or similar. We strongly encourage the authors of accepted papers to submit such artifacts for evaluation. Artifact Evaluation will take place after accepted papers have been announced. Further information will be given closer to the paper-submission deadline. Submissions where the artifact evaluation committee can reproduce the software artifacts and evaluation will receive the ?approved artifact? badge. Authors of approved artifacts are further given the opportunity to demo their artifact at the conference. In addition, the committee will select a best artifact to receive the Distinguished Artifact Award. * Steering committee * Jorge Cuellar (Siemens AG) Wouter Joosen (KU Leuven) - chair Fabio Massacci (Univ. of Trento) Bashar Nuseibeh (Open Univ. and LERO) Juan Caballero (IMDEA Software Institute) Eric Bodden (Univ. Paderborn) Lorenzo Cavallaro (Royal Holloway Univ.) * Organizing committee * General chair: Michael Meier (University of Bonn, DE) Program co-chairs: Mathias Payer (Purdue university, USA),Eric Bodden (Paderborn University, DE) Doctoral Symposium: TBA Publication chair: Elias Athanasopoulos (University of Cyprus, CY) Publicity chair: Raoul Strackx (Katholieke Universiteit Leuven, BE) Web chair: Ghita Saevels (Katholieke Universiteit Leuven, BE) * Program committee * David Aspinall, University of Edinburgh Domagoj Babic, Google Inc. Alexandre Bartel, University of Luxembourg Amel Bennaceur, The Open University Stefan Brunthaler, Paderborn University Will Enck, NC State University Michael Franz, University of California, Irvine Christian Hammer, University of Potsdam Michael Hicks, University of Maryland Trent Jaeger, The Pennsylvania State University Vassilis P. Kemerlis, Brown University Johannes Kinder, University of London Byoungyoung Lee, Purdue University Yang Liu, University of Oxford Ben Livshits, Microsoft Research Cl?mentine Maurice, Technical University Graz Andy Meneely, Rochester Institute of Technology Mira Mezini, Technical University Darmstadt Alessandro Orso, Georgia Tech Christina P?pper, New York University Abu Dhabi Awais Rashid, Lancaster University Kaveh Razavi, Vrije Universiteit Amsterdam Tamara Rezk, INRIA Angela Sasse, University College London Zhendong Su, University of California, Davis Melanie Volkamer, Karlstad University Xiangyu Zhang, Purdue University From detlef.plump at york.ac.uk Sat Feb 18 16:44:44 2017 From: detlef.plump at york.ac.uk (Detlef Plump) Date: Sat, 18 Feb 2017 21:44:44 +0000 Subject: [TYPES/announce] ICGT 2017: Deadline Extension Message-ID: ============================================ *Call for Papers (Deadline Extension)* 10th International Conference on Graph Transformation ICGT 2017 Marburg (Germany), 18-19 July 2017 Part of STAF 2017 https://sites.google.com/site/gratra2017/ ============================================ Aims and Scope --------------------------------- Dynamic structures are a major cause for complexity when it comes to model and reason about systems. They occur in software architectures, models, pointer structures, databases, networks, etc. As collections of interrelated elements, which may be added, removed, or change state, they form a fundamental modelling paradigm as well as a means to formalise and analyse systems. Applications include architectural reconfigurations, model transformations, refactoring, and evolution of a wide range of artefacts, where change can happen either at design time or at run time. Based on the observation that these structures can be represented as graphs and their modifications as graph transformations, theory and applications of graphs, graph grammars and graph transformation systems have been studied in our community for more than 40 years. The conference aims at fostering interaction within this community as well as attracting researchers from other areas, either in contributing to the theory of graph transformation or by applying graph transformation to established or novel areas. The 10th International Conference on Graph Transformation (ICGT 2017) will be held in Marburg, Germany, as part of STAF 2017 (Software Technologies: Applications and Foundations). The conference takes place under the auspices of EATCS, EASST, and IFIP WG 1.3. Proceedings will be published by Springer in the Lecture Notes in Computer Science (LNCS) series, and a special issue has been confirmed with the Journal of Logic and Algebraic Methods in Programming (Elsevier). Topics of Interest --------------------------------- Topics of interest include (but are not limited to): - General models of graph transformation (e.g., high-level, adhesive, node, edge, and hyperedge replacement systems) - Analysis and verification of graph transformation systems - Graph theoretical properties of graph languages - Automata on graphs and parsing of graph languages - Logical aspects of graph transformation - Computational models based on graph transformation - Structuring and modularization of graph transformation - Hierarchical graphs and decompositions of graphs - Parallel, concurrent, and distributed graph transformation - Term graph rewriting - Graph transformation and Petri nets - Model-driven development and model transformation - Model checking, program verification, simulation and animation - Syntax, semantics and implementation of programming languages, domain-specific languages, and visual languages - Graph transformation languages and tool support - Efficient algorithms (pattern matching, graph traversal, etc.) - Applications and case studies of graph transformation in software engineering, including software architectures, refactoring, business processes, access control and service-orientation - Application to computing paradigms such as bio-inspired, quantum, ubiquitous, and visual computing Important Dates ---------------------------------- *Abstract submission: February 27, 2017 (new)* *Paper submission: March 5, 2017 (new)* Notification: April 7, 2017 Camera-ready version: April 21, 2017 Conference: July 18-19, 2017 Submission Guidelines --------------------------------- Papers can be submitted at http://www.easychair.org/confe rences/?conf=icgt2017 using Springer's LNCS format ( http://www.springer.com/lncs), and should contain original research. Simultaneous submission to other conferences with proceedings or submission of material that has already been published elsewhere is not allowed. All submissions will be peer reviewed by members of the program committee and external subreviewers. Papers are solicited in three categories: - Research papers (16 pages max) are evaluated with respect to their originality, significance, and technical soundness. Additional material intended for reviewers may be included in a clearly marked appendix. - Case studies (12 pages max) describe applications of graph transformations in any application domain. - Tool presentation papers (12 pages max) demonstrate the main features and functionality of graph-based tools. These papers may have an appendix with a detailed demo description (up to 5 pages), which will be reviewed but not included in the proceedings. Special Issue --------------------------------- A special issue of the Journal of Logic and Algebraic Methods in Programming (Elsevier) will be devoted to extended versions of the best ICGT'17 papers. Keynote Speaker --------------------------------- We are pleased to announce Georg Gottlob (University of Oxford) as invited speaker. Organization --------------------------------- Program chairs - Detlef Plump (University of York, UK) - Juan de Lara (Universidad Aut?noma de Madrid, Spain) Program committee - Anthony Anjorin (University of Paderborn, Germany) - Paolo Baldan (University of Padova, Italy) - G?bor Bergmann (Budapest University of Technology and Economics, Hungary) - Paolo Bottoni (Sapienza University of Rome, Italy) - Andrea Corradini (University of Pisa, Italy) - Juergen Dingel (Queen's University, Canada) - Rachid Echahed (CNRS, Laboratoire LIG, France) - Maribel Fernandez (King's College London, UK) - Holger Giese (Hasso Plattner Institute, University of Potsdam, Germany) - Joel Greenyer (Leibniz University of Hannover, Germany) - Annegret Habel (University of Oldenburg, Germany) - Reiko Heckel (University of Leicester, UK) - Berthold Hoffmann (University of Bremen, Germany) - Dirk Janssens (University of Antwerp, Belgium) - Barbara K?nig (University of Duisburg-Essen, Germany) - Leen Lambers (Hasso Plattner Institute, University of Potsdam, Germany) - Yngve Lamo (Bergen University College, Norway) - Mark Minas (Universit?t der Bundeswehr M?nchen, Germany) - Mohamed Mosbah (LaBRI, University of Bordeaux, France) - Fernando Orejas (Technical University of Catalonia, Spain) - Francesco Parisi-Presicce (Sapienza University of Rome, Italy) - Arend Rensink (University of Twente, The Netherlands) - Leila Ribeiro (University Federal do Rio Grande do Sul, Brazil) - Andy Sch?rr (Technical University of Darmstadt, Germany) - Uwe Wolter (University of Bergen, Norway) - Albert Z?ndorf (University of Kassel, Germany) Contact --------------------------------- icgt2017 at easychair.org -------------- next part -------------- An HTML attachment was scrubbed... URL: From m.stannett at sheffield.ac.uk Mon Feb 20 11:44:40 2017 From: m.stannett at sheffield.ac.uk (Mike Stannett) Date: Mon, 20 Feb 2017 16:44:40 +0000 Subject: [TYPES/announce] SECOND CALL - PHYSICS & COMPUTATION 2017 Message-ID: Dear Colleagues, please find below the second call for Physics and Computation 2017. If you intend submitting a paper and/or abstract, but think you may need an extension, please let us know as soon as possible. Thanks! ============================================================ SECOND CALL FOR PAPERS The 8th International Worksop on PHYSICS AND COMPUTATION (P&C 2017) Submission deadline: 5 Mar, 2017 Notification of acceptance: 19 Apr, 2017 Final versions of papers due: 8 May 2017 A co-located workshop of UCNC 2017, June 5-9, 2017, University of Arkansas Fayetteville, Arkansas, USA SUBMISSIONS https://easychair.org/conferences/?conf=pc2017 WEB PAGE http://ucnc2017.csce.uark.edu/workshops/physicscomputation/ ============================================================ The 8th International Workshop on Physics and Computation (P&C 2017) will be held as a satellite workshop of UCNC 2017, which takes place this year from 5-9 June 2017 in Fayetteville, Arkansas, USA (http://ucnc2017.uark.edu/). TOPICS include, but are not restricted to: * Axiomatisation of physics: completeness, decidability, reduction * Dynamical systems: computability, complexity * Molecular computation and reaction-diffusion models * Multiple-substrate computation * Nanoscale algorithms * New approaches to physical computation * Novel models of computation * Philosophy of physics and computation * Physical Church-Turing thesis * Quantum computation, logics and information * Randomness and computation: quantum, dynamical and physical randomness * Relativistic computation: reasoning, complexity, hypercomputation * Theory of measurement: axiomatisation, complexity * Type theories of physical computation SUBMISSIONS Authors are invited to submit original papers (PDF, 12 pages maximum) to the workshop EasyChair site. Extended abstracts (4?5 pages) may also be submitted, although preference will be given to full papers. PROCEEDINGS Accepted papers will be made available online in a pre- proceedings before the workshop begins. Authors of selected papers will be invited to submit revised and extended versions of their papers, subject to additional review, for publication in a special issue of the International Journal of Unconventional Computing (IJUC). PROGRAMME COMMITTEE * Selim Akl (Queen's) * Pablo Arrighi (Aix-Marseille) * Edwin Beggs (Swansea) * Selmer Bringsjord (Rensselaer) * Cristian Calude (Auckland) * Felix Costa (Lisboa) * Jerome Durand-Lose (Orl?ans) * Marian Gheorghe (Bradford) * Jerzy Gorecki (Institute of Physical Chemistry, Polish Academy of Sciences) * Viv Kendon (Durham University) * Judit Madarasz (Renyi Mathematical Institute, Hungarian Academy of Sciences) * Mike Stannett (Sheffield) * Karl Svozil (Vienna) * Gergely Szekely (Renyi Mathematical Institute, Hungarian Academy of Sciences) FURTHER INFORMATION For further information, please contact the wokshop organiser: Mike Stannett Email: m.stannett(at)sheffield.ac.uk ============================================================ -------------- next part -------------- An HTML attachment was scrubbed... URL: From brucker at spamfence.net Sat Feb 18 17:57:12 2017 From: brucker at spamfence.net (Achim D. Brucker) Date: Sat, 18 Feb 2017 22:57:12 +0000 Subject: [TYPES/announce] ThEdu'17: Call for Extended Abstracts & Demonstrations Message-ID: <20170218225712.wjip654xh7ef54ve@fujikawa.home.brucker.ch> (Apologies for duplicates) Call for Extended Abstracts & Demonstrations ThEdu'17 Theorem proving components for Educational software http://www.uc.pt/en/congressos/thedu/thedu17 at CADE 26 International Conference on Automated Deduction 6-11 August 2017 Gothenburg, Sweden http://www.cade-26.info/ ThEdu'17 Scope Computer Theorem Proving is becoming a paradigm as well as a technological base for a new generation of educational software in science, technology, engineering and mathematics. The workshop brings together experts in automated deduction with experts in education in order to further clarify the shape of the new software generation and to discuss existing systems. Topics of interest include: * methods of automated deduction applied to checking students' input; * methods of automated deduction applied to prove post-conditions for particular problem solutions; * combinations of deduction and computation enabling systems to propose next steps; * automated provers specific for dynamic geometry systems; * proof and proving in mathematics education. Important Dates Extended Abstracts: 18 June 2017 Author Notification: 2 July 2017 Final Version: 16 July 2017 Workshop Day: 6 August 2017 Submission Interested researchers are invited to submit extended abstracts and system descriptions. Both kinds of submissions should be approximately 5 pages in length and present original unpublished work not submitted elsewhere. Submission is in PDF format via easychair, https://easychair.org/conferences/?conf=thedu17 formatted according to http://www.easychair.org/publications/easychair.zip The extended abstracts and system descriptions will be made available online. At least one author is expected to presents his/her submission at ThEdu'17. Joint publication in companion with other CADE26 events is under consideration (as a volume in the EPiC Series in Computing). Program Committee Francisco Botana, University of Vigo at Pontevedra, Spain Achim D. Brucker, University of Sheffield, United Kingdom Filip Maric, University of Belgrade, Serbia Walther Neuper, Graz University of Technology, Austria (co-chair) Pavel Pech , University of South Bohemia, Czech Republic Pedro Quaresma, University of Coimbra, Portugal (co-chair) Vanda Santos, CISUC, Portugal Wolfgang Schreiner, Johannes Kepler University, Austria Burkhart Wolff, University Paris-Sud, France -- Dr. Achim D. Brucker | Software Assurance & Security | University of Sheffield https://www.brucker.ch | https://logicalhacking.com/blog @adbrucker | @logicalhacking From georg.moser at uibk.ac.at Mon Feb 20 06:13:55 2017 From: georg.moser at uibk.ac.at (Georg Moser) Date: Mon, 20 Feb 2017 12:13:55 +0100 Subject: [TYPES/announce] DICE-FOPARA 2017: Deadline Extended Message-ID: <45c82401-3ff1-6f45-a008-02d25ea56003@uibk.ac.at> [Apologies for cross-postings.] ------------------------------------------------------------------------------------------- 8th Workshop on Developments in Implicit Computational complExity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis (DICE-FOPARA 2017) Affiliated with ETAPS 2017 April 22 - 23, 2017, Uppsala, Sweden http://cbr.uibk.ac.at/events/dice-fopara ------------------------------------------------------------------------------------------- OBJECTIVES The first joint international workshop on Developments in Implicit Computational complExity and FOundational and Practical Aspects of Resource Analysis (DICE-FOPARA) will be held in Uppsala, Sweden, from April 22-23, 2017 as part of the European Joint Conferences on Theory and Practice of Software 2017 (ETAPS 2017). DICE-FOPARA serves as a forum for presenting results relevant to the implicit computational complexity theory *and* to the analysis of resource consumption by computer programs (e.g. time, space, energy). The workshop brings together researchers that work on foundational issues with researchers that focus more on practical results. For further information, kindly see the workshop's website. INVITED SPEAKERS Elvira Albert (Complutense University of Madrid) Kerstin I. Eder (University of Bristol) Lars Kristiansen (University of Oslo) Jan Reinecke (Universit?t Saarland) SUBMISSIONS We ask for submission of *regular papers* describing original work (10-15 pages) or *extended abstracts* (2-6 pages) presenting already published work or work in progress. Regular papers must be prepared using the LaTeX EPTCS class (see http://eptcs.org/). Accepted regular papers will appear in an EPTCS volume. Papers should be submitted electronically via the submission page: https://easychair.org/conferences/?conf=dicefopara2017 IMPORTANT DATES Paper submission *March 5, 2017* (extended) Notification March 19, 2017 Final versions due March 26, 2017 Workshop date April 22-23, 2017 PROGRAM COMMITTEE Beniamino Accattoli (Paris) Guillaume Bonfante (Nancy, co-chair) Marko van Eekelen (Nijmegen) Marco Gaboardi (Buffalo) Dan Ghica (Birmingham) Clemens Grelck (Amsterdam) Charles Grellois (Bologna) Nao Hirokawa (JAIST) Jan Hoffmann (CMU) Thomas Jensen (Rennes) Bj?rn Lisper (M?lardalen) Hans-Wolfgang Loidl (Edinburgh) Georg Moser (Innsbruck, co-chair) Kazushige Terui (Kyoto) Simon Wegener (Saarbr?cken) Florian Zuleger (Vienna) From kaposi.ambrus at gmail.com Tue Feb 21 12:17:16 2017 From: kaposi.ambrus at gmail.com (Ambrus Kaposi) Date: Tue, 21 Feb 2017 18:17:16 +0100 Subject: [TYPES/announce] TYPES 2017 2nd call for contributions Message-ID: Reminder: abstracts (2 pp easychair.cls) due by 13 March 2017. CALL FOR CONTRIBUTIONS 23rd International Conference on Types for Proofs and Programs, TYPES 2017 and EUTYPES Cost Action CA15123 meeting Budapest, Hungary, 29 May - 1 June 2017 http://types2017.elte.hu BACKGROUND The TYPES meetings are a forum to present new and on-going work in all aspects of type theory and its applications, especially in formalised and computer assisted reasoning and computer programming. The TYPES areas of interest include, but are not limited to: * foundations of type theory and constructive mathematics; * applications of type theory; * dependently typed programming; * industrial uses of type theory technology; * meta-theoretic studies of type systems; * proof assistants and proof technology; * automation in computer-assisted reasoning; * links between type theory and functional programming; * formalizing mathematics using type theory. We encourage talks proposing new ways of applying type theory. In the spirit of workshops, talks may be based on newly published papers, work submitted for publication, but also work in progress. The EUTypes Cost Action CA15123 (eutypes.cs.ru.nl) focuses on the same research topics as TYPES and partially sponsors the TYPES Conference: May 31 - June 1 are supported by and organised under the auspices of EUTypes. INVITED SPEAKERS * Edwin Brady (University of St Andrews) * Sara Negri (University of Helsinki) * Jakob Rehof (TU Dortmund) CONTRIBUTED TALKS We solicit contributed talks. Selection of those will be based on extended abstracts/short papers of 2 pp formatted with easychair.cls. The submission site is https://easychair.org/conferences/?conf=types2017. Important dates: * submission of 2 pp abstract: 13 March 2017 * notified of acceptance/rejection: 10 April 2017 * camera-ready version of abstract: 2 May 2017 Camera-ready versions of the accepted contributions will be published in an informal book of abstracts for distribution at the workshop. POST-PROCEEDINGS Similarly to TYPES 2011 and TYPES 2013-2016, we intend to publish a post-proceedings volume in the Leibniz International Proceedings in Informatics (LIPIcs) series (subject to successful negotiation with Dagstuhl Publishing). Submission to that volume would be open for everyone. Tentative submission deadline: September 2017. PROGRAMME COMMITTEE * Andreas Abel (Chalmers University Gothenburg) * Thorsten Altenkirch (University of Nottingham) * Jos? Espirito Santo (University of Minho) * Fredrik Nordvall Forsberg (University of Strathclyde) * Silvia Ghilezan (University of Novi Sad) * Hugo Herbelin (INRIA Paris-Rocquencourt) * Martin Hofmann (Ludwig Maximilian University of Munich) * Ambrus Kaposi (E?tv?s Lor?nd University) (co-chair) * Tam?s Kozsik (E?tv?s Lor?nd University) (co-chair) * Assia Mahboubi (INRIA) * Alexandre Miquel (University of the Republic, Uruguay) * Leonardo de Moura (Microsoft Research, Redmond, USA) * Keiko Nakata (SAP, Potsdam) * Andrew Polonsky (University Paris Diderot) * Simona Ronchi Della Rocca (Universit? di Torino) * Aleksy Schubert (University of Warsaw) * Wouter Swierstra (Utrecht University) * Tarmo Uustalu (Tallinn University of Technology) TYPES STEERING COMMITTEE Marc Bezem, Herman Geuvers (chair), Hugo Herbelin, Zhaohui Luo, Ralph Matthes, Bengt Nordstr?m, Andrew Polonsky, Aleksy Schubert, Tarmo Uustalu. ABOUT TYPES The TYPES meetings from 1990 to 2008 were annual workshops of a sequence of five EU funded networking projects. From 2009 to 2015, TYPES has been run as an independent conference series. From 2016, TYPES is partially supported by COST Action EUTypes CA15123. Previous TYPES meetings were held in Antibes (1990), Edinburgh (1991), B?stad (1992), Nijmegen (1993), B?stad (1994), Torino (1995), Aussois (1996), Kloster Irsee (1998), L?keberg (1999), Durham (2000), Berg en Dal near Nijmegen (2002), Torino (2003), Jouy-en-Josas near Paris (2004), Nottingham (2006), Cividale del Friuli (2007), Torino (2008), Aussois (2009), Warsaw (2010), Bergen (2011), Toulouse (2013), Paris (2014), Tallinn (2015), Novi Sad (2016). CONTACT Email: info at types2017.elte.hu Organisers: Ambrus Kaposi, Tam?s Kozsik, Andr?s Kov?cs and the Department of Programming Languages and Compilers at the Faculty of Informatics, E?tv?s Lor?nd University, Budapest. From gabmeyer at seceng.informatik.tu-darmstadt.de Tue Feb 21 07:49:48 2017 From: gabmeyer at seceng.informatik.tu-darmstadt.de (Sebastian Gabmeyer) Date: Tue, 21 Feb 2017 13:49:48 +0100 Subject: [TYPES/announce] TAP 2017: Deadline Extension Message-ID: <50ad772f-bc1e-da7d-b8a8-f8220628b45a@seceng.informatik.tu-darmstadt.de> ===================================================== Final Call for Papers *DEADLINE EXTENSION* 11th International Conference on Tests And Proofs TAP 2017 Marburg (Germany), 19-20 July 2017 Part of STAF 2017 http://http://www.seceng.de/tap2017 ===================================================== Aim and Scope ------------- The TAP conference promotes research in verification and formal methods that targets the interplay of proofs and testing: the advancement of techniques of each kind and their combination, with the ultimate goal of improving software and system dependability. Research in verification has recently seen a steady convergence of heterogeneous techniques and a synergy between the traditionally distinct areas of testing (and dynamic analysis) and of proving (and static analysis). Formal techniques, such as model checking, that produce counterexamples when verification fails are a clear example of the duality of testing and proving. The combination of static techniques such as satisfiability modulo theory and predicate abstraction has provided means of proving correctness by complementing exhaustive enumeration testing-like techniques. More practically, testing supports the cost-effective debugging of complex models and formal specifications, and is applicable in conditions that are beyond the reach of formal techniques -- for example, components whose source code is not accessible. Testing and proving are increasingly seen as complementary rather than mutually exclusive techniques. The TAP conference aims to promote research in the intersection of testing and proving by bringing together researchers and practitioners from both areas of verification. Topics of Interest ------------------ TAP's scope encompasses many aspects of verification technology, including foundational work, tool development, and empirical research. Its topics of interest center around the connection between proofs (and other static techniques) and testing (and other dynamic techniques). Papers are solicited on, but not limited to, the following topics: - Verification and analysis techniques combining proofs and tests - Program proving with the aid of testing techniques - Deductive techniques (theorem proving, model checking, symbolic execution, SMT solving, constraint logic programming, etc.) to support testing: generating testing inputs and oracles, supporting coverage criteria, and so on. - Program analysis techniques combining static and dynamic analysis - Specification inference by deductive and dynamic methods - Testing and runtime analysis of formal specifications - Model-based testing and verification - Using model checking to generate test cases - Testing of verification tools and environments - Applications of testing and proving to new domains, such as security, configuration management, and language-based techniques - Bridging the gap between concrete and symbolic reasoning techniques - Innovative approaches to verification such as crowdsourcing and serious games - Case studies, tool and framework descriptions, and experience reports about combining tests and proofs Highlight Topics ---------------- In addition to TAP?s general topics of interests, the 11th edition of TAP will feature two highlight topics on techniques, tools, and experience reports on 1. Testing and proving the correctness of security properties and implementations of cryptographic functions and protocols with a focus on the successful interplay of tests and proofs, and 2. Asserting the correct functioning and testing of verification tools, especially on theorem provers, that form the basis of many verification results for tools and applications our society increasingly depends on. Important Dates (*UPDATED*) ------------------------- Abstract: *27 February 2017* Paper: *5 March 2017* Notification: 7 April 2017 Camera-Ready Version: 21 April 2017 Conference: 17-21 July 2017 Submission Instructions ----------------------- TAP 2017 accepts papers of three kinds: - Regular research papers: full submissions describing original research, of up to 16 pages (excluding references). - Tool demonstration papers: submissions describing the design and implementation of an analysis/verification tool or framework, of up to 8 pages (excluding references). The tool/framework described in a tool demonstration paper should be available for public use. - Short papers: submissions describing preliminary findings, proofs of concepts, and exploratory studies, of up to 6 pages (excluding references). Organization ------------ Program Chairs - Einar Broch Johnsen - Sebastian Gabmeyer Program Committee - Bernhard K. Aichernig - Elvira Albert - Bruno Blanchette - Jasmin C. Blanchette - Achim D. Brucker - Catherine Dubois - Gordon Fraser - Carlo A. Furia - Sebastian Gabmeyer (co-chair) - Angelo Gargantini - Alain Giorgetti - Christoph Gladisch - Martin Gogolla - Arnaud Gotlieb - Marieke Huisman - Bart Jacobs - Einar Broch Johnsen (co-chair) - Nikolai Kosmatov - Laura Kovacs - Martin Leuker - Panagiotis Manolios - Karl Meinke - Andreas Podelski - Andrew J. Reynolds - Martina Seidl - Martin Steffen - Martin Strecker - T. H. Tse - Luca Vigan? - Burkhart Wolff - Stijn de Gouw Contact ------- mailto:tap2017 at easychair.org From crafa at math.unipd.it Tue Feb 21 05:13:20 2017 From: crafa at math.unipd.it (Silvia Crafa) Date: Tue, 21 Feb 2017 11:13:20 +0100 Subject: [TYPES/announce] ECOOP 2017 - Call for Student Participation Message-ID: <1af77195-b75b-0cbc-721d-9d90846cb69a@math.unipd.it> ****************************************************************** ECOOP 2017 - CALL FOR STUDENT PARTICIPATION The 31st European Conference on Object-Oriented Programming 18-23 June 2017, Barcelona, Spain co-located with PLDI 2017 and other events ECOOP Summer School - Doctoral Symposium - Student Volunteers http://2017.ecoop.org #ECOOP2017 @ECOOPconf ****************************************************************** Interested in hearing the latest about Kotlin, Scala, Clojure, Rust, Swift, JavaScript, and many many other languages and systems? Curious about new ideas such as gradual types, JIT compilers for dynamic languages, differential privacy or deep learning? Always wanted to talk about computer science face to face with senior researchers and practitioners? Let?s come to share, challenge and complement your views! Join us in Barcelona from Sunday 18 to Friday 23 June 2017 The ECOOP/PLDI conferences offers support to students and professionals interested in attending. STUDENT VOLUNTEERS: Register to be Student Volunteers, help with the organization of the conference, get a free registration and a ticket for one of the banquets. The deadline for early application is April 15 2017. Info to apply: http://2017.ecoop.org/track/ecoop-2017-Student-Volunteers SUMMER SCHOOL: The ECOOP Summer School provides an easy introduction to the world of research in programming languages. It is targeted to Bachelor, Master and early Doctoral Students. No background is required other than an interest in languages technologies. Info: http://2017.ecoop.org/track/ecoop-2017-Summer-School DOCTORAL SYMPOSIUM: The Doctoral Symposium is designed to provide a forum for PhD students at any stage in their research to present their topic and get detailed feedback and advice. The main objectives of this event are: - to allow PhD students to practise writing clearly and to communicate and present their research effectively - to receive constructive feedback from other researchers and peers - to offer opportunities to form research collaborations - to contribute to the conference goals through interaction with other researchers at the main conference Info: http://2017.ecoop.org/track/ecoop-2017-Doctoral-Symposium From catherine.dubois at ensiie.fr Tue Feb 21 07:56:03 2017 From: catherine.dubois at ensiie.fr (dubois) Date: Tue, 21 Feb 2017 13:56:03 +0100 Subject: [TYPES/announce] Computers special issue - Formal Integrated Development Environments - CANCELLED In-Reply-To: References: Message-ID: <69bf3c86-b6f8-be3f-5cd5-c8118853c40d@ensiie.fr> Hi, The following special issue has been cancelled. We apologize for this. Please do not hesistate to contact us if needed. Catherine Dubois, Paolo Masci and Dominque Mery. ( apologies for duplicates) Le 11/02/2017 ? 16:17, dubois a ?crit : > Journal: Computers > Special Issue: Formal Integrated Development Environments > Special Issue Editors: Catherine Dubois, Dominique Mery and Paolo Masci > http://www.mdpi.com/journal/computers/special_issues/f_ide > > Guest Editors > - Professor Catherine Dubois > Samovar / ENSIIE > Webpage: http://www.ensiie.fr/~dubois/ > E-Mail: catherine.dubois at ensiie.fr > - Dr. Paolo Masci > HASLab/INESC TEC & Universidade do Minho, Braga, Portugal > Webpage: http://haslab.uminho.pt/masci/ > E-Mail: paolo.masci at inesctec.pt > - Professor Dominique Mery > LORIA & Universit? de Lorraine, France > Webpage: http://www.loria.fr/~mery/ > E-Mail: dominique.mery at loria.fr > > Summary > This special issue of Computers is dedicated to Formal Integrated > Development Environments (Formal-IDEs) for the rigorous specification, > design, analysis, and documentation of high-assurance systems. > > This special issue welcomes original high-quality contributions that > have been neither published in, nor submitted to, any journal or > refereed conference. Topics of interest include, but are not limited > to, the following: > Formal-IDE building: design and integration of languages, > development of user-friendly front-ends > How to make high-level logical and programming concepts palatable > to industrial developers > Integration of Object-Oriented and modularity features > Integration of static analyzers > Integration of automatic proof tools, theorem provers and testing > tools > Documentation tools > Impact of tools on certification > Experience reports on developing Formal-IDEs > Experience reports on using Formal-IDEs > Experience reports on formal methods-based assessments in > industrial applications > > > Submission > Manuscripts should be submitted online at www.mdpi.com. Manuscripts > can be submitted until the deadline. Papers will be published > continuously (as soon as accepted) and will be listed together on the > special issue website. Research articles, review articles as well as > communications are invited. For planned papers, a title and short > abstract (about 100 words) can be sent to the Editorial Office for > announcement on this website. > Submitted manuscripts should not have been published previously, nor > be under consideration for publication elsewhere (except conference > proceedings papers). All manuscripts are refereed through a > peer-review process. > -- Catherine DUBOIS, professor ENSIIE, lab. Samovar (UMR 5157) -------------- next part -------------- A non-text attachment was scrubbed... Name: catherine_dubois.vcf Type: text/x-vcard Size: 4 bytes Desc: not available URL: From rody.kersten at sv.cmu.edu Tue Feb 21 16:54:00 2017 From: rody.kersten at sv.cmu.edu (Rody Kersten) Date: Tue, 21 Feb 2017 13:54:00 -0800 Subject: [TYPES/announce] NFM 2017 - Call For Participation Message-ID: NFM 2017 - Call For Participation The 9th NASA Formal Methods Symposium ------------------------------------- https://ti.arc.nasa.gov/events/nfm-2017/ May 16 - 18, 2017 NASA Ames Research Center Moffett Field, CA, USA The NASA Formal Methods Symposium (NFM) is a forum to foster collaboration between theoreticians and practitioners from NASA, academia, and industry. NFM?s goals are to identify challenges and to provide solutions for achieving assurance for mission-critical and safety-critical systems at NASA and in the aerospace industry. The focus of the symposium will be on formal techniques and other approaches for software assurance, their theory, current capabilities and limitations, as well as their potential application to aerospace, robotics, and other NASA-relevant safety-critical systems during all stages of the software life-cycle. *Keynote speakers* * Michael Wagner, Carnegie Mellon University * Ben Haldeman, Planet Labs * Manu Sridharan, Uber Technologies Inc. * Jason Crusan, NASA Advanced Exploration Systems Division * Alexandre Arnold, Airbus *Accepted papers* A total of 31 excellent papers were accepted. The full list can be found here: https://ti.arc.nasa.gov/events/nfm-2017/papers/ *Registration* NFM 2017 will be held at NASA Ames Research Center, Moffett Field, CA on May 16 to 18, 2017. There will not be a registration fee charged to participants. All interested individuals, including non-US citizens, are welcome to attend, to listen to the talks, and to participate in discussions; however, all attendees must register via the link below. Foreign Nationals will need to send extra information and allow at least three weeks for processing time after all of the information has been received. Register here: https://ti.arc.nasa.gov/events/nfm-2017/registration/ Co-located event: AFM Workshop 2017 AFM is a one-day workshop centered around the use and integration of highly automated formal verification tools for specification, interactive theorem proving, satisfiability (SAT) and satisfiability modulo theories (SMT), model checking, program verification, static analysis, runtime verification, code generation, and testing, as well as interfaces, documentation, and education. AFM functions both as a user's meeting for SRI's tools such as PVS, SAL and Yices, and as a workshop for those interested in state of the art automation for formal methods generally. Paper deadline: March 27, 2017 Workshop: May 19, 2017 More information: http://fm.csl.sri.com/AFM17/ Organization General Chair Misty Davis (NASA Ames) Program Chairs Clark Barrett (Stanford University) Temesghen Kahsai (NASA Ames / CMU Silicon Valley) Local Organization Guy Katz (Stanford University) Rody Kersten (CMU Silicon Valley) -------------- next part -------------- An HTML attachment was scrubbed... URL: From brucker at spamfence.net Wed Feb 22 16:47:00 2017 From: brucker at spamfence.net (Achim D. Brucker) Date: Wed, 22 Feb 2017 21:47:00 +0000 Subject: [TYPES/announce] CFP: International Workshop on OCL and Textual Modeling (OCL 2017) Message-ID: <20170222214700.w56ujulpbpsk2whe@fujikawa.home.brucker.ch> (Apologies for duplicates) CALL FOR PAPERS 17th International Workshop on OCL and Textual Modeling Co-located with STAF 2017 SOFTWARE TECHNOLOGIES: APPLICATIONS AND FOUNDATIONS July 20, 2017, Marburg, Germany http://oclworkshop.github.io Modeling started out with UML and its precursors as a graphical notation. Such visual representations enable direct intuitive capturing of reality, but they have weaknesses: for example, detailed visual representations bear the risk of becoming overcrowded faster than textual models and some of the visual features lack the level of precision required to create complete and unambiguous specifications. These weaknesses of graphical notations encouraged the development of text-based modeling languages that either integrate with or replace graphical notations for modeling. Typical examples of such languages are OCL, textual MOF, Epsilon, and Alloy. Textual modeling languages have their roots in formal language paradigms like logic, programming and databases. The goal of this workshop is to create a forum where researchers and practitioners interested in building models using OCL or other kinds of textual languages can directly interact, report advances, share results, identify tools for language development, and discuss appropriate standards. In particular, the workshop will encourage discussions for achieving synergy from different modeling language concepts and modeling language use. The close interaction will enable researchers and practitioners to identify common interests and options for potential cooperation. ## Topics of interest Topics of interest include (but are not limited to): - Mappings between textual modeling languages and other languages/formalisms - Algorithms, evaluation strategies and optimizations in the context of textual modeling languages for: - validation, verification, and testing, - model transformation and code generation, - meta-modeling and DSLs, and - query and constraint specifications - Alternative graphical/textual notations for textual modeling languages - Evolution, transformation and simplification of textual modeling expressions - Libraries, templates and patterns for textual modeling languages - Tools that support textual modeling languages (e.g., verification of OCL formulae, runtime monitoring of invariants) - Complexity results for textual modeling languages - Quality models and benchmarks for comparing and evaluating textual modeling tools and algorithms - Successful applications of textual modeling languages - Case studies on industrial applications of textual modeling languages - Experience reports: - usage of textual modeling languages and tools in complex domains, - usability of textual modeling languages and tools for end-users - Empirical studies about the benefits and drawbacks of textual modeling languages - Innovative textual modeling tools - Comparison, evaluation and integration of modeling languages - Correlation between modeling languages and modeling tasks This year, we particularly encourage submissions describing applications and case studies of textual modeling as well as test suites and benchmark collections for evaluating textual modeling tools. ## Venue This workshop will be organized as a part of STAF 2017 Conferenze in Marburg, Germany. It was previously organized as part of the MODELS conference. Similar to its predecessors , the workshop addresses both people from academia and industry . The aim is to provide a forum for addressing integration of OCL and other textual modeling languages , as well as tools for textual modeling , and for disseminating good practice and discussing the new requirements for textual modeling . ## Workshop Format The workshop will include short (about 15 min) presentations, parallel sessions of working groups, and sum-up discussions. ## Submissions Two types of papers will be considered: * Short contributions (between 6 and 8 pages) describing new ideas, innovative tools or position papers. * Full papers (between 12 and 16 pages). in LNCS format. Submissions should be uploaded to [EasyChair](https://easychair.org/conferences/?conf=ocl17). The program committee will review the submissions (minimum 2 reviews per paper, usually 3 reviews) and select papers according to their relevance and interest for discussions that will take place at the workshop. Accepted papers will be published online in a post-conference edition of [CEUR](http://www.ceur-ws.org). ## Important Dates - Submission of papers: April 28, 2017 - Notification: May 25, 2017 - Workshop date: July 20, 2017 -- Dr. Achim D. Brucker | Software Assurance & Security | University of Sheffield https://www.brucker.ch | https://logicalhacking.com/blog @adbrucker | @logicalhacking From S.J.Thompson at kent.ac.uk Thu Feb 23 05:38:40 2017 From: S.J.Thompson at kent.ac.uk (Simon Thompson) Date: Thu, 23 Feb 2017 10:38:40 +0000 Subject: [TYPES/announce] Trends in Functional Programming in Education ITFPIE) 2017, call for papers Message-ID: <808795D3-0D84-4690-8498-109316D10215@kent.ac.uk> TFPIE 2017 Trends in Functional Programming in Education, 2017 The sixth workshop on Trends in Functional Programming in Education, 2017, which is to be held on the Canterbury campus of the University of Kent on Thursday, 22 June, following the 2017 TFP meeting on 19?21 June. TFPIE workshops have previously been held in St Andrews, Scotland (2012), Provo Utah, USA (2013), Soesterberg, The Netherlands (2014), and Sophia-Antipolis, France (2015), College Park, USA (2016). The goal of TFPIE is to gather researchers, teachers and professionals that use, or are interested in the use of, functional programming in education. TFPIE aims to be a venue where novel ideas, classroom-tested ideas and work-in-progress on the use of functional programming in education are discussed. The one-day workshop will foster a spirit of open discussion by having a review process for publication after the workshop. The program chair of TFPIE 2017 will screen submissions to ensure that all presentations are within scope and are of interest to participants. After the workshop, presenters will be invited to submit revised versions of their articles for publication in the journal Electronic Proceedings in Theoretical Computer Science (EPTCS). Call for papers TFPIE 2017 welcomes submissions describing techniques used in the classroom, tools used in and/or developed for the classroom and any creative use of functional programming (FP) to aid education in or outside Computer Science. Topics of interest include, but are not limited to: - FP and beginning CS students - FP and Computational Thinking - FP and Artificial Intelligence - FP in Robotics - FP and Music - Advanced FP for undergraduates - FP in graduate education - Engaging students in research using FP - FP in Programming Languages - FP in the high school curriculum - FP as a stepping stone to other CS topics - FP and Philosophy - The pedagogy of teaching FP - FP and e-learning: MOOCs, automated assessment etc. - Best Lectures ? more details below In addition to papers, we are requesting best lecture presentations. What?s your best lecture topic in an FP related course? Do you have a fun way to present FP concepts to novices or perhaps an especially interesting presentation of a difficult topic? In either case, please consider sharing it. Best lecture topics will be selected for presentation based on a short abstract describing the lecture and its interest to TFPIE attendees. Submission Potential presenters are invited to submit an extended abstract (4-6 pages) or a draft paper (up to 16 pages) in EPTCS style. The authors of accepted presentations will have their preprints and their slides made available on the workshop's website. Papers and abstracts can be submitted via easychair at the following link: https://easychair.org/conferences/?conf=tfpie2017 After the workshop, presenters will be invited to submit (a revised version of) their article for review. The PC will select the best articles for publication in the journal Electronic Proceedings in Theoretical Computer Science (EPTCS). Articles rejected for presentation and extended abstracts will not be formally reviewed by the PC. Programme committee Dr Laura Castro, University of A Coru?a Prof Ralf L?mmel, University of Koblenz-Landau Dr Elena Machkasova, University of Minnesota, Morris Prof Michel Mauny, Inria, Paris Dr Jeremy Singer, University of Glasgow Prof Simon Thompson, University of Kent (chair) Important dates Submissions of draft papers: 10 May, 2017 Notification: 17 May, 2017 Registration: 11 June, 2017 Workshop: 22 June 2017 Submission for formal review: 18 August, 2017 Notification of acceptance: 6 October, 2017 Camera ready paper: 3 November, 2017 Simon Thompson | Professor of Logic and Computation School of Computing | University of Kent | Canterbury, CT2 7NF, UK s.j.thompson at kent.ac.uk | M +44 7986 085754 | W www.cs.kent.ac.uk/~sjt From matthew.hague at rhul.ac.uk Thu Feb 23 06:53:32 2017 From: matthew.hague at rhul.ac.uk (Matthew Hague) Date: Thu, 23 Feb 2017 11:53:32 +0000 Subject: [TYPES/announce] CFP: Reachability Problems 2017, September 7-9, Royal Holloway, University of London Message-ID: <20170223115332.GH1056@chilon.net> Apologies for multiple postings. The 11th International Workshop on Reachability Problems (RP'17) 7 - 9 September 2017 | Royal Holloway, University of London, UK | http://rp17.cs.rhul.ac.uk The 11th Workshop on Reachability Problems will be hosted at Royal Holloway, University of London. The Reachability Workshop is specifically aimed at gathering together scholars from diverse disciplines interested in reachability problems that appear in algebraic structures, computational models, hybrid systems, logic and verification. Invited Speakers: Hana Chockler, King's College London Laurent Doyen, LSV - ENS Cachan Rapha?l Jungers, Universit? catholique de Louvain Andreas Podelski, University of Freiburg Submissions: Authors are invited to submit a draft of a full paper with at most 12 pages (in LaTeX, formatted according to LNCS guidelines) via Easychair. Proofs omitted due to space constraints must be put into an appendix to be read by the program committee members at their discretion. Submissions deviating from these guidelines risk rejection. Electronic submissions should be formatted in pdf. Simultaneous submission to other conferences or workshops with published proceedings is not allowed. Submission link: https://easychair.org/conferences/?conf=rp2017 Topics of interest include (but are not limited to): reachability problems in infinite state systems, rewriting systems, dynamical and hybrid systems; reachability problems in logic and verification; reachability analysis in different computational models, counter timed/cellular/communicating automata; Petri nets; computational aspects of algebraic structures (semigroups, groups and rings); frontiers between decidable and undecidable reachability problems; predictability in iterative maps and new computational paradigms. Important Dates Submission deadline: 10 May 2017 (AoE) Notification to authors: 21 June 2017 Final version: 30 June 2017 Workshop: 7 - 9 September 2017 Presentation-Only Track In addition to regular papers that will appear in our LNCS proceedings, we invite researchers to apply to give a presentation at RP'17 without an accompanying paper. Such presentations can be based on work that has appeared (or which is going to appear) in the proceedings of another conference, or which has not yet been submitted. These contributions will be judged solely on the basis of their attractiveness to the workshop. To apply to give such a presentation please submit a PDF file containing a short abstract (up to two pages) by e-mail [ rp2017 at easychair.org ] by August 2st 2017, with subject "RP2017 Informal Presentations". This abstract will not be published in the conference proceedings. Notification for the presentation-only track will be August 9th 2017. Proceedings The Conference Proceedings will be published as the volume of the Springer Verlag LNCS (Lecture Notes in Computer Science) series and distributed at the Conference. We plan also to publish selected papers in a special issue of a high quality journal following the regular referee procedure. RP'17 Program Committee: Igor Potapov, University of Liverpool (co-chair) Matthew Hague, Royal Holloway, University of London (co-chair) Paul Bell, Liverpool John Moores University Patricia Bouyer-Decitre, LSV, CNRS & ENS de Cachan Aiswarya Cyriac, Chennai Mathematical Institute Giorgio Delzanno, Universita Degli Studi Di Genova Piotrek Hofman, University of Warsaw Peter Lammich, Institut fuer Informatik, TU Munich Martin Lange, University of Kassel Salvatore La Torre, Universit? degli Studi di Salerno Ranko Lazic, University of Warwick Ond?ej Leng?l, Brno University of Technology Jerome Leroux, Laboratoire Bordelais de Recherche en Informatique Rupak Majumdar, Max Planck Institute for Software Systems Ahmed Rezine, Link?ping University Tachio Terauchi, School of Information Science, Japan Advanced Institute of Science and Technology Hsu-Chun Yen, National Taiwan University Previous Workshops: 2016: RP'16 in Aalborg, Denmark LNCS proceedings, Volume 9899/2016, Springer Verlag 2015: RP'15 in Warsaw, Poland LNCS proceedings, Volume 9328/2015, Springer Verlag 2014: RP'14 in Oxford, UK LNCS proceedings, Volume 8762/2014, Springer Verlag 2013: RP'13 in Uppsala, Sweden LNCS proceedings, Volume 8169/2013, Springer Verlag 2012: RP'12 in Bordeaux, France LNCS proceedings, Volume 7550/2012, Springer Verlag 2011: RP'11 in Genova, Italy LNCS proceedings, Volume 6945/2011, Springer Verlag 2010: RP'10 in Brno, Czech Republic LNCS proceedings, Volume 6227/2010, Springer Verlag 2009: RP'09 in Palaiseau, France LNCS proceedings, Volume 5797/2009, Springer Verlag 2008: RP'08 in Liverpool, UK ENTCS proceedings, Volume 223, Elsevier 2007: RP'07 in Turku, Finland TUCS General Publication Series, Volume 45, Turku Centre for Computer Science From walid.gomaa at gmail.com Thu Feb 23 13:07:52 2017 From: walid.gomaa at gmail.com (Walid Gomaa) Date: Thu, 23 Feb 2017 19:07:52 +0100 Subject: [TYPES/announce] Halmstad Summer School on Cyber-Physical Systems 2017 Message-ID: <6b4f390d-a2f1-4dca-54e8-d15bcaa936d0@gmail.com> Summer School on Cyber-Physical Systems - Call for Participation The Summer School on Cyber-Physical Systems brings together the theoretical foundations and the industrial practice of the area in Halmstad, a place known both for innovation in embedded systems and popular beaches. This year?s school will take place from July 17th-21st, 2017. The summer school is intended for professionals from industry (engineers, researchers, and managers) and academics (including doctoral students). Participants will learn about key topics from prominent leaders in the field. The schedule is designed to allow significant opportunities for interaction between participants and the speakers. Topics and Speakers * Henric Andersson, SAAB Group, o Modeling & Simulation of large scale Integrated Modular CPS. * Stanley Bak, Air Force Rome Labs, o Formal Verification of CPS using Flow-Pipe Construction of Hybrid Automata. * Manfred Broy, TU M?nchen, o Modeling cyber physical systems: Interaction, modularity, distribution, probability. * Luc Jaulin, ENSTA Bretagne, o Interval analysis for the conception of autonomous and reliable cyber-physical systems. * Ueda Kazunori, Waseda University, o High-level programming languages and systems for cyber-physical systems. * Andre Platzer, CMU, o Logical Foundations of Cyber-Physical Systems. * Jeff Shamma, Georgia Tech and KAUST, o Game theory for cyber-physical systems. * Martin T?rngren, KTH, o Cyber-Physical Systems - perspectives, innovation opportunities and key cross-domain challenges. All lectures will be conducted in English. Venue The summer school will take place at Halmstad University in Hav, a meeting room with an overview of the city and the Kattegat sea area. Halmstad is easily reachable by train from Copenhagen and Gothenburg airports, and by air from Stockholm. Application for Registration Registration can be done online at http://bit.ly/cps-reg. The deadline for early registration is May 1st, 2017. For more information: http://ceres.hh.se/mediawiki/CPS_2017 -- Walid Gomaa -------------- next part -------------- An HTML attachment was scrubbed... URL: From tobias.grosser at inf.ethz.ch Mon Feb 27 06:18:14 2017 From: tobias.grosser at inf.ethz.ch (Tobias Grosser) Date: Mon, 27 Feb 2017 12:18:14 +0100 Subject: [TYPES/announce] ECOOP/PLDI 2017 in Barcelona / Call for Student Participation Message-ID: <1488194294.496983.894022664.791533DF@webmail.messagingengine.com> ECOOP/PLDI 2017 in Barcelona / Call for Student Participation http://conf.researchr.org/home/pldi-ecoop-2017 Interested in hearing the latest about Scala, Perl, Clojure, Rust, Swift, JavaScript, and many many other languages and systems? Curious about new ideas such as gradual types, JIT compilers for dynamic languages, differential privacy or deep learning? Always wanted to talk about computer science face to face with senior researchers and practitioners? Let?s come to share, challenge and complement your views! Join us in Barcelona from Sunday 18 to Friday 23 June 2017 The ECOOP/PLDI conferences offers support to students and professionals interested in attending. To apply: application form # Bachelor, Master, and early Doctoral Students The ECOOP Summer School provides an easy introduction to the world of research in programming languages. No background is required other than an interest in languages technologies. Info: http://2017.ecoop.org/track/ecoop-2017-Summer-School # Doctoral Students The Doctoral Symposium is designed to provide a forum for PhD students at any stage in their research to present their topic and get detailed feedback and advice. The main objectives of this event are: to allow PhD students to practise writing clearly and to communicate and present their research effectively to receive constructive feedback from other researchers and peers to offer opportunities to form research collaborations to contribute to the conference goals through interaction with other researchers at the main conference Info: http://2017.ecoop.org/track/ecoop-2017-Doctoral-Symposium # All Students Register to be Student Volunteers, help with the organization of the conference, get a free registration and a ticket for one of the banquets. This year PLDI and ECOOP are co-located. Student Volunteers can attend events from both conferences and might be working for either. Preference can be stated in the application form. Info: http://2017.ecoop.org/track/ecoop-2017-Student-Volunteers#About From tarmo at cs.ioc.ee Mon Feb 27 17:38:12 2017 From: tarmo at cs.ioc.ee (Tarmo Uustalu) Date: Tue, 28 Feb 2017 00:38:12 +0200 Subject: [TYPES/announce] ETAPS 2018 call for satellite events Message-ID: <20170228003812.48602164@cs.ioc.ee> 21st European Joint Conferences on Theory and Practice of Software ETAPS 2018 Thessaloniki, Greece, 14-21 April 2018 http://www.etaps.org/2018/ Call for Satellite Events -- ABOUT ETAPS -- The European Joint Conferences on Theory and Practice of Software (ETAPS) is the primary European forum for academic and industrial researchers working on topics relating to Software Science. It is an annual event held in Europe each spring since 1998. Its twenty-first edition, ETAPS 2018, will take place 14-21 April 2018 in Thessaloniki, Greece. ETAPS 2018 main conferences, scheduled for 16-20 April, are: * ESOP: European Symposium on Programming * FASE: Fundamental Approaches to Software Engineering * FOSSACS: Foundations of Software Science and Computation Structures * POST: Principles of Security and Trust * TACAS: Tools and Algorithms for the Construction and Analysis of Systems -- SATELLITE EVENTS -- The ETAPS 2018 organizing committee invites proposals for satellite events (workshops) that will complement the main conferences. They should fall within the scope of ETAPS. This encompasses all aspects of the system development process, including specification, design, implementation, analysis and improvement, as well as the languages, methodologies and tools which support these activities, covering a spectrum from practically-motivated theory to soundly-based practice. Satellite events provide an opportunity to discuss and report on emerging research approaches and practical experience relevant to theory and practice of software. ETAPS 2018 satellite events will be held immediately before and after the main conferences, on 14-15 April and 21 April. -- ARRANGEMENTS FOR SATELLITE EVENTS -- The organizers of an ETAPS 2018 satellite are expected to: * create and maintain a website for the event, * form a PC, produce a call for papers for the event (if appropriate), * advertise the event through specialist mailing lists etc. to complement the publicity of ETAPS, * review the submissions received and make acceptance decisions, * prepare an informal (pre)proceedings for the event (if appropriate), * prepare the event's program complying with any scheduling constraints defined by the ETAPS 2018 organizing committee, * prepare and organize the publication of a formal (post)proceedings (if desired). The ETAPS 2018 organizing committee will: * promote the event on the website and in the publicity material of ETAPS 2018, * integrate the event's program into the overall program of the conference, * arrange registration for the event as a component of registration for ETAPS, * collect a participation fee from the registrants, * produce a compilation USB memory stick of the informal (pre)proceedings of the satellite events of ETAPS 2018 and distribute this to the registrants, * provide the event with a meeting room of an appropriate size, A/V equipment, coffee breaks and possibly lunch(es). As a rule, ETAPS will not contribute toward the travel or accommodation costs of invited speakers or organizers of satellite events. -- SUBMISSION OF SATELLITE EVENT PROPOSALS -- Researchers and practitioners wishing to organize satellite events are invited to submit proposals to the workshop co-chairs Alexander Chatzigeorgiou and Nick Bassiliades using the web form at http://eptcs.web.cse.unsw.edu.au/ETAPS/ . The following information is requested: * the name and acronym of the satellite event * the names and contact information of the organizers * the duration of the event: one or two days * the preferred period: 14 April, 15 April, 14-15 April or 21 April * the expected number of participants * a brief description (120 words approximately) of the event topic for the website and publicity material of ETAPS 2018 * a brief explanation of the event topic and its relevance to ETAPS * an explanation of the selection procedure of contributions to the event, the PC chair and members, if known already, information about past editions of the event, if applicable * any other relevant information, like a special event format, invited speakers, demo sessions, special space requirements, etc. * a tentative schedule for paper submission, notification of acceptance and final versions for the (informal pre-)proceedings (the ETAPS 2018 organizing committee will need the final files by the end of Feb. 2018) * the plans for formal publication (no formal publication, formal proceedings ready by the event, formal post-proceedings, publication venue - EPTCS or elsewhere) The proposals will be evaluated by the ETAPS 2018 organizing committee on the basis of their assessed benefit for prospective participants of ETAPS 2018. Prospective organizers may wish to consult the web pages of previous satellite events as examples: ETAPS 2017: http://www.etaps.org/2017/workshops ETAPS 2016: http://www.etaps.org/2016/workshops ETAPS 2015: http://www.etaps.org/2015/workshops ETAPS 2014: http://www.etaps.org/2014/workshops ETAPS 2013: http://www.etaps.org/2013/workshops ETAPS 2012: http://www.etaps.org/2012/workshops -- IMPORTANT DATES -- Satellite event proposals deadline: 24 March 2017 Notification of acceptance: 7 April 2017 -- HOST CITY -- Thessaloniki, named after Alexander's the Great sister, is the second largest city in Greece. Thessaloniki is an industrial and commercial center hosting an annual international trade fair, as well as a transportation hub with a major modern port and an international airport. Thessaloniki's history spans over 2300 years. Although largely rebuilt in modern style, Thessaloniki still retains its famous white Byzantine walls, the 15th century White Tower, and a Venetian citadel. The city is famous for its many fine Byzantine churches and Roman ruins of the triumphal arch and the palace of Emperor Galerius. Thessaloniki is a vibrant student city hosting more than 80,000 university students and offering countless options when it comes to local/international cuisine, cafes, music and day trips. ETAPS 2018 is organized by the Aristotle University of Thessaloniki, the largest university in Greece. -- FURTHER INFORMATION AND ENQUIRIES -- Please contact the workshop co-chairs, Alexander Chatzigeorgiou and Nikos Bassiliades . From valeria.vignudelli at ens-lyon.fr Mon Feb 27 19:31:15 2017 From: valeria.vignudelli at ens-lyon.fr (Valeria Vignudelli) Date: Tue, 28 Feb 2017 01:31:15 +0100 Subject: [TYPES/announce] Call for Scholarship Applications: Logic Mentoring Workshop (LMW) '17 Message-ID: FIRST CALL FOR SCHOLARSHIP APPLICATIONS 2nd LOGIC MENTORING WORKSHOP Reykjavik, Iceland Sunday 18 June 2017 http://lics.rwth-aachen.de/lics17/lmw.html Colocated with LICS 2017 The 2nd Logic Mentoring Workshop (LMW) invites applications from students (undergraduate, master's and PhD), in all areas of logic for scholarships to attend the Logic in Computer Science (LICS) conference this year. Attending a conference such as LICS can be a transformative experience. It exposes participants to cutting-edge research and can open up new research avenues and collaboration opportunities. However many students do not get the opportunity to attend a conference such as LICS, and its participation often underrepresents women and minorities. For this reason, women and members of minority groups are especially encouraged to apply. Scholarships will be generously funded by our sponsors (see below) and cover registration to LMW and the main LICS conference, and possibly travel and accommodation. The LMW will focus on the technical and practical aspects of a career in logic research, including talks and panel sessions from leaders in the subject. LMW ?17 builds on the success of the first edition which took place last year, also colocated with LICS. Last year's programme can be found here: . SCHOLARSHIP APPLICATIONS Applications should be made via the online form: http://bit.ly/2lLnRq5 Please note that a letter of recommendation is required and should be sent directly by your referee to Valeria Vignudelli < valeria.vignudelli at ens-lyon.fr>. Further details are on the form. The deadline for applications is *31 March 2017*. Notification will be made shortly thereafter. CONFIRMED SPEAKERS Yuri Gurevich (University of Michigan, Microsoft Research) Valeria de Paiva (Nuance Communications) Prakash Panangaden (McGill University) (more TBA) ORGANISING COMMITTEE Anupam Das (co-chair) Eric Koskinen Valeria Vignudelli (co-chair) Fabio Zanasi (co-chair) SPONSORS Icelandic Centre of Excellence in Theoretical Computer Science (ICE-TCS) National Science Foundation (NSF) ACM Special Interest Group on Logic and Computation (SIGLOG) -------------- next part -------------- An HTML attachment was scrubbed... URL: From compscience.announcement at gmail.com Sun Feb 26 18:45:43 2017 From: compscience.announcement at gmail.com (Klaus Havelund) Date: Sun, 26 Feb 2017 15:45:43 -0800 Subject: [TYPES/announce] RV 2017 - 2nd Call for papers and tutorials Message-ID: *RV 2017* *Call for Papers and Tutorials* The 17th International Conference on Runtime Verification September 13-16, Seattle, WA, USA http://rv2017.cs.manchester.ac.uk rv2017 at easychair.org Runtime verification is concerned with the monitoring and analysis of the runtime behaviour of software and hardware systems. Runtime verification techniques are crucial for system correctness, reliability, and robustness; they provide an additional level of rigor and effectiveness compared to conventional testing, and are generally more practical than exhaustive formal verification. Runtime verification can be used prior to deployment, for testing, verification, and debugging purposes, and after deployment for ensuring reliability, safety, and security and for providing fault containment and recovery as well as online system repair. Topics of interest to the conference include, but are not limited to: - specification languages - monitor construction techniques - program instrumentation - logging, recording, and replay - combination of static and dynamic analysis - specification mining and machine learning over runtime traces - monitoring techniques for concurrent and distributed systems - runtime checking of privacy and security policies - statistical model checking - metrics and statistical information gathering - program/system execution visualization - fault localization, containment, recovery and repair - integrated vehicle health management (IVHM) Application areas of runtime verification include cyber-physical systems, safety/mission-critical systems, enterprise and systems software, autonomous and reactive control systems, health management and diagnosis systems, and system security and privacy. We welcome contributions exploring the combination of runtime verification techniques with machine learning and static analysis. Whilst these are highlight topics, papers falling into these categories will not be treated differently from other contributions. An overview of previous RV conferences and earlier workshops can be found at: http://www.runtime-verification.org. RV 2017 will be held September 13-16 in Seattle, WA, USA. RV 2017 will feature a tutorial day (September 13), and three conference days (September 14-16). Important Dates *Papers* as well as *tutorial proposals* will follow the following timeline: - Abstract deadline: April 24, 2017 (Anywhere on Earth) - Paper and tutorial deadline: May 1, 2017 (Anywhere on Earth) - Tutorial notification: May 21, 2017 - Paper notification: June 26, 2017 - Camera-ready deadline: July 24, 2017 - Conference: September 13-16, 2017 Invited Speakers We are very pleased to confirm the following invited speakers for RV 2017: - Rodrigo Fonseca , Brown University, USA - Vlad Levin and Jakob Lichtenberg , Microsoft Research, USA - Andreas Zeller , Saarland University, Germany General Information on Submissions All papers and tutorials will appear in the conference proceedings in an LNCS volume. Submitted papers and tutorials must use the LNCS/Springer style detailed here: http://www.springer.de/comp/lncs/authors.html Papers must be original work and not be submitted for publication elsewhere. Papers must be written in English and submitted electronically (in PDF format) using the EasyChair submission page here: https://easychair.org/conferences/?conf=rv17 The page limitations mentioned below include all text and figures, but exclude references. Additional details omitted due to space limitations may be included in a clearly marked appendix, that will be reviewed at the discretion of reviewers, but not included in the proceedings. At least one author of each accepted paper and tutorial must attend RV 2017 to present. Paper Submissions There are three categories of papers which can be submitted: regular, short or tool papers. Papers in each category will be reviewed by at least 3 members of the Program Committee. - *Regular Papers* (up to 15 pages, not including references) should present original unpublished results. We welcome theoretical papers, system papers, papers describing domain-specific variants of RV, and case studies on runtime verification. - *Short Papers* (up to 6 pages, not including references) may present novel but not necessarily thoroughly worked out ideas, for example emerging runtime verification techniques and applications, or techniques and applications that establish relationships between runtime verification and other domains. - *Tool Demonstration Papers* (up to 8 pages, not including references) should present a new tool, a new tool component, or novel extensions to existing tools supporting runtime verification. The paper must include information on tool availability, maturity, selected experimental results and it should provide a link to a website containing the theoretical background and user guide. Furthermore, we strongly encourage authors to make their tools and benchmarks available with their submission. The Program Committee of RV 2017 will give a best paper award, and a selection of accepted regular papers will be invited to appear in a special issue of the Springer Journal on Formal Methods in System Design . Tutorial Submissions Tutorials are two-to-three-hour presentations on a selected topic. Additionally, tutorial presenters will be offered to publish a paper of up to 20 pages in the LNCS conference proceedings, not including references. A proposal for a tutorial must contain the subject of the tutorial, a proposed timeline, a note on previous similar tutorials (if applicable) and the differences to this incarnation, and a brief biography of the presenter. The proposal should not exceed 2 pages. Organization *General Chair* Klaus Havelund , NASA Jet Propulsion Laboratory, USA *Program Chairs* Shuvendu Lahiri , Microsoft Research, USA Giles Reger , University of Manchester, UK *Finance Chair* Oleg Sokolsky , University of Pennsylvania, USA *Publicity Chair* Ayoub Nour i, University of Grenoble Alpes, France *Local Organisation Chairs* Grigory Fedyukovich , University of Washington, USA Rahul Kumar , Microsoft Research, USA *Program Committee* Wolfgang Ahrendt , Chalmers Univ. of Technology/Univ. of Gothenburg, Sweden Cyrille Artho , KTH Royal Institute of Technology, Sweden Howard Barringer , The University of Manchester, UK Ezio Bartocci , Vienna University of Technology, Austria Andreas Bauer , KUKA Systems, Germany Saddek Bensalem , VERIMAG (University of Grenoble Alpes), France Eric Bodden , Fraunhofer SIT and Technische University Darmstadt, Germany Borzoo Bonakdarpour , McMaster University, Canada Christian Colombo , University of Malta, Malta Ylies Falcone , University of Grenoble Alpes, France Grigory Fedyukovich , University of Washington, USA Lu Feng , University of Virginia, USA Patrice Godefroid , Microsoft Research, USA Jean Goubault-Larrecq , CNRS & ENS de Cachan, France Alex Groce , Northern Arizona University, USA Radu Grosu , Vienna University of Technology, Austria Sylvain Hall? , University of Qu?bec at Chicoutimi, Canada Marieke Huisman , University of Twente, Netherlands Franjo Ivancic , Google Bengt Jonsson , Uppsala University, Sweden Felix Klaedtke , NEC Europe Ltd. Rahul Kumar , Microsoft Research, USA Kim Larsen , Aalborg University, Denmark Insup Lee , University of Pennsylvania, USA Axel Legay , Inria Rennes, France Martin Leucker , University of L?beck, Germany Ben Livshits , Microsoft Research, USA David Lo , Singapore Management University, Singapore Francesco Logozzo , Facebook Parthasarathy Madhusudan , University of Illinois at Urbana-Champaign, USA Leonardo Mariani , University of Milan Bicocca, Italy Madanlal Musuvathi , Microsoft Research Ayoub Nouri , University of Grenoble Alpes, France Gordon Pace , University of Malta, Malta Doron Peled , Bar Ilan University, Israel Grigore Rosu , University of Illinois at Urbana-Champaign, USA Veselin Raychev , ETH Zurich, Switzerland Cesar Sanchez , IMDEA Software Institute, Spain Gerardo Schneider, Chalmers Univ. of Technology/Univ. of Gothenburg, Sweden Rahul Sharma , Microsoft Research, USA Julien Signoles , CEA LIST, France Scott Smolka , Stony Brook University, USA Oleg Sokolsky , University of Pennsylvania, USA Bernhard Steffen , University of Dortmund, Germany Scott Stoller , Stony Brook University, USA Volker Stolz , University of Olso, Norway Frits Vaandrager , Radboud University, Netherlands Neil Walkinshaw , University of Leicester, UK Chao Wang , University of Southern California, USA Eugen Zalinescu , Technische Universitat M?nchen, Germany -------------- next part -------------- An HTML attachment was scrubbed... URL: From nipkow at in.tum.de Mon Feb 27 10:38:09 2017 From: nipkow at in.tum.de (Tobias Nipkow) Date: Mon, 27 Feb 2017 16:38:09 +0100 Subject: [TYPES/announce] Marktoberdorf Summer School: Call for Participation Message-ID: MARKTOBERDORF SUMMER SCHOOL Logical Methods for Safety and Security of Software Systems August 2-11 2017 https://asimod.in.tum.de/2017/ Apply online: https://asimod.in.tum.de/2017/participation.shtml Deadline: April 9 The "Marktoberdorf Summer School" is a 11 day summer school for young computer scientists and mathematicians. It provides in-depth presentations of state-of-the-art topics in "Logical Methods for Safety and Security of Software Systems". Lecturers and courses: CHRISTEL BAIER: Probabilistic Model Checking GILLES BARTHE: Relational Verification for Differential Privacy and Cryptography NICOLAJ BJ?RNER: Satisfiability Modulo Theories C?DRIC FOURNET: Security Verification in F* ORNA GRUMBERG: Program Repair JOOST-PIETER KATOEN: Foundations of Probabilistic Programming DANIEL KROENING: Static Analysers for Black Hats and White Hats ORNA KUPFERMANN: Automated Synthesis of Temporal-Logic Specifications MAGNUS MYREEN: Verification of an ML Compiler TOBIAS NIPKOW: Verified Analysis of Functional Data Structures LARRY PAULSON: Proof Support for Hybrid System Analysis ANDRE PLATZER: Dynamic Logic for Dynamical Systems We look forward to seeing you in Marktoberdorf in August! Orna Grumberg Tobias Nipkow -------------- next part -------------- A non-text attachment was scrubbed... Name: smime.p7s Type: application/pkcs7-signature Size: 5135 bytes Desc: S/MIME Cryptographic Signature URL: From arend.rensink at utwente.nl Mon Feb 27 06:00:56 2017 From: arend.rensink at utwente.nl (Arend Rensink) Date: Mon, 27 Feb 2017 12:00:56 +0100 Subject: [TYPES/announce] Maria Christakis wins the EAPLS Best Phd Dissertation Award 2015: Message-ID: <889c837f-c989-8369-a3ec-90e650a97895@utwente.nl> It is the great pleasure of the European Association for Programming Languages and Systems to announce the outcome of the EAPLS Best Dissertation Award 2015 (http://eapls.org/items/330/). This award is given to the PhD student who has made the most original and influential contribution to the area of Programming Languages and Systems, and has graduated in 2015 at a European academic institute. The purpose of the award is to draw attention to excellent work, to help the career of the student in question, and to promote the research field as a whole. The winner of the 2015 edition of the EAPLS Dissertation Award is Dr. Maria Christakis ETH Z?rich, Switzerland for her dissertation on Narrowing the gap between verification and systematic testing supervised by Peter M?ller. The winner was selected by a committee of international experts. Details on the procedure can be found at http://eapls.org/pages/phd_award/. The candidate theses were judged on originality, impact, relevance, and quality of writing. The jury concluded unanimously that Dr. Christakis' dissertation is an outstanding piece of work; it received the best marks amidst some very strong contenders. A summary of the jury's findings: + The thesis contains an effort in combining verification and testing, fields that seemed to be disjoint to date. + This thesis presents both novel theoretical and practical results on a high level. There are contributions that advance the state of the art both in testing and verification as well as a case study on a real piece of software. + Her contributions are significant and novel, the breadth is also "unusual" or "impressive", and she implemented and evaluated with industrial tools. + The results have been published in a series of internationally well-known conferences: FM, TACAS, ICSE, VMCAI, SEFM, RV, and SPIN. + The dissertation is very well written. We offer Dr. Christakis our heartfelt congratulations with her achievement. We are confident that it will be a sign of a long and distinguished scientific career. European Association for Programming Languages and Systems http://eapls.org From tarmo at cs.ioc.ee Tue Feb 28 15:51:44 2017 From: tarmo at cs.ioc.ee (Tarmo Uustalu) Date: Tue, 28 Feb 2017 22:51:44 +0200 Subject: [TYPES/announce] ETAPS 2017 early registration deadline approaching Message-ID: <20170228225144.050a2d88@cs.ioc.ee> Early registration deadline 12 March 2017! ****************************************************************** CALL FOR PARTICIPATION 20th European Joint Conferences on Theory And Practice of Software ETAPS 2017 Uppsala, Sweden, 22-29 April 2017 http://www.etaps.org/2017 ****************************************************************** -- ABOUT ETAPS -- ETAPS is the primary European forum for academic and industrial researchers working on topics relating to software science. ETAPS, established in 1998, is a confederation of five main annual conferences, accompanied by satellite workshops. ETAPS 2017 is the twentieth event in the series. -- MAIN CONFERENCES (24-28 April) -- * ESOP: European Symposium on Programming (PC chair Hongseok Yang, University of Oxford, UK) * FASE: Fundamental Approaches to Software Engineering (PC chairs Marieke Huisman, Universiteit Twente, The Netherlands, and Julia Rubin, University of British Columbia, Canada) * FoSSaCS: Foundations of Software Science and Computation Structures (PC chairs Javier Esparza, Technische Universit?t M?nchen, Germany, Andrzej Murawski, University of Warwick, UK) * POST: Principles of Security and Trust (PC chairs Matteo Maffei, Universit?t des Saarlandes, Germany, Mark D. Ryan, University of Birmingham, UK) * TACAS: Tools and Algorithms for the Construction and Analysis of Systems (PC chairs Axel Legay, INRIA Rennes, France, and Tiziana Margaria, LERO, Ireland) TACAS '17 hosts the 6th Competition on Software Verification (SV-COMP). -- INVITED SPEAKERS -- * Unifying speakers: Michael Ernst (University of Washington, USA) Kim G. Larsen (Aalborg University, DK) * FoSSaCS invited speaker: Joel Ouaknine (University of Oxford, UK) * TACAS invited speaker: Dino Distefano (Facebook and Queen Mary University of London, UK) -- UNIFYING PUBLIC LECTURE Serge Abiteboul (DI, INRIA Paris & ENS Cachan, France) -- INVITED TUTORIALS V?ronique Cortier (LORIA, CRNS, France) Kenneth McMillan (Microsoft Research Redmond, USA) -- CONTRIBUTED PAPERS, PROGRAMME -- See the accepted paper lists and conference programme at the conference website. -- SATELLITE EVENTS (22-23 April, 29 April) -- 16 satellite workshops and other events will take place before or after ETAPS 2017. DICE-FOPARA, GaLoP, GaM, SynCop-PV, VerifyThis (22-23 April) FESCA, SNR (22 April) HotSpot, QAPL, SannellaFest (23 April) BX, CREST, LiVe, MARS, PLACES, VPT (29 April) -- REGISTRATION -- Early registration is until Sunday, 12 March 2017 (23:59 GMT+1). http://www.etaps.org/2017/registration -- ACCOMMODATION -- The organizers have negotiated special rates from several hotels in Uppsala. To benefit from those, follow the instructions on the conference website. The offers expire on different dates. -- HOST CITY -- Uppsala city holds a rich history, having for long periods been the political, religious and academic centre of Sweden. Uppsala University is over 500 years old and ranked among the top 100 in the World and has hosted many great scientists over the years, for instance Carl von Linn?, Anders Celsius and Anders Jonas ?ngstr?m. The proximity to the capital of Sweden, Stockholm, provides additional benefits as a potential site for arranging both pre- and post congress tours, as well as for excursions or tourism. -- HOST INSTITUTION -- ETAPS 2017 is hosted by the Department of Information Technology, Uppsala University. -- ORGANIZERS Parosh Abdulla (General chair), Mohamed Faouzi Atig, Andreina Francisco, Kaj Lampka, Philipp R?mmer, Konstantinos Sagonas, Bj?rn Victor, Wang Yi, Tjark Weber, Yunyun Zhu From sinya at kurims.kyoto-u.ac.jp Tue Feb 28 23:44:13 2017 From: sinya at kurims.kyoto-u.ac.jp (Shinya Katsumata) Date: Wed, 1 Mar 2017 13:44:13 +0900 Subject: [TYPES/announce] Shonan school on "Semantics of Effects, Resources, and Applications" (May 2017) Message-ID: Call for Participants ---------------------------------------------------------------------------- Shonan school on "Semantics of Effects, Resources, and Applications" Shonan Village Center, Japan May 15-19, 2017 (your arrival would be requested the night before: May14th) *Registration Deadline: March 5th, 2017* Applicants will be able to attend the school after they are screened and approved by organizers. We will inform you of the results in early March via email. Thank you very much in advance for your understanding. ---------------------------------------------------------------------------- The School will be held at Shonan Village Center (SVC) in Japan during May 15-19, 2017. All participants are expected to arrive and check-in the night before the meeting starts (on Ma?14, 2017). The School is organized by two researchers: - Marco Gaboardi, University at Buffalo, SUNY, USA (gaboardi atmark buffalo.edu) - Shinya Katsumata, Kyoto University, Japan (sinya atmark kurims.kyoto-u.ac.jp) At the NII Shonan School, the internationally recognized scientists and researchers provide a series of advanced lectures on the state-of-the-art informatics research for students and young researchers. Each lecture also includes a short hand-on session for the participants to try tools and software used in the current research field. In addition to these valuable lectures, the participants of the NII Shonan School have an excellent opportunity to build up, enhance and widen international collaboration network among young researchers through the five-day dense program. NII Shonan Schools are managed by NII. The lectures are provided by six researchers: - Chung-Kil Hur, Korea Advanced Institute of Science and Technology, Korea - Deepak Garg, Max Planck Institute for Software Systems, Germany - Sam Lindley, The University of Edinburgh, Scotland - Paul-Andr?e Melli`es, University Paris Diderot, France - Ulrich Sch?opp, Ludwig-Maximilians-Universt?at M?unchen, Germany - Niki Vazou, University of California, San Diego, USA We would fully appreciate if you register for participation on the following web page: http://shonan.nii.ac.jp/seminar/registration-for-seminar-103/ Please enter the password: PA13Ca2nF Please be aware that the registration deadline is on *March 5th, 2017*. [Accommodation] About six weeks before the School, the SVC will send ID and Password to participants to the e-mail address you?ll have registered, so you can make a reservation for accommodation on the web page of SVC. The SVC offers a combination of facilities for conferences, training, and lodging in a resort-like setting. Its friendly and open environment promotes a culture of communication and exchange among participants. You?ll be able to see further details about travel and accommodation information on the following web page: http://www.nii.ac.jp/shonan Participants are expected to attend the full program and excursion staying at SVC throughout all school dates. [Participation fee] The participation fee including full board, meeting fees and applicable taxes is 12,500 JPY per day. *Participants need to share a twin room (two participants per room). *Excursion fee, around 5,000 JPY, is not included in the participation fee. *NII Shonan School will NOT support travel for any participants. We suggest you to bring your own personal computer at the School. [Visa] If you need a Visa to enter Japan, after confirming the necessary documents to the Embassy or the Consulate of Japan in your locating country, please ask us in an appropriate timing to issue the necessary documents prepared by us. "Seminar Details" is available in the following web page. http://shonan.nii.ac.jp/seminar/seminardetails103/ *Please put the password to see "Initial List of Invitees" P115hei7w " Please do not hesitate to contact us if you have any question. Best regards, -------------- next part -------------- An HTML attachment was scrubbed... URL: From laurie at tratt.net Mon Feb 27 03:58:49 2017 From: laurie at tratt.net (Laurence Tratt) Date: Mon, 27 Feb 2017 08:58:49 +0000 Subject: [TYPES/announce] Programming Language Implementation Summer School (PLISS) Message-ID: <20170227085849.vx64mo4p6baxpmmy@overdrive.tratt.net> ============================================================================ Programming Language Implementation Summer School (PLISS) May 20-27, 2017, Bertinoro Italy https://pliss2017.github.io/ ============================================================================ Programming languages are our interface to the myriad of computer systems we interact with on a daily basis. They allow us to craft complex sequences of operations at increasing high levels of abstraction. How are these languages designed? How are they implemented? How do we evaluate them? The First Programming Language Implementation Summer School (PLISS) will be held in Bertinoro, Italy from May 20 to 27, 2017. The Summer School's goal is to prepare early graduate students and advanced undergraduates for research in the field. This will be done through a combination of lectures on language implementation techniques and short talks exploring the state of the art in programming language research and practice. Lectures cover current research and future trends in programming language design and implementation, including: * Writing Just-in-time Compilers with LLVM * Performance Evaluation and Benchmarking * Designing a Commercial Actor Language * High-Performance Fully Concurrent Garbage Collection * Compiling Dynamic Languages * Language-support for Distributed Datastores The instructors are accomplished researchers and practitioners with extensive experience designing and engineering successful languages and tools. We gratefully acknowledge the support of our sponsors in allowing us to make travel grants and fellowships available to support students interested in attending PLISS. More details at https://pliss2017.github.io/ From kutsia at risc.jku.at Mon Feb 27 06:19:53 2017 From: kutsia at risc.jku.at (Temur Kutsia) Date: Mon, 27 Feb 2017 12:19:53 +0100 Subject: [TYPES/announce] CFP: Special Issue of the AMAI on the Formalization of Geometry, Automated and Interactive Geometric Reasoning Message-ID: <5324e3ba-f93e-6c96-bcb1-8cdf72f35a1e@risc.jku.at> Annals of Mathematics and Artificial Intelligence special issue on Formalization of Geometry, Automated and Interactive Geometric Reasoning Geometry is a privileged field of investigation for various domains of computer science from image processing to geometric modeling via artificial intelligence in education and automated proof in geometry or semantic indexation of multimedia databases and so on. This special issue of AMAI is devoted to formal computational aspects of geometry. Formalizing geometry can be investigated in several different ways. At the beginning of the 1960s, the seminal work of Gelernter in the domain of automated proof was about synthetic geometry as taught in school. Then, in the late 1970s, a kind of revolution occurred with the work of Wu consisting in translating geometry into algebra and in using pseudo-division to perform proofs of a high-level theorem in both Euclidean and hyperbolic geometries. Subsequently, much work has been done continuing that geometry/algebra relation by considering other aspects of geometry, like differential geometry, distance geometry, discovering geometric theorems in figures with dynamic geometry software or from graphical figures, etc. Moreover, several researchers studied the foundations of geometry through various set of axioms; this way, the classical axiomatic approaches of Hilbert and Tarski have been formalized, as well as computational origami or incidence geometry. Outside the domain of automated proof, formalization of geometry is also encountered almost everywhere in geometric modeling --for instance with geometric constraint solving, declarative modeling or topological modeling-- and also in computational geometry or combinatorial geometry. Call-for-Papers For this special issue of AMAI, we are seeking original contributions on various aspects of formalization of geometry having in view computational applications mainly oriented to proof but also to modeling in geometry. Relevant topics include (but are not limited to): * Polynomial algebra, invariant and coordinate-free methods, probabilistic, synthetic, and logical approaches, techniques for automated geometric reasoning from discrete mathematics, combinatorics, and numerics; * Symbolic and numeric methods for geometric computation, geometric constraint solving, automated generation/reasoning and manipulation with diagrams; * Design and implementation of geometry software, special-purpose tools, automated theorem provers, experimental studies; * Applications of formalization of geometry to mechanics, geometric modeling, CAGD/CAD, computer vision, robotics, and education. Important dates: September 1, 2017: paper submission via http://www.editorialmanager.com/amai/ selecting the issue: S688 Formalization of Geometry and Reasoning January 1, 2018: author notification March 1, 2018: revisions and camera-ready paper submission Guest Editors: Pascal Schreck , Tetsuo Ida , Laura Kovacs From Klaus.Havelund at jpl.nasa.gov Sun Feb 26 18:39:05 2017 From: Klaus.Havelund at jpl.nasa.gov (Havelund, Klaus (348B)) Date: Sun, 26 Feb 2017 23:39:05 +0000 Subject: [TYPES/announce] [fm-announcements] RV 2017 - 2nd Call for papers and tutorials Message-ID: RV 2017 Call for Papers and Tutorials The 17th International Conference on Runtime Verification September 13-16, Seattle, WA, USA http://rv2017.cs.manchester.ac.uk rv2017 at easychair.org Runtime verification is concerned with the monitoring and analysis of the runtime behaviour of software and hardware systems. Runtime verification techniques are crucial for system correctness, reliability, and robustness; they provide an additional level of rigor and effectiveness compared to conventional testing, and are generally more practical than exhaustive formal verification. Runtime verification can be used prior to deployment, for testing, verification, and debugging purposes, and after deployment for ensuring reliability, safety, and security and for providing fault containment and recovery as well as online system repair. Topics of interest to the conference include, but are not limited to: * specification languages * monitor construction techniques * program instrumentation * logging, recording, and replay * combination of static and dynamic analysis * specification mining and machine learning over runtime traces * monitoring techniques for concurrent and distributed systems * runtime checking of privacy and security policies * statistical model checking * metrics and statistical information gathering * program/system execution visualization * fault localization, containment, recovery and repair * integrated vehicle health management (IVHM) Application areas of runtime verification include cyber-physical systems, safety/mission-critical systems, enterprise and systems software, autonomous and reactive control systems, health management and diagnosis systems, and system security and privacy. We welcome contributions exploring the combination of runtime verification techniques with machine learning and static analysis. Whilst these are highlight topics, papers falling into these categories will not be treated differently from other contributions. An overview of previous RV conferences and earlier workshops can be found at: http://www.runtime-verification.org. RV 2017 will be held September 13-16 in Seattle, WA, USA. RV 2017 will feature a tutorial day (September 13), and three conference days (September 14-16). Important Dates Papers as well as tutorial proposals will follow the following timeline: * Abstract deadline: April 24, 2017 (Anywhere on Earth) * Paper and tutorial deadline: May 1, 2017 (Anywhere on Earth) * Tutorial notification: May 21, 2017 * Paper notification: June 26, 2017 * Camera-ready deadline: July 24, 2017 * Conference: September 13-16, 2017 Invited Speakers We are very pleased to confirm the following invited speakers for RV 2017: * Rodrigo Fonseca, Brown University, USA Vlad Levin and Jakob Lichtenberg, Microsoft Research, USA * Andreas Zeller, Saarland University, Germany General Information on Submissions All papers and tutorials will appear in the conference proceedings in an LNCS volume. Submitted papers and tutorials must use the LNCS/Springer style detailed here: http://www.springer.de/comp/lncs/authors.html Papers must be original work and not be submitted for publication elsewhere. Papers must be written in English and submitted electronically (in PDF format) using the EasyChair submission page here: https://easychair.org/conferences/?conf=rv17 The page limitations mentioned below include all text and figures, but exclude references. Additional details omitted due to space limitations may be included in a clearly marked appendix, that will be reviewed at the discretion of reviewers, but not included in the proceedings. At least one author of each accepted paper and tutorial must attend RV 2017 to present. Paper Submissions There are three categories of papers which can be submitted: regular, short or tool papers. Papers in each category will be reviewed by at least 3 members of the Program Committee. * Regular Papers (up to 15 pages, not including references) should present original unpublished results. We welcome theoretical papers, system papers, papers describing domain-specific variants of RV, and case studies on runtime verification. * Short Papers (up to 6 pages, not including references) may present novel but not necessarily thoroughly worked out ideas, for example emerging runtime verification techniques and applications, or techniques and applications that establish relationships between runtime verification and other domains. * Tool Demonstration Papers (up to 8 pages, not including references) should present a new tool, a new tool component, or novel extensions to existing tools supporting runtime verification. The paper must include information on tool availability, maturity, selected experimental results and it should provide a link to a website containing the theoretical background and user guide. Furthermore, we strongly encourage authors to make their tools and benchmarks available with their submission. The Program Committee of RV 2017 will give a best paper award, and a selection of accepted regular papers will be invited to appear in a special issue of the Springer Journal on Formal Methods in System Design. Tutorial Submissions Tutorials are two-to-three-hour presentations on a selected topic. Additionally, tutorial presenters will be offered to publish a paper of up to 20 pages in the LNCS conference proceedings, not including references. A proposal for a tutorial must contain the subject of the tutorial, a proposed timeline, a note on previous similar tutorials (if applicable) and the differences to this incarnation, and a brief biography of the presenter. The proposal should not exceed 2 pages. Organization General Chair Klaus Havelund, NASA Jet Propulsion Laboratory, USA Program Chairs Shuvendu Lahiri, Microsoft Research, USA Giles Reger, University of Manchester, UK Finance Chair Oleg Sokolsky, University of Pennsylvania, USA Publicity Chair Ayoub Nouri, University of Grenoble Alpes, France Local Organisation Chairs Grigory Fedyukovich, University of Washington, USA Rahul Kumar, Microsoft Research, USA Program Committee Wolfgang Ahrendt, Chalmers Univ. of Technology/Univ. of Gothenburg, Sweden Cyrille Artho, KTH Royal Institute of Technology, Sweden Howard Barringer, The University of Manchester, UK Ezio Bartocci, Vienna University of Technology, Austria Andreas Bauer, KUKA Systems, Germany Saddek Bensalem, VERIMAG (University of Grenoble Alpes), France Eric Bodden, Fraunhofer SIT and Technische University Darmstadt, Germany Borzoo Bonakdarpour, McMaster University, Canada Christian Colombo, University of Malta, Malta Ylies Falcone, University of Grenoble Alpes, France Grigory Fedyukovich, University of Washington, USA Lu Feng, University of Virginia, USA Patrice Godefroid, Microsoft Research, USA Jean Goubault-Larrecq, CNRS & ENS de Cachan, France Alex Groce, Northern Arizona University, USA Radu Grosu, Vienna University of Technology, Austria Sylvain Hall?, University of Qu?bec at Chicoutimi, Canada Marieke Huisman, University of Twente, Netherlands Franjo Ivancic, Google Bengt Jonsson, Uppsala University, Sweden Felix Klaedtke, NEC Europe Ltd. Rahul Kumar, Microsoft Research, USA Kim Larsen, Aalborg University, Denmark Insup Lee, University of Pennsylvania, USA Axel Legay, Inria Rennes, France Martin Leucker, University of L?beck, Germany Ben Livshits, Microsoft Research, USA David Lo, Singapore Management University, Singapore Francesco Logozzo, Facebook Parthasarathy Madhusudan, University of Illinois at Urbana-Champaign, USA Leonardo Mariani, University of Milan Bicocca, Italy Madanlal Musuvathi, Microsoft Research Ayoub Nouri, University of Grenoble Alpes, France Gordon Pace, University of Malta, Malta Doron Peled, Bar Ilan University, Israel Grigore Rosu, University of Illinois at Urbana-Champaign, USA Veselin Raychev, ETH Zurich, Switzerland Cesar Sanchez, IMDEA Software Institute, Spain Gerardo Schneider, Chalmers Univ. of Technology/Univ. of Gothenburg, Sweden Rahul Sharma, Microsoft Research, USA Julien Signoles, CEA LIST, France Scott Smolka, Stony Brook University, USA Oleg Sokolsky, University of Pennsylvania, USA Bernhard Steffen, University of Dortmund, Germany Scott Stoller, Stony Brook University, USA Volker Stolz, University of Olso, Norway Frits Vaandrager, Radboud University, Netherlands Neil Walkinshaw, University of Leicester, UK Chao Wang, University of Southern California, USA Eugen Zalinescu, Technische Universitat M?nchen, Germany -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- --- To opt-out from this mailing list, send an email to fm-announcements-request at lists.nasa.gov with the word 'unsubscribe' as subject or in the body. You can also make the request by contacting fm-announcements-owner at lists.nasa.gov From alcaraz at lcc.uma.es Tue Feb 28 02:25:36 2017 From: alcaraz at lcc.uma.es (Cristina Alcaraz) Date: Tue, 28 Feb 2017 08:25:36 +0100 Subject: [TYPES/announce] CFP: Twenty-second European Symposium on Research in Computer Security (ESORICS 2017) Message-ID: <8c70b214cbc656c44f1f1ed7787414e2@lcc.uma.es> ================================================================================ *** Apologies for multiple copies *** C a l l F o r P a p e r s Twenty-second European Symposium on Research in Computer Security (ESORICS 2017) Oslo, Norway -- September 11-15, 2017 WWW: https://www.ntnu.edu/web/esorics2017/ ================================================================================ Overview ------------------------------------ ESORICS is the annual European research event in Computer Security. The Symposium started in 1990 and has been held in several European countries, attracting a wide international audience from both the academic and industrial communities. Papers offering novel research contributions in computer security are solicited for submission to the Symposium. The primary focus is on original, high quality, unpublished research and implementation experiences. We encourage submissions of papers discussing industrial research and development. Important Dates ------------------------------------ * Paper submission deadline: April 19, 2017 * Notification to authors: June 16, 2016 * Camera ready due: July 26, 2016 Topics of Interest ------------------------------------ Topics of interest include, but are not limited to: * access control * accountability * ad hoc networks * anonymity * applied cryptography * authentication * biometrics * data and computation integrity * database security * data protection * digital content protection * digital forensics * distributed systems security * embedded systems security * inference control * information hiding * identity management * information flow control * information security governance and management * intrusion detection * formal security methods * language-based security * network security * phishing and spam prevention * privacy * privacy preserving data mining * risk analysis and management * secure electronic voting * security architectures * security economics * security metrics * security models * security and privacy for big data * security and privacy in cloud scenarios * security and privacy in complex systems * security and privacy in content centric networking * security and privacy in crowdsourcing * security and privacy in the IoT * security and privacy in location services * security and privacy for mobile code * security and privacy in pervasive / ubiquitous computing * security and privacy policies * security and privacy in social networks * security and privacy in web services * security and privacy in cyber-physical systems * security, privacy and resilience in critical infrastructures * security verification * software security * systems security * trust models and management * trustworthy user devices * usable security and privacy * web security * wireless security Paper Submission Guidelines ------------------------------------ Submissions must be made through EasyChair at: https://easychair.org/conferences/?conf=esorics2017 Submitted papers must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal or a conference/workshop with proceedings. The symposium proceedings will be published by Springer in the Lecture Notes in Computer Science series (LNCS). All submissions should follow the LNCS template from the time they are submitted. Submitted papers should be at most 16 pages (using 10-point font), excluding the bibliography and well-marked appendices, and at most 20 pages total. Committee members are not required to read the appendices, so the paper should be intelligible without them. All submissions must be written in English. Submissions are to be made to the Submission web site. Only pdf files will be accepted. Submissions not meeting these guidelines risk rejection without consideration of their merits. Authors of accepted papers must guarantee that their papers will be presented at the conference. Papers must be received by the aforementioned dates, 11:59 p.m. American Samoa time (UTC-11). Organisation Committee ------------------------------------ General Chairs: * Einar Snekkenes, Norwegian University of Science and Technology (NTNU), Norway. Organization Chair: * Laura Georg, Norwegian University of Science and Technology (NTNU), Norway. Workshop Chair: * Sokratis Katsikas, Norwegian University of Science and Technology (NTNU), Norway. Program Committee Chairs: * Dieter Gollman, Technische Universit?t Hamburg-Harburg, Germany * Simon Foley, IMT Atlantique, France Program Committee: Gail-Joon Ahn, Arizona State University, USA Alessandro Armando, University of Genoa, Italy Michael Backes, Saarland University, Germany Giampaolo Bella, Universit? degli studi di Catania, Italy Elisa Bertino, Purdue University, USA Carlo Blundo, Universit? degli studi di Salerno, Italy Rainer B?hme, University of Innsbruck, Austria Colin Boyd, Norwegian University of Science and Technology, Norway Stefan Brunthaler, SBA Research, Austria Tom Chothia, University of Birmingham, UK Sherman S. M. Chow, Chinese University of Hong Kong, Hong Kong Mauro Conti, University of Padua, Italy Cas Cremers, University of Oxford, UK Frederic Cuppens, IMT Atlantique, France Nora Cuppens-Boulahia, IMT Atlantique, France Mads Dam, KTH, Sweden Sabrina De Capitani di Vimercati, Universit? degli studi di Milano, Italy Herve Debar, Telecom SudParis, France Roberto Di Pietro, Nokia Bell Labs, France Josep Domingo-Ferrer, Universitat Rovira i Virgili, Spain Wenliang Du, Syracuse University, USA Pavlos Efraimidis, Democritus University of Thrace, Greece Hannes Federrath, University of Hamburg, Germany Simone Fischer-H?bner, Karlstad University, Sweden Riccardo Focardi, Universit? Ca? Foscari di Venezia, Italy Simon Foley, IMT Atlantique, France Sara Foresti, Universit? degli studi di Milano, Italy Katrin Franke, Norwegian University of Science and Technology, Norway Felix Freiling, Friedrich-Alexander-Universit?t Erlangen-N?rnberg, Germany Joaquin Garcia-Alfaro, Telecom ParisSud, France Dieter Gollmann, Hamburg University of Technology, Germany Dimitris Gritzalis, Athens University of Economics and Business, Greece Stefanos Gritzalis, University of the Aegean, Greece Joshua Guttman, Worcester Polytechnic Institute, USA Gerhard Hancke, City University of Hong Kong, China Marit Hansen, Unabh?ngiges Landeszentrum f?r Datenschutz Schleswig-Holstein, Germany Feng Hao, Newcastle University, UK Cormac Herley, Microsoft Research , USA Xinyi Huang, Fujian Normal University, China Michael Huth, Imperial College, UK Aaron D. Jaggard, U.S. Naval Research Laboratory, USA Sushil Jajodia, George Mason University, USA Limin Jia, Carnegie Mellon University, USA Wouter Joosen, KU Leuven, Belgium Vasilis Katos, Bournemouth University, UK Sokratis Katsikas, Norwegian University of Science and Technology, Norway Florian Kerschbaum, University of Waterloo, Canada Dogan Kesdogan, Universit?t Regensburg, Germany Kwangjo Kim, Korea Advanced Institute of Science and Technology, Korea Steve Kremer, INRIA Nancy-Grand Est, France Marina Krotofil, Honeywell, USA Ralf K?sters, University of Trier, Germany Junzuo Lai, Singapore Management University, Singapore Kwok-yan Lam, Nanyang Technological University, Singapore Costas Lambrinoudakis, University of Piraeus, Greece Peeter Laud, Cybernetica AS, Estonia Adam J. Lee, University of Pittsburgh, USA Gabriele Lenzini, University of Luxembourg, Luxembourg Yingjiu Li, Singapore Management University, Singapore Antonio Lioy, Politecnico di Torino, Italy Peng Liu, The Pennsylvania State University, USA Javier Lopez, University of Malaga, Spain Antonio Ma?a, University of Malaga, Spain Pratyusa K. Manadhata, Hewlett Packard Labs, USA Luigi V. Mancini, "Universita di Roma ""La Sapienza""", Italy Heiko Mantel, TU Darmstadt, Germany Olivier Markowitch, Universit? Libre de Bruxelles, Belgium Fabio Martinelli, IIT-CNR, Italy Sjouke Mauw, University of Luxembourg, Luxembourg Catherine Meadows, Naval Research Laboratory, USA John Mitchell, Stanford University, USA Aikaterini Mitrokotsa, Chalmers University of Technology, Sweden Refik Molva, EURECOM, France Charles Morisset, Newcastle University, UK Rolf Oppliger, eSECURITY Technologies, Switzerland Stefano Paraboschi, Universit? di Bergamo, Italy Dusko Pavlovic, University of Hawaii, USA G?nther Pernul, Universit?t Regensburg, Germany David Pichardie, ENS-IRISA, Rennes Frank Piessens , Katholieke Universiteit Leuven, Belgium Wolter Pieters, Delft University of Technology, The Netherlands Michalis Polychronakis, Stonybrook University, USA Christina P?pper, NYU Abu Dhabi, UAE Joachim Posegga, University of Passau, Germany Christian Probst, Technical University of Denmark, Denmark Kai Rannenberg, Goeth University, Germany Awais Rashid, Lancaster University, UK Indrajiti Ray, Colorado State University, USA Kui Ren, State University of New York at Buffalo, USA Mark Ryan, University of Birmingham, UK Peter Y.A. Ryan, University of Luxembourg, Luxembourg Rene Rydhof Hansen, Aarhus University, Denmark Andrei Sabelfeld, Chalmers University of Technology, Sweden Rei Safavi-Naini, University of Calgary, Canada Pierangela Samarati, Universit? degli studi di Milano, Italy Ravi Sandhu, University of Texas at San Antonio, USA Ralf Sasse, ETH Z?rich, Switzerland Nitesh Saxena, University of Alabama at Birmingham, USA Andreas Schaad, Huawei European Research Center, Germany Steve Schneider, University of Surrey, UK Basit Shafiq, Lahore University of Management Sciences, Pakistan Einar Snekkenes, Norwegian University of Science and Technology, Norway Willy Susilo, University of Wollongong, Australia Krzysztof Szczypiorski, Warsaw University of Technology, Poland Bj?rn Tackmann, IBM Research, Switzerland Qiang Tang, New Jersey Institute of Technology, USA Nils Ole Tippenhauer, Singapore University of Technology and Design, Singapore jaideep Tsochou, Ionion University, Greece Vijay Varadharajan, Macquarie University, Australia Luca Vigan?, King's College London, UK Michael Waidner, Fraunhofer SIT & TU Darmstadt, Germany Cong Wang, City University of Hong Kong, China Ben Smyth, Huawei, France Edgar Weippl, SBA Research, Austria Stephen Wolthusen, Royal Holloway university, UK Christos Xenakis, University of Piraeus, Greece Jeff Yan, Lancaster University, UK Meng Yu, University of Texas at San Antonio, USA Ben Zhao, University of California at Santa Barbara, USA Jianying Zhou, Institute for Infocomm Research, Singapore J?rg Schwenk, Ruhr-Universit?t, Bochum Publicity Chair * Cristina Alcaraz, University of Malaga, Spain From idramnesc at info.uvt.ro Tue Feb 28 04:54:58 2017 From: idramnesc at info.uvt.ro (Isabela Dramnesc) Date: Tue, 28 Feb 2017 11:54:58 +0200 Subject: [TYPES/announce] First CFP Synasc 2017, Timisoara, Romania Message-ID: First Call for Papers --------------------- SYNASC 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing September 21-24, 2017, Timisoara, Romania http://synasc.ro/2017 In honor of Professor Stefan Maruster?s 80th birthday, of Professor Bruno Buchberger?s 75th birthday and of Professor Tetsuo Ida?s 70th birthday Aim --- SYNASC aims to stimulate the interaction between the two scientific communities of symbolic and numeric computing and to exhibit interesting applications of the areas both in theory and in practice. The choice of the topic is motivated by the belief of the organizers that the dialogue between the two communities is very necessary for accelerating the progress in making the computer a truly intelligent aid for mathematicians and engineers. Important Dates --------------- 15 March 2017 : Proposals for workshops, special sessions, tutorials 15 April 2017 : Abstract submission 15 May 2017 : Paper submission 15 July 2017 : Notification of acceptance 01 September 2017 : Registration 01 September 2017 : Revised papers according to the reviews 21-24 September 2017 : Symposium 30 November 2017 : Final papers for post-proceedings Invited Speakers (list to be extended) ---------------- Bruno Buchberger, Johannes Kepler University, Austria Panagiota Fatourou, University of Crete Tetsuo Ida, University of Tsukuba, Japan Tracks ------ * Symbolic Computation + computer algebra + symbolic techniques applied to numerics + hybrid symbolic and numeric algorithms + numerics and symbolics for geometry + programming with constraints, narrowing * Numerical Computing + iterative approximation of fixed points + solving systems of nonlinear equations + numerical and symbolic algorithms for differential equations + numerical and symbolic algorithms for optimization + parallel algorithms for numerical computing + scientific visualization and image processing * Logic and Programming + automatic reasoning + formal system verification + formal verification and synthesis + software quality assessment + static analysis + timing analysis * Artificial Intelligence + intelligent systems for scientific computing + recommender and expert systems for scientific computing + scientific knowledge management + agent-based complex systems modeling and development + uncertain reasoning in scientific computing + computational intelligence + soft computing + machine learning + data mining, text mining and web mining + natural language processing + computer vision + intelligent hybrid systems * Distributed Computing + parallel and distributed algorithms for clouds, GPUs, HPC, P2P systems, autonomous systems. Work should focus on scheduling, scaling, load balancing, networks, fault-tolerance, gossip algorithms, energy saving + applications for parallel and distributed systems, including work on cross disciplinary (scientific) applications for grids/clouds, web applications, workflow platforms, network measurement tools, programming environments + architectures for parallel and distributed systems, including self-managing and autonomous systems, negotiation protocols, HPC on clouds, GPU processing, PaaS for (inter)cloud, brokering platforms, mobile computing + modelling of parallel and distributed systems including models on resources and networks, semantic representation, negotiation, social networks, trace management, simulators + any other topic deemed relevant to the field * Advances in the Theory of Computing + Data Structures and algorithms + Combinatorial Optimization + Formal languages and Combinatorics on Words + Graph-theoretic and Combinatorial methods in Computer Science + Algorithmic paradigms, including distributed, online, approximation, probabilistic, game-theoretic algorithms + Computational Complexity Theory, including structural complexity, boolean complexity, communication complexity, average-case complexity, derandomization and property testing + Logical approaches to complexity, including finite model theory + Algorithmic and computational learning theory + Aspects of computability theory, including computability in analysis and algorithmic information theory + Proof complexity + Computational social choice and game theory + New computational paradigms: CNN computing, quantum, holographic and other non-standard approaches to Computability + Randomized methods, random graphs, threshold phenomena and typical-case complexity + Automata theory and other formal models, particularly in relation to formal verification methods such as model checking and runtime verification + Applications of theory, including wireless and sensor networks, computational biology and computational economics + Experimental algorithmics This list is not intended to be exhaustive. Publication -------------- Research papers that are accepted and presented at the symposium will be collected as post-proceedings published by Conference Publishing Service (CPS) (included in IEEE Xplore) and will be submitted for indexing in ISI Web of Science, DBLP, SCOPUS. Extended versions of the selected papers published in post-proceedings will be considered to be published as special issues in international journals (e.g. Soft Computing Journal, Scalable Computing: Practice and Experience etc.) Honorary Chairs --------------- * Bruno Buchberger, Johannes Kepler University, Austria * Stefan Maruster, West University of Timisoara, Romania Steering Committee ------------------ * Tetsuo Ida, University of Tsukuba, Japan * Tudor Jebelean, Johannes Kepler University, Austria * Viorel Negru, West University of Timisoara, Romania * Dana Petcu, West University of Timisoara, Romania * Stephen Watt, University of Western Ontario, Canada * Daniela Zaharie, West University of Timisoara, Romania General Chairs ------------- * Viorel Negru, West University of Timisoara, Romania * Dana Petcu, West University of Timisoara, Romania Program Chairs ------------- * Tudor Jebelean, Johannes Kepler University, Austria * Daniela Zaharie, West University of Timisoara, Romania Track Chairs ------------ * Symbolic Computation + James Davenport, University of Bath, UK + Stephen Watt, University of Western Ontario, Canada + Manuel Kauers, Johannes Kepler University, Linz, Austria + Alin Bostan, INRIA, France * Numerical Computing + Stephen Takacs, Johannes Kepler University Linz, Austria + Eva Kaslik, West University of Timisoara, Romania * Logic and Programming + Nikolaj Bjorner, Microsoft Research, USA + Laura Kovacs, Chalmers University of Technology, Sweden * Artificial Intelligence + Andrei Petrovski, Robert Gordon University, UK + Daniela Zaharie, West University of Timisoara, Romania * Distributed Computing + Marc Frincu, West University of Timisoara, Romania + Karoly Bosa, Johannes Kepler University Linz, Austria * Advances in the Theory of Computing + Mircea Marin, West University of Timisoara, Romania + Gabriel Istrate, Institute e-Austria Timisoara, Romania Special sessions and workshops chair ------------------------------------ * Daniel Pop, West University of Timisoara, Romania Tutorial chair -------------- * Florin Fortis, West University of Timisoara, Romania Proceedings Chairs ------------------ * Tudor Jebelean, Johannes Kepler University, Austria * Daniela Zaharie, West University of Timisoara, Romania Local Committee Chairs ---------------------- * Isabela Dramnesc, West University of Timisoara, Romania * Silviu Panica, Institute e-Austria Timisoara, Romania * Monica Tirea, West University of Timisoara, Romania * Mihail Gaianu, West University of Timisoara, Romania Submission ----------- Submissions of research papers are invited. The papers must contain original research results not submitted and not published elsewhere. The submission process consists of two steps. * In the first step the authors are invited to express their intention to participate at the conference by registering the title and a tentative abstract (1/2 page, at maximum) of their paper. * In the second step the authors should submit the full paper. There are four categories of submissions: * Regular papers describing fully completed research results (up to 8 pages in the two-columns paper style). * System descriptions and experimental papers describing implementation results of experimental data, with a link to the reported results (up to 4 pages in the two-columns paper style). * Short papers, describing work in progress and/or preliminary results (up to 4 pages in the two-columns paper style). * Posters, describing ongoing work and research challenges of PhD students (up to 2 pages in the two-columns paper style). Both the abstract and the full paper should be submitted electronically through http://www.easychair.org/conferences/?conf=synasc2017. Special sessions, workshops and tutorials ---------------------------------------------------- Proposals are also invited for: * special sessions * satellite workshops * tutorials Special sessions ---------------- Proposals are invited for special sessions on any topic relevant to the conference. Special sessions are intended to stimulate in-depth discussions in special areas and they are fully integrated into the main conference. The research papers and the informal presentations submitted and accepted for the special sessions follow the same rules as the papers submitted to the regular sessions. It is expected that the organizers of the special sessions appoint their own chair and program committee, which will be integrated in the conference program committee and will be supervised by the conference program chair and by the general chair. Workshops --------- Proposals for satellite workshops are also invited. The satellite workshops should have topics related to SYNASC but the scientific program of each satellite workshop is managed by the workshop organizers. Authors contributing to a workshop would be required to register for the symposium. All papers accepted at workshops will be included in the local electronic pre-proceedings and the best presented papers will be included in the post proceedings published by Conference Publishing Services. Tutorials --------- Proposals for tutorials are also invited. Tutorials provide fundamental exposure to topics ranging from introductory through intermediate to advanced. The number and the duration of the tutorials will be decided by the tutorial chair under the supervision of the general chair. Depending on the number and the quality of the proposals for tutorials, they may be organized as a SYNASC Autumn School. ----------- SYNASC 2017 West University of Timisoara Department of Computer Science Bd. V. Parvan 4, 300223 Timisoara, Romania tel: + (40) 256 592195, +(40) 256 592389 fax: + (40) 256 592316, +(40) 256 592380 e-mail: synasc17 at synasc.ro -------------- next part -------------- An HTML attachment was scrubbed... URL: From inge.van.halst at informatics-europe.org Tue Feb 28 05:35:27 2017 From: inge.van.halst at informatics-europe.org (Inge van Halst) Date: Tue, 28 Feb 2017 11:35:27 +0100 Subject: [TYPES/announce] Call for Nominations - 2017 Minerva Informatics Equality Award Message-ID: ********************************************************************* *Minerva Informatics Equality Award ** *2017 Edition* *"Supporting the transition of female PhD and postdoctoral researchers into faculty positions"* *Presented by Informatics Europe* *Sponsored by Google* *Call for Nominations Now Open * *********************************************************************** Informatics Europe proudly announces the second Minerva Informatics Equality Award devoted to initiatives which seek to encourage and support the careers of women in Informatics research and education. The second of this annual award will be presented in October 2017 and is sponsored by Google. The Informatics Europe Minerva Informatics Equality Award recognizes best practices in Departments or Faculties of European universities or research labs that have been demonstrated to have a positive impact for women. On a three-year cycle the award will focus each year on a different stage of the career pipeline: * Developing the careers of female faculty, including retention and promotion; * Supporting the transition of female PhD and postdoctoral researchers into faculty positions; * Encouraging female students to enroll in Computer Science/Informatics programmes and retaining them. **The 2017 Award is devoted to initiatives supporting the transition of female PhD and postdoctoral researchers into faculty positions.** The Award seeks to celebrate successful initiatives that have had a measurable impact on the careers of women within the institution. Such initiatives can serve as exemplars of best practices within the community, with the potential to be widely adopted by other institutions. Nominations will need to demonstrate the impact that has been achieved. *For 2017 examples of impact could include an improved career development and better agreements on career planning for female PhD students and postdocs as recorded in objective surveys of staff experience, and increasing numbers of female faculty.* *The Award carries a prize of EUR 5,000* The Award will be given to a Department or Faculty to be used for further work on supporting the transition of female PhD or post-docs to faculty positions. To be eligible, nominated institutions must be located in one of the member or candidate member countries of the Council of Europe, or Israel. Institutions associated with members of the Informatics Europe Board and of the Award panel are not eligible. The Award panel will review and evaluate each proposal. It reserves the right to split the prize between at most two different proposals. Moreover, noteworthy runners up may also be included as exemplars of best practice in future Informatics Europe publications. *Proposals should be submitted only at:* https://easychair.org/conferences/?conf=miea2017 *The proposal should include:* * Contact information for the Head of the nominated Department or Faculty and the nominator (who can be the same); * A brief summary or abstract (100 words or less) which can be made public. * Description of the initiative (max 2 pages); * Evidence of its impact (max 2 pages); * An optional reference list (which may include URLs of supporting material); * Optionally, one or two letters of support. The letters of support may come, for example, from female staff members who have benefited from the scheme. *Deadlines:* * Full nominations: June 1, 2017 * Notification of winner(s): August 1, 2017 The Award will be presented at the 13th European Computer Science Summit , in Lisbon, October 23-25, 2017, where a representative of the winning institution(s) will be invited to give a talk on their achievements. *Award Panel:* * Christine Choppy, Professor of Informatics, University Paris 13 (SPC), France (Chair) * Serge Abiteboul, Senior Researcher, Inria, France (co-chair Comit? Parit?-?galit?) * Tibor Bosse, Associate Professor of Informatics, VU University Amsterdam, Netherlands (Gender Equality Officer) * Gy?ngyi Bujdos?, Professor of Informatics, University Debrecen, Hungary * Monica Divitini, Professor in Cooperation Technologies, IDI-NTNU, Norway * Anna Ing?lfsd?ttir, Professor of Informatics, University Reykjavik, Iceland * Mema Roussopoulos, Associate Professor of Computer Science, University of Athens, Greece * Letizia Tanca, Professor of Computer Science and Engineering, Politecnico di Milano, Milan, Italy *Further inquiries:* minerva-award at informatics-europe.org From splash.publicity at gmail.com Wed Mar 1 20:39:16 2017 From: splash.publicity at gmail.com (SPLASH Publicity) Date: Wed, 1 Mar 2017 17:39:16 -0800 Subject: [TYPES/announce] SPLASH 2017: 1st Combined Call for Contributions Message-ID: ACM SIGPLAN SPLASH 2017 October 22-27, 2017 Vancouver, Canada http://2017.splashcon.org The ACM SIGPLAN Conference on Systems, Programming, Languages and Applications: Software for Humanity (SPLASH) embraces all aspects of software construction, to make it the premier conference at the intersection of programming, languages, and software engineering. We invite high quality submissions describing original and unpublished work. Combined Call for Contributions: * SPLASH Workshops * OOPSLA * Onward! Papers * Onward! Essays * Dynamic Languages Symposium (DLS) * Generative Programming: Concepts & Experiences (GPCE) * Software Language Engineering (SLE) * SPLASH-E * Posters * Doctoral Symposium * Student Research Competition ## SPLASH Workshops Following its long-standing tradition, SPLASH 2017 will host a variety of high-quality workshops, allowing their participants to meet and discuss research questions with peers, to mature new and exciting ideas, and to build up communities and start new collaborations. SPLASH workshops complement the main tracks of the conference and provide meetings in a smaller and more specialized setting. Workshops cultivate new ideas and concepts for the future, optionally recorded in formal proceedings. Late phase submissions due: Fri March 3, 2017 http://2017.splashcon.org/track/splash-2017-Workshops ## OOPSLA Papers may target any stage of software development, including requirements, modeling, prototyping, design, implementation, generation, analysis, verification, testing, evaluation, maintenance, and reuse of software systems. Contributions may include the development of new tools (such as language front-ends, program analyses, and runtime systems), new techniques (such as methodologies, design processes, and code organization approaches), new principles (such as formalisms, proofs, models, and paradigms), and new evaluations (such as experiments, corpora analyses, user studies, and surveys). Abstracts due: Thu April 13, 2017 Submissions due: Mon April 17, 2017 http://2017.splashcon.org/track/splash-2017-OOPSLA ## Onward! Papers Onward! is a premier multidisciplinary conference focused on everything to do with programming and software: including processes, methods, languages, communities, and applications. Onward! is more radical, more visionary, and more open than other conferences to ideas that are well-argued but not yet proven. We welcome different ways of thinking about, approaching, and reporting on programming language and software engineering research. Submissions due: Fri April 21, 2017 http://2017.splashcon.org/track/onward-2017/onward-2017-Onward-Papers ## Onward! Essays Onward! Essays is looking for clear and compelling pieces of writing about topics important to the software community. An essay can be an exploration of a topic, its impact, or the circumstances of its creation; it can present a personal view of what is, explore a terrain, or lead the reader in an act of discovery; it can be a philosophical digression or a deep analysis. It can describe a personal journey, perhaps that by which the author reached an understanding of such a topic. The subject area should be interpreted broadly and can include the relationship of software to human endeavors, or its philosophical, sociological, psychological, historical, or anthropological underpinnings. Submissions due: Fri April 21, 2017 http://2017.splashcon.org/track/onward-2017/onward-2017-essays-2017 ## Dynamic Languages Symposium (DLS) >From Lisp, Snobol, and Smalltalk to Python, Racket, and Javascript, Dynamic Languages have been playing a fundamental role both in programming research and practice. DLS is the premier forum for researchers and practitioners to share research and experience on all aspects on Dynamic Languages. DLS invites high quality papers reporting original research and experience related to the design, implementation, and applications of dynamic languages. Abstracts due: Fri May 26, 2017 Submissions due: Fri June 2, 2017 http://www.dynamic-languages-symposium.org/dls-17/index.html ## Generative Programming: Concepts & Experiences (GPCE) The International Conference on Generative Programming: Concepts & Experience (GPCE) is a venue for researchers and practitioners interested in techniques and tools for code generation, language implementation, and product-line development. GPCE seeks conceptual, theoretical, empirical, and technical contributions to its topics of interest, which include but are not limited to (i) program transformation, staging, macro systems, preprocessors, program synthesis, and code-recommendation systems, (ii) domain-specific languages, language embedding, language design, and language workbenches, (iii) feature-oriented programming, domain engineering, and feature interactions, (iv) applications and properties of code generation, language implementation, and product-line development. Abstracts due: Sun June 25, 2017 Submissions due: Sun July 2, 2017 http://2017.splashcon.org/track/gpce-2017/gpce-2017-GPCE-2017 ## Software Language Engineering (SLE) Software Language Engineering (SLE) is the application of systematic, disciplined, and measurable approaches to the development, use, deployment, and maintenance of software languages. The term ?software language? is used broadly, and includes: general-purpose programming languages; domain-specific languages (e.g. BPMN, Simulink, Modelica); modeling and metamodeling languages (e.g. SysML and UML); data models and ontologies (e.g. XML-based and OWL-based languages and vocabularies). SLE solicits high-quality contributions in areas ranging from theoretical and conceptual contributions to tools, techniques, and frameworks in the domain of language engineering. Abstracts due: Fri June 2, 2017 Submissions due: Fri June 9, 2017 http://2017.splashcon.org/track/sle-2017/sle-2017-papers ## SPLASH-E SPLASH-E is a new (started in 2013) forum for software and languages (SE/PL) researchers with activities and interests around computing education. Some build pedagogically-oriented languages or tools; some think about pedagogic challenges around SE/PL courses; some bring computing to non-CS communities; some pursue human studies and educational research. At SPLASH-E, we share our educational ideas and challenges centered in software/languages, as well as our best ideas for advancing such work. Unlike general conferences on computing education, SPLASH-E strives to bring together researchers and those with educational interests that arise from software ideas or concerns. Submissions due: Thu June 29, 2017 http://2017.splashcon.org/track/splash-2017-SPLASH-E ## Posters The SPLASH Poster track provides an excellent forum for authors to present their recent or ongoing projects in an interactive setting, and receive feedback from the community. We invite submissions covering any aspect of programming, systems, languages and applications. The goal of the poster session is to encourage and facilitate small groups of individuals interested in a technical area to gather and interact. It is held early in the conference, to promote continued discussion among interested parties. Submissions due: Sat July 15, 2017 http://2017.splashcon.org/track/splash-2017-Posters ## Doctoral Symposium The SPLASH Doctoral Symposium provides students with useful guidance for completing their dissertation research and beginning their research careers. The symposium will provide an interactive forum for doctoral students who have progressed far enough in their research to have a structured proposal, but will not be defending their dissertation in the next 12 months. Submissions due: Fri June 30, 2017 http://2017.splashcon.org/track/splash-2017-Doctoral-Symposium ## Student Research Competition The ACM Student Research Competition (SRC), sponsored by Microsoft Research, offers a unique forum for ACM student members at the undergraduate and graduate levels to present their original research at SPLASH before a panel of judges and conference attendees. The SRC gives visibility to not only up-and-coming young researchers, but also exposes them to the field of computer science research and its community. This competition also gives students an opportunity to discuss their research with experts in their field, get feedback, and to help them sharpen their communication and networking skills. Submissions due: Mon July 17, 2017 http://2017.splashcon.org/track/splash-2017-Student-Research-Competition ## Information Contact: publicity at splashcon.org Website: http://2017.splashcon.org Location: Hyatt Regency Vancouver Vancouver, Canada ## Organization SPLASH General Chair: * Gail Murphy (University of British Columbia) OOPSLA Program Chair: * Jonathan Aldrich (Carnegie Mellon University) Onward! Papers Chair: * Emina Torlak (University of Washington) Onward! Essays Chair: * Robert Biddle (Carleton University) DLS Program Chair: * Davide Anaconde (University of Genova) GPCE General Chair: * Matthew Flatt (University of Utah) GPCE Program Chair: * Sebastian Erdweg (TU Delft) SLE General Chair: * Benoit Combemale (University of Rennes 1) SLE Program Co-Chairs: * Marjan Mernik (University of Maribor) * Bernhard Rumpe (RWTH Aachen University) SPLASH-E Chair: * Joe Gibbs Politz (University of California, San Diego) SPLASH-I Co-Chairs: * Karim Ali (University of Alberta) * Avik Chaudhuri (Facebook) Workshops Co-Chairs: * Craig Anslow (Middlesex University) * Alex Potanin (Victoria University of Wellington) OOPLSA Artifact Evaluation Co-Chairs: * Michael Bond (Ohio State University) * Sam Tobin-Hochstadt (Indiana University) Posters Co-Chairs: * Jonathan Bell (George Mason University) * Patrick Lam (University of Waterloo) Doctoral Symposium Chair: * Elisa Gonzalez Boix (Vrije Universiteit Brussel) Programming Languages Mentoring Workshop Co-Chairs: * Lori Pollock (University of Delaware) * Barbara Ryder (Virginia Tech) Student Research Competition Co-Chairs: * Shan Shan Huang (LogicBlox) * Jennifer Sartor (Vrije Universiteit Brussel) Student Volunteers Co-Chairs: * Daco Harkes (TU Delft) * Giovanni Viviani (University of British Columbia) Publications Chair: * Alex Potanin (Victoria University of Wellington) * Tijs van der Storm (CWI & University of Groningen) Sponsorships Co-Chairs: * Tony Hosking (Australian National University, Data61, Purdue University) * Jurgen Vinju (CWI & TU Eindhoven) Video Co-Chairs: * David Darais (University of Maryland) * Michael Hilton (Oregon State University) Web and Publicity Co-Chairs: * Ronald Garcia (University of British Columbia) * Eric Walkingshaw (Oregon State University) From sinya at kurims.kyoto-u.ac.jp Wed Mar 1 23:13:43 2017 From: sinya at kurims.kyoto-u.ac.jp (sinya at kurims.kyoto-u.ac.jp) Date: Thu, 2 Mar 2017 13:13:43 +0900 (JST) Subject: [TYPES/announce] Shonan school on "Semantics of Effects, Resources, and Applications" (May 2017) Message-ID: <51606.130.54.16.90.1488428023.risu@tinu.kurims.kyoto-u.ac.jp> Call for Participants ---------------------------------------------------------------------------- Shonan school on "Semantics of Effects, Resources, and Applications" Shonan Village Center, Japan May 15-19, 2017 (your arrival would be requested the night before: May14th) Registration Deadline: *March 5th, 2017* Applicants will be able to attend the school after they are screened and approved by organizers. We will inform you of the results in early March via email. Thank you very much in advance for your understanding. ---------------------------------------------------------------------------- The School will be held at Shonan Village Center (SVC) in Japan during May 15-19, 2017. All participants are expected to arrive and check-in the night before the meeting starts (on Ma?14, 2017). The School is organized by two researchers: - Marco Gaboardi, University at Buffalo, SUNY, USA (gaboardi atmark buffalo.edu) - Shinya Katsumata, Kyoto University, Japan (sinya atmark kurims.kyoto-u.ac.jp) At the NII Shonan School, the internationally recognized scientists and researchers provide a series of advanced lectures on the state-of-the-art informatics research for students and young researchers. Each lecture also includes a short hand-on session for the participants to try tools and software used in the current research field. In addition to these valuable lectures, the participants of the NII Shonan School have an excellent opportunity to build up, enhance and widen international collaboration network among young researchers through the five-day dense program. NII Shonan Schools are managed by NII. The lectures are provided by six researchers: - Chung-Kil Hur, Korea Advanced Institute of Science and Technology, Korea - Deepak Garg, Max Planck Institute for Software Systems, Germany - Sam Lindley, The University of Edinburgh, Scotland - Paul-Andr?e Melli`es, University Paris Diderot, France - Ulrich Sch?opp, Ludwig-Maximilians-Universt?at M?unchen, Germany - Niki Vazou, University of California, San Diego, USA We would fully appreciate if you register for participation on the following web page: http://shonan.nii.ac.jp/seminar/registration-for-seminar-103/ Please enter the password: PA13Ca2nF Please be aware that the registration deadline is on *March 5th, 2017*. [Accommodation] About six weeks before the School, the SVC will send ID and Password to participants to the e-mail address you?ll have registered, so you can make a reservation for accommodation on the web page of SVC. The SVC offers a combination of facilities for conferences, training, and lodging in a resort-like setting. Its friendly and open environment promotes a culture of communication and exchange among participants. You?ll be able to see further details about travel and accommodation information on the following web page: http://www.nii.ac.jp/shonan Participants are expected to attend the full program and excursion staying at SVC throughout all school dates. [Participation fee] The participation fee including full board, meeting fees and applicable taxes is 12,500 JPY per day. *Participants need to share a twin room (two participants per room). *Excursion fee, around 5,000 JPY, is not included in the participation fee. *NII Shonan School will NOT support travel for any participants. We suggest you to bring your own personal computer at the School. [Visa] If you need a Visa to enter Japan, after confirming the necessary documents to the Embassy or the Consulate of Japan in your locating country, please ask us in an appropriate timing to issue the necessary documents prepared by us. "Seminar Details" is available in the following web page. http://shonan.nii.ac.jp/seminar/seminardetails103/ *Please put the password to see "Initial List of Invitees" P115hei7w " Please do not hesitate to contact us if you have any question. Best regards, From elaine at mat.ufmg.br Wed Mar 1 09:16:48 2017 From: elaine at mat.ufmg.br (Elaine Pimentel) Date: Wed, 1 Mar 2017 11:16:48 -0300 Subject: [TYPES/announce] IMLA 2017 Deadline Extension Message-ID: Deadline Extension: 29th March, 2017 [Apologies if you receive multiple copies] --- Call for Papers --- 7th Workshop on Intuitionistic Modal Logic and Applications https://sites.google.com/site/imla2017toulouse/ Affiliated with the 29th European Summer School in Logic, Language, and Information (ESSLLI2017), University of Toulouse (France), 17-28 July, 2017 Constructive modal logics and type theories are of increasing foundational and practical relevance in computer science. Applications of constructive modal logics in type disciplines for programming languages, meta-logics for reasoning about a variety of computational phenomena and explanatory frameworks in philosophical logic are everywhere. The workshop aims at developing and explaining theoretical and methodological issues around the question of how the proof-theoretic strengths of constructive logics can best be combined with the model-theoretic strengths of modal logics. Practical issues center around the question of which modal connectives with associated laws or proof rules capture computational phenomena accurately and at the right level of abstraction. In its seventh edition, the Workshop on Intuitionistic Modal Logic and Applications will take place in Toulouse France, in conjunction with the 29th ESSLLI . Topics of interest to this forum include, but are not limited to: * Modal Logics * Logical frameworks * Proof theory * Type theory * Automated deduction * Formal semantics of languages and systems * Applications IMLA 2017 also aims to be a forum for presenting and discussing work in progress, and therefore to provide feedback to authors on their preliminary research. *Submissions* Contributions should be written in English and submitted in the form of full papers (with a maximum of 12 pages) or short papers (with a maximum of 6 pages). They must be unpublished and not submitted simultaneously for publication elsewhere. The papers should be prepared in latex using EPTCS style. The submission should be in the form of a PDF file uploaded to IMLA 2017 page at Easychair https://www.easychair.org/conferences/?conf=imla2017 until the submission deadline in March 29th, 2017, anywhere on Earth. At least one of the authors should register for the conference. The paper presentation should be in English. *Important Dates* Paper submission deadline: March 29th, 2017 Author notification: April 15th, 2017 Contribution for Proceedings: 15 May 2017 Final program [and Proceedings]: 1 June 2017 *Scientific and Organizing Committee* * Sergei Artemov, (CUNY, USA) co-chair * Valeria de Paiva (Nuance Comms, USA) co-chair * Mario Benevides (COPPE-IM, Rio, BR) * Elaine Pimentel (DMAT, UFRN, BR) * Natasha Alechina (Computer Science, University of Nottingham, UK) * Rosalie Iemhoff (Utrecht University, The Netherlands) * Tudor Protopopescu (Higher School of Economics Moscow, RU) * Giuseppe Primiero (Middlesex University London, UK) -- Elaine. ------------------------------------------------- Elaine Pimentel - DMAT/UFRN Address: Departamento de Matem?tica Universidade Federal do Rio Grande do Norte Campus Universit?rio - Av. Senador Salgado Filho, s/n? Lagoa Nova, CEP: 59.078-970 - Natal - RN Phone: +55 84 3215-3820 <(84)%203215-3820> http://sites.google.com/site/elainepimentel/ Lattes: http://lattes.cnpq.br/3298246411086415 -------------------------------------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: From dilian at csc.kth.se Thu Mar 2 09:37:01 2017 From: dilian at csc.kth.se (Dilian Gurov) Date: Thu, 2 Mar 2017 15:37:01 +0100 Subject: [TYPES/announce] CSL 2017: Final Call For Papers In-Reply-To: <25d1cb16-8773-7f01-7f70-0ac8ba989600@csc.kth.se> References: <25d1cb16-8773-7f01-7f70-0ac8ba989600@csc.kth.se> Message-ID: <26dcef7b-14f9-f6cb-663c-08bff0e823a0@csc.kth.se> ================================================================= FINAL CALL FOR PAPERS 26th EACSL Annual Conference on Computer Science Logic (CSL 2017) August 20-24, 2017, Stockholm, Sweden https://www.csl17.conf.kth.se ================================================================= AIM AND SCOPE Computer Science Logic (CSL) is the annual conference of the European Association for Computer Science Logic (EACSL). It is an interdisciplinary conference, spanning across both basic and application oriented research in mathematical logic and computer science and is intended for computer scientists whose research involves logic, as well as for logicians working on issues essential for computer science. CSL 2017 is the 26th EACSL annual conference. It will be co-organised by Stockholm University and KTH Royal Institute of Technology, and hosted by Stockholm University. CSL 2017 will be co-located with, and immediately preceded by, the Logic Colloquium 2017 (LC 2017). There will be a joint session of CSL 2017 and LC 2017 in the morning of August 20, as well as CSL-affiliated workshops during August 25-26. IMPORTANT DATES: --------------------------------------------------------------- Abstract submission for contributed papers: March 24, 2017 Paper submission: March 31, 2017 Notification: May 31, 2017 Abstract submission for short presentations: June 4, 2017 Notification on short presentations: June 14, 2017 --------------------------------------------------------------- TOPICS OF INTEREST for CSL 2017 include (but are not limited to): ----------------------------------------------------------------- ? automata and games, game semantics ? automated deduction and interactive theorem proving ? bounded arithmetic and propositional proof complexity ? categorical logic and topological semantics ? computational proof theory ? constructive mathematics and type theory ? decision procedures ? domain theory ? equational logic and rewriting ? finite model theory ? higher-order logic ? lambda calculus and combinatory logic ? linear logic and other substructural logics ? logic programming and constraints ? logical aspects of computational complexity ? logical aspects of quantum computing ? logic in database theory ? logical foundations of programming paradigms ? logical foundations of cryptography and information hiding ? logics for multi-agent systems ? modal and temporal logic ? model checking and logic-based verification ? nonmonotonic reasoning ? SAT solving and automated induction ? satisfiability modulo theories ? specification, extraction and transformation of programs ? verification and program analysis ----------------------------------------------------------------- INVITED SPEAKERS ----------------------------------------------------------------- CSL invited highlight speakers for the LC-CSL joint session on August 20: ? Phokion Kolaitis, University of California Santa Cruz and IBM Research - Almaden ? Wolfgang Thomas, RWTH Aachen CSL plenary speakers: ? Laura Kov?cs, Vienna University of Technology ? Stephan Kreutzer, Technische Universit?t Berlin ? Meena Mahajan, Institute of Mathematical Sciences, Chennai ? Margus Veanes, Microsoft Research ----------------------------------------------------------------- SPECIAL AND AFFILIATED EVENTS ----------------------------- In addition to the plenary and contributed talks CSL 2017, the conference will also include the following events: ? Joint session of CSL 2017 and LC 2017 in the morning of August 20, consisting of four plenary highlight talks, offered by speakers from both conferences. ? Presentation of the Alonzo Church award for Outstanding Contributions to Logic and Computation, ? Presentation of the EACSL Ackermann award for Outstanding Dissertation on Logic in Computer Science, ? CSL-affiliated workshops, to be held as CSL co-located events: ? Workshop on Logical Aspects of Multi-Agent Systems LAMAS 2017 (August 25) ? Workshop on Logic and Automata Theory (in memory of Zoltan Ezik) (August 25) ? Workshop on Logic and Algorithms in Computational Linguistics LACompLing'17 (August 18-19) SUBMISSIONS ----------- The CSL 2017 conference proceedings will be published in Leibniz International Proceedings in Informatics (LIPIcs). Authors are invited to submit contributed papers of no more than 15 pages in LIPIcs style (including references), presenting not previously published work, fitting the scope of the conference. The submission of contributed papers will be in two stages: * abstracts, due by March 24, 2017 (AoE); * full papers, due by March 31, 2017 (AoE). The submissions must be done via the EasyChair page for the conference: https://easychair.org/conferences/?conf=CSL 2017. Submitted papers must be in English and must provide sufficient detail to allow the Programme Committee to assess the merits of the paper. Full proofs may appear in a clearly marked technical appendix which will be read at the reviewers' discretion. Authors are strongly encouraged to include a well written introduction which is directed at all members of the PC. Papers may not be submitted concurrently to another conference with refereed proceedings. The PC chairs should be informed of closely related work submitted to a conference or a journal. Papers authored or co-authored by members of the PC are not allowed. In addition, there will be an opportunity for short oral presentations at the conference. Abstracts for such oral presentations must be submitted through the Easychair submission webpage, under the category ``short presentations'', by June 4, 2017. They will not be included in the proceedings. PROGRAMME COMMITTEE ------------------- ? Parosh Aziz Abdulla (University of Uppsala), ? Lars Birkedal (University of Aarhus), ? Nikolaj Bjorner (Microsoft Research), ? Maria Paola Bonacina (Universit? degli Studi di Verona), ? Patricia Bouyer-Decitre (LSV, ENS Cachan), ? Agata Ciabattoni (University of Viena), ? Thierry Coquand (University of Gothenburg), ? Mads Dam (KTH, Stockholm), PC co-chair ? Ugo Dal Lago (University of Bologna), ? Anuj Dawar (Cambridge University), ? Valentin Goranko (Stockholm University), PC co-chair ? Maribel Fernandez (King's College London), ? Martin Grohe (RWTH Aachen), ? Lauri Hella (University of Tampere), ? Joost-Pieter Katoen (RWTH Aachen), ? Orna Kupferman (University of Jerusalem), ? Leonid Libkin (University of Edinburgh), ? Angelo Montanari (University of Udine), ? Catuscia Palamidessi (Paris, INRIA), ? Frank Pfenning (Carnegie Mellon University, Pittsburgh) ? Ram Ramanujam (Institute of Mathematical Sciences, Chennai), ? Jean-Francois Raskin (University of Bruxelles), ? Thomas Schwentick (TU Dortmund University), ? Viorica Sofronie-Stokkermans (University of Koblenz-Landau), ? Thomas Streicher (University of Darmstadt), ? Jean-Marc Talbot (University of Aix-Marseille), ? Luca Vigan? (King's College London), ? Ron van der Meyden (UNSW Australia), ? Lijun Zhang (Chinese Academy of Sciences, Beijing). ORGANISING COMMITTEE -------------------- ? Mads Dam (OC co-chair), Department of Theoretical Computer Science, KTH ? Valentin Goranko (OC co-chair), Department of Philosophy, Stockholm University ? Dilian Gurov (Workshops chair), Department of Theoretical Computer Science, KTH ? Roussanka Loukanova, Department of Mathematics, Stockholm University ? Peter LeFanu Lumsdaine, Department of Mathematics, Stockholm University ? Anders Lundstedt, Department of Philosophy, Stockholm University ? Erik Palmgren (OC co-chair), Department of Mathematics, Stockholm University ? Henning Strandin, Department of Philosophy, Stockholm University CONTACTS AND ENQUIRIES ---------------------- With enquiries on organising matters, send email to: CSL 2017philosophy.su.se With enquiries on scientific and programme issues, send email to: CSL 2017easychair.org From comar at cs.cmu.edu Thu Mar 2 13:13:37 2017 From: comar at cs.cmu.edu (Cyrus Omar) Date: Thu, 02 Mar 2017 18:13:37 +0000 Subject: [TYPES/announce] GPCE 2017 - 1st Call for Papers Message-ID: -------------------------------------------------------------------------- CALL FOR PAPERS 16th International Conference on Generative Programming: Concepts & Experiences (GPCE 2017) October 23-24, 2017 Vancouver, Canada (co-located with SPLASH 2017) http://www.gpce.org/ http://twitter.com/GPCECONF http://www.facebook.com/GPCEConference IMPORTANT DATES * Submission of abstracts: June 25, 2017 * Submission of papers: July 2, 2017 * Paper notification: August 17, 2017 Submission site: https://gpce17.hotcrp.com/ -------------------------------------------------------------------------- SCOPE GPCE is a programming languages conference focusing on techniques and tools for code generation, language implementation, and product-line development. GPCE seeks conceptual, theoretical, empirical, and technical contributions to its topics of interest, which include but are not limited to: * program transformation, staging, macro systems, preprocessors, program synthesis, and code-recommendation systems, * domain-specific languages, language embedding, language design, and language workbenches, * feature-oriented programming, domain engineering, and feature interactions, * applications and properties of code generation, language implementation, and product-line development. Authors are welcome to check with the PC chair whether their planned papers are in scope. PAPER SELECTION The GPCE program committee will evaluate each submission according to the following selection citeria: * Novelty. Papers must present new ideas or evidence and place them appropriately within the context established by previous research in the field. * Significance. The results in the paper must have the potential to add to the state of the art or practice in significant ways. * Evidence. The paper must present evidence supporting its claims. Examples of evidence include formalizations and proofs, implemented systems, experimental results, statistical analyses, and case studies. * Clarity. The paper must present its contributions and results clearly. PAPER SUBMISSION GPCE solicits three kinds of submissions. All submissions must use the ACM SIGPLAN Conference Format and 10 point font. * Full Papers reporting original and unpublished results of research that contribute to scientific knowledge in any GPCE topic listed above. Full paper submissions must not exceed 12 pages excluding bibliography. * Short Papers presenting unconventional ideas or visions about any GPCE topic listed above. Short papers do not always require complete results as in the case of a full paper. In this way, authors can introduce new ideas to the community and get early feedback. Please note that short papers are not intended to be position statements. Short papers are included in the proceedings and will be presented at the conference. Short paper submissions must not exceed 6 pages excluding bibliography. * Tool Demonstrations presenting tools for any GPCE topic listed above. Tools must be available for use and must not be purely commercial. Submissions must provide a tool description not exceeding 6 pages excluding bibliography and a separate demonstration outline including screenshots also not exceeding 6 pages. Tool demonstrations must have the keywords ?Tool Demo? or ?Tool Demonstration? in their title. If the submission is accepted, the tool description will be published in the proceedings. The demonstration outline will only be used by the program committee for evaluating the submission. For additional information, clarification, or answers to questions please contact the program chair. ORGANIZATION Chairs (chairs at gpce.org) General Chair: Matthew Flatt (University of Utah, US) Program Chair: Sebastian Erdweg (TU Delft, Netherlands) Publicity Chair: Cyrus Omar (Carnegie Mellon University, US) Program Committee Nada Amin (EPFL, Switzerland) Casper Bach Poulsen (TU Delft, Netherlands) Sandrine Blazy (University of Rennes 1, France) Eugene Burmako (Twitter, US) Shigeru Chiba (University of Tokyo, Japan) Camil Demetrescu (Sapienza University Rome, Italy) Philipp Haller (KTH Royal Institute of Technology, Sweden) Matthew Hammer (University of Colorado, Boulder, US) Jaakko J?rvi (University of Bergen, Norway) Lennart Kats (Amazon Web Services) Sarah Nadi (University of Alberta, Canada) Bruno C. d. S. Oliveira (The University of Hong Kong, Hong Kong) Cyrus Omar (Carnegie Mellon University, US) Markus P?schel (ETH Zurich, Switzerland) M?rcio Ribeiro (Federal University of Alagoas (UFAL), Brazil) Tiark Rompf (Purdue University, US) Ina Schaefer (Technische Universit?t Braunschweig, Germany) Sandro Schulze (TU Hamburg, Germany) Tony Sloane (Macquarie University, Australia) Vincent St-Amour (Northwestern University, US) Thomas Th?m (TU Braunschweig, Germany) Markus V?lter (itemis/independent) Philip Wadler (University of Edinburgh, UK) Eric Walkingshaw (Oregon State University, US) Adam Welc (Huawei, US) Tijs van der Storm (CWI, Netherlands) -------------- next part -------------- An HTML attachment was scrubbed... URL: From ruy at cin.ufpe.br Sat Mar 4 09:21:06 2017 From: ruy at cin.ufpe.br (Ruy de Queiroz) Date: Sat, 4 Mar 2017 11:21:06 -0300 Subject: [TYPES/announce] 24th WoLLIC 2017 - DEADLINE APPROACHING Message-ID: [Please circulate. Apologies for multiple copies] WoLLIC 2017 24th Workshop on Logic, Language, Information and Computation July 18-21, 2017 University College London (UCL), London, UK SPECIAL SESSION: Screening of Navajo Math Circles (Directed by George Paul Csicsery, 2016, 58min) SCIENTIFIC SPONSORSHIP Interest Group in Pure and Applied Logics (IGPL) The Association for Logic, Language and Information (FoLLI) Association for Symbolic Logic (ASL) European Association for Theoretical Computer Science (EATCS) European Association for Computer Science Logic (EACSL) Sociedade Brasileira de Computa??o (SBC) Sociedade Brasileira de L?gica (SBL) IN COOPERATION WITH ACM Special Interest Group on Logic and Computation (ACM-SIGLOG) ORGANISATION Department of Computer Science, University College London, London, UK School of Electronic Engineering and Computer Science, Queen Mary College, London, UK Centro de Inform?tica, Universidade Federal de Pernambuco, Brazil HOSTED BY Department of Computer Science, University College London, London, UK CALL FOR PAPERS WoLLIC is an annual international forum on inter-disciplinary research involving formal logic, computing and programming theory, and natural language and reasoning. Each meeting includes invited talks and tutorials as well as contributed papers. The twenty-fourth WoLLIC will be held at the School of Electronic Engineering and Computer Science, Queen Mary College, London, UK, from July 18th to 21st, 2017. It is sponsored by the Association for Symbolic Logic (ASL), the Interest Group in Pure and Applied Logics (IGPL), the The Association for Logic, Language and Information (FoLLI), the European Association for Theoretical Computer Science (EATCS), the European Association for Computer Science Logic (EACSL), the Sociedade Brasileira de Computa??o (SBC), and the Sociedade Brasileira de L?gica (SBL). The workshop is held in cooperation with ACM Special Interest in Computational Logic (SIGLOG). PAPER SUBMISSION Contributions are invited on all pertinent subjects, with particular interest in cross-disciplinary topics. Typical but not exclusive areas of interest are: foundations of computing and programming; novel computation models and paradigms; broad notions of proof and belief; proof mining, type theory, effective learnability; formal methods in software and hardware development; logical approach to natural language and reasoning; logics of programs, actions and resources; foundational aspects of information organization, search, flow, sharing, and protection; foundations of mathematics; philosophy of mathematics; philosophical logic. Proposed contributions should be in English, and consist of a scholarly exposition accessible to the non-specialist, including motivation, background, and comparison with related works. Articles should be written in the LaTeX format of LNCS by Springer (see authors instructions at http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0). They must not exceed 12 pages, with up to 5 additional pages for references and technical appendices. The paper's main results must not be published or submitted for publication in refereed venues, including journals and other scientific meetings. It is expected that each accepted paper be presented at the meeting by one of its authors. Papers must be submitted electronically at the WoLLIC 2017 EasyChair website. (Please go to http://wollic.org/wollic2017/instructions.html for instructions.) A title and single-paragraph abstract should be submitted by Mar 14, 2017, and the full paper by Mar 21, 2017 (firm date). Notifications are expected by Apr 22, 2017, and final papers for the proceedings will be due by May 6, 2017 (firm date). PROCEEDINGS The proceedings of WoLLIC 2017, including both invited and contributed papers, will be published in advance of the meeting as a volume in Springer's LNCS series. In addition, abstracts will be published in the Conference Report section of the Logic Journal of the IGPL, and selected contributions will be published as a special post-conference WoLLIC 2017 issue of a scientific journal (to be confirmed). INVITED SPEAKERS Hazel Brickhill (Bristol) (University of Bristol) Michael Detlefsen (University of Notre Dame) Alexander Kurz (University of Leicester) Frederike Moltmann (New York University) David Pym (University College London) Nicole Schweikardt (Humboldt Universit?t) Fan Yang (Delft University) Boris Zilber (University of Oxford) STUDENT GRANTS ASL sponsorship of WoLLIC 2017 will permit ASL student members to apply for a modest travel grant (deadline: May 1st, 2017). See http://www.aslonline.org/studenttravelawards.html for details. IMPORTANT DATES Mar 14, 2017: Paper title and abstract deadline Mar 21, 2017: Full paper deadline Apr 22, 2017: Author notification May 6, 2017: Final version deadline (firm) PROGRAMME COMMITTEE Matthias Baaz (University of Technology, Vienna, Austria) John Baldwin (University of Illinois at Chicago, USA) Dana Bartozov? (Universidade de S?o Paulo, Brazil) Agata Ciabattoni (University of Technology, Vienna, Austria) Walter Dean (University of Warwick, UK) Erich Gr?del (RWTH Aachen, Germany) Volker Halbach (University of Oxford, UK) Juliette Kennedy (Helsinki University, Finland) (Chair) Dexter Kozen (Cornell University, USA) Janos Makowsky (Technion - Israel Institute of Technology, Israel) Larry Moss (indiana University, USA) Alessandra Palmigiano (Delft University, The Netherlands) Mehrnoosh Sadrzadeh (Queen Mary, UK) Sonja Smets (Amsterdam University, The Netherlands) Asger T?rnquist (K?benhavns Universitet, Denmark) Rineke Verbrugge (University of Groningen, The Netherlands) Andr?s Villaveces (Universidad Nacional, Colombia) Philip Welch (University of Bristol, UK) STEERING COMMITTEE Samson Abramsky, Johan van Benthem, Anuj Dawar, Joe Halpern, Wilfrid Hodges, Ulrich Kohlenbach, Daniel Leivant, Leonid Libkin, Angus Macintyre, Luke Ong, Hiroakira Ono, Valeria de Paiva, Ruy de Queiroz, Jouko V??n?nen. ORGANISING COMMITTEE Alexandra Silva (Univ College London, UK) (Local co-chair) Mehrnoosh Sadrzadeh (Queen Mary, UK) (Local co-chair) Paulo Oliva (Queen Mary, UK) James Brotherston (Univ College London, UK) Anjolina G. de Oliveira (U Fed Pernambuco) Ruy de Queiroz (U Fed Pernambuco) (co-chair) FURTHER INFORMATION Contact one of the Co-Chairs of the Organising Committee. WEB PAGE http://wollic.org/wollic2017/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From bogom.s at gmail.com Fri Mar 3 07:38:18 2017 From: bogom.s at gmail.com (Sergiy Bogomolov) Date: Fri, 3 Mar 2017 23:38:18 +1100 Subject: [TYPES/announce] DEADLINE EXTENSION for 4th International Workshop on Applied Verification for Continuous and Hybrid Systems (CPSWeek 2017) Message-ID: <000201d2941b$0cf81b20$26e85160$@gmail.com> Call for Submissions -- DEADLINE EXTENSION UNTIL MARCH 6 ----------------------------------------------------------------------- 4th International Workshop on Applied Verification for Continuous and Hybrid Systems CMU campus alongside CPSWeek, Pittsburgh, USA, April 17, 2017 http://cps-vo.org/group/ARCH The workshop on applied verification for continuous and hybrid systems (ARCH) brings together researchers and practitioners, and establishes a curated set of benchmarks submitted by academia and industry. Verification of continuous and hybrid systems is increasing in importance due to new cyber-physical systems that are safety- or operation-critical. This workshop addresses verification techniques for continuous and hybrid systems with a special focus on the transfer from theory to practice. Topics include, but are not limited to - Proposals for new benchmark problems (not necessarily yet solvable) - Tool presentations - Tool executions and evaluations based on ARCH benchmarks - Experience reports including open issues for industrial success - Reports on results of our friendly competition Submission Guidelines ----------------------------------------------------------------------- Submissions consist of papers of ideally 3-8 pages (pdf ) and optional files (e.g. models or traces) submitted through the ARCH?17 EasyChair web site (http://www.easychair.org/conferences/?conf=arch17). Authors have to use the EasyChair template (http://www.easychair.org/publications/for_authors).The extended abstract should be classified in its title as benchmark proposal, tool presentation, benchmark results, or experience report. Submissions receive at least 3 anonymous reviews, including one from industry and one from academia. Details on the evaluation criteria can be found at http://cps-vo.org/group/ARCH/CallForSubmissions. Submission deadline: March 6, 2017 Notification: March 15, 2017 (2 days before early registration of CPSWeek) Final Version: March 31, 2017 Workshop: April 17, 2017 (different from other CPS Week workshops; this year free of charge!) Website: http://cps-vo.org/group/ARCH (includes forums, archive, wiki, etc.) Prize ----------------------------------------------------------------------- The paper with the most promising benchmark results receives a prize of 500 Euros sponsored by Robert Bosch GmbH, Germany. The winner is preselected by the program committee and determined by an audience voting. Organizers ----------------------------------------------------------------------- Program chairs: Matthias Althoff, Technische Universit?t M?nchen, Germany Goran Frehse, UJF-Verimag, France Local chair: Sebastian Scherer, Carnegie Mellon University, USA Publicity chair: Sergiy Bogomolov, Australian National University, Australia Evaluation chair: Taylor T. Johnson, Vanderbilt University, USA Program Committee (tentative) ----------------------------------------------------------------------- Academia: Pieter Collins (Maastricht Univ.) Alexandre Donze (UC Berkeley) Ian Mitchell (Univ. British Colombia) Sayan Mitra (UI Urbana Champaign) Andre Platzer (CarnegieMellon Univ.) Nacim Ramdani (Universit? d?Orl?ans) Aditya Zutshi (Duke University) Xin Chen (RWTH Aachen University) Sicun Gao (Massachusetts Institute of Technology) Stanley Bak (Air Force Research Lab) Industry: Ajinkya Bhave (Siemens PLM) Jyotirmoy Deshmukh (Toyota) Luca Parolini (BMW) Alessandro Pinto (United Technologies) Matthias Woehrle (Bosch) William Hung (Synopsys Inc) Olivier Bouissou (MathWorks) Daniel Bryce (SIFT) Aaron Fifarek (Linquest) -------------- next part -------------- An HTML attachment was scrubbed... URL: From alexander.s.alexandrov at gmail.com Sun Mar 5 13:07:26 2017 From: alexander.s.alexandrov at gmail.com (Alexander Alexandrov) Date: Sun, 05 Mar 2017 18:07:26 +0000 Subject: [TYPES/announce] Call for Papers DBPL 2017 Message-ID: The 16th International Symposium on Database Programming Languages ============================================================================== The 16th International Symposium on Database Programming Languages (DBPL 2017) will be held in conjunction with VLDB 2017 on September 1st, 2017 in Munich, Germany. General Information ------------------------------------------------------------------------------ DBPL is a biennial symposium that aims to foster exchange of ideas and discussion about current trends and open problems between the data management and the programming languages research communities. For over 30 years, DBPL has established itself as the principal venue for publishing and discussing new ideas and problems at the intersection of data management and programming languages. Many key contributions relevant to the formal foundations, design, implementation, and evaluation of query languages (e.g., for object-oriented, nested, or semi-structured data) were first announced at DBPL. As an established destination for such new ideas, DBPL aims to solicit submissions from researchers in databases, programming languages or any other community interested in the design, implementation or foundations of languages and systems for data-centric computation. Our main goal is to provide an inter-disciplinary venue where current trends, open problems, as well as insights about research methodology for potential solutions can be shared and discussed between the two communities. Important Dates ------------------------------------------------------------------------------ - Abstracts submission deadline: May 5th, 2017 - Papers submission deadline: May 12th, 2017 - Notification of acceptance: June 19th, 2017 - Workshop: September 1st, 2017 Organizers ------------------------------------------------------------------------------ Workshop Chairs - Tiark Rompf, Purdue University, USA - Alexander Alexandrov, TU Berlin, Germany Steering Committee - Torsten Grust, Universit?t T?bingen, Germany - James Cheney, University of Edinburgh, UK - Thomas Neumann, TU M?nchen, Germany Scope and Topics ------------------------------------------------------------------------------ DBPL 2017 solicits theoretical and practical papers in all areas of Data-Centric Programming Languages. papers emphasizing new topics or foundations of emerging areas are especially welcome. Topics of interest for submissions include: - Programming Abstractions and Type Systems for Data-Centric Batch or Stream Processing - Data-Centric Language Design - Data-Centric Language Semantics - Data-Centric Language Optimizations and Transformations - Data-Centric Language Compilation to Emerging Hardware or Software Platforms - Data Integration, Exchange, and Interoperability - Declarative Data Centers - Emerging and Nontraditional Data Models - Language-Based Security in Data Management - Language-Integrated Query Mechanisms - Managing Uncertain and Imprecise Information - Metaprogramming and Heterogeneous Staged Computation - Programming Language Support for Databases - Schema Mapping and Metadata Management - Semantics and Verification of Database Systems - Validation, Type-checking Author Guidelines ------------------------------------------------------------------------------ Prospective authors are invited to submit full papers in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. Submissions should be no more than 10 pages long in the [ACM Proceedings Format] format. Each submission should begin with a succinct statement of the problem and a summary of the main results. Authors may provide more details to substantiate the main claims of the paper by including a clearly marked appendix at the end of the submission, which is not included in the page limit and is read at the discretion of the committee. At least one author of each accepted paper must attend the symposium to present their work. Short papers of at most 4 pages in the [ACM Proceedings Format] describing work in progress, demos, research challenges or visions are also welcome. Accepted short papers may be included or excluded from the formal proceedings, whichever the author(s) prefer. Full and short papers are both due on the deadline, May 12, 2017. Abstracts of full papers should be submitted by May 5th to aid reviewer selection. For detailed submission guidelines, please visit the [Workshop Homepage]. [ACM Proceedings Format] https://www.acm.org/publications/proceedings-template [Workshop Homepage] http://dbpl2017.org -------------- next part -------------- An HTML attachment was scrubbed... URL: From pkordjam at tulane.edu Sat Mar 4 12:03:34 2017 From: pkordjam at tulane.edu (Kordjamshidi, Parisa) Date: Sat, 4 Mar 2017 17:03:34 +0000 Subject: [TYPES/announce] CFP: IJCAI-2017 Workshop on Declarative Learning Based Programming Message-ID: <2A516134-EE18-413F-B218-B5B6330D97EA@tulane.edu> ---------------------------------------------------------------- CALL FOR PAPERS and PARTICIPANTS ---------------------------------------------------------------- 2nd International Workshop on Declarative Learning Based Programming (DeLBP 2017) In conjunction withTwenty- sixth International Joint Conference on Artificial Intelligence (IJCAI-17), August 19?20, 2017, Melbourne, Australia. Website: http://delbp.github.io --------------------------------------------------------------- AIM AND SCOPE ????????????????????? The main goal of Declarative Learning Based Programming (DeLBP) workshop is to investigate the issues that arise when designing and using programming languages that support learning from data and knowledge. DeLBP aims at facilitating and simplifying the design and development of intelligent real world applications that use machine learning and reasoning by addressing the following commonly observed challenges: Interaction with messy, naturally occurring data; Specifying the requirements of the application at a high abstraction level; Dealing with uncertainty in data and knowledge in various layers of the application program; Using representations that support flexible relational feature engineering; Using representations that support flexible reasoning and structure learning; Integrating a range of learning and inference algorithms; and finally addressing the above mentioned issues in one unified programming environment. Conventional programming languages offer no help to application programmers that attempt to design and develop applications that make use of real world data, and reason about it in a way that involves learning interdependent concepts from data, incorporating and composing existing models, and reasoning about existing and trained models and their parametrization. Over the last few years the research community has tried to address these problems from multiple perspectives, most notably various approaches based on Probabilistic programming, Logical Programming and the integrated paradigms. The goal of this workshop is to present and discuss the current related research and the way various challenges have been addressed. We aim at motivating the need for further research toward a unified framework in this area based on the key existing paradigms: Probabilistic Programming (PP), Logic Programming (LP), Probabilistic Logical Programming (PLP), First-order query languages and database management systems (DBMS) and deductive databases (DDB), Statistical relational learning and related languages (SRL), and connect these to the ideas of Learning Based Programming. We aim to discuss and investigate the required type of languages and representations that facilitate modeling probabilistic or non-probabilistic complex learning models, deep architectures, and provide the ability to combine, chain and perform flexible inference with existing models and by exploiting domain knowledge. (Website: http://delbp.github.io) ---------------------------------------------------------------- TOPICS OF INTEREST ????????????????????? ? New abstractions and modularity levels towards a unified framework for learning and reasoning, ? Frameworks/Computational models to combine learning and reasoning paradigms and exploit accomplishments in AI from various perspectives. ? Flexible use of structured and relational data from heterogeneous resources in learning. ? Data modeling (relational/graph-based ) issues in such a new integrated framework for learning based on data and knowledge. ? Exploiting knowledge such as expert knowledge and common sense knowledge expressed via multiple formalisms, in learning. ? The ability of closing the loop to acquire knowledge from data and data from knowledge towards life-long learning, and reasoning. ? Using declarative domain knowledge to guide the design of learning models, ? Including feature extraction, model selection, dependency structure and deep learning architecture. ? Structure Learning and automation of hyper-parameter tuning. ? Design and representation of complex learning and inference models. ? The interface for learning-based programming, ? Either in the form of programming languages, declarations, frameworks, libraries or graphical user interfaces. ? Storage and retrieval of trained learning models in a flexible way to facilitate incremental learning. ? Related applications in Natural language processing, Computer vision, Bioinformatics, Computational biology, etc. ---------------------------------------------------------------- IMPORTANT DATES ---------------------------------------------------------------- ? Submission Deadline: May 8th, 2017 ? Notification: June 5th, 2017 ? Workshop Days: August 19th-20th, 2017 ---------------------------------------------------------------- SUBMISSION AND SELECTION PROCESS ---------------------------------------------------------------- We encourage contributions with either a technical paper (IJCAI style, 6 pages without references), a position statement (IJCAI style, 2 pages maximum) or an abstract of a published work. IJCAI Style files available here [http://ijcai-17.org/FormattingGuidelinesIJCAI-17.zip]. Please make submissions via EasyChair, here [https://easychair.org/conferences/?conf=delbp2017]. ---------------------------------------------------------------- PROGRAM COMMITTEE ---------------------------------------------------------------- Guy Van den Broeck, University of California, Los Angeles Sameer Singh, University of California, Irvine Avi Pfeffer, Charles River Analytics Rodrigo de Salvo Braz, SRI International Tias Guns, Vrije University of Brussels Christos Christodoulopoulos, Amazon Cambridge, UK William Wang, University of California, Santa Barbara Kai-Wei Chang, University of Virginia ---------------------------------------------------------------- ORGANIZING COMMITTEE ---------------------------------------------------------------- Parisa Kordjamshidi, Tulane University, IHMC Dan Roth, University of Illinois at Urbana-Champaign Jan-Willem Van den Meent, Northeastern University Dan Goldwasser, Purdue University Vibhav Gogate, University of Texas at Dallas Kristian Kersting, TU Dortmund University ---------------------------------------------------------------- CONTACT ---------------------------------------------------------------- delbp-2 at googlegroups.com (Organization Committee) pkordjam at tulane.edu Please circulate this CFP among your colleagues and students. ------------------------------------------- Kordjamshidi, Parisa Assistant Professor CS Department at Tulane University Research Scientist at IHMC Homepage -------------- next part -------------- An HTML attachment was scrubbed... URL: From compscience.announcement at gmail.com Sat Mar 4 17:30:40 2017 From: compscience.announcement at gmail.com (Klaus Havelund) Date: Sat, 4 Mar 2017 14:30:40 -0800 Subject: [TYPES/announce] RERS: 7th International Challenge on the Rigorous Examination of Reactive Systems Message-ID: Dear colleagues, The *RERS Challenge* *2017*: is the 7th International Challenge on the Rigorous Examination of Reactive Systems and is *co-located with ISSTA/SPIN 2017*. The event will be held in *July 2017, in Santa Barbara, USA*. RERS is designed to encourage software developers and researchers to apply and combine their tools and approaches in a free style manner to answer evaluation questions for reachability and LTL formulas on specifically designed benchmarks. The goal of this challenge is to provide a basis for the comparison of verification techniques and available tools. The benchmarks are automatically synthesized to exhibit chosen properties and then enhanced to include dedicated dimensions of difficulty, ranging from conceptual complexity of the properties (e.g. reachability, full safety, liveness), over size of the reactive systems (a few hundred lines to tens of thousands of them), to exploited language features (arrays and index arithmetics). They are therefore especially suited for community-overlapping tool comparisons. What distinguishes RERS from other challenges is that the challenge problems can be approached in a free-style manner: it is highly encouraged to combine and exploit all known (even unusual) approaches to software verification. In particular, participants are not constrained to their own tools. To clearly separate RERS from other challenges, this year the LTL analysis is separated from the reachability of labels. RERS is then the only challenge with a special track for LTL analysis on synthesized benchmarks. The main aims of RERS 2017 are to : * encourage the combination of usually different research fields for better software verification results * provide a comparison foundation based on differently tailored benchmarks that reveals the strengths and weaknesses of specific approaches * initiate a discussion for better benchmark generation reaching out across the usual community barriers to provide benchmarks useful for testing and comparing a wide variety of tools There will be a 1 day workshop where the results will be presented, the generation methodology will be explained, and the modalities for the RERS 2018 challenge, which will be part of ISoLA 2018 will be discussed. There is still a lot of time to get engaged, and collecting RERS achievements is a lot of fun! In addition there will be book prices sponsored by Springer. Schedule: ========= SEQUENTIAL PROBLEMS =================== The sequential challenge just started. Its entire setup in online since a few days. Thus you can start right away. At least if you are a RERS newcomer, we would strongly recommend you to start with the training problems: ( http://www.rers-challenge.org/2017/index.php?page=trainingphase) They are an ideal starting point for the challenge: They are smaller in size than the challenge problems but otherwise structurally equivalent. Moreover, an automatic checker (available on the same page) allows you to evaluate your own solutions. After having tackled the training problems it should be easy to move on to attack the challenge problems. PARALLEL PROBLEMS ================= 01.03.2017: The training problems for the parallel challenge wil be online 01.05.2017: The setup for the parallel challlenge will be online. *DEADLINE for all submission* =========================== *01.07.2017* Please note that we want to specifically encourage also solutions from participants that work with tools developed by others. More detailed information on the challenge can be found in the participants section of www.rers-challenge.org/2017. Looking forward to seeing you in Santa Barbara! Best regards Bernhard, Falk, Jaco, and Markus -------------- next part -------------- An HTML attachment was scrubbed... URL: From christopher.meiklejohn at gmail.com Fri Mar 3 06:07:30 2017 From: christopher.meiklejohn at gmail.com (Christopher Meiklejohn) Date: Fri, 3 Mar 2017 12:07:30 +0100 Subject: [TYPES/announce] PMLDC 2017 - 1st Call for Papers Message-ID: Second Workshop on Programming Models and Languages for Distributed Computing Co-located with ECOOP 2017, Barcelona, Spain Date: June 20, 2017 Whether you are programming a rich web application in JavaScript that mutates state in the client?s browser, or you are building a massively deployed mobile application that will operate with client state at the device, it?s undeniable that you are building a distributed system! Two major challenges of programming distributed systems are concurrency and partial failure. Concurrency of operations can introduce accidental nondeterminism: computations may result in different outcomes with the same inputs given scheduling differences in the underlying system unless a synchronization mechanism is used to enforce some order. Synchronization is typically expensive, and reduces the efficiency of user applications. Partial failure, or the failure of one or more components in a distributed system at one time, introduces the challenge of knowing, when an operation fails, which components of the operation completed successfully. To solve these problems in practice on an unreliable, asynchronous network, atomic commit protocols and timeouts as failure detection are typically used. Because of these challenges, early approaches to providing programming abstractions for distributed computing that ignored them were inherently misguided: the canonical example being the Remote Procedure Call, still widely deployed in industry. The goal of this workshop is to discuss new approaches to distributed programming that provide efficient execution and the elimination of accidental nondeterminism resulting from concurrency and partial failure. It will bring together both practitioners and theoreticians from many disciplines: database theory, distributed systems, systems programming, programming languages, data-centric programming, web application development, and verification, to discuss the state-of-the-art of distributed programming, advancement of the state-of-the-art and paths forward to better application of theory in practice. The main objectives of this workshop are the following: * To review the state-of-the-art research in languages, models, and systems for distributed programming; * To identify areas of critical need where research can advance the state of the art; * To create a forum for discussion; * To present open problems from practitioners with an aim towards motivating academic research on relevant problems faced by industry. In the spirit of both ECOOP and Curry On, this workshop aims at favoring a multidisciplinary perspective by bringing together researchers, developers, and practitioners from both academia and industry. Submission Guidelines We solicit proposals for contributed talks. We recommend preparing proposals of 2 pages, in ACM 2 column SIGPLAN style, written in English and in PDF format. However, we will accept longer proposals or submissions to other conferences, under the understanding that PC members are only expected to read the first two pages of such longer submissions. Authors with accepted papers will have the opportunity to have their submission published on the ACM Digital Library. Workshop http://2017.ecoop.org/track/pmldc-2017-papers Submission Link https://easychair.org/conferences/?conf=pmldc2017 Important Dates Paper submission: 1 May 2017 Workshop date: 20 June 2017 Authors notification: TBA Final version: TBA Organizing Committee Christopher Meiklejohn Universit? catholique de Louvain Heather Miller Ecole Polytechnique F?d?rale de Lausanne Program Committee Carlos Baquero Universidade do Minho Annette Bieniusa Technischen Universit?t Kaiserslautern Carla Ferreira Universidade Nova Lisboa Alexey Gotsman IMDEA Software Institute Tyler McMullen Fastly Rodrigo Rodrigues Instituto Superior T?cnico, University of Lisboa & INESC-ID Ali Shoker HASLab/INESC TEC & University of Minho KC Sivaramakrishnan University of Cambridge Zach Tellman Lacuna Peter Van Roy Universit? catholique de Louvain Leif Walsh Two Sigma Investments Jordan West NOVA-LINCS Hongseok Yang University of Oxford From pierre.geneves at cnrs.fr Fri Mar 3 09:22:01 2017 From: pierre.geneves at cnrs.fr (Pierre Geneves) Date: Fri, 3 Mar 2017 15:22:01 +0100 Subject: [TYPES/announce] PhD Positions at Inria Grenoble, France Message-ID: <364d55a4-c056-45e1-2fb3-38a39480b9ae@cnrs.fr> The Tyrex research team at Inria Grenoble (http://tyrex.inria.fr) has open positions for PhD students: http://tyrex.inria.fr/jobs.html In particular, we have an open position on the following topic: Soundy Analysis Techniques for Web Development XQuery [1] is the standard language language dedicated to XML data querying and manipulation. As opposed to other NoSQL languages (and e.g. XSLT in particular), it has been intended to feature strong static typing [5]. As emphasized in [4], ?static program analysis is a key component of many software development tools, including compilers, development environments, and verification tools. Analyses are often expected to be sound in that their result models all possible executions of the program under analysis. Soundness implies that the analysis computes an over-approximation in order to stay tractable [5]; the analysis result will also model behaviors that do not actually occur in any program execution. The precision of an analysis is the degree to which it avoids such spurious results. Users expect analyses to be sound as a matter of course, and desire analyses to be as precise as possible, while being able to scale to large programs.? It was shown in [2] that sound yet precise static analyses are possible for an XQuery fragment [2], even for complex expressions that navigate in XML trees [2,3]. While soundness seems essential for any kind of static program analysis, approximations and omissions are usually required for language features when applied to real programs. This is coined by the recent concept of soundiness [4] which defines ?soundy analyses?: a soundy analysis aims to be as sound as possible without excessively compromising precision or scalability. The goal of this internship is to investigate methods of code analysis which take advantage of sound verification systems developed for XQuery language fragments in the literature (such as [2]) to efficiently compute useful guarantees on real XQuery code used in production. Specifically, the subject will consist of: ? identifying different levels of static analyses corresponding to relevant language fragments; ? supplementing sound analysis techniques with relevant approximations to make the most of them with real-world code; ? investigating the concept of soundiness [4] in the context of XQuery; ? implementing a prototype checker which is capable of running on real production code while indicating meaningful guarantees that can be provided. Real-world XQuery code will be provided by a startup in the domain of XQuery-based web development frameworks. References: [1] XQuery 3.0: An XML Query Language, W3C Recommendation 08 April 2014:https://www.w3.org/TR/xquery-30/ [2] XQuery and Static Typing: Tackling the Problem of Backward Axes. Pierre Geneves and Nils Gesbert. In International Conference on Functional Programming (ICFP) 2015 (https://hal.inria.fr/hal-01082635v2/document) [3] Efficient Static Analysis of XML Paths and Types. Pierre Genev?s, Nabil Laya?da, Alan Schmitt. In ACM SIGPLAN conference on Programming language design and implementation (PLDI) 2007 (https://hal.inria.fr/inria-00502789/document) [4] In Defense of Soundiness: A Manifesto. Ben Livshits, Manu Sridharan, Yannis Smaragdakis, Ond?ej Lhot?k, J. Nelson Amaral, Bor-Yuh, Evan Chang, Sam Guyer, Uday Khedker, Anders M?ller and Dimitrios Vardoulakis. In Communications of the ACM, 2015. http://soundiness.org/ [5] Course: Introduction to XQuery and Static Type-Checking. University Grenoble Alpes. Pierre Genev?s. http://tyrex.inria.fr/courses/mosig2015/xquery.pdf Environment: The doctoral work is to be carried out in the Tyrex research team (http://tyrex.inria.fr). Tyrex has a long research experience in the area of the web and particularly in the static analysis of web query languages through logical modeling and reasoning. The team has a tradition of conducting research both at the theoretical and applied (implementation) levels. Tyrex members regularly participate in the most relevant conferences of the domain (including major venues concerning the web, programming languages, and artificial intelligence). As such, it is an excellent and stimulating environment for ambitious PhD candidates. The PhD candidate will also benefit from the national and international collaborations of the team. The position is located at Inria Grenoble Rh?ne-Alpes (http://www.inria.fr/centre/grenoble), Montbonnot (near Grenoble, France) which is a major research laboratory in Computer Science offering a stimulating research environment. Contact: Pierre Genev?s (HDR) (pierre.geneves at cnrs.fr), Nils Gesbert (nils.gesbert at grenoble-inp.fr), Nabil Laya?da (HDR) (nabil.layaida at inria.fr) Keywords: Static typing, structured data, data-centric programming -- Pierre Genev?s, Ph.D., HDR Responsable permanent, ?quipe Tyrex LIG - Inria - UGA - CNRS - Grenoble INP Responsable de sp?cialit? Informatique, ED MSTII pierre.geneves at cnrs.fr (33)476615281 http://tyrex.inria.fr -------------- next part -------------- An HTML attachment was scrubbed... URL: From chris.heunen at ed.ac.uk Sat Mar 4 15:24:22 2017 From: chris.heunen at ed.ac.uk (Chris Heunen) Date: Sat, 04 Mar 2017 20:24:22 +0000 Subject: [TYPES/announce] Categories Logic and Physics Scotland 5 April 2017: call for participation Message-ID: CATEGORIES LOGIC AND PHYSICS SCOTLAND CALL FOR PARTICIPATION Wednesday 5 April 2017 Department of Computer and Information Sciences, University of Strathclyde http://homepages.inf.ed.ac.uk/cheunen/clapscotland/ Following our successful meetings last year, we are pleased to announce the third workshop in the CLAP Scotland series, and invite you to participate. If you would like to give a talk, email . Confirmed speakers so far include: * Kevin Dunne (University of Strathclyde) * Chris Heunen (University of Edinburgh) * Peter Hines (University of York) * Aleks Kissinger (Radboud University) * Clemens Kupke (University of Strathclyde) * Fabio Zanasi (University College London) Registration is free. For catering purposes, please email the local organiser as soon as possible if you plan to attend. Best wishes, Chris Heunen and Ross Duncan -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- An embedded and charset-unspecified text was scrubbed... Name: not available URL: From sandra at dcc.fc.up.pt Mon Mar 6 10:12:21 2017 From: sandra at dcc.fc.up.pt (Sandra Alves) Date: Mon, 6 Mar 2017 15:12:21 +0000 Subject: [TYPES/announce] FSCD 2017 - Second Call for Papers Message-ID: <82CE1544-D909-46C5-A8EF-8DA742797826@dcc.fc.up.pt> *** Apologies for multiple copies, please redistribute *** CALL FOR PAPERS Second International Conference on Formal Structures for Computation and Deduction (FSCD'17) 4 -- 7 September 2017, Oxford, UK (in-cooperation with the ACM SIGLOG and SIGPLAN and co-located with ICFP 2017) http://www.cs.ox.ac.uk/conferences/fscd2017/ FSCD (http://fscdconference.org/) covers all aspects of formal structures for computation and deduction from theoretical foundations to applications. Building on two communities, RTA (Rewriting Techniques and Applications) and TLCA (Typed Lambda Calculi and Applications), FSCD embraces their core topics and broadens their scope to closely related areas in logics, proof theory and new emerging models of computation such as quantum computing or homotopy type theory. IMPORTANT DATES All deadlines are midnight anywhere-on-earth (AoE) and are firm; late submissions will not be considered. Abstract Deadline: 7 April 2017 Submission Deadline: 14 April 2017 Rebuttal: 29--31 May 2017 Notification: 14 June 2017 Camera-Ready: 7 July 2017 Suggested, but not exclusive, list of topics for submission are: 1. Calculi: Lambda calculus * Concurrent calculi * Logics * Rewriting systems * Proof theory * Type theory and logical frameworks 2. Methods in Computation and Deduction: Type systems * Induction and coinduction * Matching, unification, completion, and orderings * Strategies * Tree automata * Model checking * Proof search and theorem proving * Constraint solving and decision procedures 3. Semantics: Operational semantics * Abstract machines * Game Semantics * Domain theory and categorical models * Quantitative models 4. Algorithmic Analysis and Transformations of Formal Systems: Type Inference and type checking * Abstract Interpretation * Complexity analysis and implicit computational complexity * Checking termination, confluence, derivational complexity and related properties * Symbolic computation 5. Tools and Applications: Programming and proof environments * Verification tools * Libraries for proof assistants and interactive theorem provers * Case studies in proof assistants and interactive theorem provers * Certification PUBLICATION The proceedings will be published as an electronic volume in the Leibniz International Proceedings in Informatics (LIPIcs) of Schloss Dagstuhl. All LIPIcs proceedings are open access. SUBMISSION GUIDELINES Submissions can be made in two categories. Regular research papers are limited to 15 pages and must present original research which is unpublished and not submitted elsewhere. System descriptions are limited to 10 pages and must describe a working system which has not been published or submitted elsewhere. Submissions must be formatted using the LIPIcs style files and submitted via EasyChair. Complete instructions on submitting a paper can be found on the conference web site. SPECIAL ISSUES Full versions of several accepted papers, to be selected by the program committee, will be invited for submission to a special issue of Logical Methods in Computer Science. BEST PAPER AWARD BY JUNIOR RESEARCHERS The program committee will consider declaring this award to a paper in which all authors are junior researchers: a junior researcher is a person who is either a student or whose PhD award date is less than three years from the first day of the meeting. PROGRAM COMMITTEE CHAIR Dale Miller, Inria Saclay & LIX PROGRAM COMMITTEE Andreas Abel, Gothenburg Univ. Elvira Albert, Complutense Madrid Maria Alpuente, TU Valencia Takahito Aoto, Niigata Univ. Zena Ariola, Univ. Oregon Federico Aschieri, TU Wien Stefano Berardi, Univ. Turin Lars Birkedal, Aarhus Univ. Filippo Bonchi, CNRS, ENS Lyon Pierre Clairambault, CNRS, ENS Lyon Ugo Dal Lago, Univ. Bologna Herman Geuvers, Radboud Univ. Silvia Ghilezan, Univ. Novi Sad Juergen Giesl, RWTH Aachen Hugo Herbelin, Inria Paris Jan Hoffmann, Carnegie Mellon Deepak Kapur, Univ. New Mexico Paul Blain Levy, Univ. Birmingham Paulo Oliva, QMUL, London Vincent van Oostrom, Univ. Innsbruck Daniela Petrisan, LIAFA, Paris Femke van Raamsdonk, VU Univ. Amsterdam Grigore Rosu, Univ. Illinois Albert Rubio, UPC-BarcelonaTech Paula Severi, Univ. Leicester Bas Spitters, Aarhus Univ. Aaron Stump, Univ. Iowa Kazushige Terui, Kyoto Univ. Rene Thiemann, Univ. Innsbruck Sophie Tison, Lille Univ. CONFERENCE CHAIR Sam Staton, Univ. of Oxford WORKSHOP CHAIR Jamie Vicary, Univ. of Oxford PUBLICITY CHAIR Sandra Alves, Univ. of Porto FSCD STEERING COMMITTEE T. Altenkirch (Univ. Nottingham), S. Alves (Univ. Porto), G. Dowek, (Inria), S. Escobar (Univ. Politecnica de Valencia), M. Fernandez (King's College London), H. Herbelin (Inria), D. Kesner (Univ. Paris), N. Kobayashi (Univ. Tokyo), L. Ong (Chair, Univ. Oxford), B. Pientka (McGill Univ.), R. Thiemann (Univ. Innsbruck). From elaine at mat.ufmg.br Mon Mar 6 08:44:38 2017 From: elaine at mat.ufmg.br (Elaine Pimentel) Date: Mon, 6 Mar 2017 10:44:38 -0300 Subject: [TYPES/announce] TABLEAUX 2017 - Final Call for Papers Message-ID: FINAL CALL FOR PAPERS TABLEAUX 2017 26th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods University of Brasilia, Brazil September 25-28, 2017 Deadlines: 18 Apr 2017 (abstract), 25 Apr 2017 (paper) http://tableaux2017.cic.unb.br/ GENERAL INFORMATION TABLEAUX is the main international conference at which research on all aspects, theoretical foundations, implementation techniques, systems development and applications, of the mechanization of tableau-based reasoning and related methods is presented. As the first TABLEAUX workshop was held in Lautenbach in 1992, this year's conference will include special events celebrating 25 years of TABLEAUX. The conference will be held in Brasilia from 25-28 September 2017. It will be co-located with both the 11th International Symposium on Frontiers of Combining Systems (FroCoS 2017) and the 8th International Conference on Interactive Theorem Proving (ITP 2017). TOPICS Tableau methods offer a convenient and flexible set of tools for automated reasoning in classical logic, extensions of classical logic, and a large number of non-classical logics. For large groups of logics, tableau methods can be generated automatically. Areas of application include verification of software and computer systems, deductive databases, knowledge representation and its required inference engines, teaching, and system diagnosis. Topics of interest include but are not limited to: * tableau methods for classical and non-classical logics (including first-order, higher-order, modal, temporal, description, hybrid, intuitionistic, substructural, relevance, non-monotonic logics) and their proof-theoretic foundations; * related methods (SMT, model elimination, model checking, connection methods, resolution, BDDs, translation approaches); * sequent calculi and natural deduction calculi for classical and non-classical logics, as tools for proof search and proof representation; * flexible, easily extendable, light weight methods for theorem proving; * novel types of calculi for theorem proving and verification in classical and non-classical logics; * systems, tools, implementations, empirical evaluations and applications (provers, logical frameworks, model checkers, ...); * implementation techniques (data structures, efficient algorithms, performance measurement, extensibility, ...); * extensions of tableau procedures with conflict-driven learning, generation of proofs; compact (or humanly readable) representation of proofs; * decision procedures, theoretically optimal procedures; * applications of automated deduction to mathematics, software development, verification, deductive and temporal databases, knowledge representation, ontologies, fault diagnosis or teaching. We also welcome papers describing applications of tableau procedures to real world examples. Such papers should be tailored to the tableau community and should focus on the role of reasoning, and logical aspects of the solution. CELEBRATING 25 YEARS To celebrate 25 years TABLEAUX the conference will include a special session of invited talks by: Reiner Haehnle Technische Universitaet Darmstadt, Germany Wolfgang Bibel Technische Universitaet Darmstadt, Germany INVITED SPEAKERS: Carlos Areces FaMAF - Universidad Nacional de Cordoba, Argentina Katalin Bimbo University of Alberta, Canada (with FroCoS and ITP) Jasmin Blanchette Inria and LORIA, Nancy, France (with FroCoS and ITP) Cezary Kaliszyk Universitaet Innsbruck, Austria (with FroCoS and ITP) WORKSHOPS AND TUTORIALS There will be a three-day programme of four workshops and four tutorials from 23-25 September. Workshops: 12th Logical and Semantic Frameworks with Applications (LSFA 2017) Sandra Alves, Renata Wassermann, Flavio L. C. de Moura 23 and 24 September 2017 Proof eXchange for Theorem Proving (PxTP) Catherine Dubois, Bruno Woltzenlogel Paleo 23 and 24 September 2017 EPS - Encyclopedia of Proof Systems Giselle Reis, Bruno Woltzenlogel Paleo 24 and 25 September 2017 DaLi - Dynamic Logic: new trends and applications Mario Benevides, Alexandre Madeira 24 September 2017 Tutorials: General methods in proof theory for modal and substructural logics Bjoern Lellmann, Revantha Ramanayake 23 September 2017 From proof systems to complexity bounds Anupam Das 24 September 2017 Proof Compressions and the conjecture NP = PSPACE Lew Gordeev, Edward Hermann Haeusler 25 September 2017 PVS for Computer Scientists Cesar Munoz, Mauricio Ayala-Rincon, Mariano Moscato 25 September 2017 Details will be published in separate calls and on the conference website. POSTER SESSION There will be a joint poster session for TABLEAUX 2017, FroCos 2017, and ITP 2017. The session is intended for descriptions of work in progress, student projects and relevant research being published elsewhere. The deadline for posters submission is June 15, 2017. More details can be found at http://tableaux2017.cic.unb.br/#postersession. PUBLICATION DETAILS The conference proceedings will published in the Springer LNAI/LNCS series, as in previous editions. SUBMISSIONS Submissions are invited in two categories: A Research papers, which describe original theoretical research, original algorithms, or applications, with length up to 15 pages. B System descriptions, with length up to 9 pages. Submissions will be reviewed by the PC, possibly with the help of external reviewers, taking into account readability, relevance and originality. For category A, theoretical results and algorithms must be original, and not submitted for publication elsewhere. Submissions will be reviewed taking into account correctness, theoretical elegance, and possible implementability. For category B submissions, a working implementation must be accessible via the internet, which includes sources. The aim of a system description is to make the system available in such a way that users can use it, understand it, and build on it. Accepted papers in both categories will be published in the conference proceedings. Papers must be edited in LaTeX using the llncs style and must be submitted electronically as PDF files via the EasyChair system: https://easychair.org/conferences/?conf=tableaux2017. For all accepted papers at least one author is required to attend the conference and present the paper. A paper title and a short abstract of about 100 words must be submitted before the paper submission deadline. Further information about paper submissions will be made available at the conference website. Be aware that neither plagiarism, nor self-plagiarism, nor duplicate publication is acceptable. Formatting instructions and the LNCS style files can be obtained via http://www.springer.com/br/computer-science/lncs/conference- proceedings-guidelines BEST PAPER AWARD The TABLEAUX 2017 Best Paper Award will be presented to the best submission nominated and chosen by the Program Committee among the accepted papers. The eligibility criteria will place emphasis on the originality and significance of the contribution, but readability and the overall technical quality, including correctness and completeness of results, will also be considered. The TABLEAUX Best Paper Award was established in 2015 and is a permanent initiative of TABLEAUX. IMPORTANT DATES 18 Apr 2017 Abstract submission 25 Apr 2017 Paper submission 8 Jun 2017 Notification of paper decisions 3 Jul 2017 Camera-ready papers due 23-25 Sep 2017 Workshops & Tutorials 25-28 Sep 2017 TABLEAUX Conference PROGRAM COMMITTEE Peter Baumgartner National ICT Australia, Canberra Maria Paola Bonacina Universita degli Studi di Verona Laura Bozzelli Universidad Politecnica de Madrid Torben Brauener Roskilde University Serenella Cerrito Ibisc, Universite d'Evry Val d'Essonne Agata Ciabattoni Technische Universitaet Wien Clare Dixon University of Liverpool Pascal Fontaine LORIA, INRIA, Universite de Lorraine Didier Galmiche LORIA, Universite de Lorraine Martin Giese Universitetet i Oslo Laura Giordano DISIT, Universita del Piemonte Orientale Rajeev Gore The Australian National University Volker Haarslev Concordia University George Metcalfe Universitaet Bern Angelo Montanari Universita degli Studi di Udine Barbara Morawska Technische Universitaet Dresden Boris Motik University of Oxford Leonardo de Moura Microsoft Research Neil Murray SUNY at Albany Claudia Nalon Universidade de Brasilia Linh Anh Nguyen Uniwersytet Warszawski Hans de Nivelle Uniwersytet Wroclawski Nicola Olivetti LSIS, Aix-Marseille Universite Jens Otten Universitetet i Oslo Valeria de Paiva Nuance Communications Nicolas Peltier Centre National de la Recherche Scientifique, Laboratoire d'Informatique de Grenoble Elaine Pimentel Universidade Federal do Rio Grande do Norte Giselle Reis Carnegie Mellon University-Qatar Philipp Ruemmer Uppsala Universitet Katsuhiko Sano Hokkaido University Renate Schmidt The University of Manchester Cesare Tinelli The University of Iowa Alwen Tiu Nanyang Technological University David Toman University of Waterloo Josef Urban Ceske vysoke uceni technicke v Praze LOCAL CONFERENCE ORGANIZATION COMMITTEE Claudia Nalon, Universidade de Brasilia, Brazil Daniele Nantes Sobrinho, Universidade de Brasilia, Brazil Elaine Pimentel, Universidade Federal do Rio Grande do Norte, Brazil Joao Marcos, Universidade Federal do Rio Grande do Norte, Brazil CONFERENCE CHAIR Claudia Nalon, University of Brasilia, Brazil PC CHAIRS Claudia Nalon, University of Brasilia, Brazil Renate Schmidt, The University of Manchester, UK -- Elaine. ------------------------------------------------- Elaine Pimentel - DMAT/UFRN Address: Departamento de Matem?tica Universidade Federal do Rio Grande do Norte Campus Universit?rio - Av. Senador Salgado Filho, s/n? Lagoa Nova, CEP: 59.078-970 - Natal - RN Phone: +55 84 3215-3820 <(84)%203215-3820> http://sites.google.com/site/elainepimentel/ Lattes: http://lattes.cnpq.br/3298246411086415 -------------------------------------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: From lutz at lix.polytechnique.fr Mon Mar 6 05:23:03 2017 From: lutz at lix.polytechnique.fr (lutz at lix.polytechnique.fr) Date: Mon, 6 Mar 2017 11:23:03 +0100 Subject: [TYPES/announce] Postdoc position in proof theory in Paris Message-ID: -------------------------------------------------------- Postdoc position in proof theory in Paris -------------------------------------------------------- There is an opening of a postdoc position on structural and computational proof theory. The position is financed by the ANR within the project FISP. The postdoc will be hosted by INRIA and the Laboratoire d'Informatique (LIX) at the Ecole Polytechnique, one of the "Grand Ecoles" in the French university system, located in the suburbs of Paris. The successful candidate will be working within the PARSIFAL team. Starting date should be in Fall 2017. Applicants must have a Ph.D. or equivalent in computer science or mathematics, and should have a strong background in proof theory and related topics. The principal responsibility of the postdoc will be to carry out research in the area of proof theory within the FISP project. There are no teaching duties. For further information, see or contact Lutz Strassburger Applications should be sent via email to Lutz Strassburger and should include a CV, a research statement (1-2 pages), and one or two recommendation letters. The application deadline is *** April 16, 2017 *** From cristi at ifi.uio.no Mon Mar 6 06:08:37 2017 From: cristi at ifi.uio.no (Christian Johansen) Date: Mon, 6 Mar 2017 12:08:37 +0100 Subject: [TYPES/announce] Several positions (PhD/PostDoc) on security and formal modelling and/or programming for IoT and/or CPS in Oslo. Message-ID: <5d8fcce7-088c-00d3-0f03-b99f5c8e492e@ifi.uio.no> __________________________________________________ Several positions (PhD/PostDoc) on security and formal modelling and/or programming for IoT and/or CPS. Dept. of Computer Science, Univeristy of Oslo See details at http://iotsec.no/phd __________________________________________________ The University of Oslo (UiO) increases the focus on security and formal methods applied to Internet of Things (IoT) and Cyber Physical Systems (CPS). Several positions are opened on the topics: * Language-based Security and Analysis * Safety modelling and verification for IoT systems * Privacy and Security for Smart Environments * Security of Communication for IoT and Smart infrastructures * Fine-grained Access Control for e-Health Data ---------------------------------------------------------------------- !! Be aware that when you apply it is important to clearly mark which !! position(s) (and preference order) you are interested in. ---------------------------------------------------------------------- =================== General information =================== The PhD positions are related to both the IoTSec.no initiative and the Strategic Research Initiative ConSeRNS, which is financed in part by the Norwegian Research Council and the University of Oslo. You will work together in a team with national project participants, and international partners, as well as becoming part of the UiO working and student environment. The work will be conducted at UiO (Oslo) in Norway. You will be part of an exciting arena for research and innovation, and have the opportunity to work in an exciting international environment with close contact to Research Institutes and Industry. The PhD students will follow the traditional PhD education at UiO, while there is also the possibility to take up a PhD in close collaboration with an industry partner (Industrial PhD). All PhDs require the admission to the PhD program of the University of Oslo. Salary is after the rules from the state, based on your experience. =============== The application (Norwegian or English) should contain: =============== * CV including names and contact information of two references * List of publications (if applicable) * Transcript of records for PhD applicants * Summary and status of your master thesis (or of PhD thesis in case of Post-doc application) * A statement letter indicating your ideas and interests in one or more of the above topics, and an indication if any other fields are relevant for you. =================== Further information =================== For further information and application through e-mail, please contact: * Olaf Owe, UiO/IFI, m: +47 22852449, olaf at ifi.uio.no * Christian Johansen, UiO/ITS, m: +47 9753 5582, cristi at ifi.uio.no ================= Candidate profile ================= The applicant is required to hold a Master's degree or equivalent in computer science or mathematics and should have good analytical and/or programming skills. The ideal candidate has background in one or more of the areas covered by the above topic titles (see also link above). Besides technical skills, we are looking for a curious, ambitious candidate who is highly motivated to do research and contribute to the work done at our group. Good communication skills in both oral and written English are expected. We strongly encourage that the application is accompanied by a short cover letter explaining shortly how the applicant's background and education fits to the goals and requirements of the project(s)/group/topic. ============= Related links ============= IoTSec project: http://IoTSec.no, More details at http://iotsec.no/phd Institute for Informatics: http://ifi.uio.no Doctoral education at the University of Oslo (UiO), http://www.mn.uio.no/english/research/doctoral-degree-and-career/ ========================== Admission criteria for UiO ========================== The purpose of the Ph.D. fellowship is research training leading to the successful completion of a PhD degree. The fellowship requires admission to the research training program at the Faculty of Mathematics and Natural Sciences. Firstly, the applicants must have obtained undergraduate (Cand.mag., i.e. B.Sc. level) with a level corresponding at least "C" and postgraduate (cand.scient. or Siv.ing., i.e. M.Sc. level) qualifications with a level corresponding at least "B". This represents approximately five years of full time studies after completion of European Upper Secondary School/International Baccalaureate. For more information see: http://www.mn.uio.no/english/research/doctoral-degree-and-career/phd- programme/application/index.html Average grade calculator, to be taken without Master Thesis http://www.uio.no/for-ansatte/arbeidsstotte/sta/fs/veiledninger/opptak /kalkulatorer/kalk.php?type=mn [ Please feel free to distribute this announcement further. ] -- ----------------------------------------------------------------- Have a nice day from Christian Johansen (old name Cristian Prisacariu) member of PMA group (Precise Modeling and Analysis) at Dept. of Informatics, Univ. of Oslo ----------------------------------------------------------------- From christian.retore at lirmm.fr Sun Mar 5 17:51:28 2017 From: christian.retore at lirmm.fr (Christian RETORE) Date: Sun, 5 Mar 2017 23:51:28 +0100 Subject: [TYPES/announce] call for papers: quantifiers and determiners (QUAD, ESSLLI 2017 Workshop) Message-ID: QUAD: QUantifiers And Determiners http://www.lirmm.fr/quad Toulouse, Monday July 17 --- Friday July 21: 17:00-18:30 As part of ESSLLI 2017 Christian Retor?, LIRMM & universit? de Montpellier, Mark Steedman, University of Edinburgh Schedule: deadline for submissions: 17 Mars 2017 submission website: https://easychair.org/conferences/?conf=quad2017 notification to authors: 15 April 2017 final version due: 19 May 2017 conference: 17-21 July 2017 Presentation: The compositional interpretation of determiners relies on quantifiers ? in a general acceptation of this later term which includes generalised quantifiers, generics, definite descriptions i.e. any operation that applies to one or several formulas with a free variable, binds it and yields a formula or possibly a generic term (the operator is then called a subnector, following Curry). There is a long history of quantification in the Ancient and Medieval times at the border between logic and philosophy of language, before the proper formalisation of quantification by Frege. A common solution for natural language semantics is the so-called theory of generalised quantifiers. Quantifiers like ? some, exactly two, at most three, the majority of, most of, few, many, ? ? are all described in terms of functions of two predicates viewed as subsets. Nevertheless, many mathematical and linguistic questions remain open. On the mathematical side, little is known about generalised , generalised and vague quantifiers, in particular about their proof theory. On the other hand, even for standard quantifiers, indefinites and definite descriptions, there exist alternative formulations with choice functions and generics or subnectors (Russell?s iota, Hilbert-Bernays, eta, epsilon, tau). The computational aspects of these logical frameworks are also worth studying, both for computational linguistic software and for the modelling of the cognitive processes involved in understanding or producing sentences involving quantifiers. On the linguistic side, the relation between the syntactic structure and its semantic interpretation, quantifier raising, underspecification, scope issues,? are not fully satisfactory. Furthermore extension of linguistic studies to various languages have shown how complex quantification is in natural language and its relation to phenomena like generics, plurals, and mass nouns. Finally, and this can be seen as a link between formal models of quantification and natural language, there by now exist psycholinguistic experiments that connect formal models and their computational properties to the actual way human do process sentences with quantifiers, and handle their inherent ambiguity, complexity, and difficulty in understanding. All those aspects are connected in the didactics of mathematics and computer science: there are specific difficulties to teach (and to learn) how to understand, manipulate, produce and prove quantified statements, and to determine the proper level of formalisation between bare logical formulas and written or spoken natural language. This workshop aims at gathering mathematicians, logicians, linguists, computer scientists to present their latest advances in the study of quantification. Among the topics that wil be addressed are the following : ? new ideas in quantification in mathematical logic, both model theory and proof theory: ? choice functions, ? subnectors (Russell?s iota, Hilbert?s epsilon and tau), ? higher order quantification, ? quantification in type theory ? studies of the lexical, syntactic and semantic of quantification in various languages ? semantics of noun phrases ? generic noun phrases ? semantics of plurals and mass nouns ? experimental study of quantification and generics ? computational applications of quantification and polarity especially for question-answering. ? quantification in the didactics of mathematics and computer science. Submissions: The program committee is looking for contributions introducing new viewpoints on quantification and determiners, the novelty being either in the mathematical logic framework or in the linguistic description or in the cognitive modelling. Submitting purely original work is not mandatory, but authors should clearly mention that the work is not original, and why they want to present it at this workshop (e.g. new viewpoint on already published results) Submissions should be - 12pt font (at least) - 1inch/2.5cm margins all around (at least) - less than 2 pages (references exluded) - with an abstract of less then 100 words and they should be submitted in PDF by easychair here: https://easychair.org/conferences/?conf=quad2017 In case the committee thinks it is more appropriate, some papers can be accepted as a poster with a lightning talk. Final versions of accepted papers may be slightly longer. They will be published on line. We also plan to publish postproceedings Programme committee: ? Christian Retor? (Universit? de Montpellier & LIRMM-CNRS) ? Mark Steedman (University of Edinburgh) ? Vito Michele Abrusci (Universit? di Roma tre) ? Mathias Baaz (University of Technology, Vienna) ? Daisukke Bekki (Ochanomizu University, Tokyo) ? Oliver Bott (Universit?t T?bingen) ? Francis Corblin (Universit? Paris Sorbonne) ? Martin Hakl (Massachusetts Institute of Technology, Cambridge MA) ? Makoto Kanazawa (National Institute of Informatics, Tokyo) ? Dan Lassiter (Stanford University) ? Zhaohui Luo (Royal Holloway College, London) ? Alda Mari (CNRS Institut Jean Nicod, Paris) ? Wilfried Meyer-Viol (King?s college, London) ? Michel Parigot (CNRS IRIF, Paris) ? Anna Szabolcsi (New-York University) ? Jakub Szymanik (Universiteit van Amsterdam) ? Dag Westerstahl (Stockholm University) ? Bruno Woltzenlogel Paleo (University of Technology, Vienna) ? Richard Zach (University of Calgary) ? Roberto Zamparelli (Universit? di Trento) http://www.lirmm.fr/quad ? Christian Retor? http://www.lirmm.fr/~retore ? Christian Retor? http://www.lirmm.fr/~retore ? Christian Retor? http://www.lirmm.fr/~retore From matthias at ccs.neu.edu Tue Mar 7 13:38:42 2017 From: matthias at ccs.neu.edu (Matthias Felleisen) Date: Tue, 7 Mar 2017 13:38:42 -0500 Subject: [TYPES/announce] Racket summer school [second and last call] Message-ID: <77896ECB-8FA5-4E8D-BCBB-A6DD99F10F74@ccs.neu.edu> The Racket Summer School of Semantics and Languages Imagine yourself confronted with a Mystery Programming Language and charged with the task of figuring out its semantics. What would you do? What if you have a formal executable semantics and want to build a production language for it? If these questions intrigue you, attend the Racket Summer School: http://summer-school.racket-lang.org/2017/ This is not your run-of-the-mill summer school. We will do our best to make it exciting, entertaining, and useful to a broad spectrum of attendees, both academic and industrial. P.S. As soon as you get accepted, we will send you your first problem set. Get ready. From S.J.Thompson at kent.ac.uk Tue Mar 7 14:10:40 2017 From: S.J.Thompson at kent.ac.uk (Simon Thompson) Date: Tue, 7 Mar 2017 19:10:40 +0000 Subject: [TYPES/announce] Professor of Cyber Security at Kent References: <58BE94BD.2010509@kent.ac.uk> Message-ID: We?re looking to appoint a professor of Cyber Security at Kent, to head up our existing group, with its Masters course and research activities. The Cyber Security group also sits alongside our Programming Languages and Systems group, and someone with strengths in PL aspects of security would fit very well. The advert for a Professor of Cyber Security is live at https://jobs.kent.ac.uk/fe/tpl_kent01.asp?s=4A515F4E5A565B1A&jobid=40739,2141233446&key=49639912&c=824734655621&pagestamp=sesmvkldtcboaxhswn and post has been advertised with an associated lectureship in security, so the successful candidate will have a chance to shape that appointment too. If you?re interested, do think about applying, or get in touch with us. I?d be happy to answer emails, as would Richard Jones, head of school: cs-hos AT kent DOT ac DOT uk Simon Simon Thompson | Professor of Logic and Computation School of Computing | University of Kent | Canterbury, CT2 7NF, UK s.j.thompson at kent.ac.uk | M +44 7986 085754 | W www.cs.kent.ac.uk/~sjt -------------- next part -------------- An HTML attachment was scrubbed... URL: From fisman at seas.upenn.edu Mon Mar 6 05:21:26 2017 From: fisman at seas.upenn.edu (Dana Fisman) Date: Mon, 6 Mar 2017 12:21:26 +0200 Subject: [TYPES/announce] SyGuS-COMP 2017 Call for Solvers and Benchmarks Submission Message-ID: SyGuS-COMP 2017 Call for Solvers and Benchmarks Submission 4th Syntax Guided Synthesis Competition Satellite event of CAV and SYNT 2017 http://www.sygus.org/SyGuS-COMP2017.html *Important Dates:* 15 May 2017: Benchmark submission deadline 7 June 2017: Deadline for first version of solvers 14 June 2017: Deadline for final version of solvers and for solver description 14 July 2017: Results published 22 July 2017: Solvers presentation (at SYNT'17) *Call for Participation:*This is a call for participation for the 4th Syntax-Guided Synthesis Competition to be organized as a satellite event of SYNT/CAV 2017. The classical formulation of the program-synthesis problem is to find a program that meets a correctness specification given as a logical formula. Recent work on program synthesis and program optimization illustrates many potential benefits of allowing the user to supplement the logical specification with a syntactic template that constrains the space of allowed implementation. The motivation is twofold. First, narrowing the space of implementations makes the synthesis problem more tractable. Second, providing a specific syntax can potentially lead to better optimizations. The input to the syntax-guided synthesis problem (SyGuS) consists of a background theory, a semantic correctness specification for the desired program given by a logical formula, and a syntactic set of candidate implementations given by a grammar. The computational problem then is to find an implementation from the set of candidate expressions that satisfies the specification in the given theory. There has been a lot of recent interest in both using SyGuS solvers for various synthesis applications and developing different solving algorithms. The SyGuS competition (SyGuS-Comp'17) will allow solvers to compete on a collection of benchmarks and advance the state-of-the-art for program-synthesis tools. The competition is organized as part of NSF Expeditions in Computing project ExCAPE by Rajeev Alur (Penn), Dana Fisman (Ben-Gurion University), Rishabh Singh (Microsoft Research), and Armando Solar-Lezama (MIT). For questions regarding the competition please contact the organizers at sygus-organizers at seas.upenn.edu. *Tracks:*This year's competition will have 4 tracks: 1) General SyGuS track, 2) Invariant Synthesis track, 3) Conditional Linear Integer Arithmetic track, and 4) Programming By Examples (PBE). More details about the tracks can be found in the extended SyGuS-IF . The results of the 3rd SyGuS competition can be found here . *Benchmarks for the competition:*We will evaluate the solvers on a subset of public benchmarks and some secret benchmarks. The domains of benchmarks include bit-vector manipulation, including bit-vector algorithms, concurrency, robotics, string transformations, and invariant generation. We are still finalizing the set of benchmarks, and would appreciate your contribution to the benchmarks as well. *Evaluation:*Evaluation of the solvers will be done on the StarExec system (200 dual quad-core machines with 256GB memory each). The solvers would be run with a TIMEOUT value. The SyGuS-correctness checker, as well as the solvers from last year's competition are available on the SyGuS community at StarExec. Candidate participants are invited to register on StarExec where they can easily compare their solvers to the previous ones against the public benchmarks. The scoring will take into account the number of benchmarks solved, the solving time, and the size of the synthesized solution. *Tool Submission and Description:*We expect the tool developers to test their solvers on the public benchmarks, and submit the solver binaries by the Solver submission deadline. Each solver submission should be accompanied by a 1-2 page (IEEE format) description of the key ideas of the solvers. *Licensing of Tools and Benchmarks:*All benchmarks will be made public after the competition. We encourage the tool developers to make their solvers open-source, but participants are welcomed to submit binaries of proprietary tools as well. -------------- next part -------------- An HTML attachment was scrubbed... URL: From cesar.a.munoz at nasa.gov Tue Mar 7 14:56:48 2017 From: cesar.a.munoz at nasa.gov (Munoz, Cesar (LARC-D320)) Date: Tue, 7 Mar 2017 19:56:48 +0000 Subject: [TYPES/announce] [fm-announcements] ITP 2017 - Final Call for Papers Message-ID: <44FBC8A0-9F3A-4151-B7A5-861BB7B77484@nasa.gov> *** Apologies for multiple copies, please redistribute *** FINAL CALL FOR PAPERS ITP 2017 8th International Conference on Interactive Theorem Proving Brasilia, Brazil September 26-29, 2017 http://itp2017.cic.unb.br SUBMISSION DEADLINES * April 3, 2017 (abstracts) * April 10, 2017 (full papers) GENERAL INFORMATION The ITP conference series is concerned with all topics related to interactive theorem proving, ranging from theoretical foundations to implementation aspects and applications in program verification, security, and formalization of mathematics. ITP is the evolution of the TPHOLs conference series to the broad field of interactive theorem proving. TPHOLs meetings took place every year from 1988 until 2009. The eighth ITP conference, ITP 2017, will be held at Universidade de Brasilia, September 26-29, 2017. SCOPE OF CONFERENCE ITP welcomes submissions describing original research on all aspects of interactive theorem proving and its applications. Suggested topics include but are not limited to the following: * formal aspects of hardware and software * formalizations of mathematics * improvements in theorem prover technology * user interfaces for interactive theorem provers * formalizations of computational models * verification of security algorithms * use of theorem provers in education * industrial applications of interactive theorem provers * concise and elegant worked examples of formalizations (proof pearls) PUBLICATION DETAILS The proceedings of the symposium will be published in the Springer's LNCS series. ** After the conference the authors of selected papers will be invited to submit revised papers for a special issue of the Journal of Automated Reasoning. ** PAPER SUBMISSIONS All submissions must be original, unpublished, and not submitted concurrently for publication elsewhere. Furthermore, when appropriate, submissions are expected to be accompanied by verifiable evidence of a suitable implementation, such as the source files of a formalization for the proof assistant used. Submissions should be no more than 16 pages in length and are to be submitted in PDF via EasyChair at the following address: https://easychair.org/conferences/?conf=itp2017 Submissions must conform to the LNCS style in LaTeX. Authors of accepted papers are expected to present their paper at the conference and will be required to a sign copyright release form. In addition to regular papers, described above, there will be a rough diamond section. Rough diamond submissions are limited to 6 pages and may consist of an extended abstract. They will be refereed and be expected to present innovative and promising ideas, possibly in an early form and without supporting evidence. Accepted diamonds will be published in the main proceedings and will be presented as short talks. IMPORTANT DATES Abstract submission deadline: April 3, 2017 Full paper submission deadline: April 10, 2017 Author notification: June 2, 2017 Camera-ready papers: June 30, 2017 Workshops & Tutorials: September 23-25, 2017 Conference: September 26-29, 2017 INVITED SPEAKERS Moa Johansson, Chalmers University of Technology, Sweden Leonardo de Moura, Microsoft Research Cezary Kaliszyk, Universitaet Innsbruck, Austria (joint with TABLEAUX and FroCos) Katalin Bimbo, University of Alberta, Canada (joint with TABLEAUX and FroCos) Jasmin Blanchette, Inria and LORIA, Nancy, France (joint with TABLEAUX and FroCos) WORKSHOPS AND TUTORIALS There will be a three-day programme of four workshops and four tutorials from 23-25 September. Workshops: 12th Logical and Semantic Frameworks with Applications (LSFA 2017) Sandra Alves, Renata Wassermann, Flavio L. C. de Moura 23 and 24 September 2017 Proof eXchange for Theorem Proving (PxTP) Catherine Dubois, Bruno Woltzenlogel Paleo 23 and 24 September 2017 EPS - Encyclopedia of Proof Systems Giselle Reis, Bruno Woltzenlogel Paleo 24 and 25 September 2017 DaLi - Dynamic Logic: new trends and applications Mario Benevides, Alexandre Madeira 24 September 2017 Tutorials: General methods in proof theory for modal and substructural logics Bjoern Lellmann, Revantha Ramanayake 23 September 2017 From proof systems to complexity bounds Anupam Das 24 September 2017 Proof Compressions and the conjecture NP =3D PSPACE Lew Gordeev, Edward Hermann Haeusler 25 September 2017 PVS for Computer Scientists Cesar Munoz, Mauricio Ayala-Rincon, Mariano Moscato 25 September 2017 Details will be published in separate calls and on the conference website. PROGRAM COMMITTEE CHAIRS Mauricio Ayala-Rincon, U. Brasilia Cesar Munoz, NASA PROGRAM COMMITTEE Maria Alpuente, T.U. Valencia Vander Alves, U. Brasilia June Andronick, Data61, CSIRO, UNSW Jeremy Avigad, Carnegie Mellon U. Sylvie Boldo, INRIA LRI Ana Bove, Chalmers & Gothenburg U. Adam Chlipala, MIT Gilles Dowek, INRIA, ENS Cachan Aaron Dutle, NASA Amy Felty, U. Ottawa Marcelo Frias, I.T. Buenos Aires Ruben Gamboa, U. Wyoming Herman Geuvers, Radboud U. Elsa Gunter, U. Illinois U.C. John Harrison, Intel Corporation Nao Hirokawa, JAIST Matt Kaufmann, U. Texas Austin Mark Lawford, McMaster U. Andreas Lochbihler, ETH Zurich Assia Mahboubi, INRIA Panagiotis Manolios, Northeastern U. Gopalan Nadathur, U. Minnesota Keiko Nakata, SAP Potsdam Adam Naumowicz, U. Bialystok Tobias Nipkow, T.U. Munich Scott Owens, U. Kent Sam Owre, SRI Lawrence Paulson, U. Cambridge Leila Ribeiro, U.F. Rio Grande do Sul Claudio Sacerdoti Coen, U. Bologna Augusto Sampaio, U.F. Pernambuco Monika Seisenberger, Swansea U. Christian Sternagel, U. Innsbruck Sofiene Tahar, Concordia U. Christian Urban, King's College London Josef Urban, Czech T.U. Prague CONTACT INFORMATION itp2017 at easychair.org http://itp2017.cic.unb.br --- To opt-out from this mailing list, send an email to fm-announcements-request at lists.nasa.gov with the word 'unsubscribe' as subject or in the body. You can also make the request by contacting fm-announcements-owner at lists.nasa.gov From tmoldere at vub.ac.be Thu Mar 9 08:59:26 2017 From: tmoldere at vub.ac.be (Tim Molderez) Date: Thu, 9 Mar 2017 14:59:26 +0100 Subject: [TYPES/announce] 2017: Call for participation Message-ID: <288d4b5d-c924-b607-5321-22dfeb7c67a0@vub.ac.be> ----------------------------------------------------------------------- 2017 : The Art, Science, and Engineering of Programming April 3-6, 2017, Brussels, Belgium http://2017.programming-conference.org ----------------------------------------------------------------------- We are excited to welcome you to 2017, a new conference focused on everything to do with programming. It takes place at the Vrije Universiteit Brussel, Belgium on April 3-6. The conference is closely associated with the open-access journal "The Art, Science, and Engineering of Programming".? The journal's first two issues form the conference's research track, which means you can freely access all papers presented at the conference before it even starts! Along with the research track, 2017 features a program with two main keynotes, two symposia, eight workshops, a coding dojo, a demo track, and a student research competition. To catch a glimpse of what 2017 has to offer, feel free to have a look at our overview video: https://www.youtube.com/watch?v=GM_hLNW4ioE *********************************************************************** Program highlights *********************************************************************** Main conference: - Keynote: "Live Literate Programming" by Gilad Bracha - Keynote: "How Racket Went Meta" by Matthew Flatt - Research track: 18 full papers - Demonstrations: 10 tool demos - ACM Student Research Competition: 8 entries Co-located events: - 10th European Lisp Symposium: 2 keynotes by Hans H?bner and Bohdan Khomtchouk, ~18 papers (not final yet) - Modularity 2017: 8 invited talks by J?rg Kienzle, Shmuel Katz, Mira Mezini, Bedir Tekinerdogan, St?phane Ducasse, Uwe A?mann, Lodewijk Bergmans and Mario S?dholt - CoCoDo - RainCode Labs Compiler Coding Dojo: code together with experts Adrian Johnstone, Elizabeth Scott, Robby Findler, and more to come! - LASSY - Workshop on Live Adaptation of Software SYstems - MiniPLoP - Mini Pattern Languages of Programs writers' workshop - MOMO - Workshop on Modularity in Modeling - MoreVMs - Workshop on Modern Language Runtimes, Ecosystems, and VMs - PASS - Workshop on Programming Across the System Stack - PX - Workshop on Programming Experience - ProWeb - Programming Technology for the Future Web - Salon des Refus?s workshop Social events: - Beer reception at the conference venue (April 3rd) - Reception at the Musical Instruments Museum (April 4th) - Banquet at the Natural Sciences Museum (April 5th) *********************************************************************** Registration, attendance and accommodation *********************************************************************** - You can register for 2017 at: http://2017.programming-conference.org/attending/registration - Early registration ends soon! Please register before March 13th to obtain the early-bird discount. - More information on attending the conference is available at: http://2017.programming-conference.org/attending/reaching-the-conference - More information on accommodation is available at: http://2017.programming-conference.org/attending/accomodation *********************************************************************** About Brussels *********************************************************************** Brussels is the capital of Belgium, and home to the headquarters of the European Union. Despite its European nature and all the different languages spoken on every street corner, Brussels still has a very "village-like"? character. It's well known for its Grand-Place, its Atomium, its Manneken-Pis, its Gueuze and its Kriek, its waffles and its chocolates. Be sure to take some time off to soak up the special atmosphere of its many different districts: Take a stroll to Rue Dansaert, Halles Saint-G?ry, and Place Sainte-Catherine. Head for Saint-Boniface, Ch?telain, or Flagey. In other words, go ahead and relish Brussels, a fine and beautiful city to explore and discover. ----------------------------------------------------------------------- For more information, please visit http://2017.programming-conference.org You can also find us on Twitter (twitter.com/programmingconf) and Facebook (facebook.com/programmingconf) Looking forward to see you in Brussels, Theo D'Hondt (General chair), Wolfgang De Meuter (Organizing chair), Crista Lopes (Program chair), J?rg Kienzle, Ralf L?mmel, Hidehiko Masuhara, Tim Molderez, Tobias Pape, and Jennifer Sartor From P.B.Levy at cs.bham.ac.uk Wed Mar 8 13:51:43 2017 From: P.B.Levy at cs.bham.ac.uk (Paul B Levy) Date: Wed, 8 Mar 2017 18:51:43 +0000 Subject: [TYPES/announce] Birmingham Fellows: prestige posts available In-Reply-To: References: Message-ID: <4b805687-0712-c57c-ad80-7f23e0977764@cs.bham.ac.uk> Permanent appointments with 5 years protected time for high-quality research Closing date: 31 March 2017 ------ Birmingham University has made a call for applications to its "Birmingham Fellowship" posts, 40 in all across the University: http://www.birmingham.ac.uk/staff/excellence/fellows/index.aspx Despite the name these are permanent appointments, but with the first 5 years being protected time for high-quality research. I'm sending this message on behalf of the Theory Group in the School of Computer Science, to encourage applicants. The Theory group specializes in bringing together diverse areas of mathematics (such as logic, type theory, category theory, topology), generally for applications to computer science (such as programming languages and their semantics), but also for the intrinsic interest of the mathematical interactions. If you don't already know of our work, you can see more on our group page http://www.cs.bham.ac.uk/research/groupings/theory/index.php and on our individual pages linked from there. You are welcome to make informal approaches to any of us. Dr Noam Zeilberger , who was appointed as a Birmingham Fellow in 2016 after research positions at INRIA in Paris, can give you insights into how the scheme works in practice. From sandra at dcc.fc.up.pt Thu Mar 9 10:25:18 2017 From: sandra at dcc.fc.up.pt (Sandra Alves) Date: Thu, 9 Mar 2017 15:25:18 +0000 Subject: [TYPES/announce] LSFA'17: Second Call for Papers Message-ID: <700487C2-AAF7-4025-8516-EB711EF26BB9@dcc.fc.up.pt> *** Apologies for multiple copies, please redistribute *** CALL FOR PAPERS 12th Workshop on Logical and Semantic Frameworks, with Applications 23-24 September 2017, Bras?lia, Brazil Satellite event of TABLEAUX, FroCoS, and ITP 2017 http://lsfa2017.cic.unb.br/ Logical and semantic frameworks are formal languages used to represent logics, languages and systems. These frameworks provide foundations for the formal specification of systems and programming languages, supporting tool development and reasoning. LSFA 2017 aims to be a forum for presenting and discussing work in progress, and therefore to provide feedback to authors on their preliminary research. The proceedings are produced after the meeting, so that authors can incorporate this feedback in the published papers. LSFA 2017 will be a satellite event of TABLEAUX, FroCoS, and ITP -- to be held in Bras?lia, Brazil, between 25 and 29 September 2017. Previous editions took place in Porto (2016), Natal (2015), Bras?lia (2014), Sao Paulo (2013), Rio de Janeiro (2012), Belo Horizonte (2011), Natal (2010), Bras?lia (2009), Salvador (2008), Ouro Preto (2007), and Natal (2006). TOPICS OF INTEREST Topics of interest to this forum include, but are not limited to: * Automated deduction * Applications of logical and/or semantic frameworks * Computational and logical properties of semantic frameworks * Formal semantics of languages and systems * Implementation of logical and/or semantic frameworks * Lambda and combinatory calculi * Logical aspects of computational complexity * Logical frameworks * Process calculi * Proof theory * Semantic frameworks * Specification languages and meta-languages * Type theory SUBMISSION AND PUBLICATION Contributions should be written in English and submitted in the form of full papers with a maximum of 16 pages including references or short papers with a maximum of 6 pages including references. Additional technical material can be provided in a clearly marked appendix which will be read by reviewers at their discretion. Contributions must also be unpublished and not submitted simultaneously for publication elsewhere. The papers should be prepared in LaTeX using ENTCS style (http://www.entcs.org/prelim.html ). The submission should be in the form of a PDF file uploaded to Easychair: https://easychair.org/conferences/?conf=lsfa2017 The workshop pre-proceedings, containing the reviewed extended abstracts, will be handed-out at workshop registration. After the workshop the authors of both full and short papers will be invited to submit full versions of their works for the post-proceedings to be published in ENTCS. At least one of the authors should register for the conference. Presentations should be in English. * Submission: 21 June 2017 * Notification: 21 July 2017 * Final pre-proceedings version due: 11 August 2017 * LSFA 2017 23-24 September 2017 According to the quality of proceedings, authors will/would/might be invited to submit an improved version of their paper for a special issue. Previous LSFA special issues have been published in journals such as J. IGPL and TCS (see http://lsfa.cic.unb.br ). INVITED SPEAKERS * H?l?ne Kirchner * TBA * TBA PROGRAMME COMMITTEE * Sandra Alves, University of Porto - co-chair * Renata Wassermann, University of S?o Paulo - co-chair * Fl?vio L. C. de Moura, Universidade de Bras?lia - local organiser * Carlos Areces, Universidad Nacional de C?rdoba * Mauricio Ayala-Rincon, Universidade de Brasilia * Veronica Becher, Universidad de Buenos Aires * Mario Benevides, Universidade Federal do Rio de Janeiro UFRJ * Walter Carnielli, Centre for Logic, Epistemology and the History of Science ? CLE * Carlos Castro, UT Federico Santa Maria * Kaustuv Chaudhuri, INRIA * Marcelo Coniglio, UNICAMP * Valeria De Paiva, University of Birmingham * Santiago Escobar, Universitat Polit?cnica de Val?ncia * Amy Felty, University of Ottawa * Maribel Fern?ndez, King's College London * Marcelo Finger, Universidade de Sao Paulo * Ichiro Hasuo, University of Tokyo * Edward Hermann Haeusler, PUC-Rio * Delia Kesner, Universit? Paris-Diderot * Bjoern Lellmann, TU Vienna * Vivek Nigam, Universidade Federal da Para?ba * Jorge A. P?rez, University of Groningen and CWI, Amsterdam * Petrucio Viana, Universidade Federal Fluminense * Elaine Pimentel, UFRN * Giselle Reis, CMU-Qatar * Camilo Rocha, Pontificia Universidad Javeriana Cali * Simona Ronchi Della Rocca, Universita' di Torino * Alvaro Tasistro, Universidad ORT Uruguay * Christian Urban, King's College London ORGANISING COMMITTEE * Fl?vio L. C. de Moura (Universidade de Bras?lia) CONTACT * lsfa2017 at easychair.org * http://lsfa2017.cic.unb.br/ ------------------------------------------------- Sandra Alves Assistant Professor, University of Porto, Portugal sandra at dcc.fc.up.pt http://www.dcc.fc.up.pt/~sandra Renata Wassermann Associate Professor, University of S?o Paulo, Brazil renata at ime.usp.br http://www.ime.usp.br/~renata/ -------------------------------------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: From shankar at csl.sri.com Sun Mar 12 15:42:51 2017 From: shankar at csl.sri.com (Natarajan Shankar) Date: Sun, 12 Mar 2017 12:42:51 -0700 Subject: [TYPES/announce] Seventh Summer School on Formal Techniques, May 21 - May 26, 2017, Atherton, California Message-ID: <58C5A4BB.4090709@csl.sri.com> Seventh Summer School on Formal Techniques, May 21 - May 26, 2017 Menlo College Atherton, California http://fm.csl.sri.com/SSFT17 Lecturers: Stephanie Delaune (IRISA France), Marijn Heule (University of Texas at Austin), K. Rustan M. Leino (Microsoft Research, Redmond WA), Sam Blackshear (Facebook), and Ashish Tiwari (SRI) Techniques based on formal logic, such as model checking, satisfiability, static analysis, and automated theorem proving, are finding a broad range of applications in modeling, analysis, verification, and synthesis. This school, the sixth in the series, will focus on the principles and practice of formal techniques, with a strong emphasis on the hands-on use and development of this technology. It primarily targets graduate students and young researchers who are interested in studying and using formal techniques in their research. A prior background in formal methods is helpful but not required. Participants at the school will have a seriously fun time experimenting with the tools and techniques presented in the lectures during laboratory sessions. The lecturers at the school include: * Stephanie Delaune (IRISA France): Verification of security protocols: from confidentiality to privacy Abstract: Security protocols are widely used today to secure transactions that take place through public channels like the Internet. Typical functionalities are the transfer of a credit card number or the authentication of a user on a system. Because of their increasing ubiquity in many important applications (e.g. electronic commerce, smartphone, government-issued ID . . . ), a very important research challenge consists in developing methods and verification tools to increase our trust on security protocols, and so on the applications that rely on them. Formal methods offer symbolic models to carefully analyse security protocols, together with a set of proof techniques and efficient tools such as ProVerif. These methods build on techniques from model-checking, automated reasoning and concurrency theory. We will explain how security protocols as well as the security properties they are supposed to achieve are formalised in symbolic models. Then, we will describe and discuss techniques to automatically verify different kinds of security properties. The lab sessions will be the opportunity to play with the ProVerif verification tool. * Marjijn Heule (University of Texas at Austin): State-of-the-art SAT Solving Abstract: Satisfiability (SAT) solvers have become powerful search engines to solve a wide range of applications in fields such as formal verification, planning and bio-informatics. Due to the elementary representation of SAT problems, many low-level optimizations can be implemented. At the same time, there exist clause-based techniques that can simulate several high-level reasoning methods. The teaching session focuses on the search procedures in successful conflict-driven clause learning SAT solvers. It shows how to learn from conflicts and provides an overview of effective heuristics for variable and value selection. Additionally, the teaching session covers recent developments, in particular a technique used in today's strongest solvers: the alternation between "classic" depth-first search with learning, and breadth-first search for simplification. * K. Rustan M. Leino (Microsoft Research, Redmond WA): Verified programs and proofs in Dafny Abstract: In these lectures, you will learn and practice the foundations of program verification, like pre- and postcondition specifications, loop invariants, termination, proofs, and induction. Dafny is a programming language that includes specifications and proof-authoring features. The lectures and labs will give you hands-on experience in using the Dafny to write and specify programs, both imperative and functional, and to write mechanically checked proofs. * Sam Blackshear (Facebook): Building compositional static analyzers with Infer Abstract: Infer is an open-source static analysis tool used to find bugs in Java, Objective-C, and C++ code at Facebook. Recently, Infer has transitioned from a standalone separation logic-based analyzer into a general framework for quickly developing modular and compositional interprocedural analyses. The framework lifts a simple intraprocedural abstract interpreter that computes the summary for a single procedure to a compositional interprocedural analysis that scales to millions of lines of code. * Ashish Tiwari (SRI International Computer Science Laboratory): Formal Techniques for Analyzing Hybrid Systems Abstract: Hybrid dynamical systems combine discrete state transition systems with continuous dynamical systems. They are used to model complex systems that have interacting discrete and continuous components, or systems that are broadly referred to as cyber-physical systems. This course will cover the basics of hybrid systems, and it will delve deeper into the verification problem and the various approaches for analyzing hybrid systems. The lab sessions will involve using tools for verification of hybrid systems. The main lectures in the summer school will be preceded by a background course on logic taught by Natarajan Shankar (SRI)and Stephane Graham-Lengrand (Ecole Polytechnique) on * Speaking Logic Abstract: Formal logic has become the lingua franca of computing. It is used for specifying digital systems, annotating programs with assertions, defining the semantics of programming languages, and proving or refuting claims about software or hardware systems. Familiarity with the language and methods of logic is a foundation for research into formal aspects of computing. This course covers the basics of logic focusing on the use of logic as a medium for formalization and proof. Note: The school is preceded by the 9th NASA Formal Methods Symposium (NFM) 2017 (https://ti.arc.nasa.gov/events/nfm-2017/) and the associated sixth Automated Formal Methods (AFM) 2017 (http://fm.csl.sri.com/AFM17/) workshop. On May 20 there will be an AFM tutorial day that students are encouraged to attend. Information about previous Summer Schools on Formal Techniques can be found at http://fm.csl.sri.com/SSFT11 http://fm.csl.sri.com/SSFT12 http://fm.csl.sri.com/SSFT13 http://fm.csl.sri.com/SSFT14 http://fm.csl.sri.com/SSFT15 http://fm.csl.sri.com/SSFT16 We expect to provide support for the travel and accommodation for a limited number of students registered at US universities, but welcome applications from non-US students as well as non-students (if space permits). Non-US students will have to cover their own travel and will be charged around US$600 for meals and lodging. Applications should be submitted at the website http://fm.csl.sri.com/SSFT17 Applicants are urged to submit their applications before April 30, 2017, since there are only a limited number of spaces available. Non-US applicants requiring US visas are requested to apply early. We strongly encourage the participation of women and under-represented minorities in the summer school. From rlc3 at leicester.ac.uk Sun Mar 12 15:09:18 2017 From: rlc3 at leicester.ac.uk (Roy L. Crole) Date: Sun, 12 Mar 2017 19:09:18 +0000 Subject: [TYPES/announce] ** Final Call ** for Midlands Graduate School 2017, Leicester, UK - Registration closes 20 Mar 2017 In-Reply-To: References: Message-ID: This is a final call for participation. Registration is open until March 20 2017, but book soon to avoid disappointment. *The Midlands Graduate School in the Foundations of Computing Science 2017* * April 9-13, Leicester, UK* ( http://www.cs.le.ac.uk/events/mgs2017/ ) The MGS has run very successfully for many years now, and in recent years we have had over 50 participants making for exciting and vibrant schools. We would be delighted to see you in Leicester in 2017. The registration fees include ALL meals; dinners are provided and many members of the lecturing team will be available for discussions during the evenings. Please forward to all those you think will be interested! The organisers: Samuel Balco Roy Crole -- R. L. Crole Associate Professor Department of Informatics University Road University of Leicester Leicester LE1 7RH United Kingdom T: +44 (0)116 252 3404 E: rlc3 at le.ac.uk W: www.cs.le.ac.uk/people/rlc3 Times Higher Awards Winner 2007-2015 -------------- next part -------------- An HTML attachment was scrubbed... URL: From herman at cs.ru.nl Sat Mar 11 11:07:34 2017 From: herman at cs.ru.nl (Herman Geuvers) Date: Sat, 11 Mar 2017 17:07:34 +0100 Subject: [TYPES/announce] 2nd Call for Papers - 10th Conference on Intelligent Computer Mathematics - CICM 2017 - Abstract Submission Deadline 15. March 2017 Message-ID: <8a59db0e-71a2-957e-6986-b39999f33b4b@cs.ru.nl> Second Call for Papers 10th Conference on Intelligent Computer Mathematics - CICM 2017 - July 17-21, 2017 University of Edinburgh, Scotland http://www.cicm-conference.org/2017 ---------------------------------------------------------------------- NEW * Invited Speakers: Alan Bundy (University of Edinburgh) and Grant Olney Passmore (University of Cambridge) ---------------------------------------------------------------------- Digital and computational solutions are becoming the prevalent means for the generation, communication, processing, storage and curation of mathematical information. Separate communities have developed to investigate and build computer based systems for computer algebra, automated deduction, and mathematical publishing as well as novel user interfaces. While all of these systems excel in their own right, their integration can lead to synergies offering significant added value. The Conference on Intelligent Computer Mathematics (CICM) offers a venue for discussing and developing solutions to the great challenges posed by the integration of these diverse areas. CICM has been held annually as a joint meeting since 2008, co-locating related conferences and workshops to advance work in these subjects. Previous meetings have been held in Birmingham (UK 2008), Grand Bend (Canada 2009), Paris (France 2010), Bertinoro (Italy 2011), Bremen (Germany 2012), Bath (UK 2013), Coimbra (Portugal 2014), Washington DC (USA 2015) and Bialystok (Poland 2016). This is a call for papers for CICM 2017, which will be held in Edinburgh, Scotland, July 17-21, 2017. CICM 2017 also invites work-in- progress papers. The principal tracks of the conference will be: * Track: Calculemus (chair: Matthew England) All topics in the intersection of computer algebra systems and automated reasoning systems including: - Automated theorem proving in computer algebra systems. - Computer algebra and symbolic computation in theorem proving systems. - Theory, design and implementation of interdisciplinary systems for computer mathematics. - Case studies and applications that involve a mix of computation and reasoning. - Case studies in formalization of mathematical theories that include non-trivial computations. - Representation of mathematics in computer algebra systems. - Input languages, programming languages, types and constraint languages, and modeling languages for mathematical assistant systems. * Track: Digital Mathematical Libraries (DML) (chair: Olaf Teschke) All topics related to the formation of a Global Digital Mathematics Library (GDML) network, ranging from experiences from existing DMLs, policies and standards facilitating interoperability, to development and integration of new techniques for content creation, preservation, enhancement and retrieval of the corpus, including: - DML creation and maintenance (content aggregation, validation, curation, enhancement). - DML architecture and representations (organization, workflows, policies, standards). - DML access and applications (retrieval, interfaces, interoperability). - DML collections and systems (experiences from various existing DMLs). * Track: Mathematical Knowledge Management (MKM) (chair: Florian Rabe) - Knowledge representation using, e.g., formal logics, computational systems, narrative document formats, or databases - Solutions to create, store, disseminate, discover, or manipulate mathematical knowledge - Corpora of knowledge inlcuding documents, theories, theorems, proofs, models, algorithms, exercises, or examples - Methods, systems, frameworks, case studies, challenges, benchmarks, or applications for mathematical knowledge - Comparisons, evaluations, or integrations of MKM solutions * Track: Systems & Projects (chair: Osman Hasan) - Systems: Stand-alone; plugins, libraries, or extensions of existing systems; or integrations of existing systems - Data: Formalizations; harvests or new processing of existing data; or case studies, test cases, or benchmark suites for systems - Projects: finished, ongoing or new - Survey papers * Track: Doctoral Programme (chair: TBD) The overall programme is organized by the General Program Chair Herman Geuvers. The local arrangements will be coordinated by Jacques Fleuriot. The publicity chair is Serge Autexier. We plan to have proceedings of the conference as in previous years with Springer Verlag as a volume in Lecture Notes in Artificial Intelligence (LNAI). *Important Dates* Conference submissions - Abstract submission deadline: 15. March 2017 - Submission deadline: 22. March 2017 - Reviews sent to authors: 26. April 2017 - Rebuttals due: 30. April 2017 - Notification of acceptance: 12. May 2017 - Camera ready copies due: 26. May 2017 - Conference: 17.-21. July 2017 Workshop Proposals - Submission deadline: 10. February 2017 - Notification of acceptance: 15. February 2017 More details on the conference are available from http://www.cicm-conference.org/2017 From fisman at seas.upenn.edu Fri Mar 10 12:00:28 2017 From: fisman at seas.upenn.edu (Dana Fisman) Date: Fri, 10 Mar 2017 19:00:28 +0200 Subject: [TYPES/announce] SYNT 2017: Call for Papers Message-ID: ---------------------------------------------------------------------- SYNT 2017 - Call For Papers 6th Workshop on Synthesis a satellite event of CAV'17 Heidelberg, Germany, July 22, 2017 https://www.react.uni-saarland.de/synt2017/ ---------------------------------------------------------------------- The workshop aims to bring together researchers interested in the broad area of synthesis of computing systems. The workshop aims to foster the development of frontier techniques in automating the development of computing systems and is inclusive in its interpretation of the term synthesis. Topics of interest include, but are not limited to: * algorithms and tools for software synthesis and reactive (discrete-time, timed, hybrid, ...) synthesis, * specification languages and optimization in synthesis, * complexity and decidability results for synthesis, * case studies of software or hardware synthesis, * connections between verification and synthesis, * synthesis by model learning, * connections between synthesis and inductive programming, * new approaches or applications for synthesis, * description and analysis of benchmark families for synthesis. ---------------------------------------------------------------------- We welcome scientific contributions of the following forms: * regular papers (max. 15 pages in EPTCS style, excluding references) * tool papers (max. 7 pages in EPTCS style, excluding references) Submitted regular and tool papers must be original and unpublished. Accepted papers will appear in the Electronic Proceedings in Theoretical Computer Science series; hence, submissions must be prepared in LaTeX using the EPTCS macro package. Given sufficient interest, extended versions of selected papers will appear in a special issue of the journal Acta Informatica. ---------------------------------------------------------------------- Important dates: Paper submission: May 1, 2017 Author notification: May 29, 2017 Workshop: July 22, 2017 ---------------------------------------------------------------------- Program Committee: * Roderick Bloem (Graz University of Technology) * Swarat Chaudhuri (Rice University) * Pedro D'Argenio (Universidad Nacional de Cordoba) * Rayna Dimitrova (MPI-SWS) * R?diger Ehlers (University of Bremen) * Bernd Finkbeiner (Saarland University) * Dana Fisman (co-chair, Ben-Gurion University) * Swen Jacobs (co-chair, Saarland University) * St?phane Lafortune (University of Michigan) * Alessio Lomuscio (Imperial College, London) * Doron Peled (Bar-Ilan University) * Ruzica Piskac (Yale University) * Nadia Polikarpova (Massachusetts Institute of Technology) * Arjun Radhakrishna (University of Pennsylvania) * Veselin Raychev (ETH Zurich) * Roopsha Samanta (Purdue University) * Ocan Sankur (Irisa Rennes) * Sven Schewe (University of Liverpool) * Armando Solar-Lezama (MIT) * Ufuk Topcu (University of Texas at Austin) * Frits Vaandrager (University of Washington) * Damien Zufferey (MPI-SWS) Program Chairs: * Dana Fisman (Ben-Gurion University) * Swen Jacobs (Saarland University) ---------------------------------------------------------------------- Keynote talk by Rupak Majumdar (Max Planck Institute for Software Systems). Additional invited speakers will be announced soon. ---------------------------------------------------------------------- The SYNT 2017 workshop is kindly supported by the Austrian National Research Network RiSE: Rigorous Systems Engineering. -------------- next part -------------- An HTML attachment was scrubbed... URL: From elias.castegren at it.uu.se Fri Mar 10 10:03:10 2017 From: elias.castegren at it.uu.se (Elias Castegren) Date: Fri, 10 Mar 2017 15:03:10 +0000 Subject: [TYPES/announce] Call for Papers: IWACO 2017 Message-ID: <430DC7BD-E425-4310-915E-10DFC9344CF3@it.uu.se> 8th IWACO International Workshop on Aliasing, Capabilities and Ownership (IWACO) Co-located with ECOOP Monday June 19th, 2017, Barcelona, Spain http://2017.ecoop.org/track/iwaco-2017-papers ## Important Dates: Paper submission: April 26th, 2017 Notification: May 25th, 2017 Final version: June 8th, 2017 Workshop: June 19th, 2017 (All deadlines AoE) ## Aim and Scope Stable object identity and shared mutable state are two powerful principles in object oriented programming. The ability to create aliases to mutable objects allows a direct modelling of sharing that occurs naturally in a domain, and lies at the heart of efficient programming patterns where aliases provide shortcuts to key places in a data structure. In a concurrent setting however, aliasing is at the root of data-races and low-level bugs as multiple threads can directly access shared objects. Coping with pointers, aliasing and the proliferation of shared mutable state is a problem that crosscuts the software development stack, from compilers and run-times to bug-finding tools and end-user software. They complicate modular reasoning and program analysis, efficient code generation, efficient use of memory, and obfuscate program logic. Several techniques have been introduced to describe and reason about stateful programs, and to restrict, analyze, and prevent aliases. These include various forms of ownership types, capabilities, separation logic, linear logic, uniqueness, sharing control, escape analysis, argument independence, read-only references, linear references, effect systems, and access control mechanisms. These tools have found their way into type systems, compilers and interpreters, run-time systems and bug-finding tools. IWACO?17 will focus on these techniques, on how they can be used to reason about stateful (sequential or concurrent) programs, and how they have been applied to programming languages. In particular, we will consider papers on: - models, type systems and other formal systems, programming language mechanisms, analysis and design techniques, patterns and notations for expressing ownership, aliasing, capabilities, uniqueness, and related topics; - empirical studies of programs or experience reports from programming systems designed with these techniques in mind; - programming logics that deal with aliasing and/or shared state, or use ownership, capabilities or resourcing; - applications of capabilities, ownership and other similar type systems in low-level systems such as programming languages runtimes, virtual machines, or compilers; and - optimization techniques, analysis algorithms, libraries, applications, and novel approaches exploiting ownership, aliasing, capabilities, uniqueness, and related topics. ## Submissions Contributions may be submitted in two formats: - Short papers (up to 3 pages, excluding references and clearly marked appendices) describing new ideas and open questions for discussion. - Full papers (up to 8 pages, excluding references and clearly marked appendices) describing (preliminary) research results. Submissions must be in English and use the LNCS template. Papers must be submitted via https://easychair.org/conferences/?conf=iwaco2017, by April 26th. There will be a post-proceedings special issue at JOT (http://www.jot.fm) for full papers, which will be subject to a further round of reviews. ## Organizing Committee Elias Castegren (Uppsala University, Sweden) elias.castegren at it.uu.se Juliana Franco (Imperial College London, United Kingdom) j.vicente-franco at imperial.ac.uk ## Workshop Program committee Colin Gordon (Drexel University, United States) Philipp Haller (KTH Royal Institute of Technology, Sweden) Tony Hosking (Australian National University, Data61, and Purdue University, United States) Felix Klock (Mozilla Corporation) James Noble (Victoria University of Wellington, New Zealand) Azalea Raad (Imperial College London, United Kingdom) -------------- next part -------------- An HTML attachment was scrubbed... URL: From kaposi.ambrus at gmail.com Mon Mar 13 17:25:48 2017 From: kaposi.ambrus at gmail.com (Ambrus Kaposi) Date: Mon, 13 Mar 2017 22:25:48 +0100 Subject: [TYPES/announce] TYPES 2017 submission deadline extended Message-ID: [Submission deadline extended by a week to 20 March 2017. Consider contributing!] CALL FOR CONTRIBUTIONS 23rd International Conference on Types for Proofs and Programs, TYPES 2017 and EUTYPES Cost Action CA15123 meeting Budapest, Hungary, 29 May - 1 June 2017 http://types2017.elte.hu BACKGROUND The TYPES meetings are a forum to present new and on-going work in all aspects of type theory and its applications, especially in formalised and computer assisted reasoning and computer programming. The TYPES areas of interest include, but are not limited to: * foundations of type theory and constructive mathematics; * applications of type theory; * dependently typed programming; * industrial uses of type theory technology; * meta-theoretic studies of type systems; * proof assistants and proof technology; * automation in computer-assisted reasoning; * links between type theory and functional programming; * formalizing mathematics using type theory. We encourage talks proposing new ways of applying type theory. In the spirit of workshops, talks may be based on newly published papers, work submitted for publication, but also work in progress. FINANCIAL SUPPORT The last two days of TYPES 2017, May 31 - June 1 are supported by and organised under the auspices of EUTypes Cost Action CA15123 (https://eutypes.cs.ru.nl). On one of these days there will be an EUTypes Management Committee (MC) meeting. This means that for members of the EUTypes MC, the cost of travel and stay for these 2 days will be covered. There will likely be some funding for a limited number of other conference participants (speakers). The funding is subject to COST rules, and invitations will be sent out via the e-cost system after the 1st of May. INVITED SPEAKERS * Edwin Brady (University of St Andrews) * Sara Negri (University of Helsinki) * Jakob Rehof (TU Dortmund) CONTRIBUTED TALKS We solicit contributed talks. Selection of those will be based on extended abstracts/short papers of 2 pp formatted with easychair.cls. The submission site is https://easychair.org/conferences/?conf=types2017. Important dates: * submission of 2 pp abstract: 20 March 2017 * notified of acceptance/rejection: 17 April 2017 * camera-ready version of abstract: 8 May 2017 Camera-ready versions of the accepted contributions will be published in an informal book of abstracts for distribution at the workshop. POST-PROCEEDINGS Similarly to TYPES 2011 and TYPES 2013-2016, we intend to publish a post-proceedings volume in the Leibniz International Proceedings in Informatics (LIPIcs) series. Submission to that volume will be open for everyone. Tentative submission deadline: September 2017. PROGRAMME COMMITTEE * Andreas Abel (Chalmers University Gothenburg) * Thorsten Altenkirch (University of Nottingham) * Jos? Espirito Santo (University of Minho) * Fredrik Nordvall Forsberg (University of Strathclyde) * Silvia Ghilezan (University of Novi Sad) * Hugo Herbelin (INRIA Paris-Rocquencourt) * Martin Hofmann (Ludwig Maximilian University of Munich) * Ambrus Kaposi (E?tv?s Lor?nd University) (co-chair) * Tam?s Kozsik (E?tv?s Lor?nd University) (co-chair) * Assia Mahboubi (INRIA) * Alexandre Miquel (University of the Republic, Uruguay) * Leonardo de Moura (Microsoft Research, Redmond, USA) * Keiko Nakata (SAP, Potsdam) * Andrew Polonsky (University Paris Diderot) * Simona Ronchi Della Rocca (Universit? di Torino) * Aleksy Schubert (University of Warsaw) * Wouter Swierstra (Utrecht University) * Tarmo Uustalu (Tallinn University of Technology) TYPES STEERING COMMITTEE Marc Bezem, Herman Geuvers (chair), Hugo Herbelin, Zhaohui Luo, Ralph Matthes, Bengt Nordstr?m, Andrew Polonsky, Aleksy Schubert, Tarmo Uustalu. ABOUT TYPES The TYPES meetings from 1990 to 2008 were annual workshops of a sequence of five EU funded networking projects. From 2009 to 2015, TYPES has been run as an independent conference series. From 2016, TYPES is partially supported by COST Action EUTypes CA15123. Previous TYPES meetings were held in Antibes (1990), Edinburgh (1991), B?stad (1992), Nijmegen (1993), B?stad (1994), Torino (1995), Aussois (1996), Kloster Irsee (1998), L?keberg (1999), Durham (2000), Berg en Dal near Nijmegen (2002), Torino (2003), Jouy-en-Josas near Paris (2004), Nottingham (2006), Cividale del Friuli (2007), Torino (2008), Aussois (2009), Warsaw (2010), Bergen (2011), Toulouse (2013), Paris (2014), Tallinn (2015), Novi Sad (2016). CONTACT Email: info at types2017.elte.hu Organisers: Ambrus Kaposi, Tam?s Kozsik, Andr?s Kov?cs and the Department of Programming Languages and Compilers at the Faculty of Informatics, E?tv?s Lor?nd University, Budapest. From eacsl at kahle.ch Mon Mar 13 05:56:39 2017 From: eacsl at kahle.ch (European Association of Computer Science Logic) Date: Mon, 13 Mar 2017 09:56:39 +0000 Subject: [TYPES/announce] Ackermann Award 2017 Message-ID: <66360389-3a83-5025-9523-c5855c7d54b8@kahle.ch> ACKERMANN AWARD 2017 - THE EACSL OUTSTANDING DISSERTATION AWARD FOR LOGIC IN COMPUTER SCIENCE CALL FOR NOMINATIONS Nominations are now invited for the 2017 Ackermann Award. PhD dissertations in topics specified by the CSL and LICS conferences, which were formally accepted as PhD theses at a university or equivalent institution between 1.1.2015 and 31.12.2016 are eligible for nomination for the award. The deadline for submission is 1 April 2017. Submission details follow below. Nominations can be submitted from 1 January 2017 and should be sent to the chair of the Jury, Anuj Dawar, by e-mail: anuj.dawar at cl.cam.ac.uk The Award The 2017 Ackermann award will be presented to the recipient(s) at the annual conference of the EACSL, 20-24 August 2017, in Stockholm (Sweden). The award consists of * a certificate, * an invitation to present the thesis at the CSL/LICS conference, * the publication of the laudatio in the CSL/LICS proceedings, and * travel support to attend the conference. The jury is entitled to give the award to more (or less) than one dissertation in a year. Jury The jury consists of: * Anuj Dawar (University of Cambridge), the president of EACSL; * Dale Miller (INRIA and Ecole Polytechnique), ACM SigLog representative; * Orna Kupferman (Hebrew University of Jerusalem); * Daniel Leivant (Indiana University, Bloomington); * Luke Ong (University of Oxford); * Jean-Eric Pin (CNRS and University of Paris 7); * Simona Ronchi Della Rocca (University of Torino), the vice-president of EACSL; * Thomas Schwentick (TU Dortmund). How to submit The candidate or his/her supervisor should submit 1. the thesis (ps or pdf file); 2. a detailed description (not longer than 20 pages) of the thesis in ENGLISH (ps or pdf file); 3. a supporting letter by the PhD advisor and two supporting letters by other senior researchers (in English); supporting letters can also be sent directly to Anuj Dawar (anuj.dawar at cl.cam.ac.uk); 4. a short CV of the candidate; 5. a copy of the document asserting that the thesis was accepted as a PhD thesis at a recognized University (or equivalent institution) and that the candidate has received his/her PhD within the specified period. The submission should be sent by e-mail as attachments to the chairman of the jury, Anuj Dawar: anuj.dawar at cl.cam.ac.uk With the following subject line and text: * Subject: Ackermann Award Submission * Text: Name of candidate, list of attachments Submission can be sent via several e-mail messages. If this is the case, please indicate it in the text. Letters of support and documents can also be faxed to: Anuj Dawar Ackermann Award +44 1223 334678 The Jury has the right to declare submissions to be out of scope or not to meet the requirements. From dingel at cs.queensu.ca Mon Mar 13 15:28:02 2017 From: dingel at cs.queensu.ca (Juergen Dingel) Date: Mon, 13 Mar 2017 15:28:02 -0400 Subject: [TYPES/announce] Faculty position in 'Foundations of Computer Science' in School of Computing, Queen's University, Canada Message-ID: The School of Computing in the Faculty of Arts and Science at Queen's University invites applications for a Tenure-track faculty position at the rank of Assistant Professor with specialization in Foundations of Computer Science including Theory of Computation, Computer Systems, Database and Big Data, and Programming Languages. Exceptional candidates in other areas may be considered. The preferred starting date is July 1, 2017. Candidates must have a PhD or equivalent degree in Computer Science, Software Engineering or a related discipline completed at the start date of the appointment. The main criteria for selection are academic and teaching excellence. The successful candidate is expected to play a major role in the delivery of undergraduate and graduate programs at the School of Computing. The successful candidate will provide evidence of high quality scholarly output that demonstrates potential for independent research leading to peer-assessed publications in one of the foundational areas of Computer Science. A commitment to secure external research funding, as well as strong potential for outstanding teaching contributions at both the undergraduate and graduate levels, and an ongoing dedication to academic and pedagogical excellence in support of the School's programs are requirements for this position. Candidates must provide evidence of an ability to work collaboratively in an interdisciplinary and student-centred environment. The successful candidate will be required to make substantive contributions through service to the School, the Faculty, the University, and/or the broader community. Salary will be commensurate with qualifications and experience. Queen's University is one of Canada's leading research-intensive universities with a global reputation and is a recognized leader in Canadian higher education. The School of Computing has 21 full-time and 18 cross-appointed faculty, over 500 undergraduate students, and over 140 graduate students. The School offers undergraduate programs in Computer Science, Software Design, Biomedical Computing, Computing and Mathematics, Computing and the Creative Arts and Cognitive Science. The School also offers Master's, and Doctoral programs in Computer Science and Ultra Large Scale Systems. Queen's historic campus is located in the heart of the vibrant Kingston community in the Thousand Islands region of South Eastern Ontario. Queen's is positioned centrally with respect to three major metropolitan areas: Toronto, Montreal, and Ottawa. Additional information about Queen's University, which may be of interest to prospective faculty members, can be found at http://www.queensu.ca/facultyrecruitment. The University invites applications from all qualified individuals. Queen's is committed to employment equity and diversity in the workplace and welcomes applications from women, visible minorities, Aboriginal peoples, persons with disabilities, and LGBTQ persons. All qualified candidates are encouraged to apply; however, in accordance with Canadian immigration requirements, Canadian citizens and permanent residents of Canada will be given priority. To comply with federal laws, the University is obliged to gather statistical information as to how many applicants for each job vacancy are Canadian citizens / permanent residents of Canada. Applicants need not identify their country of origin or citizenship; however, all applications must include one of the following statements: "I am a Canadian citizen / permanent resident of Canada"; OR, "I am not a Canadian citizen / permanent resident of Canada". Applications that do not include this information will be deemed incomplete. A complete application consists of: - a cover letter (including one of the two statements regarding Canadian citizenship / permanent resident status specified in the previous paragraph); - a current Curriculum Vitae (including a list of publications); - a statement of research interests; - a statement of teaching interests and experience (including teaching outlines and evaluations if available); and, - the names and contact information of three referees. The deadline for applications is March 31, 2017. Applicants are encouraged to send all documents in their application package electronically as a single PDF, Attn: Chair of Faculty Search Committee at CSsearch at cs.queensu.ca, although hard copy applications may be submitted to: Faculty Search Committee Chair The School of Computing 557 Goodwin Hall Queen's University Kingston, Ontario CANADA K7L 3N6 The University will provide support in its recruitment processes to applicants with disabilities, including accommodation that takes into account an applicant?s accessibility needs. If you require accommodation during the interview process, please contact Tom Bradshaw in The School of Computing, at bradshaw at cs.queensu.ca. Academic staff at Queen's University are governed by a Collective Agreement between the University and the Queen's University Faculty Association (QUFA), which is posted at http://queensu.ca/facultyrelations/faculty-librarians-and-archivists/collective-agreement and at http://www.qufa.ca. -------------- next part -------------- An HTML attachment was scrubbed... URL: From bpientka at cs.mcgill.ca Mon Mar 13 11:45:46 2017 From: bpientka at cs.mcgill.ca (Brigitte Pientka) Date: Mon, 13 Mar 2017 16:45:46 +0100 Subject: [TYPES/announce] PPDP 2017: Call For Papers Message-ID: <2890A396-2149-4310-9B2B-C23A8903ED56@cs.mcgill.ca> ======================================================== CALL FOR PAPERS 19th International Symposium on Principles and Practice of Declarative Programming PPDP 2017 Namur, Belgium, October 9-11, 2017 (co-located with LOPSTR'17) http://complogic.cs.mcgill.ca/ppdp2017 ======================================================== SUBMISSION DEADLINE: 12 May (abstracts) / 19 MAY (papers) ======================================================== PPDP 2017 is a forum that brings together researchers from the declarative programming communities, including those working in the functional, logic, answer-set, and constraint programming paradigms. The goal is to stimulate research in the use of logical formalisms and methods for analyzing, performing, specifying, and reasoning about computations, including mechanisms for concurrency, security, static analysis, and verification. Submissions are invited on all topics from principles to practice, from foundations to applications. Topics of interest include, but are not limited to ** Language Design: domain-specific languages; interoperability; concurrency, parallelism, and distribution; modules; probabilistic languages; reactive languages; database languages; knowledge representation languages; languages with objects; language extensions for tabulation; metaprogramming. ** Implementations: abstract machines; interpreters; compilation; compile-time and run-time optimization; garbage collection; memory management. ** Foundations: type systems; type classes; dependent types; logical frameworks; monads; resource analysis; cost models; continuations; control; state; effects; semantics. ** Analysis and Transformation: partial evaluation; abstract interpretation; control flow; data flow; information flow; termination analysis; resource analysis; type inference and type checking; verification; validation; debugging; testing. ** Tools and Applications: programming and proof environments; verification tools; case studies in proof assistants or interactive theorem provers; certification; novel applications of declarative programming inside and outside of CS; declarative programming pearls; practical experience reports and industrial application; education. This year the conference will be co-located with the 27th Int'l Symp. on Logic-Based Program Synthesis and Transformation (LOPSTR 2017). IMPORTANT DATES: Abstract Submission: 12 May 2017 Paper Submission: 19 May 2017 Paper Rebuttal: 10 July 2017 Notification: 20 July 2017 Final Version: 15 Aug 2017 SUBMISSION CATEGORIES: Submissions can be made in three categories: regular Research Papers, System Descriptions, and Experience Reports. Submissions of Research Papers must present original research which is unpublished and not submitted elsewhere. They must not exceed 12 pages ACM style 2-column (including figures and bibliography). Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chair in case of questions). Submissions of research papers will be judged on originality, significance, correctness, clarity, and readability. Submission of System Descriptions must describe a working system whose description has not been published or submitted elsewhere. They must not exceed 10 pages and should contain a link to a working system. System Descriptions must be marked as such at the time of submission and will be judged on originality, significance, usefulness, clarity, and readability. Submissions of Experience Reports are meant to help create a body of published, refereed, citable evidence where declarative programming such as functional, logic, answer-set, constraint programming, etc., is used in practice. They must not exceed 6 pages. Experience Reports must be marked as such at the time of submission and need not report original research results. They will be judged on significance, usefulness, clarity, and readability. Possible topics for an Experience Report include, but are not limited to: * insights gained from real-world projects using declarative programming * comparison of declarative programming with conventional programming in the context of an industrial project or a university curriculum * curricular issues encountered when using declarative programming in education * real-world constraints that created special challenges for an implementation of a declarative language or for declarative programming in general * novel use of declarative programming in the classroom * programming pearl that illustrates a nifty new data structure or programming technique. SUBMISSION GUIDELINES: Submissions must be formatted using ACM style files (latest release December 2016) using the instructions at https://www.acm.org/publications/proceedings-template To prepare your submission using LaTex: * Download acmart.zip from https://www.ctan.org/pkg/acmart * Unzip acmart.zip * Run latex acmart.ins to produce an acmart.cls file * Run pdflatex sample-sigconf.tex to check that your installation works correctly * Write your paper using sample-sigconf.tex as a template Proofs of theoretical results that do not fit within the page limit, executables of systems, code of case studies, benchmarks used to evaluate a given system, etc., should be made available, via a reference to a website or in an appendix of the paper. Reviewers will be encouraged to consider this additional material, but are not obliged to. Submissions must be self-contained within the respective page limit; considering the additional material should not be necessary to assess the merits of a submission. At least one author of each accepted submission will be expected to attend and present their paper at the conference. Papers must be submitted via easychair. The submission site is at https://easychair.org/conferences/?conf=ppdp2017 PROCEEDING Accepted papers will be published in the ACM International Conference Proceedings Series. PROGRAM CHAIR Brigitte Pientka (McGill University) PROGRAM COMMITTEE Andreas Abel (Gothenburg University) Nadia Amin (EPFL) Zena M. Ariola (University of Oregon) Kenichi Asai (Ochanomizu University) James Cheney (University of Edinburgh) Mariangiola Dezani-Ciancaglini (University of Torino) Santiago Escobar (Universitat Polit?cnica de Val?ncia) Amy Felty (University of Ottawa) Tom Fr?hwirth (University of Ulm) Patricia Johann (Appalachian State University) Neel Krishnaswami (University of Cambridge) Michael Leuschel (Universit?t D?sseldorf) Yanhong Annie Liu (Stony Brook University) Andres Loeh (Well-Typed) Vivek Nigam (Federal University of Paraiba / fortiss) Naoki Nishida (Nagoya University) Catuscia Palamidessi (INRIA) Brigitte Pientka (McGill University) (PC Chair) Ulrich Schoepp (Ludwig Maximilian University) Chung-chieh Shan (Indiana University) Bernardo Toninho (Imperial College London) LOCAL ORGANIZER (joint with LOPSTR): Wim Vanhoff (University of Namur) ---------------------------------------------------------------------- From mislove at tulane.edu Tue Mar 14 11:26:17 2017 From: mislove at tulane.edu (Mislove, Michael W) Date: Tue, 14 Mar 2017 15:26:17 +0000 Subject: [TYPES/announce] Postdoc in Semantics and Tools for Functional Quantum Programming Languages Message-ID: Dear All, Below is an announcement for a postdoctoral position working on the MURI project on Semantics and Tools for Functional Quantum Programming Languages. I invite applications from interested candidates. Thanks, Mike Mislove =============================================== Michael Mislove Phone: +1 504 865-5803 Professor and Chair FAX: +1 504 865-5063 Department of Computer Science Tulane University URL: http://www.cs.tulane.edu/~mwm New Orleans, LA 70118 USA =============================================== Postdoctoral Researcher in Semantics and Tools for Quantum Programming Languages Applications are invited for a postdoctoral position beginning July 1 and running through November 30, 2018. There is a possibility of an extension beyond November, 2018, depending on funding. The position is in the Department of Computer Science at Tulane University, and will be under the supervision of Professor Michael Mislove. The successful applicant will work on a project entitled "Semantics, Formal Reasoning, and Tool Support for Quantum Programming?. The project involves designing high-level semantic models and tools to support quantum functional programming languages. A prototype language is Proto-Quipper, which has been under development (http://www.mathstat.dal.ca/~selinger/quipper/ ). This language uses the circuit model for quantum computation, and envisions languages that support quantum computation under classical control. The overall aim is to design type-safe functional programming languages for quantum computing. The project also involves developing the meta-theory (including categorical semantics) of such languages, and eventually to formalize some of the meta-theory in a proof assistant. The focus of the Tulane work is modeling recursion in such languages, which requires developing quantum domain theory, but interactions with other aspects of the project are expected. Familiarity with programming language design, and / or semantics is a prerequisite of the position. The latter includes categorical semantics and domain theory. A good knowledge of category theory is also a prerequisite. Of course, familiarity with quantum computing is helpful. Additional components of the project will address issues around quantum information such as non-locality and contextuality, adapting proof assistants (Coq, Agda, Lean, etc) to develop automated verification for quantum programming languages, and developing quantum routers. Although the position is at Tulane University, candidates may travel to the other sites where work on this project is taking place. These include UPenn, UIowa and Stanford in the US, as well as McGill University and Dalhousie University in Canada and Oxford and Edinburgh in the UK. To apply for this position, direct your browser to the link: https://apply.interfolio.com/41053 Funding for the project comes from the DOD and the U.S. Air Force Office of Scientific Research. -------------- next part -------------- An HTML attachment was scrubbed... URL: From tobias.grosser at inf.ethz.ch Tue Mar 14 07:20:46 2017 From: tobias.grosser at inf.ethz.ch (Tobias Grosser) Date: Tue, 14 Mar 2017 12:20:46 +0100 Subject: [TYPES/announce] PLDI ACM Student Research Competition (SRC) Message-ID: <1489490446.3087071.910702352.3DAC6C05@webmail.messagingengine.com> The ACM Student Research Competition (SRC), sponsored by Microsoft Research, offers a unique forum for undergraduate and graduate students to present their original research on programming language design, implementation, theory, applications, and performance at PLDI 2017. The goal is to give students a place to discuss their research with experts in their field and to help them sharpen their research and communication skills. Please find more information at http://pldi17.sigplan.org/track/pldi-2017-student-research-competition Deadline for submission of the extended abstracts: Friday April 7th, 2017. ## Rounds Three rounds of competition will take place before and during PLDI 2017. All rounds are held in two categories: Undergraduate Students and Graduate Students (Masters and PhD level). Winners of the third round will be invited to participate in the SRC Grand Finals competition hosted by the ACM. The PLDI rounds are: * Extended abstract round. All students are encouraged to submit an extended abstract outlining their research. * Poster session. Based on the abstracts, a panel of judges will select the most promising authors to participate in the poster session which will take place at PLDI. In the poster session, students will have the opportunity to present their work to the judges, who will select a group of semi-finalists in each category to advance to the next round. * PLDI presentation. The last PLDI round will consist of an oral presentation at the conference to compete for the three top places. ## Prizes Winners of the three top places in each category receive prizes of $500 for the first place winner, $300 for the second place winner and $200 for the third place winner, respectively. The top three undergraduate and graduate winners receive an award medal and a one-year complimentary ACM student membership with a subscription to ACM?s Digital Library. ## ACM SRC Grand Finals First place winners in each category will be invited to participate in the ACM SRC Grand Finals, an on-line round of competition between first-place SRC winners from different ACM conferences held in 2017. Grand Finals will be judged by a different, ACM-appointed panel of judges. Winners of the three top Grand Finals places in each category will receive additional prizes of $500 for the first place winner, $300 for the second place winner and $200 for the third place winner, respectively. They will be also invited to the annual ACM Award Banquet along with prestigious ACM award winners, including the winner of the Turing Award. ## Eligibility criteria Current student status, either graduate or undergraduate, at the time of submission deadline. In order to advance to the poster session round, participants of the SRC must be current ACM (student) members. ## Extended Abstract Submission Details Each submission should include the student author?s name, institutional affiliation, e-mail address, and postal address; research advisor?s name; ACM student member number; category (undergraduate or graduate); research title; and an extended abstract addressing the following: The extended abstract must not exceed 1000 words and must not be longer than 2 pages. Reference lists do not count towards these limits. ## SRC Panel Xavier Martorell, BSC and UPC (chair). Tobias Grosser, ETH Zurich Sandrine Blazy, IRISA Martin Kong, RICE University Timothy Bourke, INRIA Cole Schlesinger, Barefoot Networks, Inc. From maietti at math.unipd.it Tue Mar 14 11:31:39 2017 From: maietti at math.unipd.it (Maria Emilia Maietti) Date: Tue, 14 Mar 2017 16:31:39 +0100 Subject: [TYPES/announce] seeking a lecturer for 8hs on proof-assistants in PD Message-ID: <58C80CDB.70100@math.unipd.it> ?????????????????????????????????????????????? Seeking a non-Italian lecturer to give an 8-hour introduction to proof-assistants in Padova ???????????????????????????????????????????? We are looking for a non-Italian scientist (even a PhD student with high expertise) to give 2 or more seminars for a total of 8 hours maximum and 4 hours minimum (that can be split from 2 up to 4 days) as an ***introduction to the use of a proof-assistant based on a constructive dependent type theory*** like Calculus of Inductive Constructions orMartin-Loef's type theory. Period of seminars: to be chosen in April/May 2018 Location: University of Padova Type of students: master students in Computer Science at the University of Padova. Compensation: 1500 euros DEADLINE for application : 22 March 2017 If you are available please write no later than 22 March to maietti at math.unipd.it sambin at math.unipd.it with a CV included. Many thanks for your attention Best wishes Maria Emilia Maietti Giovanni Sambin From crafa at math.unipd.it Tue Mar 14 06:42:31 2017 From: crafa at math.unipd.it (Silvia Crafa) Date: Tue, 14 Mar 2017 11:42:31 +0100 Subject: [TYPES/announce] ECOOP 2017 - Doctoral Symposium Message-ID: <21267e09-baa4-e62d-c853-b529ea5d4778@math.unipd.it> ****************************************************************** ECOOP 2017 - DOCTORAL SYMPOSIUM The 31st European Conference on Object-Oriented Programming 19-23 June 2017, Barcelona, Spain co-located with PLDI 2017 and other events http://2017.ecoop.org #ECOOP2017 @ECOOPconf ****************************************************************** The ECOOP Doctoral Symposium provides a forum for PhD students at any stage in their research to get detailed feedback and advice. The objectives of this event are to: - allow students to practise writing clearly and present their research effectively; - receive constructive feedback from experienced researchers and peers; - offer opportunities to form research collaborations; - interact with other researchers at the ECOOP and PLDI. FORMAT The symposium is a full-day of interactive presentations. It starts with lightning talks where each student gives an ?elevator pitch? of their research. Next, each student give a formal presentation followed by questions and discussions. Besides the formal presentations, there will be opportunities for informal interactions during breaks, lunch and dinner. Famous researchers will give talks on topics related to PhD studies and exploring possibilities beyond your doctorate. SUBMISSIONS We have two distinct submission categories: junior and senior submissions. Junior students may not yet have developed a thesis topic, they will present their research ideas and any progress to date. Senior students are expected to give an outline of their thesis topic and will feedback towards the successful completion of their thesis and defence. Submissions are done through https://easychair.org/conferences/?conf=ecoop17ds and are due on April 21, AOE. A) Junior PhD Students Submit a 4?8 page research proposal in the Dagstuhl LIPIcs format with: - a problem description - a detailed sketch of a proposed approach - related work It is not necessary to present concrete results. Instead, try to inform the reader that you have a (well-motivated) problem and present a possible solution. Attempt to provide a clear road map detailing future research efforts. The research proposal should include the name and email of your PhD advisor. B) Senior PhD Students The experience for senior Students is meant to mimic a ?mini-defense? interview. Aside from the actual feedback, this helps the student gain familiarity with the style and mechanics of such an interview (advisors of student presenters will not be allowed in). The students should be able to present: - the importance of the problem - a clear research proposal - some preliminary work - an evaluation plan Please submit a 4?8 page abstract in the Dagstuhl LIPIcs format with the following: 1. Problem Description What is the problem? What is the significance of this problem? Why can the current state of the art not solve this problem? 2. Goal Statement What is the goal of your research? What artifacts (tools, theories, methods) will be produced, how do they address the stated problem? 3. Method What experiments, prototypes, or studies need to be produced/executed? What is the validation strategy? How will it show the goal was reached? This isn?t a technical paper, don?t focus on technical details, but rather on the research method. The paper should include the name and email of your PhD advisor. PARTICIPATION Accepted students will give two presentations: 1. A two-minute presentation stating key issues of the research (the ?elevator pitch?). 2. A 15 minute presentation followed by 15? of questions, feedback and discussions. 3. An email from the student?s advisor (to ecoop17ds at easychair.org) to confirm the advisor attended at least one presentation rehearsal. Prior to the symposium, each student will be assigned submissions of two other students. For each submission the student will prepare a short summary, feedback and 2-3 questions for discussion on the submission. The student will also be expected to take active part in all discussions. FUNDING AND OTHER EVENTS The organizers encourage students to apply for funding through the ECOOP student volunteer program, http://2017.ecoop.org/track/ecoop-2017-Student-Volunteers. Consider applying to the ECOOP Summer School, great speakers with an emphasis towards teaching useful skills for young researchers, http://2017.ecoop.org/track/ecoop-2017-Summer-School From andrea.rosa at usi.ch Mon Mar 13 23:03:30 2017 From: andrea.rosa at usi.ch (Andrea Rosa) Date: Tue, 14 Mar 2017 03:03:30 +0000 Subject: [TYPES/announce] ACM/SPEC ICPE'17 - Call for Participation Message-ID: <240187B6-260A-4FD3-B377-DA5C14BAC1CF@usi.ch> ICPE 2017 8th ACM/SPEC International Conference on Performance Engineering Sponsored by ACM SIGMETRICS, SIGSOFT, and SPEC RG L'Aquila, Italy April 22-27, 2017 https://icpe2017.spec.org/ ------------------------------------------------------------------------------- The goal of the International Conference on Performance Engineering (ICPE) is to integrate theory and practice in the field of performance engineering by providing a forum for sharing ideas and experiences between industry and academia. Nowadays, complex systems of all types, like Web-based systems, data centers and cloud infrastructures, social networks, peer-to-peer, mobile and wireless systems, cyber-physical systems, the Internet of Things, real-time and embedded systems, have increasingly distributed and dynamic system architectures that provide high flexibility, however, also increase the complexity of managing end-to-end application performance. ICPE brings together researchers and industry practitioners to share and present their experiences, discuss challenges, and report state-of-the-art and in-progress research on performance engineering of software and systems, including performance measurement, modeling, benchmark design, and run-time performance management. The focus is both on classical metrics such as response time, throughput, resource utilization, and (energy) efficiency, as well as on the relationship of such metrics to other system properties including but not limited to scalability, elasticity, availability, reliability, and security. ------------------------------------------------------------------------------- PROGRAM ICPE'17 takes place from April 22 to 27, 2017. The main conference runs from April 24 to 26, with a welcome reception on April 24 and a banquet on April 25. Tutorials are held on April 22 and 23, while workshops take place on April 22, 23, and 27. The preliminary program is available at https://icpe2017.spec.org/conference-program.html The following eight workshops will be held in conjunction with the main conference: - Saturday, April 22: -- ACPROSS: Autonomous Control for Performance and Reliability Trade-offs in Internet of Services -- PABS: Third International Workshop on Performance Analysis of Big Data Systems -- WOSP-C: Workshop on Challenges in Performance Methods for Software Development - Sunday, April 23: -- ENERGY-SIM: Third International Workshop on Energy-aware Simulation -- LTB: Sixth International Workshop on Load Testing and Benchmarking of Software Systems -- MoLS: First International Workshop on Monitoring in Large-Scale Software Systems -- WEPPE: Workshop on Education and Practice of Performance Engineering - Thursday, April 27: -- QUDOS: Third International Workshop on Quality-aware DevOps More information on the workshops can be found at https://icpe2017.spec.org/conference-program/conference-workshops.html ------------------------------------------------------------------------------- REGISTRATION Registration is open! To register to ICPE'17 or to the co-located workshops and tutorials, please follow the instruction at the following link: https://icpe2017.spec.org/registration.html. Early registration deadline: March 24, 2017 ------------------------------------------------------------------------------- KEYNOTE We are proud to announce our keynote speakers for ICPE'17: -------------------------------------- Arif Merchant (Google) Title: Autonomic storage management at scale Abstract: Cloud data centers use enormous amounts of storage, and it is critical to monitor, manage, and optimize the storage autonomically. Optimally configuring storage is difficult because storage workloads are very diverse and change over time. Data centers measure running workloads, but this measurement data stream is itself quite large. We present some real world case studies in the use of big data techniques, sampling, and optimization to manage storage in data centers. Short bio: Arif Merchant is a Research Scientist at Google and leads the Storage Analytics group, which studies interactions between components of the storage stack. His interests include distributed storage systems, storage management, and stochastic modeling. He holds the B.Tech. degree from IIT Bombay and the Ph.D. in Computer Science from Stanford University. He is an ACM Distinguished Scientist. -------------------------------------- Francesco Quaglia (University of Rome "La Sapienza") Title: Performance is Also a Matter of Where You Live Abstract: Nowadays, a plethora of techniques and methods are available to optimize the runtime behavior of complex applications, ranging from modeling/prediction tools to the employment of recognized patterns and/or knowledge-bases on the expected performance under specific workloads. However, in common scenarios, the ultimate applications' behavior may depend on features that are scarcely predictable or difficult to be taken into account when designing the applications and their own runtime optimizers. Among them, we mention the actual structure of the underlying hardware and/or virtualized platforms, as well as specific runtime dynamics such as thread correlation on data and synchronization---not much the average behavior, rather punctual effects. We believe that the environment where applications live, like operating systems and user-space runtime libraries, play a central role in coping with these features. We similarly believe that such environments must be re-staged so as to be actually effective in pursuing the performance optimization goal. In this talk, we discuss specific guidelines to re-stage the environments, based on a real experience, and we point as well to challenges that are still untackled and deserve attention by the research community. Short bio: Francesco Quaglia received the Laurea degree (MS level) in Electronic Engineering in 1995 and the PhD degree in Computer Engineering in 1999 from the University of Rome ``La Sapienza''. From summer 1999 to summer 2000 he held an appointment as a Researcher at the Italian National Research Council (CNR). Since January 2005 he works as an Associate Professor at the School of Engineering of the University of Rome ``La Sapienza", where he has previously worked as an Assistant Professor since September 2000 to December 2004. His main research interests are in the areas of high performance computing, dependable computing, transactional systems, operating systems, automatic code parallelization, performance analysis and optimization. Currently, he is the director of the HPDCS (High Performance and Dependable Computing Systems) Research Lab at the University of Rome ``La Sapienza''. -------------------------------------- Thomas Wuerthinger (Oracle Labs) Title: Micro-Benchmarking Considered Harmful Subtitle: When the Whole is Faster or Slower Than the Sum of its Parts Abstract: Measuring the time spent on small individual fractions of program code is a common technique for analysing performance behavior and detecting performance bottlenecks. The benefits of the approach include a detailed individual attribution of performance and understandable feedback loops when experimenting with different code versions. There are however severe pitfalls when following this approach that can lead to vastly misleading results. Modern optimizing compilers use complex optimization techniques that take a large part of the program into account. There can be therefore unexpected side-effects when combining different code snippets or even when running a presumably unrelated part of the code. This talk will present performance paradoxes with examples from the domain of dynamic compilation of Java programs. Furthermore, it will discuss an alternative approach to modelling code performance characteristics that takes the challenges of complex optimising compilers into account. Short Bio: Thomas Wuerthinger is a Senior Research Director at Oracle Labs leading programming language implementation teams for languages including Java, JavaScript, Ruby, and R. He is the architect of the Graal compiler and the Truffle self-optimizing runtime system. Previously, he worked on the Crankshaft optimizing compiler of V8 at Google, and the Maxine research virtual machine at Sun Microsystems. He received a PhD degree from JKU Linz for his research about dynamic code evolution. ------------------------------------------------------------------------------- ORGANIZING COMMITTEE General Chairs * Walter Binder, Universit? della Svizzera italiana (USI), Switzerland * Vittorio Cortellessa, Universit? dell'Aquila, Italy Research Program Chairs * Anne Koziolek, Karlsruhe Institute of Technology, Germany * Evgenia Smirni, College of William and Mary, USA Industry Program Chairs * Meikel Poess, Oracle, USA Tutorials Chair * Valeria Cardellini, Universit? di Roma Torvergata, Italy Workshops Chairs * Hanspeter M?ssenb?ck, Johannes Kepler Universit?t Linz, Austria * Catia Trubiani, Gran Sasso Science Institute, Italy Posters and Demos Chair * Lubomir Bulej, Charles University, Czech Republic Awards Chairs * Petr Tuma, Charles University, Czech Republic * Murray Woodside, Carleton University, Canada Local Organization Chair * Antinisca Di Marco, Universit? dell'Aquila, Italy Publicity Chairs * Andrea Ros?, Universit? della Svizzera italiana (USI), Switzerland * Diego Perez, Politecnico di Milano, Italy Finance Chair * Andr? van Hoorn, University of Stuttgart Publication and Registration Chair * Davide Arcelli, Universit? dell'Aquila, Italy Web Site Chair * Daniele Di Pompeo, Universit? dell'Aquila, Italy -------------------------------------------------------------------------------- CONTACTS Do not hesitate to contact the general chairs at > and > for more information about ICPE'17 and the co-located venues. ------------ Andrea Ros? PhD student - Teaching assistant Faculty of Informatics - Office SI-205 Universit? della Svizzera italiana (USI) Via G. Buffi 13 CH-6904 Lugano Switzerland (e) andrea.rosa at usi.ch (p) +41 58 666 4455 ext. 2183 (w) http://www.inf.usi.ch/phd/rosaa/ From spreen at math.uni-siegen.de Wed Mar 15 06:17:52 2017 From: spreen at math.uni-siegen.de (Dieter Spreen) Date: Wed, 15 Mar 2017 11:17:52 +0100 Subject: [TYPES/announce] Continuity, Computability, Constructivity 2017; call for submissions In-Reply-To: <8841cefc-0149-4a4f-d998-8dab51c75d91@jaist.ac.jp> References: <8841cefc-0149-4a4f-d998-8dab51c75d91@jaist.ac.jp> Message-ID: Continuity, Computability, Constructivity ? From Logic to Algorithms (CCC 2017) Loria, 26-30 June 2017 Call for papers https://members.loria.fr/MHoyrup/CCC/home.html CCC is a workshop series bringing together researchers from exact real number computation, computable analysis, effective descriptive set theory, constructive analysis, and related areas. The overall aim is to apply logical methods in these disciplines to provide a sound foundation for obtaining exact and provably correct algorithms for computations with real numbers and related analytical data, which are of increasing importance in safety critical applications and scientific computation. Previous workshops have been held in Cologne 2009, Trier 2012, Gregynog 2013, Ljubljana 2014, and Kochel 2015. The conference series has always been linked with EU-funded international research projects, with COMPUTAL (Computable Analysis) in the years 2012-2015 and now with CID (Computing with Infinite Data), a research network between Europe, Chile, Japan, New Zealand, Russia, Singapore, South Africa, South Korea, and the USA. This conference is the first CID event, but is open to all researchers in the area. The workshop will take place in Nancy, France. Scope: The workshop specifically invites contributions in the areas of Exact real number computation, Correctness of algorithms on infinite data, Computable analysis, Complexity of real numbers, real-valued functions, etc. Effective descriptive set theory Scott's domain theory, Constructive analysis, Category-theoretic approaches to computation on infinite data, Weihrauch degrees, And related areas. Invited Speakers: Matthew de Brecht (Kyoto, Japan) Bernhard Reus (Brighton, UK) Matthias Schr?der (Darmstadt, Germany) Alex Simpson (Ljubljana, Slovenia) Submission: Extended abstracts (1-2 pages) of original work are welcome. Deadline: 17 April 2017 Upload your submission via EasyChair: https://easychair.org/conferences/?conf=ccc20170 Programme Committee: Ulrich Berger (Swansea) Pieter Collins (Maastricht) Mathieu Hoyrup (Nancy) (co-chair) Erik Palmgren (Stockholm) Victor Selivanov (Novosibirsk) Dieter Spreen (Siegen) (co-chair) Martin Ziegler (Daejeon). Organizing Committee: Anne-Lise Charbonnier (Nancy) Mathieu Hoyrup (Nancy) -------------- next part -------------- An HTML attachment was scrubbed... URL: From christian.retore at lirmm.fr Wed Mar 15 18:04:30 2017 From: christian.retore at lirmm.fr (Christian RETORE) Date: Wed, 15 Mar 2017 23:04:30 +0100 Subject: [TYPES/announce] Quantifiers and Determiners : two days left Message-ID: <9FE19D33-29D5-4721-AC0B-485CBDB165D3@lirmm.fr> There will probably be no deadline extension. If you have questions about submitting an abstract (2 pages), just let me know. QUAD: QUantifiers And Determiners http://www.lirmm.fr/quad Toulouse, Monday July 17 --- Friday July 21: 17:00-18:30 As part of ESSLLI 2017 Christian Retor?, LIRMM & universit? de Montpellier, Mark Steedman, University of Edinburgh Schedule: deadline for submissions: 17 Mars 2017 submission website: https://easychair.org/conferences/?conf=quad2017 notification to authors: 15 April 2017 final version due: 19 May 2017 conference: 17-21 July 2017 Presentation: The compositional interpretation of determiners relies on quantifiers ? in a general acceptation of this later term which includes generalised quantifiers, generics, definite descriptions i.e. any operation that applies to one or several formulas with a free variable, binds it and yields a formula or possibly a generic term (the operator is then called a subnector, following Curry). There is a long history of quantification in the Ancient and Medieval times at the border between logic and philosophy of language, before the proper formalisation of quantification by Frege. A common solution for natural language semantics is the so-called theory of generalised quantifiers. Quantifiers like ? some, exactly two, at most three, the majority of, most of, few, many, ? ? are all described in terms of functions of two predicates viewed as subsets. Nevertheless, many mathematical and linguistic questions remain open. On the mathematical side, little is known about generalised , generalised and vague quantifiers, in particular about their proof theory. On the other hand, even for standard quantifiers, indefinites and definite descriptions, there exist alternative formulations with choice functions and generics or subnectors (Russell?s iota, Hilbert-Bernays, eta, epsilon, tau). The computational aspects of these logical frameworks are also worth studying, both for computational linguistic software and for the modelling of the cognitive processes involved in understanding or producing sentences involving quantifiers. On the linguistic side, the relation between the syntactic structure and its semantic interpretation, quantifier raising, underspecification, scope issues,? are not fully satisfactory. Furthermore extension of linguistic studies to various languages have shown how complex quantification is in natural language and its relation to phenomena like generics, plurals, and mass nouns. Finally, and this can be seen as a link between formal models of quantification and natural language, there by now exist psycholinguistic experiments that connect formal models and their computational properties to the actual way human do process sentences with quantifiers, and handle their inherent ambiguity, complexity, and difficulty in understanding. All those aspects are connected in the didactics of mathematics and computer science: there are specific difficulties to teach (and to learn) how to understand, manipulate, produce and prove quantified statements, and to determine the proper leve