Dear friends and colleagues,
a final call for registering as a participant at the workshop
Theorem Proving and Machine Learning in the age of LLMs: SoA and Future
Perspectives <https://europroofnet.github.io/wg5-edinburgh25/>
that will take place in Edinburgh, 7-9 April 2023.
We have a strong program
<https://easychair.org/smart-program/EuroProofNet-WG5/index.html>, so join
us and have fun!
Please just note that all (even local) participants are required to
register no later than the 12th of March: due to the high number of
participants we had to resort to a more formal organisation strategy.
Looking forward to seeing you at the workshop,
Ekaterina, Kathrin, Michael, Elizabeth, Christian
(Apologies for multiple postings)
NEW! Due to popular demand, we are continuing to accept full papers
(not just modifications) until the May 1 deadline!
----------------------------------------------------------------------
Final Call for Papers - Extended deadlines
Paper submission May 1, Artifacts May 6
SAS 2023
The 30th Static Analysis Symposium
Cascais (Lisbon), Portugal, Sun 22 - Tue 24, October 2023
https://2023.splashcon.org/home/sas-2023
----------------------------------------------------------------------
The 30th Static Analysis Symposium, SAS 2023, will be co-located with
SPLASH 2023 in Cascais (Lisbon), Portugal.
Static Analysis is widely recognized as a fundamental tool for program
verification, bug detection, compiler optimization, program
understanding, and software maintenance. The series of Static Analysis
Symposia has served as the primary venue for the presentation of
theoretical, practical, and application advances in the area.
IMPORTANT DATES
All deadlines are AoE (Anywhere on Earth)
**NEW**
- Full paper submission: (Extended) May 1, 2023
- Artifact submission: (Extended) May 6, 2023
- Author response period: June 11-14, 2023
- Notification: June 29, 2023
- Final version due: August 3, 2023
- Conference: Part of SPLASH, Oct 22-24, 2023
TOPICS
The technical program for SAS 2023 will consist of invited lectures
and presentations of refereed papers. Contributions are welcomed on
all aspects of static analysis, including, but not limited to:
- Abstract interpretation
- Automated deduction
- Data flow analysis
- Debugging techniques
- Deductive methods
- Emerging applications
- Model-checking
- Data science
- Program optimizations and transformations
- Program synthesis
- Program verification
- Machine learning and verification
- Security analysis
- Tool environments and architectures
- Theoretical frameworks
- Type checking
- Distributed or networked systems
PAPER SUBMISSION
All paper submissions will be judged on the basis of significance,
relevance, correctness, originality, and clarity.
Submission link: https://easychair.org/conferences/?conf=sas2023
We welcome regular papers as well as papers focusing on any of the
following in the NEAT (New questions/areas, Experience, Announcement,
Tool) category:
- Well-motivated discussion of new questions or new areas.
- Experience with static analysis tools, Industrial Reports, and Case
Studies
- Brief announcements of work in progress
- Tool papers
We do not impose a page limit for submitted papers but we encourage
brevity as reviewers have a limited time that they can spend on each
paper. With the exception of experience papers, all other papers will
follow a lightweight double-blind reviewing process. The identity of
the authors for the remaining papers will be known to the reviewers.
Submissions can address any programming paradigm, including
concurrent, constraint, functional, imperative, logic,
object-oriented, aspect, multi-core, distributed, and GPU programming.
Papers must be written and presented in English. A submitted paper
must describe original work and must not substantially overlap with
papers that have been published or that are simultaneously submitted
to a journal or a conference with refereed proceedings.
All submitted papers will be judged on the basis of significance,
relevance, correctness, originality, and clarity. The review process
will include a rebuttal period where authors have the opportunity to
respond to preliminary reviews on the paper.
RADHIA COUSOT AWARD
The program committee will select an accepted regular paper for the
Radhia Cousot Young Researcher Best Paper Award in memory of Radhia
Cousot and her fundamental contributions to static analysis, as well
as being one of the main promoters and organizers of the SAS series of
conferences.
ARTIFACTS
As in previous years, we encourage authors to submit a virtual machine
image containing any artifacts and evaluations presented in the
paper. Artifact submission is optional. Artifact evaluation will be
concurrent with paper review.
PROGRAM COMMITTEE
Gogul Balakrishnan, Google, United States
Liqian Chen, National University of Defense Technology, China
Yu-Fang Chen, Academia Sinica, Taiwan
Patrick Cousot, United States
Michael Emmi, Amazon Web Services, United States
Pietro Ferrara, Università Ca' Foscari, Venezia, Italy
Roberto Giacobazzi, University of Verona, Italy
Roberta Gori, University of Pisa, Italy
Manuel Hermenegildo, U. Pol. de Madrid and IMDEA SW., Spain (Co-Chair)
Francesco Logozzo, Facebook, United States
Isabella Mastroeni, University of Verona, Italy
Antoine Miné, Sorbonne Université, France
José Morales, IMDEA Software Institute, Spain (Co-Chair)
Kedar Namjoshi, Nokia Bell Labs, United States
Jorge A. Navas, Certora, inc., United States
Martin C. Rinard, Massachusetts Institute of Technology, United States
Daniel Schoepe, Amazon, United Kingdom
Helmut Seidl, Technische Universität München, Germany
Mihaela Sighireanu, IRIF, Université Paris Diderot, France
Gagandeep Singh, U. of Illinois at Urbana-Champaign, United States
Yulei Sui, University of New South Wales, Sydney, Australia
Laura Titolo, Laura Titolo, NIA/NASA LaRC, United States
Jingling Xue, UNSW Sydney, Australia
Xin Zhang, Peking University, China
Artifact Evaluation Committee Chair: Marc Chevalier, Snyk, Switzerland
Publicity Chair: Louis Rustenholz, UPM and IMDEA SW, Spain
Hi,
Logtalk 3.65.0 is now available for downloading at:
https://logtalk.org/
This release documents the no longer experimental "(@)/1" control construct; adds a new "since" key to the "info/2" directive; adds two new values for the number of proofs to the "mode/2" directive; improves the Handbook sections on debugging and documenting predicates; reduces the number of atoms created by some tools and libraries; fixes the "git" library when working with paths containing spaces; includes significant fixes and improvements to the "debugger" and "lgtunit" tools; improves tests reporting; includes fixes for the Java examples and testing automation on Windows; adds notes for most of the skipped tests; includes new and revised tests; and provides portability updates for LVM, Scryer Prolog, and, Trealla Prolog.
For details and a complete list of changes, please consult the release notes at:
https://github.com/LogtalkDotOrg/logtalk3/blob/master/RELEASE_NOTES.md
You can show your support for Logtalk continued development and success at GitHub by giving us a star and a symbolic sponsorship:
https://github.com/LogtalkDotOrg/logtalk3
Happy logtalking!
Paulo
-----------------------------------------------------------------
Paulo Moura
Logtalk developer
(Apologies for multiple postings)
NEW! Are you running late in preparing your SAS paper? No worries!
Submit what you have (e.g., title and abstract) and you will have
one extra week until May 1 for updating your paper (and May 6 for
your artifact).
----------------------------------------------------------------------
Final Call for Papers - Extended deadlines
Paper submission April 24, Paper update May 1, Artifacts May 6
SAS 2023
The 30th Static Analysis Symposium
Cascais (Lisbon), Portugal, Sun 22 - Tue 24, October 2023
https://2023.splashcon.org/home/sas-2023
----------------------------------------------------------------------
The 30th Static Analysis Symposium, SAS 2023, will be co-located with
SPLASH 2023 in Cascais (Lisbon), Portugal.
Static Analysis is widely recognized as a fundamental tool for program
verification, bug detection, compiler optimization, program
understanding, and software maintenance. The series of Static Analysis
Symposia has served as the primary venue for the presentation of
theoretical, practical, and application advances in the area.
IMPORTANT DATES
All deadlines are AoE (Anywhere on Earth)
**NEW**
- Paper submission (title and abstract): April 24, 2023
- Paper update deadline: (Extended) May 1, 2023
- Artifact submission: (Extended) May 6, 2023
- Author response period: June 11-14, 2023
- Notification: June 29, 2023
- Final version due: August 3, 2023
- Conference: Part of SPLASH, Oct 22-24, 2023
TOPICS
The technical program for SAS 2023 will consist of invited lectures
and presentations of refereed papers. Contributions are welcomed on
all aspects of static analysis, including, but not limited to:
- Abstract interpretation
- Automated deduction
- Data flow analysis
- Debugging techniques
- Deductive methods
- Emerging applications
- Model-checking
- Data science
- Program optimizations and transformations
- Program synthesis
- Program verification
- Machine learning and verification
- Security analysis
- Tool environments and architectures
- Theoretical frameworks
- Type checking
- Distributed or networked systems
PAPER SUBMISSION
All paper submissions will be judged on the basis of significance,
relevance, correctness, originality, and clarity.
Submission link: https://easychair.org/conferences/?conf=sas2023
We welcome regular papers as well as papers focusing on any of the
following in the NEAT (New questions/areas, Experience, Announcement,
Tool) category:
- Well-motivated discussion of new questions or new areas.
- Experience with static analysis tools, Industrial Reports, and Case
Studies
- Brief announcements of work in progress
- Tool papers
We do not impose a page limit for submitted papers but we encourage
brevity as reviewers have a limited time that they can spend on each
paper. With the exception of experience papers, all other papers will
follow a lightweight double-blind reviewing process. The identity of
the authors for the remaining papers will be known to the reviewers.
Submissions can address any programming paradigm, including
concurrent, constraint, functional, imperative, logic,
object-oriented, aspect, multi-core, distributed, and GPU programming.
Papers must be written and presented in English. A submitted paper
must describe original work and must not substantially overlap with
papers that have been published or that are simultaneously submitted
to a journal or a conference with refereed proceedings.
All submitted papers will be judged on the basis of significance,
relevance, correctness, originality, and clarity. The review process
will include a rebuttal period where authors have the opportunity to
respond to preliminary reviews on the paper.
RADHIA COUSOT AWARD
The program committee will select an accepted regular paper for the
Radhia Cousot Young Researcher Best Paper Award in memory of Radhia
Cousot and her fundamental contributions to static analysis, as well
as being one of the main promoters and organizers of the SAS series of
conferences.
ARTIFACTS
As in previous years, we encourage authors to submit a virtual machine
image containing any artifacts and evaluations presented in the
paper. Artifact submission is optional. Artifact evaluation will be
concurrent with paper review.
PROGRAM COMMITTEE
Gogul Balakrishnan, Google, United States
Liqian Chen, National University of Defense Technology, China
Yu-Fang Chen, Academia Sinica, Taiwan
Patrick Cousot, United States
Michael Emmi, Amazon Web Services, United States
Pietro Ferrara, Università Ca' Foscari, Venezia, Italy
Roberto Giacobazzi, University of Verona, Italy
Roberta Gori, University of Pisa, Italy
Manuel Hermenegildo, U. Pol. de Madrid and IMDEA SW., Spain (Co-Chair)
Francesco Logozzo, Facebook, United States
Isabella Mastroeni, University of Verona, Italy
Antoine Miné, Sorbonne Université, France
José Morales, IMDEA Software Institute, Spain (Co-Chair)
Kedar Namjoshi, Nokia Bell Labs, United States
Jorge A. Navas, Certora, inc., United States
Martin C. Rinard, Massachusetts Institute of Technology, United States
Daniel Schoepe, Amazon, United Kingdom
Helmut Seidl, Technische Universität München, Germany
Mihaela Sighireanu, IRIF, Université Paris Diderot, France
Gagandeep Singh, U. of Illinois at Urbana-Champaign, United States
Yulei Sui, University of New South Wales, Sydney, Australia
Laura Titolo, Laura Titolo, NIA/NASA LaRC, United States
Jingling Xue, UNSW Sydney, Australia
Xin Zhang, Peking University, China
Artifact Evaluation Committee Chair: Marc Chevalier, Snyk, Switzerland
Publicity Chair: Louis Rustenholz, UPM and IMDEA SW, Spain
(Apologies for multiple postings)
----------------------------------------------------------------------
Final Call for Papers - Paper Deadline: April 24, 2023
SAS 2023
The 30th Static Analysis Symposium
Cascais (Lisbon), Portugal, Sun 22 - Tue 24, October 2023
https://2023.splashcon.org/home/sas-2023
----------------------------------------------------------------------
The 30th Static Analysis Symposium, SAS 2023, will be co-located with
SPLASH 2023 in Cascais (Lisbon), Portugal.
Static Analysis is widely recognized as a fundamental tool for program
verification, bug detection, compiler optimization, program
understanding, and software maintenance. The series of Static Analysis
Symposia has served as the primary venue for the presentation of
theoretical, practical, and application advances in the area.
IMPORTANT DATES
All deadlines are AoE (Anywhere on Earth)
- Full paper submission: April 24, 2023
- Artifact submission: April 29, 2023
- Author response period: June 11-14, 2023
- Notification: June 29, 2023
- Final version due: August 3, 2023
- Conference: Part of SPLASH, Oct 22-24, 2023
TOPICS
The technical program for SAS 2023 will consist of invited lectures
and presentations of refereed papers. Contributions are welcomed on
all aspects of static analysis, including, but not limited to:
- Abstract interpretation
- Automated deduction
- Data flow analysis
- Debugging techniques
- Deductive methods
- Emerging applications
- Model-checking
- Data science
- Program optimizations and transformations
- Program synthesis
- Program verification
- Machine learning and verification
- Security analysis
- Tool environments and architectures
- Theoretical frameworks
- Type checking
- Distributed or networked systems
PAPER SUBMISSION
All paper submissions will be judged on the basis of significance,
relevance, correctness, originality, and clarity.
Submission link: https://easychair.org/conferences/?conf=sas2023
We welcome regular papers as well as papers focusing on any of the
following in the NEAT (New questions/areas, Experience, Announcement,
Tool) category:
- Well-motivated discussion of new questions or new areas.
- Experience with static analysis tools, Industrial Reports, and Case
Studies
- Brief announcements of work in progress
- Tool papers
We do not impose a page limit for submitted papers but we encourage
brevity as reviewers have a limited time that they can spend on each
paper. With the exception of experience papers, all other papers will
follow a lightweight double-blind reviewing process. The identity of
the authors for the remaining papers will be known to the reviewers.
Submissions can address any programming paradigm, including
concurrent, constraint, functional, imperative, logic,
object-oriented, aspect, multi-core, distributed, and GPU programming.
Papers must be written and presented in English. A submitted paper
must describe original work and must not substantially overlap with
papers that have been published or that are simultaneously submitted
to a journal or a conference with refereed proceedings.
All submitted papers will be judged on the basis of significance,
relevance, correctness, originality, and clarity. The review process
will include a rebuttal period where authors have the opportunity to
respond to preliminary reviews on the paper.
RADHIA COUSOT AWARD
The program committee will select an accepted regular paper for the
Radhia Cousot Young Researcher Best Paper Award in memory of Radhia
Cousot and her fundamental contributions to static analysis, as well
as being one of the main promoters and organizers of the SAS series of
conferences.
ARTIFACTS
As in previous years, we encourage authors to submit a virtual machine
image containing any artifacts and evaluations presented in the
paper. Artifact submission is optional. Artifact evaluation will be
concurrent with paper review.
PROGRAM COMMITTEE
Gogul Balakrishnan, Google, United States
Liqian Chen, National University of Defense Technology, China
Yu-Fang Chen, Academia Sinica, Taiwan
Patrick Cousot, United States
Michael Emmi, Amazon Web Services, United States
Pietro Ferrara, Università Ca' Foscari, Venezia, Italy
Roberto Giacobazzi, University of Verona, Italy
Roberta Gori, University of Pisa, Italy
Manuel Hermenegildo, U. Pol. de Madrid and IMDEA SW., Spain (Co-Chair)
Francesco Logozzo, Facebook, United States
Isabella Mastroeni, University of Verona, Italy
Antoine Miné, Sorbonne Université, France
José Morales, IMDEA Software Institute, Spain (Co-Chair)
Kedar Namjoshi, Nokia Bell Labs, United States
Jorge A. Navas, Certora, inc., United States
Martin C. Rinard, Massachusetts Institute of Technology, United States
Daniel Schoepe, Amazon, United Kingdom
Helmut Seidl, Technische Universität München, Germany
Mihaela Sighireanu, IRIF, Université Paris Diderot, France
Gagandeep Singh, U. of Illinois at Urbana-Champaign, United States
Yulei Sui, University of New South Wales, Sydney, Australia
Laura Titolo, Laura Titolo, NIA/NASA LaRC, United States
Jingling Xue, UNSW Sydney, Australia
Xin Zhang, Peking University, China
Artifact Evaluation Committee Chair: Marc Chevalier, Snyk, Switzerland
Publicity Chair: Louis Rustenholz, UPM and IMDEA SW, Spain
** Apologies for my previous posting about LOPSTR (please ignore)**
----------------------------------------------------------------
33rd International Symposium on Logic-based Program Synthesis and
Transformation (LOPSTR 2023)
Co-located with PPDP 2023 as part of SPLASH 2023
October 23-24, 2023 - Cascais, Lisbon, Portugal
https://lopstr.github.io/2023/
----------------------------------------------------------------
Important dates:
- Abstract submission: May 19, 2023 (AoE)
- Paper submission: May 26, 2023 (AoE)
- Author notification: July 24, 2023 (AoE)
- Camera-ready: August 18, 2023
- Symposium: October 23-24, 2023
OVERVIEW
The aim of the LOPSTR series is to stimulate and promote international
research and collaboration on logic-based program development. LOPSTR
is open to contributions in logic-based program development in any
language paradigm. LOPSTR has a reputation for being a lively,
friendly forum for presenting and discussing work in progress.
LOPSTR 2023 will be held in-person at Hotel Cascais Miragem in
Cascais, Lisbon, Portugal and will be co-located with PPDP 2023 as
part of SPLASH 2023. At least one of the authors of the accepted paper
is expected to attend the conference and present the paper. Information
about venue and travel is available on the SPLASH 2023 website.
Topics of interest cover all aspects of logic-based program
development, all stages of the software life cycle, and issues of both
programming-in-the-small and programming-in-the-large, including, but
not limited to:
- synthesis
- transformation
- specialization
- inversion
- composition
- optimisation
- specification
- analysis and verification
- testing and certification
- program and model manipulation
- AI-methods for program development
- verification and testing of AI-based systems
- transformational techniques in software engineering
- logic-based methods for security, cyber-physical and distributed
system
- applications, tools and industrial practice
Survey papers that present some aspects of the above topics from a new
perspective and papers that describe experience with industrial
applications and case studies are also welcome.
PAPER SUBMISSION
Submissions can be made in two categories:
- Regular Papers (15 pages max.)
- Short Papers (8 pages max.)
References do NOT count towards the page limit. Additional pages may
be used for appendices not intended for publication. Reviewers are not
required to read the appendices, and thus papers should be
intelligible without them. All submissions must be written in English.
Submissions must not substantially overlap with papers/tools that have
been published or that are simultaneously submitted to a journal,
conference, or workshop with refereed proceedings.
Submissions of Regular Papers must describe the original work. Work
that already appeared in unpublished or informally published workshop
proceedings may be submitted (please contact the PC chair in case of
questions).
Submissions of Short Papers may include presentations of exciting if
not fully polished research and tool demonstrations that are of
academic and industrial interest. Tool demonstrations should describe
the relevant system, usability, and implementation aspects of a tool.
All accepted papers will be included in the conference proceedings and
published by Springer as a Lecture Notes in Computer Science (LNCS)
volume.
After the symposium, a selection of a few best papers will be invited
for submission to rapid publication in the Journal of Theory and
Practice of Logic Programming (TPLP). Authors of selected papers will
be invited to revise and/or extend their submissions to be considered
for publication. The papers submitted to TPLP will be subject to the
standard reviewing process of the journal.
SUBMISSION GUIDELINES
Authors should submit an electronic copy of the paper (written in
English) in PDF, formatted in the Lecture Notes in Computer Science
style. Each submission must include on its first page the paper title;
authors and their affiliations; contact author's email; abstract; and
three to four keywords which will be used to assist the PC in
selecting appropriate reviewers for the paper. Authors should consult
Springer's authors' instructions at the author's page, and use their
proceedings templates, either for LaTeX (available also in overleaf)
or for Word, for the preparation of their papers. Springer encourages
authors to include their ORCIDs in their papers. In addition, upon
acceptance, the corresponding author of each paper, acting on behalf
of all of the authors of that paper, must complete and sign a
Consent-to-Publish form. The corresponding author signing the
copyright form should match the corresponding author marked on the
paper. Once the files have been sent to Springer, changes relating to
the authorship of the papers cannot be made.
Page numbers (and, if possible, line numbers) should appear on the
manuscript to help the reviewers in writing their report. So, for
LaTeX, we recommend that authors use:
\pagestyle{plain}
\usepackage{lineno}
\linenumbers
Papers should be submitted via EasyChair:
https://easychair.org/conferences/?conf=lopstr2023
BEST PAPER AWARD
Thanks to Springer's sponsorship, two best paper awards (one for each
submission category), with a 500 EUR prize, will be given at LOPSTR
2023. The program committee will select the winning papers based on
relevance, originality and technical quality but may also take
authorship into account (e.g. a student paper).
PROGRAM CHAIRS
Robert Glück, University of Copenhagen, Denmark
Bishoksan Kafle, IMDEA Software Institute, Spain
PUBLICITY CHAIR
Daniel Jurjo Rivas, IMDEA Software Institute, Spain
PROGRAM COMMITTEE MEMBERS
Slim Abdennadher, German International University, Egypt
José Júlio Alferes, Universidade Nova de Lisboa, Portugal
Roberto Amadini, University of Bologna, Italy
William Byrd, University of Alabama at Birmingham, USA
Michael Codish, Ben-Gurion University of the Negev, Israel
Gregory Duck, National University of Singapore, Singapore
Isabel García-Contreras, University of Waterloo, Canada
Ashutosh Gupta, IIT Bombay, India
Gopal Gupta, The University of Texas at Dallas, USA
Michael Hanus, University of Kiel, Germany
Temesghen Kahsai, Amazon, USA
Maja Hanne Kirkeby, Roskilde University, Denmark
Michael Leuschel, Heinrich Heine University Düsseldorf, Germany
Nai-Wei Lin, National Chung Cheng University, Taiwan
Fred Mesnard, University of Reunion, France
José F. Morales, IMDEA Software Institute, Spain
Carlos Olarte, Universitè Sorbonne Paris Nord, France
Alberto Pettorossi, Università di Roma Tor Vergata, Italy
Christoph Reichenbach, Lund University, Sweden
Peter Schachte, The University of Melbourne, Australia
Helge Spieker, Simula Research Laboratory, Norway
Theresa Swift, Universidade Nova de Lisboa, Portugal
Laura Titolo, National Institute of Aerospace, USA
Kazunori Ueda, Waseda University, Japan
Germán Vidal, Universitat Politècnica de València, Spain
Nisansala Yatapanage, Australian National University, Australia
Florian Zuleger, Vienna University of Technology, Austria
HISTORY
LOPSTR is a renowned symposium that has been held for more than 30
years. The first meeting was held in Manchester, UK in
1991. Information about previous symposia:
http://lopstr.webs.upv.es/. You might have a look at the contents of
past LOPSTR symposia at DBLP
(https://dblp.uni-trier.de/db/conf/lopstr/index.html) and past LNCS
proceedings at Springer (https://link.springer.com/conference/lopstr).
--
Self-knowing is not achieved by the fastest unconscious runner, but by
those who just keep running consciously.
--------------------------------------------------------------------------------
SAS 2023
30th Static Analysis Symposium
Cascais (Lisbon), Portugal, Sun 22 - Tue 24, October 2023
https://2023.splashcon.org/home/sas-2023
--------------------------------------------------------------------------------
The 30th Static Analysis Symposium, SAS 2023, will be co-located with
SPLASH 2023 in Cascais (Lisbon), Portugal.
Static Analysis is widely recognized as a fundamental tool for program
verification, bug detection, compiler optimization, program understanding, and
software maintenance. The series of Static Analysis Symposia has served as the
primary venue for the presentation of theoretical, practical, and application
advances in the area.
IMPORTANT DATES
All deadlines are AoE (Anywhere on Earth)
- Full paper submission: April 24, 2023
- Artifact submission: April 29, 2023
- Author response period: June 11-14, 2023
- Notification: June 29, 2023
- Final version due: August 3, 2023
- Conference: Part of SPLASH, Oct 22-24, 2023
TOPICS
The technical program for SAS 2023 will consist of invited lectures
and presentations of refereed papers. Contributions are welcomed on
all aspects of static analysis, including, but not limited to:
Abstract interpretation
Automated deduction
Data flow analysis
Debugging techniques
Deductive methods
Emerging applications
Model-checking
Data science
Program optimizations and transformations
Program synthesis
Program verification
Machine learning and verification
Security analysis
Tool environments and architectures
Theoretical frameworks
Type checking
Distributed or networked systems
PAPER SUBMISSION
All paper submissions will be judged on the basis of significance, relevance,
correctness, originality, and clarity.
Submission link: https://easychair.org/conferences/?conf=sas2023
We welcome regular papers as well as papers focusing on any of the
following in the NEAT (New questions/areas, Experience, Announcement,
Tool) category:
- Well-motivated discussion of new questions or new areas.
- Experience with static analysis tools, Industrial Reports, and Case Studies
- Brief announcements of work in progress
- Tool papers
We do not impose a page limit for submitted papers but we encourage
brevity as reviewers have a limited time that they can spend on each
paper. With the exception of experience papers, all other papers will
follow a lightweight double-blind reviewing process. The identity of
the authors for the remaining papers will be known to the reviewers.
Submissions can address any programming paradigm, including
concurrent, constraint, functional, imperative, logic,
object-oriented, aspect, multi-core, distributed, and GPU
programming.
Papers must be written and presented in English. A submitted paper
must describe original work and must not substantially overlap with
papers that have been published or that are simultaneously submitted
to a journal or a conference with refereed proceedings.
All submitted papers will be judged on the basis of significance,
relevance, correctness, originality, and clarity. The review process
will include a rebuttal period where authors have the opportunity to
respond to preliminary reviews on the paper.
RADHIA COUSOT AWARD
The program committee will select an accepted regular paper for the Radhia
Cousot Young Researcher Best Paper Award in memory of Radhia Cousot and her
fundamental contributions to static analysis, as well as being one of the main
promoters and organizers of the SAS series of conferences.
ARTIFACTS
As in previous years, we encourage authors to submit a virtual machine image
containing any artifacts and evaluations presented in the paper. Artifact
submission is optional. Artifact evaluation will be concurrent with paper
review.
[Apologies for multiple cross postings]
*** Call for Nominations ***
The 2023 Alain Colmerauer Prize
-------------------------------
Organized by the Association for Logic Programming<https://nam02.safelinks.protection.outlook.com/?url=http%3A%2F%2Fwww.logicp…>
In the summer of 1972, Alain Colmerauer and his team in Marseille developed and implemented the first version of the logic programming language Prolog. Together with both earlier and later collaborations with Robert Kowalski and his colleagues in Edinburgh, this work laid the practical and theoretical foundations for the Prolog and logic programming of today. Prolog and its related technologies soon became key tools of symbolic programming and Artificial Intelligence.
2022 was celebrated as the Year of Prolog<https://nam02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fprologyea…> to recognize the 50th anniversary of these events and highlight the continuing significance of Prolog and Logic Programming both for symbolic, explainable AI, and for computing more generally. The celebration culminated with the award of the inaugural edition of the ALP Alain Colmerauer Prolog Heritage Prize (in short: the Alain Colmerauer Prize) for recent practical accomplishments that highlight the benefits of Prolog-inspired computing for the future. The Alain Colmerauer Prize and the Year of Prolog were organized by the Association for Logic Programming (ALP) and the Prolog Heritage Association (PHA). Details of the 2022 Alain Colmerauer Prize can be found at https://prologyear.logicprogramming.org/ColmerauerPrize.html.
The 2023 Award
--------------
The Alain Colmerauer Prize will continue to be awarded in 2023 and beyond. Nominations are sought for the 2023 edition of the Alain Colmerauer Prize.
Eligibility
-----------
Any individual or group of individuals can nominate themselves or their institution(s)/organization(s) for the Prize. Nominations should describe work that meets the purpose of the Prize. Submissions that address the well-being of society or of the planet are especially welcome.
Submissions
-----------
Nominations should explain the contribution and argue for its present and future significance. The submissions must not exceed three pages plus references and may optionally be accompanied by up to two letters of support no longer than 500 words each. Submissions should be made by the candidates themselves, in pdf, through EasyChair<https://nam02.safelinks.protection.outlook.com/?url=https%3A%2F%2Feasychair…> at https://easychair.org/conferences/?conf=acprize2023<https://nam02.safelinks.protection.outlook.com/?url=https%3A%2F%2Feasychair…>.
Selection and award
-------------------
The Prize is given for depth, novelty, and proven or potential impact. The winner is selected by the Jury from the submitted nominations in consultation with the Year of Prolog Scientific Committee. Furthermore, a shortlist of up to five finalists may also be selected in the process. The Jury will provide a detailed citation that explains the basis of the awarding of the Prize.
The winner receives a certificate and cash support of up to 2,000 Euros for attending the conference and award ceremony. If there are multiple winners, this amount is shared. Finalists also receive certificates.
Timeline for the 2023 award
---------------------------
*******Deadline for submissions*******
May 15, 2023.
*******Notification of the shortlisted candidates*******
June 4, 2023.
Award and presentation of the 2023 Prize
-----------------------------------------
The winner of the 2023 Prize will be announced at the 39th International Conference on Logic Programming (ICLP 2023)<https://nam02.safelinks.protection.outlook.com/?url=https%3A%2F%2Ficlp2023.…>.
The 2023 AC Prize Jury
-------------
Maria Garcia de la Banda, Gopal Gupta (chair), Manuel Hermenegildo, Y. Annie Liu, and Marie-Christine Rousset
For more information and details, click here<https://nam02.safelinks.protection.outlook.com/?url=https%3A%2F%2Flogicprog…>.
--
You received this message because you are subscribed to the Google Groups "SICStus Users" group.
To unsubscribe from this group and stop receiving emails from it, send an email to sicstus-users+unsubscribe(a)googlegroups.com<mailto:sicstus-users+unsubscribe(a)googlegroups.com>.
To view this discussion on the web visit https://groups.google.com/d/msgid/sicstus-users/BL1PR01MB7652D695ADB9A9F191…<https://nam02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fgroups.go…>.
10th Workshop on Horn Clauses for Verification and Synthesis (HCVS)
Co-located with ETAPS 2023
23rd April 2023 - Paris, France
https://www.sci.unich.it/hcvs23/
Important dates:
- Paper submission deadline: Mar 8, 2023 (EXTENDED)
- Paper notification: Mar 22, 2023
- Workshop: Apr 23, 2023
Many Program Verification and Synthesis problems of interest can be
modeled directly using Horn clauses and many recent advances in the
CLP and CAV communities have centered around efficiently solving
problems presented as Horn clauses.
This series of workshops aims to bring together researchers working in
the two communities of Constraint/Logic Programming (e.g., ICLP and
CP), Program Verification (e.g., CAV, TACAS, and VMCAI), and Automated
Deduction (e.g., CADE, IJCAR), on the topic of Horn clause based
analysis, verification, and synthesis.
Horn clauses for verification and synthesis have been advocated by
these communities in different times and from different perspectives
and HCVS is organized to stimulate interaction and a fruitful exchange
and integration of experiences.
The workshop follows previous meetings: HCVS 2022 in Munich, Germany
(ETAPS 2022), HCVS 2021, online (ETAPS 2021), HCVS 2020, online (ETAPS
2020), HCVS 2019 in Prague, Czech Republic (ETAPS 2019), HCVS 2018 in
Oxford, UK (CAV, ICLP and IJCAR at FLoC 2018), HCVS 2017 in
Gothenburg, Sweden (CADE 2017), HCVS 2016 in Eindhoven, The
Netherlands (ETAPS 2016), HCVS 2015 in San Francisco, CA, USA (CAV
2015), and HCVS 2014 in Vienna, Austria (VSL).
Topics of interest include, but are not limited to the use of Horn
clauses, constraints, and related formalisms in the following areas:
- Analysis and verification of programs and systems of various kinds
(e.g., imperative, object-oriented, functional, logic, higher-order,
concurrent, transition systems, petri-nets, smart contracts)
- Program synthesis
- Program testing
- Program transformation
- Constraint solving
- Type systems
- Machine learning and automated reasoning
- CHC encoding of analysis and verification problems
- Resource analysis
- Case studies and tools
- Challenging problems
We solicit regular papers describing theory and implementation of
Horn-clause based analysis and tool descriptions. We also solicit
extended abstracts describing work-in-progress, as well as
presentations covering previously published results, extended
abstracts of doctoral theses, and overviews of research projects that
are of interest to the workshop.
At least one author of each accepted paper will be required to attend
the workshop to present the contribution.
CHC Competition:
HCVS 2023 will host the 6th competition on constraint Horn clauses
(CHC-COMP https://chc-comp.github.io/ ), which will compare
state-of-the-art tools for CHC solving for performance and
effectiveness on a set of publicly available benchmarks. A report on
CHC-COMP will be part of the workshop's proceedings. The report also
contains tool descriptions of the participating solvers.
Program Chairs:
David Monniaux, VERIMAG, CNRS, Grenoble, France
José F. Morales, IMDEA Software, Madrid, Spain
Program Committee:
Nikolaj Bjørner, Microsoft, USA
Evelyne Contejean, LRI, CNRS, Univ Paris-Sud, France
Stefania Dumbrava, ENSIIE Paris-Evry, France
Fabio Fioravanti, University of Chieti-Pescara, Italy
Pierre-Loic Garoche, ENAC, France
Dejan Jovanović, Amazon Web Services, USA
Ekaterina Komendantskaya, Heriot-Watt University, UK
Jorge A. Navas, Certora, USA
Philipp Rüemmer, Uppsala University, Sweden
Hiroshi Unno, University of Tsukuba, Japan
Submission has to be done in one of the following formats:
- Regular papers (up to 12 pages plus bibliography in EPTCS
(http://www.eptcs.org/) format), which should present previously
unpublished work (completed or in progress), including descriptions
of research, tools, and applications.
- Tool papers (up to 4 pages in EPTCS format), including the papers
written by the CHC-COMP participants, which can outline the
theoretical framework, the architecture, the usage, and experiments
of the tool.
- Extended abstracts (up to 3 pages in EPTCS format), which describe
work in progress or aim to initiate discussions.
- **Presentation-only papers**, i.e., papers already submitted or
presented at a conference or another workshop. Such papers can be
submitted in any format, and will not be included in the workshop
post-proceedings.
- Posters that are of interest to the workshop
All submitted papers will be refereed by the program committee and
will be selected for inclusion in accordance with the referee
reports. Accepted regular papers and extended abstracts will be
published electronically as a volume in the Electronic Proceedings in
Theoretical Computer Science (EPTCS) series, see http://www.eptcs.org/
(provided that enough regular papers are accepted). The publication
of a paper is not intended to preclude later publication. Full
versions of extended abstracts published in EPTCS, or substantial
revisions, may later be published elsewhere.
Papers must be submitted through the EasyChair system using the web
page: https://easychair.org/conferences/?conf=hcvs2023
10th Workshop on Horn Clauses for Verification and Synthesis (HCVS)
Co-located with ETAPS 2023
23rd April 2023 - Paris, France
https://www.sci.unich.it/hcvs23/
Important dates:
- Paper submission deadline: Feb 22, 2023
- Paper notification: Mar 22, 2023
- Workshop: Apr 23, 2023
Many Program Verification and Synthesis problems of interest can be
modeled directly using Horn clauses and many recent advances in the
CLP and CAV communities have centered around efficiently solving
problems presented as Horn clauses.
This series of workshops aims to bring together researchers working in
the two communities of Constraint/Logic Programming (e.g., ICLP and
CP), Program Verification (e.g., CAV, TACAS, and VMCAI), and Automated
Deduction (e.g., CADE, IJCAR), on the topic of Horn clause based
analysis, verification, and synthesis.
Horn clauses for verification and synthesis have been advocated by
these communities in different times and from different perspectives
and HCVS is organized to stimulate interaction and a fruitful exchange
and integration of experiences.
The workshop follows previous meetings: HCVS 2022 in Munich, Germany
(ETAPS 2022), HCVS 2021, online (ETAPS 2021), HCVS 2020, online (ETAPS
2020), HCVS 2019 in Prague, Czech Republic (ETAPS 2019), HCVS 2018 in
Oxford, UK (CAV, ICLP and IJCAR at FLoC 2018), HCVS 2017 in
Gothenburg, Sweden (CADE 2017), HCVS 2016 in Eindhoven, The
Netherlands (ETAPS 2016), HCVS 2015 in San Francisco, CA, USA (CAV
2015), and HCVS 2014 in Vienna, Austria (VSL).
Topics of interest include, but are not limited to the use of Horn
clauses, constraints, and related formalisms in the following areas:
- Analysis and verification of programs and systems of various kinds
(e.g., imperative, object-oriented, functional, logic, higher-order,
concurrent, transition systems, petri-nets, smart contracts)
- Program synthesis
- Program testing
- Program transformation
- Constraint solving
- Type systems
- Machine learning and automated reasoning
- CHC encoding of analysis and verification problems
- Resource analysis
- Case studies and tools
- Challenging problems
We solicit regular papers describing theory and implementation of
Horn-clause based analysis and tool descriptions. We also solicit
extended abstracts describing work-in-progress, as well as
presentations covering previously published results, extended
abstracts of doctoral theses, and overviews of research projects that
are of interest to the workshop.
At least one author of each accepted paper will be required to attend
the workshop to present the contribution.
CHC Competition:
HCVS 2023 will host the 6th competition on constraint Horn clauses
(CHC-COMP https://chc-comp.github.io/ ), which will compare
state-of-the-art tools for CHC solving for performance and
effectiveness on a set of publicly available benchmarks. A report on
CHC-COMP will be part of the workshop's proceedings. The report also
contains tool descriptions of the participating solvers.
Program Chairs:
David Monniaux, VERIMAG, CNRS, Grenoble, France
José F. Morales, IMDEA Software, Madrid, Spain
Program Committee:
Nikolaj Bjørner, Microsoft, USA
Evelyne Contejean, LRI, CNRS, Univ Paris-Sud, France
Stefania Dumbrava, ENSIIE Paris-Evry, France
Fabio Fioravanti, University of Chieti-Pescara, Italy
Pierre-Loic Garoche, ENAC, France
Dejan Jovanović, Amazon Web Services, USA
Ekaterina Komendantskaya, Heriot-Watt University, UK
Jorge A. Navas, Certora, USA
Philipp Rüemmer, Uppsala University, Sweden
Hiroshi Unno, University of Tsukuba, Japan
Submission has to be done in one of the following formats:
- Regular papers (up to 12 pages plus bibliography in EPTCS
(http://www.eptcs.org/) format), which should present previously
unpublished work (completed or in progress), including descriptions
of research, tools, and applications.
- Tool papers (up to 4 pages in EPTCS format), including the papers
written by the CHC-COMP participants, which can outline the
theoretical framework, the architecture, the usage, and experiments
of the tool.
- Extended abstracts (up to 3 pages in EPTCS format), which describe
work in progress or aim to initiate discussions.
- **Presentation-only papers**, i.e., papers already submitted or
presented at a conference or another workshop. Such papers can be
submitted in any format, and will not be included in the workshop
post-proceedings.
- Posters that are of interest to the workshop
All submitted papers will be refereed by the program committee and
will be selected for inclusion in accordance with the referee
reports. Accepted regular papers and extended abstracts will be
published electronically as a volume in the Electronic Proceedings in
Theoretical Computer Science (EPTCS) series, see http://www.eptcs.org/
(provided that enough regular papers are accepted). The publication
of a paper is not intended to preclude later publication. Full
versions of extended abstracts published in EPTCS, or substantial
revisions, may later be published elsewhere.
Papers must be submitted through the EasyChair system using the web
page: https://easychair.org/conferences/?conf=hcvs2023