- Termtools - lists.rwth-aachen.de

von YAMADA, Akihisa

Dear all, FLoC will give us five medals. We distribute them as follows: Gold, Silver, and Bronze medals go to the top three teams according to a competition-wide ranking. (*) Two special medals go to the best two teams in advancing the state of the art. (**) The unit "team" is chosen to ensure medals go to different places. When the registration is closed, I'll suggest a definition of teams. Please raise comments on it if necessary. It will ultimately be decided by SC minus conflict of interest. The detail of the ranking is as follows: Recall that for each benchmark, each claim (Termination, Nontermination, Upper-bound, Lower-bound, and their CERTIFIED versions) yields score in range [0,1]. The virtual best solver (VBS) records the best (consistent) score for each claim collected at least since 2018. (*) Teams are ranked by the Euclidean norms of the normalized score vector. Each component of the vector is the score of the team in a category, divided by the score of the VBS in the category. (**) If a team gets higher score for a benchmark and a claim than previous year's VBS, then the team gets the difference as a special score, and teams are ranked by sums of these scores. In short, if you claim YES/NO while no tool in the past claimed so, then you get special score 1. Best, Akihisa

1 Jahr, 11 Monate

3
3
0 0

Additions to TRS_Conditional

von Salvador Lucas

Dear all, In order to make the TermCOMP 2022 'demo' category of termination of CTRSs more attractive, we submitted a new collection of oriented CTRSs from COPS. We did not provide any suggestion of name for the collection. Thus, for TermCOMP 2022 I see that it has been named Gutierrez_22 (Raúl submitted the collection of examples). Perhaps COPS_oriented22 would be more appropriate as it recognizes the real origin of the examples. It is not a big problem, but I think better to update the name of the collection. Sorry for not proposing the name of the collection in time. Best regards, Salvador.

1 Jahr, 11 Monate

2
1
0 0

Termination and Complexity Competition 2022: Second Call for

von Juergen Giesl

*Termination and Complexity Competition 2022* http://www.termination-portal.org/wiki/Termination_Competition_2022 *Call for Participation* Since the beginning of the millennium, many research groups developed tools for fully automated termination and complexity analysis. After a tool demonstration at the 2003 Termination Workshop in Valencia, the community decided to start an annual termination competition to spur the development of tools and termination techniques. The termination and complexity competition focuses on automated termination and complexity analysis for all kinds of programming paradigms, including categories for term rewriting, imperative programming, logic programming, and functional programming. In all categories, we also welcome the participation of tools providing certifiable proofs. The goal of the termination and complexity competition is to demonstrate the power of the leading tools in each of these areas. The competition will be affiliated with IJCAR 2022 ( https://easychair.org/smart-program/FLoC2022/IJCAR-index.html) and it will be part of the Olympic Games at the Federated Logic Conference (FLoC 2022) ( https://www.floc2022.org/floc-olympic-games). It will be run on the StarExec platform (http://www.starexec.org/). The final run and a presentation of the final results will be live at FLoC. We strongly encourage all developers of termination and complexity analysis tools to participate in the competition. We also welcome the submission of termination and complexity problems, especially problems that come from applications. A category is only run in the competition if there are at least 2 participants and at least 40 examples for this category in the underlying termination problem data base. If there is no category that is convenient for your tool, you can contact the organizers, since other categories can be considered as well if enough participants are guaranteed. For further information, we refer to the website of the termination and complexity competition: http://www.termination-portal.org/wiki/Termination_Competition_2022 *Important dates* - Tool and Problem Submission: July 24, 2022 - First Run: July 25, 2022 - Bug/Conflict Report Deadline: July 30, 2022 - Bugfix Deadline: August 4, 2022 - Final Run: August 5, 2022 - Award Ceremony at FLoC: August 9, 2022 - Presentations at WST: August 12, 2022

1 Jahr, 11 Monate

1
0
0 0

Registration open for termCOMP 2022

von YAMADA, Akihisa

Dear all, the GitHub repository is ready for termCOMP 2022 registration: https://github.com/TermCOMP/starexec-master I hope the instruction there is clear enough. Please post questions on this list otherwise. You can monitor the status of registration and run at http://termcomp.github.io/Y2022/ Best, Akihisa

1 Jahr, 12 Monate

4
6
0 0

invitation for tool presentations at WST 2022

von Cynthia Kop

Hello all, We would like to extend an invitation to authors of termination or complexity tools to give a presentation at WST 2022 on 11-12 August, 2022 in Haifa. To participate, please submit a title and abstract by *18 June*. Tool presentations will be 5-20 minutes (to your preference). Submissions should be made at https://easychair.org/conferences/?conf=wst22 Participants are additionally invited to submit a 1-2 page extended abstract, to be included in the (informal) proceedings. This is not mandatory for participation. Hoping to see you at WST! Cynthia Kop.

2 Jahre

1
1
0 0

Termination and Complexity Competition 2022: Call for Participation

von Juergen Giesl

*Termination and Complexity Competition 2022* http://www.termination-portal.org/wiki/Termination_Competition_2022 *Call for Participation* Since the beginning of the millennium, many research groups developed tools for fully automated termination and complexity analysis. After a tool demonstration at the 2003 Termination Workshop in Valencia, the community decided to start an annual termination competition to spur the development of tools and termination techniques. The termination and complexity competition focuses on automated termination and complexity analysis for all kinds of programming paradigms, including categories for term rewriting, imperative programming, logic programming, and functional programming. In all categories, we also welcome the participation of tools providing certifiable proofs. The goal of the termination and complexity competition is to demonstrate the power of the leading tools in each of these areas. The competition will be affiliated with IJCAR 2022 ( https://easychair.org/smart-program/FLoC2022/IJCAR-index.html) and it will be part of the Olympic Games at the Federated Logic Conference (FLoC 2022) ( https://www.floc2022.org/floc-olympic-games). It will be run on the StarExec platform (http://www.starexec.org/). The final run and a presentation of the final results will be live at FLoC. All (co-)authors of tools or benchmarks are invited (but not required) to give a 5-20min presentation of their contributions at the Workshop of Termination (WST 2022, https://sws.cs.ru.nl/WST2022) on August 12, 2022. We ask for a title and abstract by June 18, and anyone who sends this in may additionally submit a 1-2 page paper to be included in the WST proceedings (but this is not mandatory). Please use the following URL for your WST submission: https://easychair.org/conferences/?conf=wst22 We strongly encourage all developers of termination and complexity analysis tools to participate in the competition. We also welcome the submission of termination and complexity problems, especially problems that come from applications. A category is only run in the competition if there are at least 2 participants and at least 40 examples for this category in the underlying termination problem data base. If there is no category that is convenient for your tool, you can contact the organizers, since other categories can be considered as well if enough participants are guaranteed. For further information, we refer to the website of the termination and complexity competition: http://www.termination-portal.org/wiki/Termination_Competition_2022 *Important dates* - Title and Abstract Submission to WST: June 18, 2022 - Tool and Problem Submission: July 24, 2022 - First Run: July 25, 2022 - Bug/Conflict Report Deadline: July 30, 2022 - Bugfix Deadline: August 4, 2022 - Final Run: August 5, 2022 - Award Ceremony at FLoC: August 9, 2022 - Presentations at WST: August 12, 2022

2 Jahre

1
0
0 0

WST 2022: final call for papers (submission deadline changed!)

von Cynthia Kop

====================================================================== WST 2022 - Call for Papers 18th International Workshop on Termination https://sws.cs.ru.nl/WST2022 August 11-12, 2022, Haifa, Israel Co-located with IJCAR-11 at FLoC 2022 ====================================================================== The Workshop on Termination (WST) traditionally brings together, in an informal setting, researchers interested in all aspects of termination, whether this interest be practical or theoretical, primary or derived. The workshop also provides a ground for cross-fertilization of ideas from the different communities interested in termination (e.g., working on computational mechanisms, programming languages, software engineering, constraint solving, etc.). The friendly atmosphere enables fruitful exchanges leading to joint research and subsequent publications. /*The submission deadline has been extended by one week.*/ IMPORTANT DATES: * submission deadline: *May 10, 2022* * notification: *June 15, 2022* * final version due: *June 29, 2022* * workshop: August 11-12, 2022 INVITED SPEAKER: René Thiemann TOPICS: The 18th International Workshop on Termination welcomes contributions on all aspects of termination. In particular, papers investigating applications of termination (for example in complexity analysis, program analysis and transformation, theorem proving, program correctness, modeling computational systems, etc.) are very welcome. Topics of interest include (but are not limited to): * abstraction methods in termination analysis * certification of termination and complexity proofs * challenging termination problems * comparison and classification of termination methods * complexity analysis in any domain * implementation of termination analysis methods * non-termination analysis and loop detection * normalization and infinitary normalization * operational termination of logic-based systems * ordinal notation and subrecursive hierarchies * SAT, SMT, and constraint solving for (non-)termination analysis * scalability and modularity of termination methods * termination analysis in any domain (lambda calculus, declarative programming, rewriting, transition systems, probabilistic programs, etc.) * well-founded relations and well-quasi-orders SUBMISSION GUIDELINES: Submissions are short papers/extended abstracts which should not exceed 5 pages. There will be only informal reviewing. In particular, we welcome short versions of recently published articles and papers submitted elsewhere. The program committee checks relevance and provides additional feedback for each submission. The accepted papers will be made available electronically before the workshop. Papers should be submitted electronically via the submission page: https://easychair.org/conferences/?conf=wst22 Please, use LaTeX and the LIPIcs style file https://submission.dagstuhl.de/styles/download-tag/lipics/v2021.1.2/authors… to prepare your submission. PROGRAM COMMITTEE: * Jose Divasón - U. de La Rioja * Florian Frohn - AbsInt GmbH * Jera Hensel - RWTH Aachen * Dieter Hofbauer - ASW Saarland * Sebastiaan Joosten - Dartmouth College * Cynthia Kop (chair) - Radboud U. Nijmegen * Akihisa Yamada - AIST, Japan * Hans Zantema - Eindhoven U. of Technology

2 Jahre, 2 Monate

1
0
0 0

WST 2022 - Call for Papers

von Cynthia Kop

====================================================================== WST 2022 - Call for Papers 18th International Workshop on Termination https://sws.cs.ru.nl/WST2022 August 11-12, 2022, Haifa, Israel Co-located with IJCAR-11 at FLoC 2022 ====================================================================== The Workshop on Termination (WST) traditionally brings together, in an informal setting, researchers interested in all aspects of termination, whether this interest be practical or theoretical, primary or derived. The workshop also provides a ground for cross-fertilization of ideas from the different communities interested in termination (e.g., working on computational mechanisms, programming languages, software engineering, constraint solving, etc.). The friendly atmosphere enables fruitful exchanges leading to joint research and subsequent publications. IMPORTANT DATES: * submission deadline: May 3, 2022 * notification: June 8, 2022 * final version due: June 22, 2022 * workshop: August 11-12, 2022 INVITED SPEAKERS: TBA TOPICS: The 18th International Workshop on Termination welcomes contributions on all aspects of termination. In particular, papers investigating applications of termination (for example in complexity analysis, program analysis and transformation, theorem proving, program correctness, modeling computational systems, etc.) are very welcome. Topics of interest include (but are not limited to): * abstraction methods in termination analysis * certification of termination and complexity proofs * challenging termination problems * comparison and classification of termination methods * complexity analysis in any domain * implementation of termination analysis methods * non-termination analysis and loop detection * normalization and infinitary normalization * operational termination of logic-based systems * ordinal notation and subrecursive hierarchies * SAT, SMT, and constraint solving for (non-)termination analysis * scalability and modularity of termination methods * termination analysis in any domain (lambda calculus, declarative programming, rewriting, transition systems, probabilistic programs, etc.) * well-founded relations and well-quasi-orders SUBMISSION GUIDELINES: Submissions are short papers/extended abstracts which should not exceed 5 pages. There will be no formal reviewing. In particular, we welcome short versions of recently published articles and papers submitted elsewhere. The program committee checks relevance and provides additional feedback for each submission. The accepted papers will be made available electronically before the workshop. Papers should be submitted electronically via the submission page: https://easychair.org/conferences/?conf=wst22 Please, use LaTeX and the LIPIcs style file https://submission.dagstuhl.de/styles/download-tag/lipics/v2021.1.2/authors… to prepare your submission. PROGRAM COMMITTEE: * Jose Divasón - U. de La Rioja * Florian Frohn - AbsInt GmbH * Jera Hensel - RWTH Aachen * Dieter Hofbauer - ASW Saarland * Sebastiaan Joosten - Dartmouth College * Cynthia Kop (chair) - Radboud U. Nijmegen * Akihisa Yamada - AIST, Japan * Hans Zantema - Eindhoven U. of Technology

2 Jahre, 2 Monate

1
1
0 0

FSCD 2024: Call for Location

von carsten＠dcs.bbk.ac.uk

(Apologies for multiple copies of this announcement. Please circulate.) --------------- Call for Location for FSCD 2024 The FSCD conference covers all aspects of Formal Structures for Computation and Deduction from theoretical foundations to applications. The annual FSCD conference comprises the main conference and a considerable number of affiliated workshops (expectedly, more than ten). We invite proposals for locations to host the 9th FSCD International Conference to be held during the summer of 2024. Previous (and upcoming) FSCD meetings include: FSCD 2016 in Porto (Portugal); FSCD 2017 in Oxford (UK) co-located with ICFP 2017; FSCD 2018 in Oxford (UK) as part of FLoC 2018; FSCD 2019 in Dortmund (Germany); FSCD 2020 in Paris (France) co-located with IJCAR 2020; FSCD 2021 in Buenos Aires (Argentina); FSCD 2022 in Haifa (Israel) as part of FLOC2022; FSCD 2023 in Rome (Italy). The deadline for proposals is *** 27th June 2022 ***. Proposals should be sent to the FSCD Steering Committee Chair (see contact information below). We encourage proposers to register their intention informally as soon as possible. Selected proposals are to be presented at the business meeting of FSCD 2022 taking place at Haifa in August 2022. The final decision about hosting and organising of FSCD 2024 will be taken by the SC after an advisory vote of the members of the community in attendance at the business meeting. Proposals should address the following points: * FSCD Conference Chair (complete name and current position), host institution, FSCD Local Committee (complete names and current positions), availability of student-volunteers. * National, regional, and local government and industry support, both organizational and financial. * Accessibility to the location (i.e., transportation) and attractiveness of the proposed site. Accessibility can include both information about local transportation and travel information to the location (flight and/or train connections), as well as estimated costs. * Appropriateness of the proposed dates (including consideration of holidays/other events during the period), hotel prices, and access to dormitory facilities for students. * Estimated costs on registration for the conference and workshops, both for regular and student participants. * Conference and exhibit facilities for the anticipated number of registrants (typically around 200). For example: = number, capacity and audiovisual equipment of meeting rooms; = a large plenary session room that can hold all the registrants; = enough rooms for parallel session workshops/tutorials in the two days before and the two days after the main conference; = internet connectivity and workstations for demos/competitions; = catering services; = presence of professional staff. * Support for hybrid attendance to the conference. * Residence accommodations and food services in a range of price categories and close to the conference venue, for example, number and cost range of hotels, and availability and cost of dormitory rooms (e.g., at local universities) and kind of services they offer. * Other relevant information, which can include information about leisure activities and attractiveness of the location (e.g., cultural and historical aspects, touristic activities, etc...). Contact information: Herman Geuvers herman(a)cs.ru.nl FSCD SC Chair

2 Jahre, 3 Monate

1
0
0 0

How to fix existing TPDB benchmarks

von YAMADA, Akihisa

Dear all, while ago, SC discussed on how to fix TPDB benchmarks. We should maintain consistency with past competition results, so we agree on the following rule: If changes should be made on benchmarks that has been used in a past competition, please follow the procedure: - Rename the benchmark following the rule: file.ext -> file_REV2.ext -> file_REV3.ext -> ... - Make sure the old file is removed. - Then make pull request. Best, Akihisa

2 Jahre, 4 Monate

1
0
0 0