<head>
<meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
<meta name="GENERATOR" content="MSHTML 11.00.10570.1001"></head>
<body><p>Apologies for the cross postings<br>============================================================<br>SYNASC 2023 - Final Call for Papers</p><p>25th International Symposium on<br>Symbolic and Numeric Algorithms for Scientific Computing<br>September 11-14, 2023, LORIA in Nancy, France<br><a href="http://synasc.ro/2023">http://synasc.ro/2023</a></p><p>=== Aim ===</p><p>SYNASC aims to stimulate interaction among multiple communities focusing on<br>defining, optimizing and executing complex algorithms in several application areas.<br>The focus of the conference ranges from symbolic and numeric computation to<br>formal methods applied to programming, artificial intelligence, distributed computing<br>and computing theory. The interplay between these areas, in fact, is essential in the<br>current scenario where the economy and society demand for the development of<br>complex, data-intensive, trustable and high-performance computational systems.</p><p>In this context we invite submissions containing original results related to SYNASC main tracks, workshops and special session.</p><p>=== Important Dates ===</p><p>19 June 2023: Paper submission for main tracks (AoE - strict deadline)<br>19 June 2023: Paper submission for workshops and special sessions (AoE - strict deadline)<br>15 July 2023: Notification of acceptance<br>15 August 2023: Early registration <br>1 September 2023: Late registration<br>11-14 September 2023: Symposium<br>31 October 2023: Revised papers for post-proceedings</p><p>=== Conference format ===</p><p>SYNASC 2023 is planned as an in-person conference. However, virtual participation<br>might be a possibility in exceptional situations.</p><p>=== Invited speakers ===</p><p>* Hora?iu Cirstea, Université de Lorraine, France<br>* James Davenport, University of Bath, UK<br>* Fairouz Kamareddine, Heriot-Watt University, Edinburgh, UK<br>* Andrei Paun, University of Bucharest, Romania<br>* Radu Stoica, Université de Lorraine, France<br>* Thomas Sturm, CNRS, France</p><p>=== Main tracks ===</p><p>* Symbolic Computation<br> Track chairs:<br> James Davenport, University of Bath, UK<br> Stephen Watt, University of Waterloo, Canada</p><p>* Numerical Computing <br> Track chairs:<br> Eva Kaslik, West University of Timisoara, Romania<br> Dorota Mozyrska, Bialystok University of Technology, Poland<br> Stefan Takacs, Johannes Kepler University Linz, Austria</p><p>* Logic and Programming<br> Track chairs<br> Nikolaj Bjorner, Microsoft Research, USA<br> Arie Gurfinkel, University of Waterloo, Canada<br> Laura Kovacs, Vienna University of Technology (TU Wien), Austria</p><p>* Distributed Computing<br> Track chairs<br> Mark Frincu, Nottingham Trent University, UK<br> Dana Petcu, West University of Timisoara, Romania</p><p>* Artificial Intelligence<br> Track chairs<br> Edwin Lughofer, Johannes Kepler University, Linz, Austria<br> Andrei Petrovski, Robert Gordon University, UK<br> Daniela Zaharie, West University of Timisoara, Romania</p><p>* Theory of Computing<br> Track chairs<br> Mircea Marin, West University of Timisoara, Romania <br> Gabriel Istrate, University of Bucharest, Romania </p><p>=== Workshops ===</p><p>The following workshops will be collocated with SYNASC 2023:</p><p>+ 25th Workshop on Agents for Complex Systems (ACSys)<br>+ 7th Workshop on Digital Image Processing for Medical and Automotive Industry (DIPMAI)<br>+ 25th Workshop on Iterative Approximation of Fixed Points (IAFP)<br>+ 25th Workshop on Natural Computing and Applications (NCA)<br>+ 1st Workshop on Theory of Smart Contracts and Applications (TOSCA)</p><p>=== Special sessions ===</p><p>+ Special Session in honor of Professor James Davenport, at his 70th birthday<br>+ Special Session for PhD students</p><p>=== Tutorials ===</p><p>+ Tutorial on "The TLA+ Language and Tools for Specifying and Verifying Systems" - Stephan Merz, INRIA, France<br>+ Tutorial on "Performance and compliance anomaly detection" - Gabriel Iuhasz, West University of Timisoara, Romania</p><p>=== Submission ===</p><p>All papers must contain original research results and should not be submitted or<br> published elsewhere. There are four categories of submissions:<br>+ Regular papers describing fully completed research results (up to 8 pages<br> in the two-columns paper style). <br>+ System descriptions and experimental papers describing software prototypes,<br> results of simulations, or experimental data analysis, with a link to the reported<br> results (up to 4 pages in the two-columns paper style).<br>+ Work in progress papers, describing ongoing work and/or preliminary results<br> (up to 4 pages in the two-columns paper style). <br>+ Short papers and posters, describing ongoing work and research challenges<br> of PhD students (up to 4 pages in the two-columns paper style).<br>The papers should be submitted electronically through<br> <a href="http://www.easychair.org/conferences/?conf=synasc2023">http://www.easychair.org/conferences/?conf=synasc2023</a> .</p><p>Research papers that are accepted and presented at the symposium will be<br>collected as proceedings published by Conference Publishing Service (CPS)<br>(included in IEEE Xplore) and will be submitted for indexing in ISI Web of Science,<br>DBLP, SCOPUS. For all accepted papers, at least one author is required to<br>register for the conference and present the paper.</p><p>There will be a best paper award for a PhD student presentation.</p><p>=== Topics for main tracks ===</p><p>* Symbolic Computation<br> + computer algebra<br> + symbolic analysis<br> + symbolic combinatorics<br> + symbolic techniques applied to numerics<br> + hybrid symbolic and numeric algorithms<br> + numerics and symbolics for geometry<br> + programming with constraints, narrowing<br> + applications of symbolic computation to artificial intelligence and vice-versa</p><p>* Numerical Computing<br> + iterative approximation of fixed points<br> + solving systems of nonlinear equations<br> + numerical and symbolic algorithms for differential equations<br> + numerical and symbolic algorithms for optimization<br> + parallel algorithms for numerical computing<br> + scientific visualization and image processing</p><p>* Logic and Programming<br> + automatic reasoning<br> + formal system verification<br> + formal verification and synthesis<br> + software quality assessment<br> + static analysis<br> + timing analysis<br> + automated testing<br> <br>* Distributed Computing<br> + modelling of parallel and distributed systems<br> + parallel and distributed algorithms<br> + architectures for parallel and distributed systems. <br> + applications for parallel and distributed systems,<br> + acceleration of AI or Big Data applications using distributed and<br> parallel computing<br> + networked intelligence and Internet of Things <br> <br>* Artificial Intelligence<br> + knowledge discovery, representation, and management<br> + automated reasoning, uncertain reasoning, and constraint strategies<br> + recommender and expert systems<br> + intelligent systems, agents, and networks<br> + agent-based complex systems<br> + AI-based systems for scientific computing<br> + machine learning – including deep learning models and technologies<br> + explainable and trustworthy AI<br> + information retrieval, data mining, text mining and web mining<br> + computational intelligence - including fuzzy, neural and evolutionary computing<br> + AI applications: natural language processing, computer vision,<br> signal processing, stock market, computational neuroscience, robotics,<br> autonomous vehicles, medical diagnosis, cybersecurity, digital design,<br> online education, algorithm invention and analysis</p><p>* Theory of Computing<br> + data structures and algorithms<br> + combinatorial optimization<br> + formal languages and combinatorics on words<br> + graph-theoretic and combinatorial methods in computer science<br> + algorithmic paradigms, including distributed, online,<br> approximation, probabilistic, game-theoretic algorithms<br> + computational complexity theory, including structural complexity, boolean<br> complexity, communication complexity, average-case complexity,<br> derandomization and property testing<br> + logical approaches to complexity, including finite model theory<br> + algorithmic and computational learning theory<br> + aspects of computability theory, including computability in<br> analysis and algorithmic information theory<br> + proof complexity<br> + computational social choice and game theory<br> + new computational paradigms: CNN computing, quantum,<br> holographic and other non-standard approaches to computability<br> + randomized methods, random graphs, threshold phenomena and<br> typical-case complexity<br> + automata theory and other formal models, particularly in<br> relation to formal verification methods such as model checking<br> and runtime verification<br> + applications of theory, including wireless and sensor networks,<br> computational biology and computational economics<br> + experimental algorithmics</p><p>=== Committees ==<br> <br> * Steering Committee:<br> + Anca Mirela Andreica, Babes-Bolyai University of Cluj-Napoca, Romania<br> + James Davenport, University of Bath, UK<br> + Tetsuo Ida, University of Tsukuba, Japan<br> + Tudor Jebelean, Johannes Kepler University, Austria<br> + Laura Kovacs, Technical University of Vienna, Austria<br> + Dorel Lucanu, “Alexandru Ioan Cuza” University of Iasi, Romania<br> + Viorel Negru, West University of Timisoara, Romania<br> + Dana Petcu, West University of Timisoara, Romania<br> + Alin Stefanescu, University of Bucharest, Romania<br> + Stephen Watt, University of Waterloo, Canada<br> + Daniela Zaharie, West University of Timisoara, Romania</p><p> * General Chairs:<br> + Viorel Negru, West University of Timisoara, Romania<br> + Daniela Zaharie, West University of Timisoara, Romania</p><p> * Program Chairs:<br> + Sorin Stratulat, Université de Lorraine, France<br> + Mircea Marin, West University of Timisoara, Romania</p><p>-----------<br>SYNASC 2023<br>e-mail: <a href="mailto:contact@synasc.ro">contact@synasc.ro</a>
</p></body>