[TYPES/announce] Postdoc position on Automatic Parallelization of Dalvik Bytecode at CNAM, Paris
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Postdoc position on Automatic Parallelization of Dalvik Bytecode Applications are invited for a Postdoctoral Research Fellow position working on automatic parallelization of Android applications. While modern smartphones possesses powerful CPUs with many-cores, smartphone applications often tend not to fully exploit all the available power. The overall aim of the project is to investigate the possibility of automatic parallelization of Dalvik bytecode to improve applications performances on multicore architectures. Dalvik bytecode is used as the distribution format of Android applications. Android Runtime (ART) compiles Dalvik applications into native machine code upon installation. We propose to investigate high level parallelization of Dalvik code before deploying it on ART. This project is a collaboration between the CEDRIC laboratory of CNAM and manycore.io. The postdoc will take place in Paris both at the CEDRIC laboratory and at manycore.io. The postdoc will be supervised by Pr. Tristan Crolard and Dr. Sami Taktak at CEDRIC laboratory and Nicolas Toper at manycore.io. The postdoc is available for a period of 1 year. The successful candidate will have to develop a formal model of Dalvik code and formalize code transformation for automatic parallelization of Android applications. The work will involve developing techniques that combine programming languages semantics, compilation and formal methods. To apply you must hold (or be close to achieving) a PhD in Computer Science. You should have demonstrated your research competence in formal methods and/or programming languages semantics and compilation. You should also have a strong mathematical background, good programming skills. English proficiency is required. Interested applicants are encouraged to contact us with inquiries. Sami Taktak Tristan Crolard Nicolas Toper https://cedric.cnam.fr https://www.manycore.io
[TYPES/announce] Bx 2019 Second Call for Papers (Workshop on Bidirectional Transformations)
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Bx 2019: 8th International Workshop on Bidirectional Transformations Highlights: - workshop date set on June 4, 2019 - Zachary Ives confirmed as invited speaker - abstract submission in two weeks (Tuesday, Feb 12, AoE) - links to CEUR-WS.org style and template files updated * http://bx-community.wikidot.com/bx2019:home * June 4, 2019, Saint Joseph’s University, Philadelphia, PA, USA * as part of Philadelphia Logic Week (PLW) 2019: https://sites.sju.edu/plw/ * Invited speaker: Zachary Ives (University of Pennsylvania) Bidirectional transformations (bx) are a mechanism for maintaining the consistency of at least two related sources of information. Such sources can be relational databases, software models and code, or any other document following standard or ad-hoc formats. Bx are an emerging topic in a wide range of research areas, with prominent presence at top conferences in several different fields (namely databases, programming languages, software engineering, and graph transformation), but with results in one field often getting limited exposure in the others. Bx 2019 is a dedicated venue for bx in all relevant fields, and is part of a workshop series that was created in order to promote cross-disciplinary research and awareness in the area. As such, since its beginning in 2012, the workshop has rotated between venues in different fields. Bx 2019 will be a part of Philadelphia Logic Week (PLW) 2019, which also includes conference and workshops on logic, provenance, and databases, topics that we hope will complement Bx and help build engagement with these communities. Important Dates === - Abstract submission: Feb 12 (AoE) - Paper submission:Feb 19 (AoE) - Author notification: Apr 8 - Camera-ready: around May 1 - Workshop:Jun 4, 2019 Aims and Topics === The aim of the workshop is to bring together researchers and practitioners, established and new, interested in bx from different perspectives, including but not limited to: - bidirectional programming languages and frameworks - data and model synchronization - view updating - inter-model consistency analysis and repair - data/schema (or model/metamodel) co-evolution - coupled software/model transformations - inversion of transformations and data exchange mappings - domain-specific languages for bx - analysis and classification of requirements for bx - bridging the gap between formal concepts and application scenarios - analysis of efficiency of transformation algorithms and benchmarks - survey and comparison of bx technologies - case studies and tool support Submission Guidelines = Papers must follow the CEUR-WS.org one-column style (with page numbers) available at - http://ceur-ws.org/Vol-XXX/samplestyles/onecolpceurws.sty and must be submitted via EasyChair: - https://www.easychair.org/conferences/?conf=bx2019 A sample LaTeX file using the above style (along with an included sample image) can be downloaded at - http://ceur-ws.org/Vol-XXX/samplestyles/paper1p.tex - http://ceur-ws.org/Vol-XXX/samplestyles/fig1.eps Five categories of submissions are considered: * Full Research Papers (up to 15 pages) - in-depth presentations of novel concepts and results - applications of bx to new domains - survey papers providing novel comparisons between existing bx technologies and approaches case studies * Tool Papers (up to 8 pages) - guideline papers presenting best practices for employing a specific bx approach (with a specific tool) - presentation of new tools or substantial improvements to existing ones - qualitative and/or quantitative comparisons of applying different bx approaches and tools * Experience Report (up to 8 pages) - sharing experiences and lessons learned with bx tools/frameworks/languages - how bx is used in (research/industrial/educational) projects * Extended Abstracts and Short Papers (up to 4 pages) - work in progress - small focused contributions - position papers and research perspectives - critical questions and challenges for bx * Talk Proposals (up to 2 pages) - proposed lectures about topics of interest for bx - existing work representing relevant contributions for bx - promising contributions that are not mature enough to be proposed as papers of the other categories If your submission is not a Full Research Paper, please include the intended submission category in the Title field of EasyChair’s submission form. The bibliography is excluded from the page limits. All papers are expected to be self-contained and well-written. Tool papers are not expected to present novel scientific results, but to document artifacts of interest and share bx experience/best practices with the community. Experience papers are expected to report on lessons learnt
[TYPES/announce] LearnAut 2019 first Call for Papers -- LICS 2019 Workshop
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Learning and Automata (LearnAut) -- LICS 2019 workshop June 23rd, Vancouver, Canada Website: https://learnaut19.github.io SUBMISSION DEADLINE March 30th Learning models defining recursive computations, like automata and formal grammars, are the core of the field called Grammatical Inference (GI). The expressive power of these models and the complexity of the associated computational problems are major research topics within mathematical logic and computer science, spanning the communities that the Logic in Computer Science (LICS) conference brings together. Historically, there has been little interaction between the GI and LICS communities, though recently some important results started to bridge the gap between both worlds, including applications of learning to formal verification and model checking, and (co-)algebraic formulations of automata and grammar learning algorithms. The goal of this workshop is to bring together experts on logic who could benefit from grammatical inference tools, and researchers in grammatical inference who could find in logic and verification new fruitful applications for their methods. We invite submissions of recent work, including preliminary research, related to the theme of the workshop. Similarly to how main machine learning conferences and workshops are organized, all accepted abstracts will be part of a poster session held during the workshop. Additionally, the Program Committee will select a subset of the abstracts for oral presentation. At least one author of each accepted abstract is expected to represent it at the workshop. Topics of interest include (but are not limited to): - Computational complexity of learning problems involving automata and formal languages. - Algorithms and frameworks for learning models representing language classes inside and outside the Chomsky hierarchy, including tree and graph grammars. - Learning problems involving models with additional structure, including numeric weights, inputs/outputs such as transducers, register automata, timed automata, Markov reward and decision processes, and semi-hidden Markov models. - Logical and relational aspects of learning and grammatical inference. - Theoretical studies of learnable classes of languages/representations. - Relations between automata and recurrent neural networks. - Active learning of finite state machines and formal languages. - Methods for estimating probability distributions over strings, trees, graphs, or any data used as input for symbolic models. - Applications of learning to formal verification and (statistical) model checking. - Metrics and other error measures between automata or formal languages. ** Invited speakers ** Lise Getoor (UC Santa Cruz) Prakash Panangaden (McGill University) Nils Jansen (Radboud University) (to be confirmed) ** Submission instructions ** Submissions in the form of extended abstracts must be at most 8 single-column pages long at most (plus at most four for bibliography and possible appendixes) and must be submitted in the JMLR/PMLR format. The LaTeX style file is available here: https://ctan.org/tex-archive/macros/latex/contrib/jmlr We do accept submissions of work recently published or currently under review. - Submission url: https://easychair.org/conferences/?conf=learnaut2019 - Submission deadline: March 30th - Notification of acceptance: April 25th - Registration: TBD ** Program Committee ** Dana Angluin (Yale University) Borja Balle (Amazon Research Cambridge) Leonor Becerra-Bonache (Université de Saint-Etienne) François Denis (Aix-Marseille Université) Colin de la Higuera (Nantes University) Falk Howar (TU Clausthal) Ariadna Quattoni (Naver Labs Europe) Alexandra Silva (University College of London) Makoto Kanazawa (Hosei University) Matthias Gallé (Naver Labs Europe) Frits Vaandrager (Radboud University) Alexander Clark (King’s College London) Kousha Etessami (University of Edinburgh) ** Organizers ** Remi Eyraud (Aix-Marseille Université) Tobias Kappé (University College London) Guillaume Rabusseau (Université de Montréal / Mila) Matteo Sammartino (University College London)
