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

Workshop on Advances in Separation Logics (ASL 2022 @ FLOC 2022)

von RADU IOSIF

Workshop on Advances in Separation Logics (ASL 2022), Haifa, Israel, July 31st 2022 https://asl-workshop.github.io/asl22/ The past two decades have witnessed important progress in static analysis and verification of code with low-level pointer and heap manipulations, mainly due to the development of Separation Logic (SL). SL is a resource logic, a dialect of the logic of Bunched Implications (BI) designed to describe models of the heap memory and the mutations that occur in the heap as the result of low-level pointer updates. The success of SL in program analysis is due to the support for local reasoning, namely the ability of describing only the resource(s) being modified, instead of the entire state of the system. This enables the design of compositional analyses that synthesize specifications of the behavior of small parts of the program before combining such local specifications into global verification conditions. Another interesting line of work consists in finding alternatives to the underlying semantic domain of SL, namely heaps with aggregative composition, in order to address other fields in computing, such as self-adapting distributed networks, blockchain and population protocols, social networks or biological systems. We consider submissions on topics including: * decision procedures for SL and other resource logics, * computational complexity of decision problems such as satisfiability, entailment and abduction for SL and other resource logics, * axiomatisations and proof systems for automated or interactive theorem proving for SL and other resource logics, * verification conditions for real-life interprocedural and concurrent programs, using SL and other resource logics, * alternative semantics and computation models based on the notion of resource, * application of separation and resource logics to different fields, such as sociology and biology. ASL 2022 is affiliated with IJCAR 2022. Due to the uncertainty of the COVID19 and international situation, the workshop will be organized as a virtual event. Keynote Speakers * Philippa Gardner, Imperial College London * Ralf Jung, MIT CSAIL Important Dates * Papers due: May 20, 2022 (AoE, firm) * Authors notification: June 15, 2022 (AoE) * Workshop: July 31, 2022 Program Committee Nadia Polikarpova (UCSD, San Diego, USA) James Brotherston (UCL, London, UK) Qinxiang Cao (Shanghai Jiaotong University) Dan Frumin (University of Groningen, The Netherlands) Lennart Beringer (Princeton University, USA) Arthur Charguéraud (INRIA Strasbourg, France) Radu Iosif (Verimag, CNRS, Univ. Grenoble Alpes, France) Le Quang Loc (UCL, London, UK) Alessio Mansutti (University of Oxford, UK) Christoph Matheja (DTU, Lyngby, Denmark) Daniel Méry (University of Loraine, France) Koji Nakazawa (Nagoya University, Japan) Nicolas Peltier (LIG, CNRS, Grenoble, France) Adam Rogalewicz (Brno University of Technology, Czech Republic) Mihaela Sighireanu (LMF, ENS Paris-Saclay, France) Florian Zuleger (Vienna University of Technology, Austria) Organizing committee Radu Iosif (Verimag, CNRS, Univ. Grenoble Alpes, France) Nikos Gorogiannis (Meta, London, UK) Robbert Krebbers (Radboud Univ. Nijmegen, The Netherlands) Mihaela Sighireanu (LMF, ENS Paris-Saclay, France) Makoto Tatsuta (NII, Tokyo, Japan) Thomas Noll (RWTH, Aachen, Germany)

2 Jahre, 2 Monate

1
0
0 0

ICALP 2022 - Second Call for Participation

von Amaury Pouly (IRIF)

================================== ICALP 2022 - Call for Participation ================================== The 49th International Colloquium on Automata, Languages, and Programming (ICALP) will take place ** in Paris, France, and online on 4-8 July 2022. ** The 2022 edition has the following special features: - The conference is hybrid. - This will be the 50th birthday of the conference and some special events are planned. - The ICALP Extended Stay Support Scheme (IESSS) is here for helping the organisation of collaborations around the conference. ICALP is the main conference and annual meeting of the European Association for Theoretical Computer Science (EATCS). As usual, ICALP will be preceded by a series of workshops, which will take place on July 4. The 2022 edition will be also the occasion to celebrate the 50th anniversary of both EATCS and the first ICALP, which was first held in 1972 in Rocquencourt, in the Paris area. ============= Important dates and information ============= Website: https://icalp2022.irif.fr/ Early Registration: May 11 Conference: July 4-8, 2022 Workshops: July 4 ============= Registration ============= For registration, follow this link: https://icalp2022.irif.fr/?page_id=50 ============= Extended Stay Support Scheme (IESS) ============= For its 49th edition, the ICALP conference offers to its attendees an Extended Stay Support Scheme (IESSS) aiming at enhancing scientific collaborations and diminishing the carbon footprint of scientific research activities. ICALP 2022 attendees are encouraged to combine their visit to Paris with collaborations with local researchers. This support scheme is primarily intended for participants travelling long distances and must be combined with an attendance to ICALP. Upon acceptation, research institutes involved in this mechanism will cover standard expenses (accommodation and traveling fees, plane excluded) and will provide material support for research activities. See https://icalp2022.irif.fr/?page_id=50 for more information. ============= Invited Speakers ============= Albert Atserias, Universitat Politècnica de Catalunya Constantinos Daskalakis, MIT Leslie Ann Goldberg, Oxford University Madhu Sudan, Harvard Stéphan Thomassé, ENS Lyon Santosh Vempala, Georgia Tech ============= Awards ============= During the conference, the following awards will be given: - the EATCS award (https://eatcs.org/index.php/eatcs-award), - the Gödel prize (https://eatcs.org/index.php/goedel-prize), - the Presburger award (https://eatcs.org/index.php/presburger), - the EATCS distinguished dissertation award (https://eatcs.org/index.php/dissertation-award), - the best papers for Track A and track B, - the best student papers for Track A and track B. ============= Accepted papers ============= See https://icalp2022.irif.fr/?page_id=85 ============= Workshops ============= See https://icalp2022.irif.fr/?page_id=46 for more information. - Parameterized Approximation Algorithms Workshop - Combinatorial Reconfiguration - Recent Advances on Total Search Problems - Algorithmic Aspects of Temporal Graphs V - Trends in Arithmetic Theories - Structure Meets Power 2022 - Straight-Line Programs, Word Equations and their Interplay - Graph Width Parameters: from Structure to Algorithms

2 Jahre, 2 Monate

1
0
0 0

EATCS-IPEC Nerode Prize 2022 - CFN

von Anuj Dawar

EATCS-IPEC Nerode Prize - 2nd Call for Nominations Deadline: 15 May, 2022 The EATCS-IPEC Nerode Prize for outstanding papers in the area of multivariate algorithmics, is presented annually with the presentation taking place at IPEC (International Symposium on Parameterized and Exact Computation). IPEC 2022 is due to take place as part of ALGO 2022 on 5-9 September in Potsdam, Germany. The Prize is named in honor of Anil Nerode in recognition of his major contributions to mathematical logic, theory of automata, computability and complexity theory. Award Committee The winning paper(s) will be selected by the EATCS-IPEC Nerode Prize Award Committee. This year's committee consists of the following people. Anuj Dawar, chair (University of Cambridge, anuj.dawar(a)cl.cam.ac.uk) Fedor Fomin (University of Bergen, fedor.fomin(a)uib.no) Thore Husfeldt (IT University of Copenhagen, thore(a)itu.dk) Deadline for Nominations: 15 May, 2022. Decision: 1 July, 2022. The Award Committee is solely responsible for the selection of the winner of the award which may be shared by more than one paper or series of papers. The Award Committee reserves the right to declare no winner at all. Eligibility Any research paper or series of research papers by a single author or by a team of authors published in a recognized refereed journal. The research work nominated for the award should be in the area of multivariate algorithms and complexity meant in a broad sense, and encompasses, but is not restricted to those areas covered by IPEC. The Award Committee has the ultimate authority to decide on the eligibility of a nomination. Papers authored by a member of the Award Committee are not eligible for nomination. Note that the past restrictions that require a certain number of years before/after the publication of the nominated papers have been removed. Nominations Nominations may be made by any member of the scientific community including the members of the Award Committee. A nomination should contain a brief summary of the technical content of each nominated paper and a brief explanation of its significance. Nominations are done by an email to the Award Committee Chair with copies to the members of the committee. The Subject line of the nomination E-mail should contain the group of words "Nerode Prize Nomination".

2 Jahre, 2 Monate

1
0
0 0

Fwd: LogTeach-22, First Call for Papers

von Johann Makowsky

******************************************************************* LogTeach-22: Why and how to tech Logic for CS undergraduates? ******************************************************************* =============== Call for papers =============== https://easychair.org/cfp/LogTeach-22 LogTeach-22: LICS 2022 Workshop (July 31 and August 1, 2022, Haifa) Why and how to tech Logic for CS undergraduates? Scientific justification ------------------------- Logic is one of the pillars of the foundation of Computer Science, together with Algorithmic Mathematics, Information Theory, and Electronics. Consequently various versions of Logic courses used to be part of the undergraduate syllabus of Computer Science. However, as witnessed by the variety of conferences related to Logic present at the FLoC event, the emphasis has moved from the foundation to applications of Logic in Computer Science. Each of these conferences deal with topics suitable for advanced undergraduate and graduate courses, which require some Logic based prerequisite. On the other hand, Logic courses in the undergraduate syllabus have been forced to make place for courses deemed more suitable for the education of future specialists and practitioners working in IT. Many of the top Universities worldwide have dropped foundational Logic courses for undergraduates for more practical oriented courses, turning undergraduate CS programs into programs more suitable for what used to be vocational colleges and professional schools. Time has come to critically reflect upon and reevaluate the role of Logic in the undergraduate syllabus. It seems clear that the classical Logic in CS courses have no place there anymore. They seem to teach and emphasize the wrong narrative of logic as taught by tradition. However, it seems also clear that eliminating Logic courses all together is counter productive. The purpose of the workshop is the prepare a proposal for a logic course Logic-2020 which is useful and acceptable for University undergraduates in CS, and which can serve as a prerequisite for the many diverse branches of applied logic. "Logic may be not very useful, if you know it, but very harmful, if you ignore it" (Georg Kreisel) Invited speakers ---------------- * Moshe Vardi (Rice University, Houston TX, USA) * TBC Organisation ------------- The purpose of the workshop is to prepare a joint position paper to be published possibly in the Communications of ACM, or a similar prominent place, with recommendations for the future of teaching Logic for undergraduate CS-students. We plan to have presentations of position papers (30 minutes, including discussion) and invited lectures (60 minutes including discussion), followed by a two hour panel discussion. Workshop organizers and Program Committee ------------------------------------------ J.A. Makowsky (Technion, Haifa, Israel) E.V. Ravve (ORT Braude, Karmiel, Israel) S.N. Artemov (CUNY, New York, USA) S. Szeider (Technical University, Vienna, Austria) Dates and Location ------------------ FLOC is planned to be a conference with physical presence (possibly hybrid) in Haifa. The final decision on this will be made by May 1, 2022. * Deadline for abstract submission of papers: 10. May, 2022 * Deadline for submission of papers: 20. May, 2022 * Notification of acceptance: 15. June, 2022 * Submission link https://easychair.org/conferences/?conf=logteach22 For further information and questions contact: Prof. emeritus J.A. Makowsky Faculty of Computer Science Technion - Israel Institute of Technology Haifa 32000 http://www.cs.technion.ac.il/~janos

2 Jahre, 2 Monate

1
2
0 0

Formal Methods Education Online @ FLoC - CfP

von Jan Křetínský

========================================================== First Call for Contributions FOMEO'22 Formal Methods Education Online: Tips, Tricks & Tools Collocated with FLoC'22 https://www7.in.tum.de/~kretinsk/fomeo22.html ========================================================== Online instruction of formal methods has gained more and more importance over the last years, including teaching of basics of logics and automata theory, formal verification, theorem proving, knowledge representation etc. This workshop brings together instructors of formal methods as well as developers of teaching support systems for formal methods to (a) present teaching support systems for formal methods education, and (b) discuss experiences with and concepts for developing online courses and tools. *IMPORTANT DATES:* * submission deadline May 10th, 2022 (AoE) * acceptance notification May 31st, 2021 * preliminary workshop date July 31st and/or August 1st, 2021 *FORMAT:* We plan to have short presentations of the tools and concepts, advertising the key functionality, as well as discussion sessions, to allow for detailed questions, demos and exchanging experiences. Depending on the decision of FLoC on May 1st, we will either offer a physical or hybrid workshop or have it completely online. *SUBMISSION:* You can submit your contribution at https://easychair.org/conferences/?conf=fomeo22 We allow submission about tools that were already presented in the previous edition of FOMEO. Submissions should provide a short abstract (at most 1 page pdf in free format) and fill in the basic information according to the following template: - Name: - Link: - Area: - Content (3-5 lines): - Usage (3-5 lines): There will be no formal proceedings, but the PDF and the basic tool information will be included in the regularly amended list of all tools on the FOMEO website. Please feel very welcome to ask any questions! *ORGANIZERS:* Jan Křetínský (TU Munich, jan.kretinsky(a)tum.com) Josje Lodder (Open Universiteit Nederland, josje.lodder(a)ou.nl) Francois Schwarzentruber (ENS Rennes, francois.schwarzentruber(a)ens-rennes.fr ) Maximilian Weininger (TU Munich, maxi.weininger(a)tum.de) Thomas Zeume (Ruhr University Bochum, thomas.zeume(a)rub.de)

2 Jahre, 2 Monate

1
0
0 0

CiE 2022: CALL FOR INFORMAL PRESENTATIONS

von acie＠acie.eu

========================================= CiE 2022: CALL FOR INFORMAL PRESENTATIONS ========================================= Computability in Europe 2022: Revolutions and revelations in computability **CiE 2022 is planned as an on-site conference with online elements** Swansea, Wales, United Kingdom July 11-15, 2022 https://cs.swansea.ac.uk/cie2022/ Continuing the tradition of past CiE conferences, we invite researchers to present informal presentations of their recent work. A proposal for an informal presentation must be submitted via EasyChair (https://easychair.org/conferences /?conf=cie2022), using the LNCS style file (available at https:// www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines), and be 1 page long; a brief description of the results suffices and an abstract is not required. Informal presentations will not be published in the LNCS conference proceedings. Results presented as informal presentations at CiE 2022 may appear or may have appeared in other conferences with formal proceedings and/or in journals. The deadline for the submission of abstracts for informal presentations is May 10, 2022. The notifications of acceptance for informal presentations will be sent a few days after submission. For questions, please contact the organisers at cie2022swansea(a)gmail.com.

2 Jahre, 2 Monate

1
0
0 0

QBF 2022 -- 2nd CFP

von HUBERT MING CHEN

CALL FOR PAPERS QBF 2022 -------- International Workshop on Quantified Boolean Formulas and Beyond August 1, 2022 To be held in hybrid format (virtually + in-person). https://www.ac.tuwien.ac.at/qbf2022/ Affiliated to and co-located with: Int. Conf. on Theory and Applications of Satisfiability Testing (SAT 2022), August 2-5, 2022. ------------------------------------------------------------- Quantified Boolean formulas (QBF) are an extension of propositional logic which allows for explicit quantification over propositional variables. The decision problem of QBF is PSPACE-complete, compared to the NP-completeness of the decision problem of propositional logic (SAT). Many problems from application domains such as model checking, formal verification or synthesis are PSPACE-complete, and hence could be encoded in QBF in a natural way. Considerable progress has been made in QBF solving throughout the past years. However, in contrast to SAT, QBF is not yet widely applied to practical problems in academic or industrial settings. For example, the extraction and validation of models of (un)satisfiability of QBFs has turned out to be challenging, given that state-of-the-art solvers implement different solving paradigms. The goal of the International Workshop on Quantified Boolean Formulas (QBF Workshop) is to bring together researchers working on theoretical and practical aspects of QBF solving. In addition to that, it addresses (potential) users of QBF in order to reflect on the state-of-the-art and to consolidate on immediate and long-term research challenges. The workshop also welcomes work on reasoning with quantifiers in related problems, such as dependency QBF (DQBF), quantified constraint satisfaction problems (QCSP), and satisfiability modulo theories (SMT) with quantifiers. =============== IMPORTANT DATES =============== May 1: Submission June 5: Notification of acceptance June 19: Final versions of accepted papers due August 1: Workshop Please see the workshop webpage for any updates: https://www.ac.tuwien.ac.at/qbf2022/ ====================== CALL FOR CONTRIBUTIONS ====================== The workshop is concerned with all aspects of current research on all formalisms enriched by quantifiers, and in particular QBF. The topics of interest include (but are not limited to): Applications, encodings and benchmarks with quantifiers QBF Proof theory and complexity results Experimental evaluations of solvers or related tools Case studies illustrating the power of quantifiers Certificates and proofs for QBF, QCSP, SMT with quantifiers, etc. Formats of proofs and certificates Implementations of proof checkers and verifiers Decision procedures Calculi and their relationships Data structures, implementation details and heuristics Pre- and inprocessing techniques Structural reasoning ========== SUBMISSION ========== Submissions of extended abstracts are invited and will be managed via Easychair: https://easychair.org/conferences/?conf=qbf2022 In particular, we invite the submission of extended abstracts on work that has been published already, novel unpublished work, or work in progress. The following forms of submissions are solicited: - Proposals for short tutorial presentations on topics related to the workshop. Tutorial proposals will be reviewed by the PC. The number of accepted tutorials depends on the overall number of accepted papers and talks, with the aim to set up a balanced workshop program. - Talk abstracts reporting on already published work. Such an abstract should include an outline of the planned talk, and pointers to relevant bibliography. - Talk proposals presenting work that is unpublished or in progress. - Submissions which describe novel applications of QBF or related formalisms in various domains are particularly welcome. Additionally, this call comprises known applications which have been shown to be hard for QBF solvers in the past as well as new applications for which present QBF solvers might lack certain features still to be identified. Each submission should have an overall length of 1-4 pages in LNCS format. Authors may decide to include an appendix with additional material. Appendices will be considered at the reviewers' discretion. The accepted extended abstracts will be published on the workshop webpage. The workshop does not have formal proceedings. Authors of accepted contributions are expected to give a talk at the workshop. ======= CONTACT ======= qbf2022(a)easychair.org ================= PROGRAM COMMITTEE ================= Hubie Chen, Birkbeck, University of London Florian Lonsing, Stanford University Martina Seidl, JKU Linz Friedrich Slivovsky, TU Wien

2 Jahre, 2 Monate

1
0
0 0

MOVEP: Early-bird rate ends April 30th

von Martin Zimmermann

IMPORTANT DATES: - Early-bird rate ends April 30th - Submission deadline for student presentations: May 1st 15th Summer School on Modelling and Verification of Parallel Processes (MOVEP) Aalborg University, Aalborg, Denmark June 13 - 17, 2022 https://movep2022.cs.aau.dk/ MOVEP is a five-day summer school on modelling and verification of infinite state systems. It aims to bring together researchers and students working in the fields of control and verification of concurrent and reactive systems. MOVEP 2022 will consist of ten invited tutorials. In addition, there will be special sessions that allow PhD students to present their on-going research (each talk will last around 20 minutes). Extended abstracts (1-2 pages) of these presentations will be published in informal proceedings. == Speakers == Giovanni Bacci (Aalborg University, Denmark): From Bisimulations to Metrics via Couplings David Baelde (ENS Rennes & IRISA): Formal Proofs of Cryptographic Protocols with Squirrel Christel Baier (Technische Universität Dresden, Germany): From Verification to Causality-based Explications Wojciech Czerwiński (University of Warsaw, Poland): The Reachability Problem for Vector Addition Systems Bartek Klin (Oxford University, United Kingdom): Computation Theory over Sets with Atoms Laura Kovacs (Vienna University of Technology, Austria): First-Order Theorem Proving and Vampire Anca Muscholl (LaBRI & Université Bordeaux, France): A View on String Transducers Nir Piterman (Chalmers University of Technology, Sweden): Reactive Synthesis Amaury Pouly (IRIF, France): Linear Dynamical Systems: Reachability and Invariant Generation Renaud Vilmart (LMF & Inria): How to Verify Quantum Processes == Registration == Please visit https://movep2022.cs.aau.dk/registration.html == Committees == Organising committee * Peter G. Jensen (Aalborg University, Denmark) * Florian Lorber (Aalborg University, Denmark) * Martin Zimmermann (chair, Aalborg University, Denmark) Program committee * Saddek Bensalem (Université Grenoble Alpes, France) * Patricia Bouyer-DeCitre (LMF, CNRS & ENS Paris-Saclay, France) * Emmanuel Filiot (Université libre de Bruxelles, Belgium) * Dana Fisman (Ben-Gurion University, Israel) * Radu Grosu (Vienna University of Technology, Austria) * Holger Hermanns (Saarland University, Germany) * Nils Jansen (Radboud University Nijmegen, Netherlands) * Marcin Jurdzinski (University of Warwick, United Kingdom) * Steve Kremer (Inria Nancy - Grand Est, France) * K Narayan Kumar (Chennai Mathematical Institute, India) * Denis Kuperberg (ENS Lyon, France) * Anca Muscholl (LaBRI & Université Bordeaux, France) * Paritosh K. Pandya (IIT Bombay, India) * Gabrielle Puppis (Udine University, Italy) * Nir Piterman (Chalmers University of Technology, Sweden) * Kristin Rozier (Iowa State University, United States) * César Sánchez (IMDEA Software Institute, Spain) * Szymon Torunczyk (University of Warsaw, Poland) * Martin Zimmermann (chair, Aalborg University, Denmark) Steering committee * Nathalie Bertrand (INRIA Rennes, France) * Benedikt Bollig (LMF, CNRS & ENS Paris-Saclay, France) * Radu Iosif (CNRS & Verimag, France) * Didier Lime (Ecole centrale de Nantes, France) * Christof Löding (RWTH Aachen University, Germany) * Nicolas Markey (CNRS & INRIA & Univ. Rennes 1, France)

2 Jahre, 2 Monate

1
0
0 0

[fm-announcements] NFM 2022 - Call for participation

von Havelund, Klaus (US 348B) via fm-announcements

CALL FOR PARTICIPATION 14th NASA Formal Methods Symposium (NFM 2022) May 24-27, 2022 Pasadena, California, USA URL: https://gcc02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnfm2022.c… NFM 2022 is organized by Jet Propulsion Laboratory, USA *** Free Registration *** : https://gcc02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnfm2022.c… MIXED PHYSICAL + VIRTUAL SYMPOSIUM After two years of virtual NFM symposia, we are returning to arranging a physical event. However, virtual participation is supported for those who prefer this option. THEME OF THE SYMPOSIUM The complexity of mission-critical and safety-critical systems at NASA and in the aerospace industry requires advanced techniques to address their specification, design, verification, validation, and certification. The NASA Formal Methods Symposium (NFM) is a forum to foster collaboration between theoreticians and practitioners from NASA, academia, and industry working on formal methods to develop and apply such techniques. The NASA Formal Methods Symposium is an annual event organized by the NASA Formal Methods Research Group, composed of researchers spanning six NASA centers. REGISTRATION There is no registration fee charged to participants. Register here: https://gcc02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnfm2022.c… KEYNOTE SPEAKERS Dines Bjørner (Technical University of Denmark, Denmark) Steve Chien (Jet Propulsion Laboratory, USA) Daniel Jackson (MIT CSAIL, USA) Julia Lawall (Inria-Paris, France) Sriram Sankaranarayanan (University of Colorado Boulder, USA) Alex Summers (University of British Columbia, Canada) Emina Torlak (University of Washington, USA) TUTORIALS Edwin Brady (University of St. Andrews, UK) Ankush Desai (Amazon Web Services, USA) Anastasia Mavridou (KBR Inc/NASA Ames Research Center, USA) Leonardo de Moura (Microsoft Research, USA) Sebastian Ullrich (Karlsruhe Institute of Technology, Germany) ORGANIZERS Klaus Havelund (Jet Propulsion Laboratory, PC chair) Jyo Deshmukh (USC, PC chair) Richard Murray (Caltech, Local chair) Ivan Perez (NIA, PC chair) --- To opt-out from this mailing list, send an email to fm-announcements-request(a)lists.nasa.gov with the word 'unsubscribe' as subject or in the body. You can also make the request by contacting fm-announcements-owner(a)lists.nasa.gov

2 Jahre, 3 Monate

1
0
0 0

Deadline approaching - 10 PhD positions in logic-related CS in Vienna

von Magdalena Ortiz

*Second Call for Applications* for Doctoral Candidates (University Assistants, Pre-Doc) 40 hours/week, for 4 years The novel interdisciplinary Marie Sklodowska-Curie COFUND doctoral training programme LogiCS@TUWien - Logics for Computer Science http://www.vcla.at/msca is offering a further 10 full-time PhD positions. The program is co-funded by the European Commission and hosted by TU Wien, one of the most successful technical universities in Europe and the largest one in Austria. The Faculty of Informatics of TU Wien is a leading research and teaching institution which consistently ranks among the top 100 computer science faculties in the global Times Higher Education ranking. In the heart of Europe, Vienna has a distinguished history in mathematics, computer science, and logic-related research and offers one of the highest living standards in the world. The doctoral positions are open to international high-potential early-stage researchers with an interest in working on Logical Methods in Computer Science and their applications, including: * Artificial Intelligence * Databases * Verification * Algorithms The programme provides a 4-year long doctoral training for international PhD candidates within an English-language curriculum. LogiCS@TUWien will run for 60 months and foresees the recruitment of a further 10 PhD candidates in addition to the 10 candidates recruited in the first call. These new PhD candidates will each pursue research on one of the available projects (see http://www.vcla.at/msca/topics/) and be supervised by: * Agata Ciabattoni * Thomas Eiter * Georg Gottlob * Magdalena Ortiz * Stefan Szeider * Georg Weissenbacher * Stefan Woltran * Florian Zuleger This is the second call for applications, after filling 10 positions in the first call. The application deadline for this call is April 30, 2022. For details on how to apply, see http://www.vcla.at/msca/apply or watch the video at https://youtu.be/Aq0JGJ9eqzQ --------------- -- Magdalena Ortiz Assoc.Prof. Knowledge Representation and Reasoning Institute of Logic and Computation (E192/3) Faculty of Informatics, TU Wien -- Magdalena Ortiz Assoc.Prof. Knowledge Representation and Reasoning Institute of Logic and Computation (E192/3) Faculty of Informatics, TU Wien

2 Jahre, 3 Monate

1
0
0 0

2024

2023

2022

2021

2020

2019

2018

finite-model-theory