- finite-model-theory - lists.rwth-aachen.de

FTfJP 2020 (virtual) - Call for Participation - 23.07.2020
by Oortwijn Wytse 16 Jul '20

16 Jul '20

# CALL FOR PARTICIPATION 22th Workshop on Formal Techniques for Java-like Programs, FTfJP 2020 https://2020.ecoop.org/track/FTfJP-2020-papers Virtual event, to be held using Zoom, on Thursday, 23 July 2020, from 10:00 to 17:30 (GMT+2 Amsterdam time). Participation is free. For more details please see the webpage linked above. ## INVITED SPEAKERS * Frank de Boer and Hans-Dieter Hiep (CWI, the Netherlands): History-based Specification and Verification of Java Collections in KeY * Sung-Shik Jongmans (Open University, CWI; the Netherlands): Discourje: Runtime Verification of Communication Protocols in Clojure ## INVITED TUTORIAL * Alexander Summers (University of British Columbia, Canada): Prusti – Deductive Verification for Rust ## PROGRAM The program of (virtual) FTfJP 2020, July 23th, is as follows. All times are in GMT+2 Amsterdam time. Session One * 10:00 - 11:00: History-based Specification and Verification of Java Collections in KeY (invited talk) (Frank de Boer and Hans-Dieter Hiep) * 11:00 - 11:30: Dalarna: A Simplistic Capability-Based Dynamic Language Design For Data Race Freedom (Kiko Fernandez-Reyes, James Noble, Isaac Oscar Gariano, Erin Greenwood-Thessman, Michael Homer and Tobias Wrigstad) * 11:30 - 11:50: ConSysT: Tunable, Safe Consistency meets Object-Oriented Programming (Mirko Köhler, Nafise Eskandani Masoule, Alessandro Margara and Guido Salvaneschi) -- lunch break -- Session Two * 13:15 - 13:45: Salsa: Static Analysis of Serialization Features (Joanna Cecilia da Silva Santos, Reese Jones and Mehdi Mirakhorli) * 13:45 - 14:05: Towards Verified Construction of Correct and Optimised GPU Software (Marieke Huisman and Anton Wijs) * 14:05 - 14:35: An inductive abstract semantics for coFJ (Pietro Barbieri, Francesco Dagnino and Elena Zucca) * 14:35 - 15:05: A Separation Logic to Verify Termination of Busy-Waiting for Abrupt Program Exit (Tobias Reinhard, Amin Timany and Bart Jacobs) -- break -- Session Three * 15:30 - 16:30: Prusti – Deductive Verification for Rust (invited tutorial) (Alexander Summers) * 16:30 - 17:30: Discourje: Runtime Verification of Communication Protocols in Clojure (invited talk) (Sung-Shik Jongmans) ## ABOUT FTfJP 2020 Formal techniques can help analyse programs, precisely describe program behaviour, and verify program properties. Modern programming languages are interesting targets for formal techniques due to their ubiquity and wide user base, stable and well-defined interfaces and platforms, and powerful (but also complex) libraries. New languages and applications in this space are continually arising, resulting in new programming languages (PL) research challenges. Work on formal techniques and tools and on the formal underpinnings of programming languages themselves naturally complement each other. FTfJP is an established workshop which has run annually since 1999 alongside ECOOP, with the goal of bringing together people working in both fields. The workshop has a broad PL theme; the most important criterion is that submissions will generate interesting discussions within this community. The term “Java-like” is somewhat historic and should be interpreted broadly: FTfJP solicits and welcomes submission relating to programming languages in general, beyond Java, C#, Scala, etc.

1 0

2020 ALONZO CHURCH AWARD ANNOUNCEMENT
by Andrzej Murawski 15 Jul '20

15 Jul '20

2020 ALONZO CHURCH AWARD ANNOUNCEMENT The ACM Special Interest Group on Logic (SIGLOG), the European Association for Theoretical Computer Science (EATCS), the European Association for Computer Science Logic (EACSL), and the Kurt Gödel Society (KGS) are pleased to announce that Ronald Fagin, Phokion G. Kolaitis, Renée J. Miller, Lucian Popa, and Wang Chiew Tan have been selected as the winners of the 2020 Alonzo Church Award for Outstanding Contributions to Logic and Computation. The award recognizes their ground-breaking work on laying the logical foundations for data exchange, described in the following papers: (1) Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Renée J. Miller. Data exchange: Semantics and Query Answering, Proceedings of the 9th International Conference on Database Theory (ICDT 2003), pp. 207-223, 2003. Full journal version: Theoretical Computer Science, Vol. 336, No. 1, pp. 89-124, 2005. (2) Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan. Composing Schema Mappings: Second-Order Dependencies to the Rescue, Proceedings of the 23rd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 2004), pp. 83-94, 2004. Full journal version: ACM Transactions on Database Systems, Vol. 30, No. 4, pp. 994-1055, 2005. Data exchange is the problem of transforming data structured under a schema, called the source schema, into data conforming to a different schema, called the target schema. The results and techniques developed have in addition to gaining theoretical insights influenced the development of industrial and academic tools. The 2020 Church Award was selected by a panel consisting of Mariangiola Dezani, Thomas Eiter (chair), Javier Esparza, Radha Jagadeesan and Natarajan Shankar. THE CONTRIBUTION Data exchange is an old and ubiquitous problem in data management that was described by Philip Bernstein as the "oldest problem in databases". Early work on data exchange used low-level, ad hoc programs to transform data from the source schema to the target schema, which resulted into inefficiencies and limited reusability. Publications (1) and (2) laid the logical foundations for data exchange and became the catalyst for the development of data exchange as a research area in its own right. Publication (1) is about logic in computer science: a fragment of first-order logic, called source-to-target tuple-generating dependencies (in short, s-t tgds), is systematically used as a specification language in data exchange. The algorithmic and structural properties of s-t tgds are explored, and the concept of a universal solution is introduced as the preferred way to carry out the data exchange task. Publication (2) is about logic from computer science: first, it is shown that the language of s-t tgds is not closed under composition; second, a new fragment of second-order logic, called second-order tuple-generating dependencies (in short, SO tgds) is identified and shown to be the “right" logic-based specification language for composing s-t tgds. The award publications are well-cited and have been recognized with two test-of-time awards.

1 0

Awardees of the VCLA International Student Awards for Outstanding Master and Undergraduate Theses in Logic and Computer Science - 2020
by Mihaela Rozman 15 Jul '20

15 Jul '20

The Vienna Center for Logic and Algorithms of TU Wien (VCLA) has the pleasure to announce the recipients of the VCLA International Student Awards for Outstanding Master and Undergraduate Theses in Logic and Computer Science. The highly successful fifth edition of the VCLA International Student Awards was concluded in July 2020. The awardees of the 2020 edition of the VCLA International Student Awards are: ***OUTSTANDING MASTER THESIS AWARD*** Karolina Okrasa (Poland Warsaw University of Technology) Thesis: Complexity of variants of graph homomorphism problem in selected graph classes Under the supervision of Paweł Rzążewski http://www.vcla.at/2020/07/fifth-edition-of-the-vcla-international-student-… ***OUTSTANDING UNDERGRADUATE RESEARCH AWARD*** Antonin Callard (France ENS Paris-Saclay) Thesis: Topological analysis of represented spaces and computable maps, cb0 spaces and non-countably-based spaces Under the supervision of Mathieu Hoyrup http://www.vcla.at/2020/07/fifth-edition-of-the-vcla-international-student-… ============= AWARDS ============= The annually awarded VCLA Awards are dedicated to the memory of Helmut Veith, the brilliant computer scientist who tragically passed away in March 2016, and aim to carry on his commitment to promoting young talent and promising researchers in these areas. The awardees receive: • Outstanding Master Thesis Award: 1200 EUR • Outstanding Undergraduate Research (Bachelor) Award: 800 EUR • The awardees will be invited to present their work at an award ceremony (TBA due to COVID -19) =================== (SELF-)NOMINATIONS =================== The nominated theses had to be awarded between 15 November 2018 and 31 December 2019. The 2021 call will be issued in January 2021, for theses awarded between 15 November 2019 and 31 December 2020: http://www.vcla.at/vcla-awards =================== FORMER AWARDEES =================== *Martín Muñoz (Pontificia Universidad Católica de Chile): Descriptive Complexity for Counting Complexity Classes *Alexej Rotar (TU München): The Satisfiability Problem for Fragments of PCTL *Tomáš Lamser (Masaryk University): Algorithmic Analysis of Patrolling Games *Jeremy Liang An Kong (Imperial College London): MCMAS-Dynamic: Symbolic Model Checking Linear Dynamic Logic *Felix Dörre (Karlsruhe Institute of Technology): Verification of Random Number Generators *Valeria Vignudelli (University of Bologna): The Discriminating Power of Higher-Order Languages: A Process Algebraic Approach *Maximilian Schleich (Oxford University): Learning Regression Models over Factorised Joins *Pablo Muñoz (University of Chile): New Complexity Bounds for Evaluating CRPQs with Path Comparisons *Kuldeep S. Meel (Rice University): Sampling Techniques for Boolean Satisfiability *Luke Schaeffer (University of Waterloo): Deciding Properties of Automatic Sequences *Sophie Spirkl (University of Bonn): Boolean Circuit Optimization =========================== VCLA AWARD COMMITTEE 2020 =========================== *Shqiponja Ahmetaj *Ezio Bartocci *Ekaterina Fokina *Robert Ganian, co-chair *Benjamin Kiesl *Martin Lackner *Bjoern Lellmann *Anna Lukina *Laura Nenzi *Johannes Oetsch *Magdalena Ortiz, chair *Revantha Ramanayake, co-chair *Zeynep G. Saribatur *Mantas Simkus *Sebastian Skritek *Friedrich Slivovsky *Max Tschaikowski *Johannes P. Wallner

1 0

Awardees of the VCLA International Student Awards for Outstanding Master and Undergraduate Theses in Logic and Computer Science - 2020
by Mihaela Rozman 15 Jul '20

15 Jul '20

The Vienna Center for Logic and Algorithms of TU Wien (VCLA) has the pleasure to announce the recipients of the VCLA International Student Awards for Outstanding Master and Undergraduate Theses in Logic and Computer Science. The highly successful fifth edition of the VCLA International Student Awards was concluded in July 2020. The awardees of the 2020 edition of the VCLA International Student Awards are: ***OUTSTANDING MASTER THESIS AWARD*** Karolina Okrasa (Poland Warsaw University of Technology) Thesis: Complexity of variants of graph homomorphism problem in selected graph classes Under the supervision of Paweł Rzążewski http://www.vcla.at/2020/07/fifth-edition-of-the-vcla-international-student-… ***OUTSTANDING UNDERGRADUATE RESEARCH AWARD*** Antonin Callard (France ENS Paris-Saclay) Thesis: Topological analysis of represented spaces and computable maps, cb0 spaces and non-countably-based spaces Under the supervision of Mathieu Hoyrup http://www.vcla.at/2020/07/fifth-edition-of-the-vcla-international-student-… ============= AWARDS ============= The annually awarded VCLA Awards are dedicated to the memory of Helmut Veith, the brilliant computer scientist who tragically passed away in March 2016, and aim to carry on his commitment to promoting young talent and promising researchers in these areas. The awardees receive: • Outstanding Master Thesis Award: 1200 EUR • Outstanding Undergraduate Research (Bachelor) Award: 800 EUR • The awardees will be invited to present their work at an award ceremony (TBA due to COVID -19) =================== (SELF-)NOMINATIONS =================== The nominated theses had to be awarded between 15 November 2018 and 31 December 2019. The 2021 call will be issued in January 2021, for theses awarded between 15 November 2019 and 31 December 2020: http://www.vcla.at/vcla-awards =================== FORMER AWARDEES =================== *Martín Muñoz (Pontificia Universidad Católica de Chile): Descriptive Complexity for Counting Complexity Classes *Alexej Rotar (TU München): The Satisfiability Problem for Fragments of PCTL *Tomáš Lamser (Masaryk University): Algorithmic Analysis of Patrolling Games *Jeremy Liang An Kong (Imperial College London): MCMAS-Dynamic: Symbolic Model Checking Linear Dynamic Logic *Felix Dörre (Karlsruhe Institute of Technology): Verification of Random Number Generators *Valeria Vignudelli (University of Bologna): The Discriminating Power of Higher-Order Languages: A Process Algebraic Approach *Maximilian Schleich (Oxford University): Learning Regression Models over Factorised Joins *Pablo Muñoz (University of Chile): New Complexity Bounds for Evaluating CRPQs with Path Comparisons *Kuldeep S. Meel (Rice University): Sampling Techniques for Boolean Satisfiability *Luke Schaeffer (University of Waterloo): Deciding Properties of Automatic Sequences *Sophie Spirkl (University of Bonn): Boolean Circuit Optimization =========================== VCLA AWARD COMMITTEE 2020 =========================== *Shqiponja Ahmetaj *Ezio Bartocci *Ekaterina Fokina *Robert Ganian, co-chair *Benjamin Kiesl *Martin Lackner *Bjoern Lellmann *Anna Lukina *Laura Nenzi *Johannes Oetsch *Magdalena Ortiz, chair *Revantha Ramanayake, co-chair *Zeynep G. Saribatur *Mantas Simkus *Sebastian Skritek *Friedrich Slivovsky *Max Tschaikowski *Johannes P. Wallner

1 0

PhD position in dependence logic, Helsinki (Finland)
by Yang, Fan 07 Jul '20

07 Jul '20

The Department of Mathematics and Statistics at the University of Helsinki (Finland) invites applications for a Doctoral student position in Dependence Logic for a fixed-term of four years. The position will start as soon as possible. **Application deadline** Applications should be sent as soon as possible, preferably by August 9, 2020. The position will remain open until filled. **Job description** The doctoral student is expected to conduct research on dependence logic. Dependence logic a novel logical formalism for reasoning about dependence and independence concepts in sciences (read more on: https://plato.stanford.edu/entries/logic-dependence/). The doctoral student will work within the research project on “Dependence logic and its applications in no-go paradoxes in sciences” funded by Academy of Finland. This multidisciplinary project aims to study open problems in dependence logic (including the axiomatization problem, expressivity, etc.) and to investigate applications of dependence logic and team semantics in no-go paradoxes in social choice, quantum foundations and database theory. The principal investigator of the project is Dr. Fan Yang (https://sites.google.com/site/fanyanghp/). This research is embedded in the Helsinki Logic Group. For more information about the Group, please visit: https://wiki.helsinki.fi/display/Logic/Home. **Qualifications** Applicants are expected to hold a Master’s degree in mathematics, computer science, philosophy or some other relevant subject by the time of the start date. An ideal candidate should have a strong background in mathematical logic, and a keen interest in interdisciplinary research. For more information and details see https://sites.google.com/site/fanyanghp/phd-position or contact Dr. Fan Yang at fan.yang(at)helsinki.fi<http://helsinki.fi>.

1 0

Call for Participation at the 32nd International Conference Computer-Aided Verification - CAV 2020 - Virtual and admission free event - Registration deadline is July 10th, 2020
by Mihaela Rozman 06 Jul '20

06 Jul '20

[Apologies for multiple copies of this announcement] ****************************************************************** CALL FOR PARTICIPATION Computer-Aided Verification, 32nd International Conference CAV 2020 Virtual and admission free event, Registration closes July 10th, 2020. July 19-24, 2020 http://i-cav.org/2020/ ****************************************************************** -- ABOUT CAV -- CAV 2020 is the 32nd in a series dedicated to the advancement of the theory and practice of computer-aided formal analysis methods for hardware and software 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. Along with the main conference, CAV will feature eight workshops (in addition to the Verification Mentoring Workshop) and tutorials. -- REGISTRATION -- Registration for the CAV 2020 event is free. Registration closes July 10th, 2020. Registration is required to attend the main conference and all associated workshops. http://i-cav.org/2020/attending/ -- CAV 2020 PROGRAM -- Available here https://easychair.org/smart-program/CAV2020/ -- WORKSHOPS (19-21st July) -- VERIFICATION MENTORING WORKSHOP (19-20 July) -- TUTORIALS (20th July) -- MAIN CONFERENCE (21-24 July) -- INVITED SPEAKERS -- * David Dill, Callibra at Facebook: Formal Verification of Libra Blockchain Smart Contracts * Pushmeet Kohli, Deepmind at Google: Towards Robust Artificial Intelligence via Spec-consistent Machine Learning -- INVITED TUTORIALS -- * Tevfik Bultan, University of California, Santa Barbara: Quantifying Information Leakage Using Model Counting * Sriram Sankaranarayanan, University of Colorado, Boulder: Probabilistic Programming: A Guide for Verificationists -- PUBLIC LECTURE ``Logic Lounge'' -- * Cory Doctorow: Working as Intended: Surveillance Capitalism is not a Rogue Capitalism http://i-cav.org/2020/logic-lounge/ -- CO-LOCATED EVENTS (19-21ST July) -- 8 satellite workshops and the Verification Mentoring Workshop will take place during CAV 2020. http://i-cav.org/2020/workshops-2/ http://i-cav.org/2020/mentoring/ Check their webpages for their schedule and program. * Numerical Software Verification (NSV) * Working Conference on Verified Software: Theories, Tools, and Experiments (VSTTE) * Workshop on Verification of Neural Networks (VNNb 20) and Verification of Neural Networks Competition (VNN-COMPb 20) * Workshop on Democratizing Software Verification * Workshop on Synthesis (SYNT) * Workshop on Program Equivalence and Relational Reasoning (PERR) * Workshop on Formal Methods for ML-Enabled Autonomous Systems (FoMLAS) * Workshop on Formal Methods for Blockchains (FMBC) * Verification Mentoring Workshop (VMW) -- VIRTUAL SOCIAL EVENTS -- TBD -- ORGANIZERS -- We hope to welcome you to CAV 2020 online! Shuvendu Lahiri (Microsoft Research) and Chao Wang (University of Southern California) CAV 2020 Program Co-chairs (on behalf of the entire CAV 2020 organizing committee)

1 0

[CfP] EELP 2020 - The Second Workshop on Epistemic Extensions of Logic Programming
by Laura Pandolfo 03 Jul '20

03 Jul '20

============================================================================== CALL FOR PAPERS EELP 2020 The Second Workshop on Epistemic Extensions of Logic Programming September 18-24, 2020 Rende, Italy https://www.semsys.aau.at/events/eelp2020/ ============================================================================== AFFILIATION This workshop is part of the International Conference of Logic Programming (ICLP) 2020. In keeping with the main conference, the workshop will be held as a fully virtual event this year. AIMS AND SCOPE Several successful logic programming languages, evidenced by the availability of a multitude of solvers, industrial applications, and an active research community, have been proposed in the literature. Researchers have long recognized the need for epistemic operators in these languages. This led to a flurry of research on this topic, and renewed interest in recent years. A central question is that of the definition of a rigorous and intuitive semantics for such epistemic operators, which is still subject of ongoing research. Notions of equivalence, structural properties, and the inter-relationships between logic programming languages and established logics are all subjects being actively investigated. Another important topic is that of practical solvers to compute answers to logic programs that contain epistemic operators. Several solvers are actively developed, building on established solvers, or using rewriting-based approaches. For practical applications, additional language features are actively explored in order to be able to apply epistemic extensions of logic programming langauges to practical problems. The goal of this workshop is to facilitate discussions regarding these topics and a productive exchange of ideas. Topics of interests include (but are not limited to): - Semantics of epistemic operators in logic programming - New methods for solving epistemic extensions of logic programs - Computational properties of epistemic extensions of logic programs - Relating epistemic extensions of logic programs with other logic-based formalisms - Practical applications of logic programming extended with epistemic extensions - Additional language features - Multi-paradigm problem solving involving epistemic extensions of logic programming - Evaluation and comparison of logic programs with epistemic extensions to other paradigms - Grounding of non-ground logic programs programs with epistemic extensions SUBMISSION GUIDELINES We welcome two categories of submissions: - Full Papers, that is, original, unpublished research (at most 15 pages), and - Extended Abstracts of already published research (at most 2 pages). All submissions should be in the Springer LNCS format. Paper submission will be handled electronically by means of the Easychair system. All submissions will be peer-reviewed. The submission page is available here: http://www.easychair.org/conferences/?conf=eelp2020. EELP is a non-archival venue and there will be no published proceedings. However, informal proceedings will be provided and the papers will be posted informally on the workshop website. Submissions to other conferences and journals both in parallel and subsequent to EELP 2020 are allowed. IMPORTANT DATES Paper submission: August 7, 2020 AoE Notification: August 31, 2020 Camera-ready: September 11, 2020 Workshop Dates: September 18-24, 2020, as a workshop of ICLP 2020 ORGANIZERS AND CO-CHAIRS Wolfgang Faber, University of Klagenfurt Jorge Fandinno, University of Potsdam Michael Morak, University of Klagenfurt CONTACT Please direct any questions to eelp2020(a)easychair.org. -- -- *Dona il 5x1000* all'Università degli Studi di Sassaricodice fiscale: 00196350904

1 0

[CfP] PLP-2020: The Seventh Workshop on Probabilistic Logic Programming
by Laura Pandolfo 02 Jul '20

02 Jul '20

PLP-2020: The Seventh Workshop on Probabilistic Logic Programming ---------------------------------------------------------------- A workshop of 36th International Conference on Logic Programming September 18-24, 2020, virtual conference http://stoics.org.uk/plp/plp2020/ Deadline for submissions: Aug, 1st 2020 **** COVID-19: Due to the ongoing pandemic, the workshop will be held online. **** Overview ----- Probabilistic logic programming (PLP) approaches have received much attention in this century. They address the need to reason about relational domains under uncertainty arising in a variety of application domains, such as bioinformatics, the semantic web, robotics, and many more. Developments in PLP include new languages that combine logic programming with probability theory, as well as algorithms that operate over programs in these formalisms. The workshop encompasses all aspects of combining logic, algorithms, programming and probability. PLP is part of a wider current interest in probabilistic programming. By promoting probabilities as explicit programming constructs, inference, parameter estimation and learning algorithms can be ran over programs which represent highly structured probability spaces. Due to logic programming's strong theoretical underpinnings, PLP is one of the more disciplined areas of probabilistic programming. It builds upon and benefits from the large body of existing work in logic programming, both in semantics and implementation, but also presents new challenges to the field. PLP reasoning often requires the evaluation of large number of possible states before any answers can be produced thus braking the sequential search model of traditional logic programs. While PLP has already contributed a number of formalisms, systems and well understood and established results in: parameter estimation, tabling, marginal probabilities and Bayesian learning, many questions remain open in this exciting, expanding field in the intersection of AI, machine learning and statistics. This workshop provides a forum for the exchange of ideas, presentation of results and preliminary work, in the following areas * probabilistic logic programming formalisms * parameter estimation * statistical inference * implementations * structure learning * reasoning with uncertainty * constraint store approaches * stochastic and randomised algorithms * probabilistic knowledge representation and reasoning * constraints in statistical inference * applications, such as * * bioinformatics * * semantic web * * robotics * probabilistic graphical models * Bayesian learning * tabling for learning and stochastic inference * MCMC * stochastic search * labelled logic programs * integration of statistical software The above list should be interpreted broadly and is by no means exhaustive. Purpose ----- After six successful editions of this workshop at ICLP 2014 in Vienna, ICLP 2015 in Cork and ILP 2016 in London, at ILP 2017 in Orléans, at ILP 2018 in Ferrara, at ICLP 2019 in Las Cruces, PLP will be online this year and will be co-located with ICLP 2020. We hope that this encourages further collaboration between researchers in PLP and researchers working in other areas of ICLP. Submissions ----- Submissions will be managed via EasyChair(https://easychair.org/conferences/?conf=plp2020). Contributions should be prepared in the LNCS style. A mixture of papers are sought including: new results, work in progress as well as technical summaries of recent substantial contributions. Papers presenting new results should be 6-15 pages in length. Work in progress and technical summaries can be shorter (2-5 pages). The workshop proceedings will clearly indicate the type of each paper. At least one author of each accepted paper will be required to attend the workshop to present the contribution. Publication ----- Informal proceedings will be made available electronically to attendees. They will also be for stored permanently in the form on CEUR Workshop Proceedings (http://ceur-ws.org/) or arXiv (https://arxiv.org). The proceedings will consist of clearly marked sections corresponding to the different types of submissions accepted. Deadlines ----- Papers due: Aug, 1st 2020 Notification to authors: Sep, 1st 2020 Camera ready version due: Sep, 10th 2020 Workshop date: September 18-24, 2020 (the deadline for all dates is AOE) Invited Speaker(s) ----- To be confirmed. Organising Committee ----- Carmine Dodaro (University of Calabria, Italy) [co-chair] (dodaro(a)mat.unical.it) George Aristidis Elder (Queen Mary University of London, UK) [co-chair] (g.a.elder(a)qmul.ac.uk) Program Committee ----- To be confirmed. -- -- *Dona il 5x1000* all'Università degli Studi di Sassaricodice fiscale: 00196350904

1 0

[2nd CfP] ICLP DC 2020 - 16th Doctoral Consortium (DC) on Logic Programming
by Laura Pandolfo 01 Jul '20

01 Jul '20

*** ICLP DC 2020 - 16th Doctoral Consortium (DC) on Logic Programming *** The 16th Doctoral Consortium (DC) on Logic Programming provides students with the opportunity to present and discuss their research directions, and to obtain feedback from both peers and experts in the field. The preliminary website of the DC can be found at: https://sites.google.com/view/iclp-dc-2020/iclp-2020-doctoral-consortium The DC will take place during the 36th International Conference on Logic Programming (ICLP) https://iclp2020.unical.it/ (September 18-24, 2020), hosted by the University of Calabria, Italy, as a fully virtual event. The best paper from the DC will be given the opportunity to make a presentation in a session of the main ICLP conference. We aim to find sponsoring to cover the registration cost of students participating in the DC, but this still has to be confirmed. Important Dates Paper submission: July 11, 2020 Notification: July 25, 2020 Camera-ready copy: August 6, 2020 DC presentations: Sunday, September 20, 2020 (fully virtual event) However, DC students are highly recommended to attend the Autumn School on Logic Programming and Constraint Programming on: Friday and Saturday, September 18-19, 2020: https://sites.google.com/view/iclp-dc-2020/autumn-school-on-logic-programmi… Audience The DC is designed for students currently enrolled in a Ph.D. program, though we are also open to exceptions (e.g., students currently in a Master's program and interested in doctoral studies). Students at any stage in their doctoral studies are encouraged to apply for participation in the DC. Applicants are expected to conduct research in areas related to logic and constraint programming; topics of interest include (but are not limited to): Theoretical Foundations of Logic and Constraint Logic Programming Sequential and Parallel Implementation Technology Static and Dynamic Analysis, Abstract Interpretation, Compilation Technology, Verification Logic-based Paradigms (e.g., Answer Set Programming, Concurrent Logic Programming, Inductive Logic Programming) Innovative Applications of Logic Programming Submissions by students who have presented their work at previous ICLP DC editions are allowed, but should occur only if there are substantial changes or improvements to the student's work. The DC offers participants a convenient, more informal way to interact with established researchers and fellow students, through presentations, question-answer sessions, panel discussions, and invited presentations. The Doctoral Consortium will also provide the possibility to reflect - through short activities, information sessions, and discussions - on the process and lessons of research and life in academia. Each participant will give a short, critiqued, research presentation. Discussants Renowned experts and researchers in the fields of logic and constraint programming will join in evaluating submissions and will participate in the DC, providing valuable feedback to DC participants. Goals To provide doctoral students working in the fields of logic and constraint programming with a friendly and open forum to present their research ideas, listen to ongoing work from peer students, and receive constructive feedback. To provide students with relevant information about important issues for doctoral candidates and future academics. To develop a supportive community of scholars and a spirit of collaborative research. To support a new generation of researchers with information and advice on academic, research, industrial, and non-traditional career paths. Submission Details The DC is designed for students currently enrolled in a Ph.D. program, however Master's students who are actively involved in research (please see the list of topics below) can also participate in the DC program. Applicants are expected to conduct research in areas related to logic and constraint programming. Topics included, but not limited to: Foundations: Semantics, Formalisms, Nonmonotonic reasoning, Knowledge representation. Languages: Concurrency, Objects, Coordination, Mobility, Higher Order, Types, Modes, Assertions, Modules, Meta-programming, Logic-based domain-specific languages, Programming Techniques. Declarative programming: Declarative program development, Analysis, Type and mode inference, Partial evaluation, Abstract interpretation, Transformation, Validation, Verification, Debugging, Profiling, Testing, Execution visualization. Implementation: Virtual machines, Compilation, Memory management, Parallel/distributed execution, Constraint handling rules, Tabling, Foreign interfaces, User interfaces. Related Paradigms and Synergies: Inductive and Co-inductive Logic Programming, Constraint Logic Programming, Answer Set Programming, Interaction with SAT, SMT and CSP solvers, Logic programming techniques for type inference and theorem proving, Argumentation, Probabilistic Logic Programming, Relations to object-oriented and Functional programming. Applications: Databases, Big Data, Data integration and federation, Software engineering, Natural language processing, Web and Semantic Web, Agents, Artificial intelligence, Computational life sciences, Education, Cybersecurity, and Robotics. Submissions of the research summary must be made in EPTCS format (http://info.eptcs.org/) and submitted via EasyChair. All papers must be written in English and should be between 5 and 10 pages. For all accepted DC papers, the student is required to attend the DC program and give a presentation during the DC. A program committee consisting of experts in various areas related to logic and constraint programming reviews the submissions. Papers are reviewed by at least two, and usually three, referees. The submission package should consist of the research summary in the format mentioned above, a short vita or cover letter of the applicant, a letter of recommendation from applicant's faculty advisor, and one paragraph statement outlining how the school will benefit the applicant. All material is to be submitted electronically, in PDF format on the Easychair system. Easychair link: https://easychair.org/conferences/?conf=iclp20200 (Doctoral Consortium track) Research summary (make sure to include your complete name, address, and affiliation): The body of your research summary (no more than 10 pages, but 5 is fine as well!) should provide a clear overview of your research, its potential impact, and its current status. You are encouraged to include the following sections: Introduction and problem description Background and overview of the existing literature Goal of the research Current status of the research Preliminary results accomplished (if any) Open issues and expected achievements Bibliographical references Review Criteria The DC program committee will select participants based on their anticipated contribution to the DC objectives. Participants typically have settled on their thesis directions and have their research proposal accepted by their thesis committee. Students will be selected based on clarity and completeness of their submission package, relevance of their research area w.r.t. the focus of ICLP, stage of research, recommendation letter, and evidence of promise towards a successful career in research and academia, such as published papers or technical reports. Registration Registration is part of the ICLP 2020 registration. Registration costs for ICLP will be lower than usual since it is virtual this year. We aim to find sponsoring to cover the registration cost of students participating in the DC, but this still has to be confirmed. Program co-chairs Bart Bogaerts, Vrije Universiteit Brussel Daniela Inclezan, Miami University Program Committee Carmine Dodaro, University of Calabria Jorge Fandinno, Potsdam University Fabio Fioravanti, University of Chieti-Pescara Paul Fodor, Stony Brook University Martin Gebser, University of Klagenfurt Jose F. Morales, IMDEA Software Research Institute Zeynep G. Saribatur, Vienna University of Technology Frank Valencia, LIX, Ecole Polytechnique -- -- *Dona il 5x1000* all'Università degli Studi di Sassaricodice fiscale: 00196350904

1 0

CSL 2021 final call for papers - amended
by Jean Goubault-Larrecq 29 Jun '20

29 Jun '20

===================================== Final call for papers (CSL'21) - amended! ===================================== *** Due to the exceptional circumstances this year, we have decided to change the deadlines slightly. July 1st is now the deadline for _submission of abstracts_. The actual papers are expected on July 8th or before. See below for details. *** Computer Science Logic (CSL) is the annual conference of the European Association for Computer Science Logic (EACSL), see https://www.eacsl.org/. It is an interdisciplinary conference, spanning across both basic and application oriented research in mathematical logic and computer science. CSL'21 will be held on January 25-28, 2021, in Ljubljana, Slovenia. At the time of this announcement, it is still hard to say whether the meeting will take place physically, or remotely, or both, although the latter tends to be the most likely. Submission guidelines: ---------------------- 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. The CSL 2021 conference proceedings will be published in Leibniz International Proceedings in Informatics (LIPIcs), see https://submission.dagstuhl.de/documentation/authors. Authors are invited to submit contributed papers of no more than 15 pages in LIPIcs style (not including references), presenting unpublished work fitting the scope of the conference. 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. At least one of the authors of each accepted paper is expected to register to the conference, and present their papers, whether physically or online, depending on the situation and the available means of organisation in January 2021. *** In order to submit a paper, authors are expected to submit an abstract on EasyChair at or before July 1st, 2020, anywhere on Earth. The deadline for submitting the actual paper is July 8th, 2020, anywhere on Earth. You may of course submit the actual paper before July 1st, 2020, if you wish. Only the papers that obey both deadlines will be considered by the program committee. All restrictions about concurrent submissions and resubmissions mentioned above apply to the papers only, not the abstracts. In short, in doubt, we encourage you to submit an abstract! *** Important dates: ---------------- abstract submission: July 1, 2020 (AoE) paper submission: July 8, 2020 (AoE) notification: September 25, 2020 conference: January 25-28, 2021 List of topics: --------------- automated deduction and interactive theorem proving constructive mathematics and type theory equational logic and term rewriting automata and games, game semantics modal and temporal logic model checking decision procedures logical aspects of computational complexity finite model theory computational proof theory logic programming and constraints lambda calculus and combinatory logic domain theory categorical logic and topological semantics database theory specification, extraction and transformation of programs logical aspects of quantum computing logical foundations of programming paradigms verification and program analysis linear logic higher-order logic nonmonotonic reasoning Program Committee: ------------------ * Andreas Abel, University of Gothenburg, Sweden * Zena M. Ariola, University of Oregon, USA * Jeremy Avigad, Carnegie Mellon University, USA * Christel Baier, Technische Universität Dresden, Germany (co-chair) * Jasmin Blanchette, Vrije Universiteit Amsterdam, the Netherlands * Jean Goubault-Larrecq, ENS Paris-Saclay, France (co-chair) * Masahito Hasegawa, Kyoto University, Japan * Jean-Baptiste Jeannin, University of Michigan, USA * Michael Kaminski, Technion Haifa, Israel * Delia Kesner, Université de Paris, France * Laura Kovács, Vienna University of Technology, Austria * Martin Lange, University of Kassel, Germany * Sławomir Lasota, Warsaw University, Poland * Florin Manea, Georg-August Universität Göttingen, Germany * Stefan Milius, Friedrich-Alexander Universität Erlangen-Nürnberg, Germany * Antoine Mottet, Charles University, Czech Republic * Andrzej Murawski, University of Oxford, UK * Elaine Pimentel, Universidade Federal do Rio Grande do Norte, Brasil * Sophie Pinchinat, IRISA Rennes, France * Simona Ronchi Della Rocca, Università di Torino, Italy * Krishna S, IIT Bombay, India * Peter Selinger, Dalhousie University, Canada * Sebastian Siebertz, Universität Bremen, Germany * Alex Simpson, University of Ljubljana, Slovenia (organizer) * Marie Van Den Bogaard, Université Libre de Bruxelles * Yde Venema, Universiteit van Amsterdam, the Netherlands Organization Committee: ----------------------- Alex Simpson (University of Ljubljana, chair) Andrej Bauer (University of Ljubljana) Daniel Ahman (University of Ljubljana) Contact: -------- Please send all questions about submissions to the PC co-chairs: csl2021(a)easychair.org

1 0