The Italian Conference on Theoretical Computer Science (ICTCS) is the conference of the Italian Chapter of the European Association for Theoretical Computer Science.
The purpose of ICTCS is to foster the cross-fertilization of ideas stemming from different areas of theoretical computer science. In particular, ICTCS provides an ideal environment where junior researchers and PhD students can meet senior researchers.
Contributions in any area of theoretical computer science are warmly invited from researchers of all nationalities.
The topics of interest include, but are not limited to, the following:
Two types of contributions, written in English and formatted according to CEUR-WS style, are solicited.
Regular papers: up to 12 pages (bibliography excluded), presenting original results not appeared or submitted elsewhere. To ease the reviewing process, the authors of regular papers may add an appendix, although reviewers are not required to consider it in their evaluation.
Communications: up to 5 pages (bibliography excluded), suitable for extended abstracts of papers already appeared/submitted or to be submitted elsewhere, as well as papers reporting ongoing research and overviews of PhD theses or research projects.
Authors are invited to submit their manuscripts in PDF format by accessing:
easychair.org/conferences/?conf=ictcs2025
All accepted original contributions (regular papers and communications with at least 5 pages including the bibliography) will be published on CEUR-WS.org (unless the authors waive). Please use the CEURART LaTeX style from the CEUR-WS.org website, using the one-column format.
For each accepted contribution, at least one of the authors is required to attend the conference and present the paper.
Submission deadline:Following the tradition, the authors of the very best papers presented at the conference will be invited to submit an extended version of their work in a special issue of Theoretical Computer Science journal. Invitations will be sent out after the workshop. The target is to publish the special issue by the end of the year 2026.
One way of defining ``knowledge'' is as ``consisting of information with good explanatory function that has proven resistant to falsification'' (D. Deutsch). In this talk I will present my personal view of Theoretical Computer Science as an intellectual activity that has provided over the last decades explanations of natural phenomena that have transformed how we see the world and what we can do in it.
The talk is biased by my personal taste and thus it focuses on Algorithm and Computational Complexity, and on Cryptography, one of its most successful intellectual spinoffs.
I will start from the Cook-Levin theory of NP-completeness that explains the phenomenon of so many hard problems (they are essentially the same problem!) and then I move to the Foundations of Cryptography, seen as the provable consequence of the existence of one-way functions and trapdoor functions.
I will discuss the transformatory power of Cryptography by looking at three specific problems in Cryptography that I have studied in the recent years: Oblivious RAM, Private Information Retrieval and Anamorphic Encryption.
Timed Automata (TA) -- supported by the model checking tool UPPAAL -- has for more than 30 years been used for modelling and verification of numerous industrial real-time system. In 2001 the extension of Priced Timed Automata (PTA) was introduced allowing for additional aspects of resource consumption to be modelled and optimized, simply by additional continuous (cost) variables that may evolve with different (positive) rates.
In the talk I will introduce PTA and survey the large number of the decidability and undecidability results as well as efficient symbolic algorithms, that have been established over the last 25 years for various extensions of the basic notion of PTA. It should be noted that PTA itself as well the extensions considered have been motivated by needs of particular case-studies. The extensions studied include multiple clock variables, multiple resource variables, resource constrained properties ranging from optimal reachability and safety to general resource constrained temporal properties as well as presence of an antagonistic opponent.
More recently, the seemingly slight extension Energy Timed Automata (ETA) was introduced in 2011: here resources are allowed not only to be consumed but also produced, reflected by rates of corresponding continuous cost-variables being either positive or negative. In the talk I will motivate the usefulness of this extension but also demonstrate the resulting drastic increase in complexity and our search for decidable yet useful subclasses. Most recently we found such a subclass (so-called SFETA) develop efficient algorithms exploiting quantifier elimination for linear arithmetic. In particular I will highlight how we may successfully synthesize optimal infinite production plans for an industrial case of a hydraulic oil pump.
Venue: Room 9–11, Department of Economics, Viale Pindaro 42, Pescara
Talk length: Regular: 25 min (20 + 5 Q&A); Communication: 15 min (10 + 5 Q&A)
Timed Automata (TA) -- supported by the model checking tool UPPAAL -- has for more than 30 years been used for modelling and verification of numerous industrial real-time system. In 2001 the extension of Priced Timed Automata (PTA) was introduced allowing for additional aspects of resource consumption to be modelled and optimized, simply by additional continuous (cost) variables that may evolve with different (positive) rates. In the talk I will introduce PTA and survey the large number of the decidability and undecidability results as well as efficient symbolic algorithms, that have been established over the last 25 years for various extensions of the basic notion of PTA. It should be noted that PTA itself as well the extensions considered have been motivated by needs of particular case-studies. The extensions studied include multiple clock variables, multiple resource variables, resource constrained properties ranging from optimal reachability and safety to general resource constrained temporal properties as well as presence of an antagonistic opponent. More recently, the seemingly slight extension Energy Timed Automata (ETA) was introduced in 2011: here resources are allowed not only to be consumed but also produced, reflected by rates of corresponding continuous cost-variables being either positive or negative. In the talk I will motivate the usefulness of this extension but also demonstrate the resulting drastic increase in complexity and our search for decidable yet useful subclasses. Most recently we found such a subclass (so-called SFETA) develop efficient algorithms exploiting quantifier elimination for linear arithmetic. In particular I will highlight how we may successfully synthesize optimal infinite production plans for an industrial case of a hydraulic oil pump.
Timed Automata (TA) -- supported by the model checking tool UPPAAL -- has for more than 30 years been used for modelling and verification of numerous industrial real-time system. In 2001 the extension of Priced Timed Automata (PTA) was introduced allowing for additional aspects of resource consumption to be modelled and optimized, simply by additional continuous (cost) variables that may evolve with different (positive) rates. In the talk I will introduce PTA and survey the large number of the decidability and undecidability results as well as efficient symbolic algorithms, that have been established over the last 25 years for various extensions of the basic notion of PTA. It should be noted that PTA itself as well the extensions considered have been motivated by needs of particular case-studies. The extensions studied include multiple clock variables, multiple resource variables, resource constrained properties ranging from optimal reachability and safety to general resource constrained temporal properties as well as presence of an antagonistic opponent. More recently, the seemingly slight extension Energy Timed Automata (ETA) was introduced in 2011: here resources are allowed not only to be consumed but also produced, reflected by rates of corresponding continuous cost-variables being either positive or negative. In the talk I will motivate the usefulness of this extension but also demonstrate the resulting drastic increase in complexity and our search for decidable yet useful subclasses. Most recently we found such a subclass (so-called SFETA) develop efficient algorithms exploiting quantifier elimination for linear arithmetic. In particular I will highlight how we may successfully synthesize optimal infinite production plans for an industrial case of a hydraulic oil pump.
.
| Wednesday 10 Sep | Thursday 11 Sep | Friday 12 Sep |
|---|---|---|
| 09:00 – 09:15 Opening ICTCS 2025 |
09:00 – 10:00 Invited Talk – “Theoretical Computer Science and Explanations that Transform the World” (G. Persiano) |
09:00 – 10:40 EATCS Prize Ceremony Best Young Researcher Award Best PhD Dissertation Award Best Master Thesis Award |
| 09:15 – 10:15 Invited Talk – “Priced and Energy Timed Automata” (K. G. Larsen) |
||
| 10:20 – 10:45 SESSION 1 — Graphs, Algorithms and Complexity |
10:05 – 10:45 SESSION 4 — Logic and Formal Methods |
|
| 10:45 – 11:15 Coffee break |
10:45 – 11:15 Coffee break |
10:40 – 11:10 Coffee break |
| 11:15 – 11:55 SESSION 1 — Graphs, Algorithms and Complexity |
11:15 – 11:30 SESSION 4 — Logic and Formal Methods |
11:10 – 12:15 SESSION 8 — Graphs, Algorithms and Complexity |
| 12:00 - 12:45 SESSION 2 — Logic and Formal Methods 1 |
11:35 - 12:20 SESSION 5 — Algorithmic Game Theory |
12:15 – 13:10 SESSION 9 — Logic and Formal Methods |
| 13:10 – 13:25 Closing ICTCS 2025 |
||
| 12:45 – 14:15 Lunch |
12:45 – 14:15 Lunch |
13:30 – Lunch |
| 14:15 – 14:55 SESSION 3 — Automata, Languages and Computation |
14:15 – 15:30 SESSION 6 — Graphs, Algorithms and Complexity |
|
| 15:00 – 16:30 Assembly of the IC of the EATCS |
15:30 – 16:00 Coffee break |
|
| 16:30 – 23:00 Guided tour of the Trabocchi Coast & Conference Dinner |
16:00 – 17:15 SESSION 7 — Automata, Languages and Computation |
Last updated: 14 August 2025
Registration is open!
You can register at the page: abruzzoincoming.it/en/tour/ictcs-2025-26th-italian-conference-on-theoretical-computer-science/
For each accepted contribution, at least one of the authors is required to register, attend the conference and present the paper.
Early Registration fees – up to August 16th, 2025 included
Late Registration fees – from August 17th, 2025
Registration fees include: Access to the conference sessions, daily coffee breaks and lunches, conference dinner and one year membership to EATCS and to the Italian Chapter.
If you need additional tickets for the social dinner (€55.00 each), please send an email to booking@abruzzoincoming.it after completing your conference registration.
Pescara has a small airport, Abruzzo Airport, very close to downtown. If traveling directly to Abruzzo Airport is not an option (very likely!), consider going through Rome Fiumicino Airport. From there, there are many bus connections (3h10m - 4h00m travel time), with either Prontobus, Di Carlo Bus or Flixbus.
Another option is landing in Rome Ciampino Airport: from there you can find bus connections to Pescara (~ 3h30m travel time) with Prontobus, Flixbus or itabus. If you are in Rome but not at the airport, all companies above have buses departing from Rome Tiburtina bus station.
You can also reach Pescara by trains departing from Rome Tiburtina train station. However, trains on the line Rome–Pescara are quite slow. On the bright side, the trip by train is interesting since trains pass trough many small rural villages in the innermost part of Italy. If you have time to spare (and no work to do... probably no Internet connection there) it could be an alternative.
If you are in Italy everywhere else, you can reach Pescara by bus (see bus companies above) or train.
This is a list of hotels in downtown Pescara or near the place of the conference.
Below are the instructions for preparing the final version of accepted contributions to ICTCS 2025.
The camera ready version of the paper, along with the copyright form and requested information, must be uploaded in EasyChair, at the page easychair.org/conferences/?conf=ictcs2025 using the "Update information" and "Add or update files" buttons in the submission section.
Deadline: August 24, 2025
Authors must update the following information in EasyChair:
\copyrightyear{2025}
\copyrightclause{Copyright for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).}
\conference{ICTCS 2025: Italian Conference on Theoretical Computer Science, September 10--12, 2025, Pescara, Italy}
To complete the submission, one author must fill in and hand-sign the AUTHOR-AGREEMENT form. Scanned handwritten signatures are required; image signatures are not allowed.
