[TYPES/announce] tenure-track assistant professor positions at Boston University Computer Science Department
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Boston University Computer Science Department has openings for two tenure-track assistant professorships. The search is open to all the areas of computer science and strong applicants working on the principles of programming languages and related areas will be seriously considered. You can find below the official announcement, which is also available at the link: https://urldefense.com/v3/__https://www.bu.edu/cs/2021/09/17/bu-cs-invites-applications-for-new-faculty-members/__;!!IBzWLUs!CMKBQNqbXEeJD5W5B1dMbgTBYGnzsLkWrjfywyUVGokca_ZGVHBX26EkWD5uD0bJWUjwfWbSUCKoyA$ We do hope to expand our Principles of Programming Languages and Verification group. https://urldefense.com/v3/__http://www.bu.edu/cs/research/popv/__;!!IBzWLUs!CMKBQNqbXEeJD5W5B1dMbgTBYGnzsLkWrjfywyUVGokca_ZGVHBX26EkWD5uD0bJWUjwfWY-t4-Wfw$ I am happy to answer any question that interested candidates may have. Best! Marco Official Announcement ——— Boston University Computer Science has openings for two tenure-track assistant professorships beginning July 1, 2022. Strong applicants in all areas of computer science, including security, privacy, foundations of programming languages and formal verification, machine learning and optimization, systems, human-computer interaction, artificial intelligence, algorithms, and theory, are encouraged to apply. We also have an opening for an associate professor of the practice beginning July 1, 2022. This search is particularly focused in the areas of artificial intelligence, machine learning, and deep learning. The Department is in the midst of an extended period of sustained growth, and is looking to both deepen areas of existing strength as well as to broaden into additional, new areas. Over the past several years, the tenure track faculty size has grown by 50%, with corresponding increases in graduate student population as well as in space and other resources. In December 2019, Boston University broke ground on a new 17-story, 350,000-square-foot Data Sciences Center, to house Computer Science along with other units contributing to Data Science, with planned opening in January 2023. Boston University, which has steadily increased in rankings over the past decade, is committed to nurturing and supporting interdisciplinary and cross-departmental research. BU is situated centrally in Boston, a vibrant city with an enormous range of options for industrial and academic collaboration around technology. The Department consists of a diverse group of 32 tenured and tenure-track faculty members, and offers programs leading to B.A., M.S., and Ph.D. degrees. The Department has research strengths in data mining, databases, graphics, image and video computing, machine learning, natural language processing, networking, distributed systems, operating systems, software design and implementation, real-time systems, security and cryptography, and theory of computation and algorithms. In addition, members of the Department collaborate closely with faculty across the university including mathematics and statistics, computer engineering, mechanical engineering, biology, earth and environment, economics, law, medicine, among others.Additional information about the Department is available at https://urldefense.com/v3/__http://www.bu.edu/cs__;!!IBzWLUs!CMKBQNqbXEeJD5W5B1dMbgTBYGnzsLkWrjfywyUVGokca_ZGVHBX26EkWD5uD0bJWUjwfWaVu0197A$ . Boston University as well as the Department of Computer Science expect excellence in research and in teaching and are committed to building a culturally, racially, and ethnically diverse scholarly community. To apply: Assistant Professor position (review to begin on 12/1/21 and continue on a rolling basis): https://urldefense.com/v3/__https://academicjobsonline.org/ajo/jobs/19503__;!!IBzWLUs!CMKBQNqbXEeJD5W5B1dMbgTBYGnzsLkWrjfywyUVGokca_ZGVHBX26EkWD5uD0bJWUjwfWaoWnpNHQ$ BU is an equal opportunity employer and all qualified applicants will receive consideration for employment without regard to race, color, religion, sex, sexual orientation, gender identity, national origin, disability status, protected veteran status, or any other characteristic protected by law. We are a VEVRAA Federal Contractor. Applicants are encouraged to consider other open faculty positions in related academic units at Boston University, including Computing & Data Sciences, Electrical & Computer Engineering, and Statistics. Upon request, successful candidates will have the opportunity to secure secondary appointments in cognate academic units at Boston University as appropriate.
[TYPES/announce] Postdoc Position at Simon Fraser University in Vancouver, Canada
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] The announcement below may be relevant for people interested in Rust, ownership types, and verification looking for a postdoc position. Best, Marco Steve Ko (Associate Professor at Simon Fraser University in Vancouver, Canada, https://steveyko.github.io/) is looking for a postdoc with a background in programming languages and/or software engineering. The postdoc will work on a research project that explores verification for mobile systems software using the Rust language combined with symbolic execution and other verification tools. The project is being done in collaboration with Marco Gaboardi (Associate Professor at Boston University in Boston, USA, http://cs-people.bu.edu/gaboardi/). The postdoc will be the main lead of the project and potentially work with a group of PhD/MS/undergraduate students. The expected duration of the position is two years. Interested applicants are encouraged to send their CV directly to Steve Ko at steve...@sfu.ca. - Steve
[TYPES/announce] PhD student positions at Boston University
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] The Boston University Programming Languages and Verification group (POPV) is looking for PhD students. http://www.bu.edu/cs/research/popv/ The group consists of several faculty, postdocs and students with interests in different aspects of programming languages, verification, type theories and proof assistants. Members of the POPV group actively collaborate with other groups at Boston University, including the Boston University Security group (https://www.bu.edu/cs/groups/busec/), and at other universities in the Boston area. Interested candidates are encouraged to contact one of the faculty in the group. The deadline for applications is December 15. The official application information can be found here: http://www.bu.edu/cs/phd-program/phd/ Application fees can be waived, if needed. All admitted PhD students will receive a 5-year fellowship offer, which may be a combination of a non-service fellowship, teaching fellowship or doctoral research assistant. Boston University is a large private University on the west side of Boston with a rich tradition of inclusion and social justice. We are proud that we were the first American university to award a PhD to a woman (1877) and that Martin Luther King Jr. received his PhD here (1955). The Boston area is home to a vibrant academic environment formed by multiple universities with a strong tradition in programming languages and verification, and it is also home to several startups and tech industries related to these research areas.
[TYPES/announce] CSF 2020 - Call for Short Talks
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] CSF 2020 - Call for Short Talks The Computer Security Foundations Symposium is an annual conference for researchers in computer security. Following the current COVID-19 situation, this year CSF will be an online event. https://www.ieee-security.org/TC/CSF2020/ Dates: June 22 to 26, 2020 CSF is now seeking *short talks* 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 above, the main focus of CSF is foundational security and privacy. Short talks are a great way to present late-breaking results, works-in-progress, works you want to advertise, and student projects to the CSF community. Each accepted short talk will be assigned a 5 min slot. Deadline: June 20, 2020 Submission Instructions: Authors are required to submit a title and abstract by email to gaboa...@bu.edu with subject "[CSF 2020] short talk proposal".
[TYPES/announce] CFP - Theory and Practice of Differential Privacy (TPDP) 2019 - November 11 - London, UK - Colocated with CCS 2019
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Theory and Practice of Differential Privacy (TPDP) 2019 November 11 - London, UK - Colocated with CCS 2019 Call for Papers Differential privacy is a promising approach to privacy-preserving data analysis. Differential privacy provides strong worst-case guarantees about the harm that a user could suffer from participating in a differentially private data analysis, but is also flexible enough to allow for a wide variety of data analyses to be performed with a high degree of utility. Having already been the subject of a decade of intense scientific study, it has also now been deployed in products at government agencies such as the U.S. Census Bureau and companies like Apple and Google. Researchers in differential privacy span many distinct research communities, including algorithms, computer security, cryptography, databases, data mining, machine learning, statistics, programming languages, social sciences, and law. This workshop will bring researchers from these communities together to discuss recent developments in both the theory and practice of differential privacy. Specific topics of interest for the workshop include (but are not limited to): • theory of differential privacy, • differential privacy and security, • privacy preserving machine learning, • differential privacy and statistics, • differential privacy and data analysis, • trade-offs between privacy protection and analytic utility, • differential privacy and surveys, • programming languages for differential privacy, • relaxations of the differential privacy definition, • differential privacy vs other privacy notions and methods, • experimental studies using differential privacy, • differential privacy implementations, • differential privacy and policy making, • applications of differential privacy. Submissions The goal of TPDP is to stimulate the discussion on the relevance of differentially private data analyses in practice. For this reason, we seek contributions from different research areas of computer science and statistics. Authors are invited to submit a short abstract (4 pages maximum) of their work. Submissions will undergo a lightweight review process and will be judged on originality, relevance, interest and clarity. Submission should describe novel work or work that has already appeared elsewhere but that can stimulate the discussion between different communities at the workshop. Accepted abstracts will be presented at the workshop either as a talk or a poster. The workshop will not have formal proceedings and is not intended to preclude later publication at another venue. Selected papers from the workshop will be invited to submit a full version of their work for publication in a special issue of the Journal of Privacy and Confidentiality. Submission website: https://easychair.org/conferences/?conf=tpdp2019 Important Dates Submission: June 21 (anywhere on earth) Notification: August 9 Workshop: 11/11 Program Committee • Michael Hay (co-chair), Colgate University • Aleksandar Nikolov (co-chair), University of Toronto • Aws Albarghouthi, University of Wisconsin–Madison • Borja Balle, Amazon • Mark Bun, Boston University • Graham Cormode, University of Warwick • Rachel Cummings, Georgia Tech University • Xi He, University of Waterloo • Gautam Kamath, University of Waterloo • Ilya Mironov, Google Research – Brain • Uri Stemmer, Ben-Gurion University • Danfeng Zhang, Penn State University For more information, visit the workshop website at https://tpdp.cse.buffalo.edu/2019/
[TYPES/announce] OPLSS 2019 - Oregon Programming Languages Summer School - deadline extension
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] *Extended deadline: April 30th, 2019* We are pleased to announce the program of the 18th annual Oregon Programming Languages Summer School (OPLSS) to be held from June 17th to June 29th, 2019 at the University of Oregon in Eugene. Full information on registration can be found here: http://www.cs.uoregon.edu/Activities/summerschool This year’s topic is "Foundations of Probabilistic Programming and Security”. The speakers and topics include: Amal Ahmed - Northeastern University Secure Compilation Andrew Gordon — Microsoft Research Empowering Spreadsheet Users with Probabilistic Programming Robert Harper - Carnegie Mellon University Practical Foundations for Programming Languages Fritz Henglein - Deon Digital AG and University of Copenhagen Smart Declarative Contracts Jan Hoffmann - Carnegie Mellon University Resource Analysis Andrew Myers — Cornell University Security-Typed Languages Frank Pfenning - Carnegie Mellon University Session-Typed Concurrent Programming Alexandra Silva - University College London Coalgebraic Semantics Sam Staton — University of Oxford Probabilistic programming: Bayesian Nonparametrics and Semantics Nikhil Swamy — Microsoft Research Verifying Low-level Code for Security and Correctness Properties using F* We hope you can join us for this excellent program. Zena Ariola, Paul Downen, Robert Harper and Marco Gaboardi [cid:16879899-50F8-45D1-9678-A6C7848516D1]
[TYPES/announce] OPLSS 2019 - Oregon Programming Languages Summer School - June 17-29 2019
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] We are pleased to announce the program of the 18th annual Oregon Programming Languages Summer School (OPLSS) to be held from June 17th to June 29th, 2019 at the University of Oregon in Eugene. The registration deadline is April 15th, 2019. Full information on registration and scholarships can be found here: http://www.cs.uoregon.edu/Activities/summerschool This year’s topic is "Foundations of Probabilistic Programming and Security”. The speakers and topics include: Amal Ahmed - Northeastern University Secure Compilation Andrew Gordon — Microsoft Research Empowering Spreadsheet Users with Probabilistic Programming Robert Harper - Carnegie Mellon University Practical Foundations for Programming Languages Fritz Henglein - Deon Digital AG and University of Copenhagen Smart Declarative Contracts Jan Hoffmann - Carnegie Mellon University Resource Analysis Frank Pfenning - Carnegie Mellon University Session-Typed Concurrent Programming Alexandra Silva - University College London Coalgebraic Semantics Sam Staton — University of Oxford Probabilistic programming: Bayesian Nonparametrics and Semantics Nikhil Swamy — Microsoft Research Verifying Low-level Code for Security and Correctness Properties using F* We hope you can join us for this excellent program. Zena Ariola, Paul Downen, Robert Harper and Marco Gaboardi
[TYPES/announce] POPL 2019 - Call for Tutorials
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] CALL FOR TUTORIALS POPL 2019 46th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages POPL: 13-19 January 2019 Affiliated Events: 13-15, 19 January 2019 Lisbon, Portugal http://popl19.sigplan.org The 46th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2019) will be held in Lisbon, Portugal. POPL provides a forum for the discussion of fundamental principles and important innovations in the design, definition, analysis, transformation, implementation and verification of programming languages, programming systems, and programming abstractions. Tutorials for POPL 2019 are solicited on any topic relevant to the POPL community. In particular, tutorials describing emerging topics or novel tools have been especially successful in the past. Tutorials will be held on *Monday January 14, 2019* (two days before the main conference and the day before PLMW). The expected length of a tutorial is 3 hours and, depending on the schedule, there might be the option to repeat it in the morning and in the afternoon. - Submission details * Deadline for submission: 15 October 2018 * Notification of acceptance: 25 October 2018 A tutorial proposal should provide the following information. * Tutorial title * Presenter(s), affiliation(s), and contact information * 1-3 page description (for evaluation). This should include the objectives, topics to be covered, presentation approach, target audience, prerequisite knowledge, and if the tutorial was previously held, the location (i.e. which conference), date, and number of attendees if available. * 1-2 paragraph abstract suitable for tutorial publicity. * 1 paragraph biography suitable for tutorial publicity. Proposal must be submitted in pdf or txt form by email to the associated events chairs Marco Gaboardi (gaboa...@buffalo.edu) and Zachary Kincaid (zkinc...@cs.princeton.edu). - Further information Any query regarding POPL 2018 tutorial proposals should be addressed to the associated events chairs Marco Gaboardi (gaboa...@buffalo.edu) and Zachary Kincaid (zkinc...@cs.princeton.edu)
[TYPES/announce] Theory and Practice of Differential Privacy (TPDP) 2018 Call for Papers
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Theory and Practice of Differential Privacy (TPDP) 2018 Call for Papers Colocated with CCS 2018 - October 15 - Toronto, Canada Differential privacy is a promising approach to privacy-preserving data analysis. Differential privacy provides strong worst-case guarantees about the harm that a user could suffer from participating in a differentially private data analysis, but is also flexible enough to allow for a wide variety of data analyses to be performed with a high degree of utility. Having already been the subject of a decade of intense scientific study, it has also now been deployed in products at government agencies such as the U.S. Census Bureau and companies like Apple and Google. Researchers in differential privacy span many distinct research communities, including algorithms, computer security, cryptography, databases, data mining, machine learning, statistics, programming languages, social sciences, and law. This workshop will bring researchers from these communities together to discuss recent developments in both the theory and practice of differential privacy. Specific topics of interest for the workshop include (but are not limited to): – theory of differential privacy, – privacy preserving machine learning, – differential privacy and statistics, – differential privacy and security, – differential privacy and data analysis, – trade-offs between privacy protection and analytic utility, – differential privacy and surveys, – programming languages for differential privacy, – relaxations of the differential privacy definition, – differential privacy vs other privacy notions and methods, – experimental studies using differential privacy, – differential privacy implementations, – differential privacy and policy making, – applications of differential privacy. Submissions: The goal of TPDP is to stimulate the discussion on the relevance of differentially private data analyses in practice. For this reason, we seek contributions from different research areas of computer science and statistics. Authors are invited to submit a short abstract (2-4 pages maximum) of their work. 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. Accepted abstracts will be presented at the workshop either as a talk or a poster. The workshop will not have formal proceedings and is not intended to preclude later publication at another venue. Please format your submissions according to the instructions in https://www. sigsac.org/ccs/CCS2018/papers/. Submissions will be accepted at https://easychair.org/ conferences/?conf=tpdp18. Important dates: – Abstract submission: July 20 (anywhere on Earth), – Author Notification: August 13, – Workshop: October 15. Website: http://tpdp.cse.buffalo.edu/2018/ Program committee: • Aleksandar Nikolov (chair), University of Toronto • Raef Bassily, Ohio State University • Mark Bun, Boston University • Michael Hay, Colgate University • Vishesh Karwa, Temple University • Katrina Ligett, Hebrew University • Anand Sarwate, Rutgers University • Thomas Steinke, IBM • Reza Shokri, National University of Singapore • Kunal Talwar, Google
[TYPES/announce] PLAS 2017 Call for Participation
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] PLAS 2017 Call for Participation ACM SIGSAC 12th Workshop on Programming Languages and Analysis for Security (PLAS 2017) http://plas2017.cse.buffalo.edu/ 30 October 2017 Dallas, TX, USA Co-located with ACM CCS 2017 (https://www.sigsac.org/ccs/CCS2017/) Registration through the CCS website. — *Invited Speakers* Stephen Chong, Harvard University, USA Authorization Contracts Michael Hicks, University of Maryland, USA Languages for Oblivious Computation — *Accepted papers* CFG Construction Soundness in Control-Flow Integrity Gang Tang, Trent Jaeger (Penn State University) Using Precise Taint Tracking for Auto-sanitization Tejas Saoji, Thomas H. Austin (San Jose State University), Cormac Flanagan (UCSC) Modular Synthesis of Heap Exploits Dusan Repel, Johannes Kinder, Lorenzo Cavallaro (Royal Holloway, University of London) Annotated multisemantics to prove Non-Interference analyses Gurvan Cabon, Alan Schmitt (Inria) Design-time Quantification of Integrity in Cyber-physical Systems Eric Rothstein Morris, Martin Ochoa, Carlos G. Murguia (Singapore University of Technology and Design) Encoding DCC in Haskell Maximilian Algehed, Alejandro Russo (Chalmers University of Technology) A Sequent Calculus for Counterfactual Reasoning McKenna McCall, Lay Kuan Loh, Limin Jia (Carnegie Mellon University) Simplicity: A New Language for Blockchains Russell O'Connor (Blockstream) Short Paper: Compiler Optimizations with Retrofitting Transformations: Is there a Semantic Mismatch? Jay Lim (Rutgers), Vinod Ganapathy (Indian Institute of Science), Santosh Nagarakatte (Rutgers) Short Paper: Towards information flow reasoning about real-world C code Samuel Gruetter (MIT), Toby Murray (University of Melbourne)
[TYPES/announce] POPL 2018 call for tutorials
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] CALL FOR TUTORIALS POPL 2018 45th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages POPL: 8-13 January 2018 Affiliated Events: 8-9, 13 January 2018 Los Angeles, USA http://popl18.sigplan.org The 45th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2018) will be held in Los Angeles, USA. POPL provides a forum for the discussion of fundamental principles and important innovations in the design, definition, analysis, transformation, implementation and verification of programming languages, programming systems, and programming abstractions. Tutorials for POPL 2018 are solicited on any topic relevant to the POPL community. In particular, tutorials describing emerging topics or novel tools have been especially successful in the past. Tutorials will be held on Monday January 8, 2016 (two days before the main conference and the day before PLMW). The expected length of a tutorial is 3 hours and, depending on the schedule, there might be the option to repeat it in the morning and in the afternoon. - Submission details Deadline for submission: 01 September 2017 Notification of acceptance: 15 September 2017 A tutorial proposal should provide the following information. • Tutorial title • Presenter(s), affiliation(s), and contact information • 1-3 page description (for evaluation). This should include the objectives, topics to be covered, presentation approach, target audience, prerequisite knowledge, and if the tutorial was previously held, the location (i.e. which conference), date, and number of attendees if available. • 1-2 paragraph abstract suitable for tutorial publicity. • 1 paragraph biography suitable for tutorial publicity. Proposal must be submitted in pdf or txt form by email to the associated events chair Marco Gaboardi (gaboa...@buffalo.edu). The organizers may also solicit tutorials directly, as has been common in the past. - Further information Any query regarding POPL 2018 tutorial proposals should be addressed to the associated events chair, Marco Gaboardi (gaboa...@buffalo.edu).
[TYPES/announce] POPL 2018 - call for Workshops and co-located Events
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] CALL FOR WORKSHOPS AND CO-LOCATED EVENTS POPL 2018 45th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages POPL: 8-13 January 2018 Affiliated Events: 8-9, 13 January 2018 Los Angeles, USA http://popl18.sigplan.org The 45th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2018) will be held in Los Angeles, USA. POPL provides a forum for the discussion of fundamental principles and important innovations in the design, definition, analysis, transformation, implementation and verification of programming languages, programming systems, and programming abstractions. Events focusing on experimental and theoretical topics are welcome. Proposals are invited for workshops and other events to be co-located with POPL 2018. Events can either be sponsored by SIGPLAN (http://acm.org/sigplan/) or supported through in-cooperation status. Workshops should be more informal and focused than POPL itself, include sessions that enable interaction among the workshop attendees, and be fairly low cost. The preference is for one-day workshops, but other schedules can also be considered. - Submission details Deadline for submission: 15 May 2017 Notification of acceptance: 5 June 2017 A workshop proposal should provide the following information. • Name of the workshop. • Duration of the workshop. • Organizers: names, affiliation, contact information, brief (100 words) biography. • A short description (150-200 words) of the topic. • Event format: workshop; type of submissions if any; review process; results dissemination. • Expected attendance and target audience. • Potential PC members. • History of the workshop. Proposal must be submitted in pdf or txt form by email to the workshop chair Marco Gaboardi (gaboa...@buffalo.edu). - Sponsorship vs in-cooperation status Events can either be sponsored by SIGPLAN (http://acm.org/sigplan/) or supported through in-cooperation status. Sponsored workshops are required to produce a final report after the workshop has taken place that is suitable for publication in SIGPLAN Notices. Further information about SIGPLAN sponsorship and in-cooperation status of workshops is available here: http://www.sigplan.org/Resources/Proposals/Cooperated http://www.sigplan.org/Resources/Proposals/Sponsored - Selection committee All submissions will be evaluated by a committee comprising the following members of the POPL 2018 organizing committee, together with the members of the SIGPLAN executive committee. Marco Gaboardi University at Buffalo, SUNY Workshops chair Ranjit Jhala University of California, San Diego General chair Andrew Myers Cornell University Program chair - Further information Any query regarding POPL 2018 co-located event proposals should be addressed to the workshops chair, Marco Gaboardi (gaboa...@buffalo.edu).
