SYNASC aims to stimulate the interaction among multiple communities focusing on defining, optimizing, and executing complex algorithms in several application areas. The focus of the conference then ranges from symbolic and numeric computation to formal methods applied to programming, artificial intelligence, distributed computing, and computing theory. The interplay between these areas is essential in the current scenario where the economy and society demand for the development of complex, data-intensive, trustable, and high-performance computational systems.

SYNASC 2024 is organized in conjunction with FROM – Working Formal Methods Symposium 2024 - https://from2024.uvt.ro/

Important Dates

• 30 June 2024 (AoE): Paper submission for main tracks (final deadline)
• 30 June 2024 (AoE): Paper submission for workshops and special sessions (extended deadline)
• 15 July 2024: Notification of acceptance
• 5 September 2024: Registration
• 5 September 2024: Revised papers according to the reviews
• 16-19 September 2024: Symposium

Submission Guidelines

All papers must contain original research results and should not be submitted or published elsewhere. There are four categories of submissions:

• Regular papers describing fully completed research results (up to 8 pages of text, excluding references, in the two-column paper style).   
• System descriptions and experimental papers describing software prototypes, results of simulations, or experimental data analysis, with a link to the reported results (up to 4 pages in the two-column paper style).
• Work-in-progress papers, describing ongoing work and/or preliminary results (up to 4 pages of text, excluding references, in the two-column paper style).   
• Short papers and posters, describing ongoing work and research challenges of PhD students (up to 4 pages of text, excluding references, in the two-columns paper style).

There will be a best paper award for a PhD student presentation.

Invited speakers

• Nikolaj Bjorner, Microsoft Research, USA
• Kadi Bouatouch, University of Rennes, France
• Mike Preuss, Leiden University, The Netherlands
• Sasha Radomirovic, University of Surrey, UK
• Amr Sabry, Indiana University, USA

Special Sessions

• NALPHIDA - Natural Language Processing for Digital Humanities Applications
• NACET - Numerical Approaches for the Clean Energy Transition
• SS-PhD - Special Session for PhD students

Workshops

• IAFP - Iterative Algorithms for Approximating Fixed Points of Various Contractive Type Operators 
• SegWEDA - Serious Games in Well-being, Environment, Digital Heritage and Other Applications 
• NCA - Natural Computing and Applications 

Tutorials

• Generalized multisets over infinite alphabets with atoms (Andrei Alexandru, Gabriel Ciobanu - Institute of Computer Science, Romanian Academy, Iasi Branch, Romania)
• Advanced Methodologies for Time Series Analysis: From Preprocessing to Deep Learning for Event Detection and Variable Prediction (Carlos Domingo, Barcelona Supercomputing Center)

List of Topics

SYNASC is organized into six tracks:

• Symbolic Computation
  • computer algebra
  • symbolic analysis
  • symbolic combinatorics
  • symbolic techniques applied to numerics
  • symbolic regression
  • hybrid symbolic and numeric algorithms
  • numerics and symbolics for geometry
  • programming with constraints, narrowing
  • applications of symbolic computation to artificial intelligence and vice-versa
• Numerical Computing
  • iterative approximation of fixed points
  • solving systems of nonlinear equations
  • numerical and symbolic algorithms for differential equations
  • numerical and symbolic algorithms for optimization
  • parallel algorithms for numerical computing
  • scientific visualization and image processing
• Logic and Programming
  • automatic reasoning
  • formal system verification
  • formal verification and synthesis
  • software quality assessment
  • static analysis
  • timing analysis
  • automated testing
• Distributed Computing
  • modelling of parallel and distributed systems
  • parallel and distributed algorithms
  • architectures for parallel and distributed systems
  • applications for parallel and distributed systems 
  • acceleration of AI or Big Data applications using distributed and parallel computing
  • networked intelligence and Internet of Things
• Artificial Intelligence
  • knowledge discovery, representation, and management
  • automated reasoning, uncertain reasoning, and constraint strategies
  • recommender and expert systems
  • intelligent systems, agents, and networks
  • agent-based complex systems
  • AI-based systems for scientific computing
  • machine learning – including deep learning models and technologies
  • explainable and trustworthy AI
  • information retrieval, data mining, text mining and web mining
  • computational intelligence - including fuzzy, neural and evolutionary computing
  • AI applications: natural language processing, computer vision, signal processing, stock market, computational neuroscience, robotics, autonomous vehicles, medical diagnosis, cybersecurity, digital design, online education, algorithm invention and analysis
• Theory of Computing
  • data structures and algorithms
  • combinatorial optimization
  • formal languages and combinatorics on words
  • graph-theoretic and combinatorial methods in computer science
  • algorithmic paradigms, including distributed, online, approximation, probabilistic, game-theoretic algorithms
  • computational complexity theory, including structural complexity, boolean complexity, communication complexity, average-case complexity, derandomization and property testing
  • logical approaches to complexity, including finite model theory
  • algorithmic and computational learning theory
  • aspects of computability theory, including computability in analysis and algorithmic information theory
  • proof complexity
  • computational social choice and game theory
  • new computational paradigms: CNN computing, quantum, holographic and other non-standard approaches to computability
  • randomized methods, random graphs, threshold phenomena and typical-case complexity
  • automata theory and other formal models, particularly in relation to formal verification methods such as model checking and runtime verification
  • applications of theory, including wireless and sensor networks, computational biology and computational economics
  • experimental algorithmics

Committees

Program Committee

• Honorary Chair:
  • Bruno Buchberger, Johannes Kepler University, Austria
• Steering Committee:
  • Anca Mirela Andreica, Babes-Bolyai University of Cluj-Napoca, Romania
  • James Davenport, University of Bath, UK
  • Tetsuo Ida, University of Tsukuba, Japan
  • Tudor Jebelean, Johannes Kepler University, Austria
  • Laura Kovacs, Technical University of Vienna, Austria
  • Dorel Lucanu, "Alexandru Ioan Cuza" University of Iasi, Romania
  • Viorel Negru, West University of Timisoara, Romania
  • Dana Petcu, West University of Timisoara, Romania
  • Alin Stefanescu, University of Bucharest, Romania
  • Stephen Watt, University of Western Ontario, Canada
  • Daniela Zaharie, West University of Timisoara, Romania
• General Chairs:
  • Viorel Negru, West University of Timisoara, Romania
  • Daniela Zaharie, West University of Timisoara, Romania
• Program Chairs:
  • Fairouz Kamareddine, Heriot-Watt University, Edinburgh, UK
  • Mircea Marin, West University of Timisoara, Romania
• Track Chairs:
  • Symbolic Computation
    • James Davenport, University of Bath, UK
    • Stephen Watt, University of Waterloo, Ontario, Canada
  • Numerical Computing
    • Eva Kaslik, West University of Timisoara, Romania
    • Dorota Mozyrska, Bialystok University of Technology, Poland
    • Stephen Takacs, Johannes Kepler University Linz, Austria
  • Logic and Programming
    • Nikolaj Bjorner, Microsoft Research, USA
    • Arie Gurfinkel, University of Waterloo, Canada
    • Laura Kovacs, Technical University of Vienna, Austria
  • Artificial Intelligence
    • Andrei Petrovski, Robert Gordon University, UK
    • Daniela Zaharie, West University of Timisoara, Romania
  • Distributed Computing
    • Marc Frincu, Nottingham Trent University, UK
    • Dana Petcu, West University of Timisoara, Romania
  • Theory of Computing
    • Gabriel Istrate, Institute e-Austria Timisoara, Romania
    • Mircea Marin, West University of Timisoara, Romania
• Special Sessions and Workshops Chair:
  • Daniel Pop, West University of Timisoara, Romania
• Tutorials Chair:
  • Florin Fortis, West University of Timisoara, Romania
• Proceedings Chairs:
  • Fairouz Kamareddine, Heriot-Watt University, Edinburgh, UK
  • Mircea Marin, West University of Timisoara, Romania

Organizing Committee

• Monica Sancira, West University of Timisoara - chair
• Flavia Micota, West University of Timisoara, Romania
• Cosmin Bonchis, West University of Timisoara, Romania
• Theodor Grumeza, West University of Timisoara, Romania
• Adrian Spătaru, West University of Timisoara, Romania

Publicity Chairs

• Silviu Panica, Institute e-Austria Timisoara, Romania
• Sebastian Stefănigă, West University of Timisoara, Romania

Technical Committee

• Dorin Cazan, West University of Timisoara, Romania
• Razvan Iovescu, West University of Timisoara, Romania
• Ștefan Secrieru, West University of Timisoara, Romania

Publication

SYNASC 2024 proceedings will be published by the Conference Publishing Service (CPS)

Venue

The conference will be held at the West University of Timisoara, Romania.

Contact

All questions about submissions should be emailed to contact@synasc.ro