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

ICLA 2025: First Call for Papers

von Abhisekh Sankaran

============ Call for Papers ============ ================================================= ICLA 2025: Indian Conference on Logic and its Applications Dates: Feb 3 -- 5, 2025 Venue: Indian Statistical Institute (ISI), Kolkata, India Website: https://logicindia.org/icla/icla2025/ ================================================= =================== About the conference =================== The Indian Conference on Logic and its Applications (ICLA) is the primary conference of the Association for Logic in India (ALI [1]). It is a forum for bringing together researchers from a variety of fields in which formal logic plays a significant and often foundational role: Mathematics, Computer Science, Philosophy, Linguistics and Cognitive Science. A special feature of ICLA is the inclusion of studies in systems of logic in the Indian tradition, as well as historical research on logic. Details of the previous ICLA 2023 can be found at [2], and those of the earlier editions of the conference at the ALI website. [1] https://logicindia.org/ [2] https://icla2023.iiti.ac.in/ The upcoming ICLA 2025 is the 11th edition of the conference and features the following: * Best paper and best student paper awards; * Two kinds of contributed papers: - Extended abstracts for inclusion in the conference proceedings. The review process for these abstracts will involve a rebuttal phase; - Short abstracts only for presentation in the conference; * Invitation to selected accepted papers of the conference for submission to a special issue of a journal (to be announced in due course); * The conference will take place in offline in-person mode; * ALI will co-organize with Jadavpur University, the Asian Workshop on Philosophical Logic (AWPL) which will take place for the first time in India in Kolkata following ICLA 2025. ===================================== Events: Main conference and co-located workshops ===================================== + Main conference: ICLA 2025: - Date: Feb 3 -- 5, 2025 - Venue: ISI Kolkata - Website: https://logicindia.org/icla/icla2025/ + Co-located workshop: AWPL 2025: - Date: Feb 6 -- 8, 2025 - Venue: Jadavpur University Kolkata - Website: https://sites.google.com/view/awpl2025/ ============================ Important dates and information ============================ Submission dates: All dates below are AOE (Anywhere on Earth). - Deadline for abstract of submission: Aug 11, 2024 - Submission deadline: Aug 15, 2024 - Rebuttal period: Sep 23 -- Sep 28, 2024 - Notification to authors: 18 Oct, 2024 - Camera-ready version: TBA - Registration: TBA Easychair website: https://easychair.org/conferences/?conf=icla2025 ==================== Submission guidelines ==================== Authors are invited to submit papers presenting original and unpublished research in any area of logic and its applications. Please see below for a detailed list of topics. Listed below are common guidelines for all submissions. A submission is either an extended abstract or a short abstract. 1) Submissions must be in electronic form, and must be submitted through Easychair via https://easychair.org/conferences/?conf=icla2025. 2) Submissions must be in English and should provide sufficient details to allow the program committee to assess their merits. Each submission must be a single PDF file. 3) Submissions will be peer-reviewed in a single-blind process. 4) Submissions authored or co-authored by PC members are allowed. PC member submissions will however be subject to a higher level of scrutiny than other submissions. —------------------------------------------------------ Additional guidelines for extended abstracts —------------------------------------------------------ 1) The submission should not exceed 12 pages excluding references, and should adhere to the Springer-Verlag Lecture Notes LaTeX2e style [SV]. Detailed proofs of technical results or other supplementary material, if necessary, can be included in a clearly marked appendix or made available via pointers to technical reports which may be read at the discretion of the programme committee. There is no restriction on the length of the appendix. [SV] https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu… 2) Submissions of previously published works, or concurrent submissions to journals or to other conferences with proceedings, are not allowed. The authors can however make full versions of their submissions available at online repositories such as ArXiv, HAL, ECCC and the like. 3) During the reviewing, there will be a rebuttal phase for extended abstracts which would give the authors an opportunity to respond to the initial reviews. Instructions related to the rebuttal will be communicated to the authors before the rebuttal period. 4) Accepted extended abstracts will be published in the conference proceedings which will appear in the FoLLI Publications on Logic, Language and Information [FoL], a sub-series of Springer LNCS. [FoL] https://www.springer.com/gp/computer-science/lncs/societies-and-lncs/folli-… —------------------------------------------------- Additional guidelines for short abstracts —------------------------------------------------- 1) The submission should be about a page in length describing the main results of the work. Pointers to technical reports detailing the results can be provided. 2) There will be no rebuttal phase for short abstracts. 3) Accepted short abstracts will not be published in the conference proceedings. They might however be made available on the conference website. ================== Submission Topics ================== The list of topics include, but are not limited to, the following. Submissions of interdisciplinary nature are especially encouraged. + Algorithmic randomness, category theory, descriptive set theory, foundations of mathematics, homotopy type theory, logical aspects of topology, model theory, recursion theory, reverse mathematics, universal algebra + Belief change and revision, deontic logics, description logics, dynamic epistemic logic, first order modal logic, formal epistemology, imperative logics, logic and artificial intelligence, logic in decision and game theory, logic and social choice theory, logic and social cognition, logic and social software, logic for information, logic for probability and uncertainty, modal logic – algebraic, algorithmic, category theoretic and model theoretic aspects, multi-agent systems, normative reasoning, provability logics + Automata theory and logic, category theory in computer science, logic and algebraic methods, logic and concurrency, logic and games, logic and quantum computing, probabilistic logics and stochastic processes, transductions, two-variable logics, well quasi orders + Automated reasoning, formal analysis of programs, formal verification and synthesis, hyperproperties, logic in industrial applications, logic in security and privacy, programming language semantics, real time logics, temporal logics, theory and applications of SAT and SMT solvers and theorem provers, software/app development for logic + Algorithmic meta theorems, comonads in finite model theory, decision procedures for logics, definable functions on relational structures, logic and computational complexity, logic and constraint satisfaction problems, logic and databases, logic and graph structure theory, logic in machine learning, many valued logics in finite model theory, proof complexity, stability theory over finite structures + History of logic – Indian, Chinese and Western and comparative studies, Indian philosophical systems: Buddhism, Jainism, Mīmāṃsa and Nyāya, interaction of classical logic with other logics, many valued logics and their applications, non-monotonic logics, paraconsistency, particular systems of logic + General tools and frameworks for logical systems, Large Language Models (LLMs) – cognitive aspects and impact on society, logic and cognitive science, logic in education, logic and ethics in artificial intelligence, logic in law, logic and linguistics, logic and metaphysics, logic and philosophy of mathematics, logic and philosophy of science, philosophical issues of logical systems, philosophy of language ======= Awards ======= The following awards will be given to selected contributed papers during the conference: - Best paper award - Best student paper award All the authors in any paper considered for the best student paper award must be students at the time of submission of the paper. Please note that it is possible for neither of these awards to be given in the event that none of the submitted papers meet the requisite standards. ==================== Programme Committee ==================== Chairs: C Aiswarya (Chennai Mathematical Institute, India) Prabal Kumar Sen (University of Calcutta, India) Shashi Mohan Srivastava (IACS Kolkata and RKMVERI Belur, India) Members: Rupa Bandyopadhyay (Jadavpur University Kolkata, India) Sanjukta Basu (Rabindra Bharati University Kolkata, India) Kuntala Bhattacharya (Rabindra Bharati University Kolkata, India) Amita Chatterjee (Jadavpur University Kolkata, India) Madhumita Chatterjee (Jadavpur University Kolkata, India) Tran Chieu-Minh (National University of Singapore, Singapore) Deepak D’Souza (IISc Bangalore, India) Anupam Das (University of Birmingham, UK) Hans van Ditmarsch (University of Toulouse, CNRS, IRIT, France) Su Gao (Nankai University, China) Shibashis Guha (TIFR Mumbai, India) Petr Hliněný (Masaryk University, Brno, Czech Republic) Moritz Lichter (RWTH Aachen, Germany) Khushraj Madnani (MPI-SWS Saarbrücken, Germany) Gayatri Panicker (Vellore Institute of Technology, India) Anand Pillay (University of Notre Dame, USA) R Ramanujam (Azim Premji University, India) Nicholas Ramsey (University of Notre Dame, USA) Krishna S (IIT Bombay, India) Abhisekh Sankaran (TCS Research, India) Manidipa Sanyal (University of Calcutta, India) Sylvain Schmitz (IRIF Paris, France) Stephen G Simpson (Vanderbilt University, USA) Slawomir Solecki (Cornell University, USA) Shichang Song (Beijing Jiaotong University) Bama Srinivasan (Anna University, India) Vaishnavi Sundararajan (IIT Delhi, India) Sergei Starchenko (University of Notre Dame, USA) Ramanathan S Thinniyam (Uppsala University, Sweden) Jouko Väänänen (University of Helsinki, Finland) More members are expected to join. ========================== Organizing Committee Chairs ========================== Sourav Chakraborty (Indian Statistical Institute Kolkata) Sujata Ghosh (Indian Statistical Institute Chennai) ===================== Co-located Workshops ===================== Asian Workshop on Philosophical Logic (AWPL) - Date: Feb 6 -- 8, 2025 - Venue: Jadavpur University Kolkata - Website: https://sites.google.com/view/awpl2025/ More information and updates about the conference can be found at: https://logicindia.org/icla/icla2025/. For any queries or suggestions, feel free to write to: icla2025(a)gmail.com.

1 Tag

1
0
0 0

Precall "Bilateral AI" (50 PhDs, 10 Postdocs), fall 2024

von Hackl, Andrea

Cluster of Excellence Bilateral Artificial Intelligence Pre-Call for Applications For the recently established Cluster of Excellence CoE Bilateral Artificial Intelligence (BILAI), funded by the Austrian Science Fund (FWF), we are looking for more than 50 PhD students and 10 Post-Doc researchers (m/f/d) to join our team at one of the six leading research institutions across Austria (see below). In BILAI, major Austrian players in Artificial Intelligence (AI) are teaming up to work towards Broad AI. As opposed to Narrow AI, which is characterized by task-specific skills, Broad AI seeks to address a wide array of problems, rather than being limited to a single task or domain. To develop its foundations, BILAI employs a Bilateral AI approach, effectively combining sub-symbolic AI (neural networks and machine learning) with symbolic AI (logic, knowledge representation, and reasoning) in various ways. Harnessing the full potential of both symbolic and sub-symbolic approaches can open new avenues for AI, enhancing its ability to solve novel problems, adapt to diverse environments, improve reasoning skills, and increase efficiency in computation and data use. These key features enable a broad range of applications for Broad AI, from drug development and medicine to planning and scheduling, autonomous traffic management, and recommendation systems. Prioritizing fairness, transparency, and explainability, the development of Broad AI is crucial for addressing ethical concerns and ensuring a positive impact on society. The research team is committed to cross-disciplinary work in order to provide theory and models for future AI and deployment to applications. CoE Research Institutions: Johannes Kepler Universität Linz (JKU Linz) Technische Universität Wien (TU Wien) Alpen-Adria-Universität Klagenfurt (AAU) Institute of Science and Technology Austria (ISTA) Technische Universität Graz (TU Graz) Wirtschaftsuniversität Wien (WU Wien) Board of directors: Sepp Hochreiter (JKU Linz) Agata Ciabattoni (TU Wien) Thomas Eiter (TU Wien) Gerhard Friedrich (AAU) Christoph Lampert (ISTA) Robert Legenstein (TU Graz) Axel Polleres (WU Wien) Martina Seidl (JKU Linz) The call for applications will open on *** September 1,*** 2024. For more information, see http://www.bilateral-ai.net. Stay tuned!

1 Woche, 5 Tage

1
0
0 0

FTfJP 2024 - Deadline extension

von Di Stefano, Luca

========================================================== CALL FOR PAPERS - DEADLINE EXTENSION FTfJP 2024 26th Workshop on Formal Techniques for Java-like Programs 20 September 2024, Vienna, Austria https://conf.researchr.org/home/issta-ecoop-2024/FTfJP-2024 =========================================================== === Important dates === - Paper submission: 26 June 2024 (AoE, extended) - Paper notification: 24 July 2024 (AoE) - Workshop date: 20 September 2024, colocated with ISSTA/ECOOP 2024 (16-20 September 2024) Deadlines expire at 23:59 anywhere on earth on the dates displayed above. Submission site: https://easychair.org/conferences/?conf=ftfjp2024 === Objectives and scope === 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 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. Past editions of FTfJP have featured work on C++, JavaScript, Rust, and other languages and calculi. The term 'formal techniques' has a similarly broad interpretation. Example topics of interest include: - Language design and semantics - Type systems - Concurrency and new application domains - Specification and verification of program properties - Program analysis (static or dynamic) - Program synthesis - Security - Pearls (programs or proofs) FTfJP welcomes submissions on technical contributions, case studies, experience reports, challenge proposals, tools, and position papers. Webpages for previous workshops in this series are available at https://ftfjp.github.io/. === Paper Categories === Contributions are sought in two categories: - Full Papers (6 pages, excluding references) present a technical contribution, case study, or detailed experience report. We welcome both complete and incomplete technical results; ongoing work is particularly welcome, provided it is substantial enough to stimulate interesting discussions. - Short Papers (2 pages, excluding references) should advocate a promising research direction, or otherwise present a position likely to stimulate discussion at the workshop. We encourage e.g. established researchers to set out a personal vision, and beginning researchers to present a planned path to a PhD. Both types of contributions will benefit from feedback received at the workshop. Submissions will be peer reviewed, and will be evaluated based on their clarity and their potential to generate interesting discussions. Reviewing will be single blind, i.e, submissions need not be anonymized. The format of the workshop encourages interaction. FTfJP is a forum in which a wide range of people share their expertise, from experienced researchers to beginning PhD students. === Submission guidelines === All submissions and reviews will be managed within EasyChair. Submissions should be made via https://easychair.org/conferences/?conf=ftfjp2024. There is no need to indicate the paper category (long/short). Submissions should be in acmart/sigplan style, 10pt font. Formatting requirements are detailed on the SIGPLAN Author Information page (https://www.sigplan.org/Resources/Author). We plan that, as in previous years, accepted papers will be published in the ACM Digital Library, though authors will be able to opt out of this publication, if desired. At least one author of an accepted paper must register to the conference by the early registration date and attend the workshop to present the work and participate in the discussions. === Steering Committee === Werner Dietl, University of Waterloo, Canada Radu Grigore, Facebook, United Kingdom Gary T. Leavens, University of Central Florida, United States Rosemary Monahan, National University of Ireland, Ireland (SC chair) Alexander J. Summers, University of British Columbia, Canada === Program Committee === Vincenzo Arceri, University of Parma, Italy Avik Chaudhuri, Facebook, United States Luca Di Stefano, TU Wien, Austria (chair) Claire Dross, AdaCore, France Madalina Erascu, Institute e-Austria Timisoara, Romania Marie-Christine Jakobs, LMU Munich, Germany Kenny Lu Zhuo Ming, Singapore University of Technology and Design, Singapore Lina Marsso, University of Toronto, Canada Henrique Rebelo, Federal University of Pernambuco, Brazil Silvia Lizeth Tapia Tarifa, University of Oslo, Norway Oksana Tkachuk, Amazon Web Services, United States Luca Di Stefano TU Wien Informatics https://www.lucadistefano.eu

2 Wochen, 2 Tage

1
0
0 0

PhD position in Logic and Complexity, Sheffield (UK), Deadline: 1

von Jonni T Virtema

******************************************************* * PhD position in Quantitative logics and complexity theory * University of Sheffield, UK * Fully funded for 3.5 years (both UK Home and International rates) * Possible times to start: preferably Autumn 2024 ******************************************************* I am looking for a motivated PhD student to join the Foundations of Computation group (https://www.sheffield.ac.uk/cs/research/groups/foundations-computation) of The University of Sheffield (https://www.sheffield.ac.uk/cs). The topic of the PhD project is quite flexible, but should relate to my current research directions in quantitative logics and complexity theory. Here possible directions are temporal logics, logical foundations of neural networks, and logical foundations of database theory (for more details: https://www.findaphd.com/phds/project/quantitative-logics-and-complexity-th…). This PhD studentship will fund the full (UK or Overseas) tuition fee and provide a tax-free stipend at the standard UKRI rate (currently £19,237 for 2024/25) for 3.5 years. In addition, both the Department and research group provide funding for attending conferences. Interested candidates are encouraged to contact me directly by email for further details (j.t.virtema(a)sheffield.ac <mailto:j.t.virtema@sheffield.ac>.uk). For more details on the possible topics, the candidate may refer to my recent works at http://www.virtema.fi/. Best wishes, Jonni

2 Wochen, 5 Tage

1
0
0 0

[Vardi-list] OSSyM Workshop@CAV 2024

von Moshe Vardi

************************************************** Open-source, State-of-the-art Symbolic Model-checking framework (OSSyM) Workshop July 23, 2024 Montreal, Canada Co-located with CAV https://laboratory.temporallogic.org/ossym/ ************************************************** This email is to officially invite you to be an active participant in the CAV workshop on this project on July 23, focusing on the new model-checking intermediate language MoXI, its surrounding infrastructure, and the path forward for maximizing involvement of, and utility for, the international research community. Please check out these resources on MoXI: * a preliminary schedule: https://laboratory.temporallogic.org/ossym/ * slides and a recorded keynote on the project: https://modelchecker.github.io/ * materials from a mini-version of this workshop held at FMCAD 2023: https://github.com/ModelChecker/FMCAD23-Tutorial * our SPIN 2024 paper, describing MoXI semantics: https://research.temporallogic.org/papers/SPIN2024.pdf * our CAV 2024 tool paper, describing an initial implementation of MoXI translations: https://research.temporallogic.org/papers/CAV2024.pdf This will be an old-school style workshop, without a published proceedings, centered around active discussion and facilitating research collaborations. Our goal is to actively involve as much of the model-checking research community as possible! Your active participation in the tutorials, discussions, and collaborative activities of this workshop is vital to the project's goals. We hope to see you in Montreal! OSSyM Organizers: Kristin Yvonne Rozier Natarajan Shankar Cesare Tinelli Moshe Y. Vardi _______________________________________________ Vardi-list mailing list Vardi-list(a)mailman.rice.edu https://mailman.rice.edu/mailman/listinfo/vardi-list

3 Wochen

1
0
0 0

PhD and Postdoc positions at University of Warsaw

von Szymon Toruńczyk

Dear colleague, Please find below a job announcement for the ERC Consolidator Grant BUKA. I would be grateful if you could forward it to anyone interested. With best wishes for the holidays, and a happy new year, Szymon Toruńczyk –––––––––––––––––––––––––– The ERC Consolidator Grant BUKA (Limits of Structural Tractability) is offering 2 Postdoc and 2 PhD positions at the University of Warsaw. The goal of the project is to systematically explore the tractability limit of computational problems related to logic and structural graph theory. The project is led by Szymon Toruńczyk. The project website is https://sites.google.com/view/buka-project/ (see below for a description). We are looking for highly motivated and creative candidates. The applicants should have a strong background in at least one of the following fields: structural graph theory, algorithms and complexity, finite model theory, or model theory. The starting date of the grant is the 1st of October 2024. We encourage applicants to express their interest by *June 27nd, 2024 *(see https://euraxess.ec.europa.eu/jobs/238633 for a job announcement). The duration of the PhD positions will be 4 years, and the duration of the Postdoc position will be up to 2 years. The positions come with a very good salary and carry no teaching load; however, if desired participation in teaching might be arranged. There is a generous travel budget. Feel free to contact me for more details: szymtor(a)mimuw.edu.pl. ––––––––––––––– Description of BUKA The area of the project lies at the interface of algorithmic and finite model theory, structural graph theory, and model theory. The goal is systematically explore fixed-parameter tractability of the model checking problem for first-order logic for restricted classes of graphs. On the one hand, this topic is closely related to concepts studied in structural graph theory – such as classes of bounded treewidth, cliquewidth, twin-width, or nowhere dense classes – and in combinatorics – such as the Erdős-Hajnal property, χ-boundedness, VC-dimension, regularity. On the other hand, it is closely related to concepts studied in model theory – such as monadically stable and NIP theories – and in finite model theory – such as locality of first-order logic and query enumeration in database theory. Finally, it is closely related to parameterized complexity theory and algorithms. The project will develop the structure theory for the considered graphs or structures, and will seek efficient algorithms leveraging this structure. One of the main goals of the project is to characterize those hereditary graph classes, for which the model checking problem for first-order logic is fixed-parameter tractable. See https://sites.google.com/view/buka-project/ <https://pococop.eu/> for more details.

3 Wochen

1
0
0 0

SEFM'24 -- Deadline extended!

von Alexandre Madeira

========= DEADLINE EXTENSION ============== 22nd International Conference on Software Engineering and Formal Methods 4-8 November 2024 University of Aveiro, Portugal https://sefm-conference.github.io/2024/ ============================================ The 21st edition of the International Conference on Software Engineering and Formal Methods will be held between 6 and 8 November 2024, with workshops taking place on 4 and 5 November 2024. *Important dates* Abstract submission: 21 June 2024 (AoE) -- Extended! Paper submission: 28 June 2024 (AoE) -- Extended! Author notification: 15 August 2024 Workshops: 4-5 November 2024 Conference: 6-8 November 2024 *Overview and Scope* The conference aims to bring together researchers and practitioners from academia, industry and government, to advance the state of the art in formal methods, to facilitate their uptake in the software industry, and to encourage their integration within practical software engineering methods and tools. The topics of interest include, but are not limited to, the following aspects of software engineering and formal methods. -Software Development Methods .Formal modelling, specification, and design .Software evolution, maintenance, re-engineering, and reuse .Design Principles -Programming languages .Domain-specific languages .Type theory .Abstraction and refinement -Software Testing, Validation, and Verification .Model checking, theorem proving, and decision procedures .Testing and runtime verification .Statistical and probabilistic analysis .Synthesis .Performance estimation and analysis of other non-functional properties .Other light-weight and scalable formal methods .Security and Safety -Security, privacy, and trust .Safety-critical, fault-tolerant, and secure systems .Software certification .Applications and Technology Transfer -Service-oriented and cloud computing systems, Internet of Things .Component, object, multi-agent and self-adaptive systems .Real-time, hybrid, and cyber-physical systems .Intelligent systems and machine learning .Quantum systems .HCI, interactive systems, and human error analysis .Education -Case studies, best practices, and experience reports *Invited Speakers* Luís S. Barbosa, University of Minho, PT Paula Herber, Universitat Munster, DE Aleks Kissinger, University of Oxford, UK *Paper submission* We solicit two categories of papers: .Regular papers - describing original research results, case studies, or surveys, should not exceed 16 pages (excluding bibliography of at most two pages). .Tool papers - that describe an operational tool and its contributions should not exceed 8 pages. Papers must be formatted according to the guidelines for Springer LNCS papers. All submissions must be original, unpublished, and not submitted concurrently for publication elsewhere. Papers can be submitted through Easychair: https://easychair.org/conferences/?conf=sefm2024. *Artifact Evaluation* This edition of SEFM introduces an artifact evaluation (AE). An artifact contains any necessary material to support the claims made in the paper and ideally makes the results fully reproducible. Submission of an artifact is optional for regular papers and mandatory for tool papers. The artifacts will be judged by the Artifact Evaluation Committee (AEC). More details will be available soon. *Publication* All accepted papers will appear in the proceedings of the conference that will be published as a volume in Springer’s LNCS series. The authors of a selected subset of accepted papers will be invited to submit extended versions of their papers to a special issue of the journal Software and Systems Modeling (SoSyM). ------------------------------------------------------- Alexandre Madeira http://sweet.ua.pt/madeira/

3 Wochen, 4 Tage

1
0
0 0

VCLA International Student Awards - Deadline Extension and Last Call

von Hackl, Andrea

The deadline for the submission of self-nominations for the VCLA International Student Awards has been extended to the 15th of June 2024! Please find the revised call for nominations below. ---------------------------------- The Vienna Center for Logic and Algorithms of TU Wien calls for the nomination of authors of outstanding theses and scientific works in the field of Logic and Computer Science, in the following two categories: - Outstanding Master Thesis Award* - Outstanding Undergraduate Thesis Award (Bachelor thesis or equivalent, 1st cycle of the Bologna process)* *The degree must have been awarded between January 1st, 2023 and December 31st, 2023 (inclusive). ---------------------------------- The main areas of interest are: ---------------------------------- - Computational Logic, covering theoretical and mathematical foundations such as proof theory, model theory, computability theory, Boolean satisfiability (SAT), QBF, constraint satisfaction, satisfiability modulo theories, automated deduction (resolution, refutation, theorem proving), non-classical logics (substructural logics, multi-valued logics, deontic logics, modal and temporal logics). - Algorithms and Computational Complexity, including design and analysis of discrete algorithms, complexity analysis, algorithmic lower bounds, parameterized and exact algorithms, decomposition methods, approximation algorithms, randomized algorithms, algorithm engineering, as well as algorithmic game theory, computational social choice, parallel algorithms, graph drawing algorithms, and distributed algorithms. - Databases and Artificial Intelligence, concerned with logical methods for modeling, storing, and drawing inferences from data and knowledge. This includes subjects like query languages based on logical concepts (Datalog, variants of SQL, XML, and SPARQL), novel database-theoretical methods (schema mappings, information extraction and integration), logic programming, knowledge representation and reasoning (ontologies, answer-set programming, belief change, inconsistency handling, argumentation, planning). - Verification, concerned with logical methods and automated tools for reasoning about the behavior and correctness of complex state-based systems such as software and hardware designs as well as hybrid systems. This ranges from model checking, program analysis and abstraction to new interdisciplinary areas such as fault localization, program repair, program synthesis, and the analysis of biological systems. ---------------------------------- Awards ---------------------------------- - The Outstanding Master Thesis Award: 1200 EUR. - The Outstanding Undergraduate Thesis Award: 800 EUR. - The winners will be invited to present their work at an award ceremony in Vienna, if the situation allows. ---------------------------------- Eligibility ---------------------------------- - The degree must have been awarded between January 1st, 2023 and December 31st, 2023 (inclusive). - Students who obtained their degree at TU Wien are not eligible. ---------------------------------- Nomination Requirements ---------------------------------- Nominations must include: - A cover page that contains the name and contact details of the nominated person, the title of the work for which the person is being nominated, award category, the date on which the degree was awarded, and the name of the university. - An English summary of the thesis of maximum 3 pages, excluding references (A4 or letter page size, 11pt font min). The summary must clearly state the main contribution of the work, its novelty, and its relevance to some of the aforementioned areas of interest. - The CV of the nominated person, including publication list (if applicable). - An endorsement letter from a supervisor or another proposing person. The letter must clearly state the independent and novel contribution of the student, and why the proposer believes the student deserves the award. The endorsement letter may be provided after the submission deadline, and emailed directly to award (AT) logic-cs.at. - The full thesis. All documents should be in English, with the exception of the thesis. In case the thesis is in a different language, it must be accompanied by a research report in English of at least 10 pages that should be sufficient for the committee to evaluate the merit and quality of the submitted work. ---------------------------------- Instructions for submitting self-nominations ---------------------------------- - Nominations should be submitted electronically by the applicants using the following link to EasyChair: https://easychair.org/conferences/?conf=vclaawards2024. - Submissions consist of two pdf files. The first is a single pdf file containing all documents for the nomination except the full thesis; the documents should appear in the order they are listed above. The second pdf file is the full thesis. - The endorsement letter may optionally be sent by email by the endorser and omitted from the Easychair submission. In this case, please email the letter as a pdf file, including the name of the nominated person in the subject, to award (AT) logic-cs DOT at. - The submission must be accompanied by a plain text electronic abstract of the thesis of at most 400 words, and three keywords. - The nominated student must be listed as the only author in the submission form. ---------------------------------- Important dates ---------------------------------- - Submission deadline: June 15th, 2024 (anywhere on Earth) - Notification of decision: After August 31st, 2024 ---------------------------------- Contact ---------------------------------- Please send all inquiries to award(a)logic-cs.at<mailto:award@logic-cs.at>. ---------------------------------- VCLA Award Committee 2024 ---------------------------------- Shqiponja Ahmetaj (chair) Kees van Berkel Michele Chiari Katalin Fazekas Daniela Kaufmann Matthias Lanzinger Xinghan Liu Anela Lolic (chair) Sanja Lukumbuzya Jan Maly Xavier Parent Vaidyanathan Peruvemba Ramaswamy Michael Rawson Martin Riener Sebastian Skritek Matteo Tesi Felix Winter Jules Wulms ---------------------------------- Website with information on the award and the previous awardees ---------------------------------- https://www.vcla.at/2024/04/call-for-nominations-vcla-international-student… Andrea Hackl, MA Project Manager Vienna Center for Logic and Algorithms Technische Universität Wien Favoritenstraße 9-11, Stiege 3, 3. Stock, 1040 Wien andrea.hackl(a)tuwien.ac.at<mailto:andrea.hackl@tuwien.ac.at> www.vcla.at<http://www.vcla.at/>

4 Wochen, 1 Tag

1
0
0 0

FTfJP 2024 - First CfP

von Di Stefano, Luca

========================================================== CALL FOR PAPERS FTfJP 2024 26th Workshop on Formal Techniques for Java-like Programs 20 September 2024, Vienna, Austria https://conf.researchr.org/home/issta-ecoop-2024/FTfJP-2024 =========================================================== === Important dates === Important dates - Paper submission: 19 June 2024 (AoE) - Paper notification: 24 July 2024 (AoE) - Workshop date: 20 September 2024, colocated with ISSTA/ECOOP 2024 (16-20 September 2024) Deadlines expire at 23:59 anywhere on earth on the dates displayed above. Submission site: https://easychair.org/conferences/?conf=ftfjp2024 === Objectives and scope === 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 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. Past editions of FTfJP have featured work on C++, JavaScript, Rust, and other languages and calculi. The term 'formal techniques' has a similarly broad interpretation. Example topics of interest include: - Language design and semantics - Type systems - Concurrency and new application domains - Specification and verification of program properties - Program analysis (static or dynamic) - Program synthesis - Security - Pearls (programs or proofs) FTfJP welcomes submissions on technical contributions, case studies, experience reports, challenge proposals, tools, and position papers. Webpages for previous workshops in this series are available at https://ftfjp.github.io/. === Paper Categories === Contributions are sought in two categories: - Full Papers (6 pages, excluding references) present a technical contribution, case study, or detailed experience report. We welcome both complete and incomplete technical results; ongoing work is particularly welcome, provided it is substantial enough to stimulate interesting discussions. - Short Papers (2 pages, excluding references) should advocate a promising research direction, or otherwise present a position likely to stimulate discussion at the workshop. We encourage e.g. established researchers to set out a personal vision, and beginning researchers to present a planned path to a PhD. Both types of contributions will benefit from feedback received at the workshop. Submissions will be peer reviewed, and will be evaluated based on their clarity and their potential to generate interesting discussions. Reviewing will be single blind, i.e, submissions need not be anonymized. The format of the workshop encourages interaction. FTfJP is a forum in which a wide range of people share their expertise, from experienced researchers to beginning PhD students. === Submission guidelines === All submissions and reviews will be managed within EasyChair. Submissions should be made via https://easychair.org/conferences/?conf=ftfjp2024. There is no need to indicate the paper category (long/short). Submissions should be in acmart/sigplan style, 10pt font. Formatting requirements are detailed on the SIGPLAN Author Information page (https://www.sigplan.org/Resources/Author). We plan that, as in previous years, accepted papers will be published in the ACM Digital Library, though authors will be able to opt out of this publication, if desired. At least one author of an accepted paper must register to the conference by the early registration date and attend the workshop to present the work and participate in the discussions. === Steering Committee === Werner Dietl, University of Waterloo, Canada Radu Grigore, Facebook, United Kingdom Gary T. Leavens, University of Central Florida, United States Rosemary Monahan, National University of Ireland, Ireland (SC chair) Alexander J. Summers, University of British Columbia, Canada === Program Committee === Vincenzo Arceri, University of Parma, Italy Avik Chaudhuri, Facebook, United States Claire Dross, AdaCore, France Madalina Erascu, Institute e-Austria Timisoara, Romania Marie-Christine Jakobs, LMU Munich, Germany Kenny Lu Zhuo Ming, Singapore University of Technology and Design, Singapore Lina Marsso, University of Toronto, Canada Henrique Rebelo, Federal University of Pernambuco, Brazil Silvia Lizeth Tapia Tarifa, University of Oslo, Norway Oksana Tkachuk, Amazon Web Services, United States Luca Di Stefano TU Wien Informatics https://www.lucadistefano.eu

1 Monat

1
0
0 0

Ackermann Award: First call for nominations - Deadline 1st July

von Maribel Fernandez

ACKERMANN AWARD 2024 EACSL OUTSTANDING DISSERTATION AWARD FOR LOGIC IN COMPUTER SCIENCE CALL FOR NOMINATIONS Nominations are now invited for the 2024 Ackermann Award. PhD dissertations in topics specified by the CSL and LICS conferences, which were formally accepted as PhD theses at a university or equivalent institution between 1 January 2023 and 31 December 2023 are eligible for nomination for the award. The deadline for submission is 1 July 2024. Nominations should be submitted by the candidate or the supervisor via Easychair: https://easychair.org/my/conference?conf=ackermann2024 Please submit a pdf file containing: 1. a summary in English of the thesis (maximum 10 pages), providing a gentle introduction and overview of the thesis, highlighting the novel results and their impact and including a link to the thesis in the first page (please do not include the thesis itself); 2. a supporting letter by the PhD advisor and two supporting letters by other senior researchers (in English); 3. a copy of a document stating that the thesis was accepted as a PhD thesis at a recognised University (or equivalent institution) and that the candidate was awarded the PhD degree within the specified period; 4. a short CV of the candidate. *** The Award The 2024 Ackermann award will be presented to the recipient(s) at CSL 2025. The award consists of a certificate, an invitation to present the thesis at the CSL conference, the publication of the laudatio in the CSL proceedings, an invitation to the winner to publish the thesis in the FoLLI subseries of Springer LNCS, and financial support to attend the conference. *** Ackermann Jury The jury consists of: * Albert Atserias (UPC Barcelona) * Christel Baier (TU Dresden) * Andrej Bauer (U Ljubljana) * Javier Esparza (TU Munich) * Maribel Fernandez (King’s College London), EACSL president * Joost-Pieter Katoen (RWTH Aachen U), ACM SigLog rep. * Delia Kesner (IRIF, U Paris Cite) * Slawomir Lasota (U Warsaw) * Florin Manea (U Goettingen), EACSL vice-president * Prakash Panangaden (McGill U) For more information please contact Maribel Fernandez: Maribel.Fernandez(a)kcl.ac.uk<mailto:Maribel.Fernandez@kcl.ac.uk>

1 Monat

1
1
0 0

2024

2023

2022

2021

2020

2019

2018

finite-model-theory