- FMIndia - mail.cmi.ac.in

CONCUR 2026: Final Call for Papers
by totzke＠liverpool.ac.uk 09 Apr '26

09 Apr '26

CONCUR 2026: Final Call for Papers When: 1 – 4 September, 2026 Where: Liverpool, UK Web: https://confest-2026.github.io/concur ------------------------------------------------------------------------ The International Conference on Concurrency Theory (CONCUR) brings together researchers, developers, and students in order to advance the theory of concurrency and promote its applications. CONCUR solicits high quality papers reporting research results and/or experience related to semantics, logics, verification and analysis of concurrent systems. The 2026 edition will be co-located with QEST+FORMATS, FMICS and a number of workshops under the joint name CONFEST 2026, which will take place September 1-5, 2026 at the University of Liverpool, UK. Important dates - Abstracts: 20 April, 2026 (AoE) - Submissions: 27 April, 2026 (AoE) - Rebuttal: 1 – 3 June, 2026 (AoE) - Notification: 15 June, 2026 (AoE) - Camera Ready: 29 June, 2026 (AoE) - Conference: 1 – 4 September, 2026 - Workshops: 5 September, 2026 Topics Submissions are solicited in the theory and practice of concurrent systems. The principal topics include (but are not limited to): - Basic models of concurrency such as abstract machines, domain-theoretic models, categorical and coalgebraic models, game-theoretic models, parametric models, process algebras, graph transformation systems, Petri nets, hybrid systems, mobile and collaborative systems, probabilistic systems, real-time systems, quantum systems, biology-inspired systems, and synchronous systems; - Logics for concurrency such as modal logics, program logics, probabilistic and stochastic logics, temporal logics, multi-agent logics, and resource logics; - Verification and analysis techniques for concurrent systems such as abstract interpretation, atomicity checking, model checking, race detection, pre-order and equivalence checking, run-time verification, state-space exploration, static analysis, synthesis, testing, theorem proving, type systems, and security analysis; - Distributed/parallel algorithms and concurrent data structures: design, analysis, complexity, correctness, fault tolerance, reliability, availability, consistency, self-organization, self-stabilization, commitment schemes, communication protocols; - Theoretical foundations, tools, and empirical evaluations of architectures, execution environments, and software development for concurrent systems such as geo-replicated systems, distributed ledgers, communication networks, multiprocessor and multi-core architectures, quantum computing, quantum communication, shared and transactional memory, resource management and awareness, compilers and tools for concurrent programming, programming models such as component-based, object- and service-oriented. Paper submission - All papers must be original, unpublished, and not submitted for publication elsewhere. - Each paper will undergo a thorough review process. - Papers must be submitted electronically as PDF files via EasyChair (https://easychair.org/conferences?conf=concur2026) - Proceedings will be published by LIPIcs; please use their style files (https://drops.dagstuhl.de/entities/series/LIPIcs#author) when preparing your submission. - Submissions follow a single-blind process. - Papers must not exceed 15 pages (excluding references and appendices, LIPIcs style) - An appendix may provide additional material and proofs, but should not be expected to be scrutinized by the reviewers and will not be published in the proceedings. - PC members are allowed to submit. However, if it gets to a final vote on the last papers to be accepted, then PC-coauthored papers cannot be selected. Special Issue A special issue dedicated to selected papers from CONCUR’2026 will appear in Logical Methods in Computer Science. Awards There will be a CONCUR Test-of-Time award, Best Paper award, and Best Student Paper award in 2026. The winners will be announced at the conference. Invited Speakers - Jade Alglave, University College London / Arm, UK - Ezio Bartocci, TU Wien, Austria - Ichiro Hasuo, National Institute of Informatics, Japan - Jean-François Raskin, Université Libre de Bruxelles, Belgium - Qiyi Tang, University of Liverpool, UK Program Committee Chairs - Ana Sokolova, University of Salzburg, Austria - Patrick Totzke, University of Liverpool, UK Program Committee - Parosh Abdulla, Uppsala University, Sweden - Giorgio Bacci, Aalborg University, Denmark - Christel Baier, TU Dresden, Germany - Paolo Baldan, University of Padova, Italy - Nathalie Bertrand, INRIA Rennes, France - Laura Bocchi, University of Kent, UK - Filippo Bonchi, University of Pisa, Italy - Valentina Castiglioni, Eindhoven University of Technology, the Netherlands - Dmitry Chistikov, University of Warwick, UK - Corina Cirstea, University of Southampton, UK - Wojciech Czerwiński, University of Warsaw, Poland - Javier Esparza, TU Munich, Germany - Benjamin Kaminski, Saarland University and UCL, Germany/UK - Tobias Kappé, Leiden University, the Netherlands - Stefan Kiefer, University of Oxford, UK - Barbara König, University of Duisburg-Essen, Germany - Antonín Kucera, Masaryk University, Czech Republic - Yong Li, SKLCS Beijing, China - Nicolas Mazzocchi, STU Bratislava, Slovakia - Roland Meyer, TU Braunschweig, Germany - Pierre Ohlmann, CNRS, LIS Marseille, France - Prakash Panangaden, McGill and University of Edinburgh, Canada/UK - Kirstin Peters, University of Augsburg, Germany - Guillermo A. Pérez, University of Antwerp, Belgium - Damien Pous, CNRS, ENS Lyon, France - Karin Quaas, University of Leipzig, Germany - Ege Saraç, CISPA, Germany - Sylvain Schmitz, Université Paris Cité, France - Henning Urbat, FAU Erlangen-Nürnberg, Germany - Viktor Vafeiadis, MPI-SWS, Germany - Franck van Breugel, York University, Canada - Rob van Glabbeek, University of Edinburgh, UK - Pierre Vandenhove, Université de Mons, Belgium - Kazuki Watanabe, NII, Tokyo, Japan - Sarah Winter, Université Paris Cité, France - Nisansala Yatapanage, Australian National University, Australia - Florian Zuleger, TU Wien, Austria Steering Committee - Luca Aceto, Reykjavik University, Iceland - Christel Baier, TU Dresden, Germany - Pedro R. D’Argenio, National University of Córdoba, Argentina - Wan Fokkink, VU Amsterdam, the Netherlands - Catuscia Palamidessi, INRIA Saclay and LIX, France - Jiri Srba, Aalborg University, Denmark Questions regarding submissions should be directed to the PC chairs (concur2026(a)easychair.org)

1 0

IARCS Verification Seminar Series -- Talk by Ashish Mishra on April 07 at 1900 hrs IST
by VSS IARCS 06 Apr '26

06 Apr '26

Dear all, The next talk in the IARCS Verification Seminar Series will be given by Ashish Mishra, a faculty member in the Department of Computer Science and Engineering at IIT Hyderabad. The talk is scheduled on Tuesday, April 07, at 1900 hrs IST (add to Google calendar <https://calendar.google.com/calendar/event?action=TEMPLATE&tmeid=NG8ydXZuaW…> ). The details of the talk can be found on our webpage ( https://fmindia.cmi.ac.in/vss/) and also appended to the body of this email. The Verification Seminar Series, an initiative by the Indian Association for Research in Computing Science (IARCS), is a monthly, online talk-series, broadly in the area of Formal Methods and Programming Languages, with applications in Verification and Synthesis. The aim of this talk-series is to provide a platform for Formal Methods researchers to interact regularly. In addition, we hope that it will make it easier for researchers to explore newer problems/areas and collaborate on them, and for younger researchers to start working in these areas. All are welcome to join. Best regards, Organizers, IARCS Verification Seminar Series ============================================================= Title: Coverage Types: Underapproximate Refinement Types for Generator Coverage Meeting Link: https://us02web.zoom.us/j/89164094870?pwd=eUFNRWp0bHYxRVpwVVNoVUdHU0djQT09 (Meeting ID: 891 6409 4870, Passcode: 082194) Abstract: Property-based testing (PBT) has become a widely used technique for validating semantic properties of programs by automatically generating test inputs that satisfy user-specified preconditions. In practice, however, the effectiveness of PBT depends critically on the quality of input generators. When preconditions describe rich structural constraints, purely random generators rarely produce many valid inputs, forcing developers to write specialized generators by hand. Unfortunately, such generators are often incomplete, i.e., they may fail to produce many valid inputs, limiting the behaviors explored during testing. However, it is not readily apparent how to validate whether a particular generator provides sufficient coverage against a given precondition. Typically, developers must rely on manual inspection and post-hoc analysis. In this talk, I will present a refinement type-based framework for reasoning about the coverage of test input generators. Our key idea is coverage types, an interpretation of refinement types that captures must-style guarantees about the values a program will produce, rather than the traditional may-style approximation of possible outputs. Conceptually, coverage types bring ideas from Incorrectness logic and underapproximate reasoning into the type system. The types associated with expressions now capture the set of values guaranteed to be produced by an expression, rather than the typical formulation that uses types to represent the set of values an expression may produce. This automated, underapproximate reasoning mechanism allows us to formally verify coverage properties of generators in a higher-order functional language with inductive data types. Building on this foundation, I will also describe a synthesis-based program repair technique that automatically patches incomplete generators by enumerating candidate repairs guided by coverage types. Together, these ideas enable both verification and automated repair of test generators, providing stronger guarantees about the effectiveness of property-based testing and illustrating how incorrectness-style, underapproximate reasoning can be integrated with modern type systems to support practical testing workflows. Bio: Ashish Mishra obtained his PhD from IISc Bangalore. He was subsequently a post-doctoral researcher at Northeastern University and Purdue University, before joining IIT Hyderabad as an Assistant Professor in 2024. Ashish's research interests are broadly in Program Verification and Synthesis, Functional Programming and Type Systems.

1 0

First CfP: SYNT 2026, 15th Workshop on Synthesis (Lisbon, Portugal), July 25, 2026
by Supratik Chakraborty 31 Mar '26

31 Mar '26

**SYNT 2026 : 15th International Workshop on Synthesis** 25th July 2026 Co-located with FLoC 2026, Lisbon, Portugal --- The SYNT workshop aims to bring together researchers interested in the broad area of synthesis of computing systems. The workshop fosters the development of frontier techniques in automating the development of computing systems and is inclusive in its interpretation of the term “synthesis”. SYNT 2026 encourages submissions that can be broadly categorized into one of the tracks: reactive synthesis, functional synthesis and neuro-symbolic synthesis. However, submissions in other areas related to synthesis are also welcome. --- **Topics of interest include, but are not limited to:** - Algorithms and tools for synthesis of computing systems, broadly interpreted - Reactive (discrete-time, timed, hybrid, ...) synthesis - Functional (program, circuit, …) synthesis - Neuro-symbolic synthesis - Specification languages and optimization in synthesis, - Complexity and decidability results for synthesis, - Case studies of software or hardware synthesis, - Connections between verification and synthesis, - Synthesis by model learning, - Connections between synthesis and inductive programming, - New approaches or applications for synthesis, - Description and analysis of benchmark families for synthesis. --- **SYNT 2026 submission instructions** SYNT 2026 welcomes submissions of extended abstracts up to 3 pages, excluding references. All submissions should be in the Lecture Notes in Computer Science (LNCS) format: https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu… <https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu…> As in previous years, there will be no published proceedings of SYNT 2026 Submissions will be judged on how interesting they are to the SYNT community. Overlap with previously published work should be indicated but does not disqualify a submission if the presentation can be expected to be of enough interest. Parallel submissions are welcome as well, since there will be no published proceedings. --- **WORKSHOP URL:** https://synt2026.github.io/ <https://synt2026.github.io/> **SUBMISSION URL:** https://submissions.floc26.org/synt/ <https://submissions.floc26.org/synt/> --- **IMPORTANT DATES:** - Submission: 1st May (AoE) - Author Notification: 14th May (AoE) - Workshop: 25th July --- Organisers: Supratik Chakraborty (Indian Institute of Technology Bombay) K. S. Thejaswini (Université libre de Bruxelles)

1 0

IARCS Verification Seminar Series -- Talk by Ashish Mishra on April 07 at 1900 hrs IST
by VSS IARCS 30 Mar '26

30 Mar '26

Dear all, The next talk in the IARCS Verification Seminar Series will be given by Ashish Mishra, a faculty member in the Department of Computer Science and Engineering at IIT Hyderabad. The talk is scheduled on Tuesday, April 07, at 1900 hrs IST (add to Google calendar <https://calendar.google.com/calendar/event?action=TEMPLATE&tmeid=NG8ydXZuaW…> ). The details of the talk can be found on our webpage ( https://fmindia.cmi.ac.in/vss/) and also appended to the body of this email. The Verification Seminar Series, an initiative by the Indian Association for Research in Computing Science (IARCS), is a monthly, online talk-series, broadly in the area of Formal Methods and Programming Languages, with applications in Verification and Synthesis. The aim of this talk-series is to provide a platform for Formal Methods researchers to interact regularly. In addition, we hope that it will make it easier for researchers to explore newer problems/areas and collaborate on them, and for younger researchers to start working in these areas. All are welcome to join. Best regards, Organizers, IARCS Verification Seminar Series ============================================================= Title: Coverage Types: Underapproximate Refinement Types for Generator Coverage Meeting Link: https://us02web.zoom.us/j/89164094870?pwd=eUFNRWp0bHYxRVpwVVNoVUdHU0djQT09 (Meeting ID: 891 6409 4870, Passcode: 082194) Abstract: Property-based testing (PBT) has become a widely used technique for validating semantic properties of programs by automatically generating test inputs that satisfy user-specified preconditions. In practice, however, the effectiveness of PBT depends critically on the quality of input generators. When preconditions describe rich structural constraints, purely random generators rarely produce many valid inputs, forcing developers to write specialized generators by hand. Unfortunately, such generators are often incomplete, i.e., they may fail to produce many valid inputs, limiting the behaviors explored during testing. However, it is not readily apparent how to validate whether a particular generator provides sufficient coverage against a given precondition. Typically, developers must rely on manual inspection and post-hoc analysis. In this talk, I will present a refinement type-based framework for reasoning about the coverage of test input generators. Our key idea is coverage types, an interpretation of refinement types that captures must-style guarantees about the values a program will produce, rather than the traditional may-style approximation of possible outputs. Conceptually, coverage types bring ideas from Incorrectness logic and underapproximate reasoning into the type system. The types associated with expressions now capture the set of values guaranteed to be produced by an expression, rather than the typical formulation that uses types to represent the set of values an expression may produce. This automated, underapproximate reasoning mechanism allows us to formally verify coverage properties of generators in a higher-order functional language with inductive data types. Building on this foundation, I will also describe a synthesis-based program repair technique that automatically patches incomplete generators by enumerating candidate repairs guided by coverage types. Together, these ideas enable both verification and automated repair of test generators, providing stronger guarantees about the effectiveness of property-based testing and illustrating how incorrectness-style, underapproximate reasoning can be integrated with modern type systems to support practical testing workflows. Bio: Ashish Mishra obtained his PhD from IISc Bangalore. He was subsequently a post-doctoral researcher at Northeastern University and Purdue University, before joining IIT Hyderabad as an Assistant Professor in 2024. Ashish's research interests are broadly in Program Verification and Synthesis, Functional Programming and Type Systems.

1 0

[CFP - Extended Deadline] - IEEE W2R-Health 2026 - International Workshop on intelligent environments for personalized healthcare
by Alfonso Esposito 25 Mar '26

25 Mar '26

Call for Papers: 1st International Workshop on intelligent environments for personalized healthcare(W2R-Health 2026), held in conjunction with IEEE WoWMoM 2026 in Bologna, June 16-19, 2026. Paper Submission Deadline: April 10, 2026 (Extended, firm) Call For Papers -------------------------------------------------------------------------------------------------------- -------------------------------------------------------------------------------------------------------- The 1st IEEE International Workshop on intelligent environments for personalized healthcare (IEEE W2R-Health 2026) in conjunction with IEEE WoWMoM 2026, June 16 2026, Bologna, Italy -------------------------------------------------------------------------------------------------------- -------------------------------------------------------------------------------------------------------- Submission Deadline: April 10, 2026 (Extended, firm) WEBSITE https://w2r-health.github.io/W2R-Health/ SUBMISSION LINK https://edas.info/N35071 -------------- CALL FOR PAPERS W2R-HEALTH Workshop Wearables to Robotics for Intelligent and Personalized Healthcare The W2R-HEALTH Workshop aims to advance interdisciplinary research at the intersection of wearable sensing, Internet of Things (IoT), artificial intelligence, edge computing, and robotics to enable intelligent and personalized healthcare environments. Rapid progress in wearable technologies and humanoid robotics is opening new opportunities to transform healthcare spaces into adaptive, context-aware, and patient-centered systems that support continuous monitoring, assisted living, rehabilitation, and personalized interventions. The workshop focuses on the integration of wearable IoT technologies and robotic platforms to create smart healthcare ecosystems capable of real-time sensing, intelligent decision-making, and privacy-preserving data processing. By bridging engineering and life sciences, W2R-HEALTH seeks to stimulate collaboration and foster discussion on how sensing, computation, and robotic technologies can jointly shape the next generation of personalized healthcare solutions. Topics of interest include, but are not limited to: • Wearable sensing and body-area networks for healthcare monitoring • IoT architectures and platforms for smart healthcare environments • Context-aware and personalized healthcare applications • Human activity recognition and behavioral modeling for health assessment • Physiological and multimodal sensing with data fusion techniques • Humanoid and mobile robots for healthcare assistance and rehabilitation • Human–robot interaction in assistive and clinical environments • AI-based planning, reasoning, and decision-making for personalized care • Knowledge representation and intelligent healthcare spaces • Edge and fog computing for real-time and privacy-preserving processing • Machine learning and federated learning for healthcare analytics • Wireless and mobile networking solutions for smart healthcare systems • Security, privacy, and trust in IoT- and robot-enabled healthcare • Ethical, legal, and social implications of intelligent healthcare technologies • Clinical validation, user acceptance, and real-world deployment W2R-HEALTH encourages contributions that present novel research results, system prototypes, experimental studies, and interdisciplinary perspectives, with the goal of advancing intelligent, secure, and human-centered healthcare environments. -------------- FEATURES - Best Paper Award, - Best-selected papers will be invited to submit an extended version to a workshop-dedicated Special Issue (SI) -------------- SUBMISSION RULES Papers must be formatted in the standard IEEE two-column format that is used by the IEEE WOWMOM 2026 main conference and must not exceed 6 pages in length (including references). All submitted papers will go through a peer review process, and all accepted papers which are presented by one of the authors at the workshop will be published in the IEEE WOWMOM 2026 proceedings and IEEE Xplore. ------------- IMPORTANT DATES Submission Deadline: April 10, 2026 (Extended, firm) Notification of Acceptance: April 25, 2026 Camera Ready: April 30, 2026 Workshop: June 16, 2026 ------------- ORGANIZING COMMITEEE Technical Program Chairs * Valeria Seidita (University of Palermo, Italy) * Marco Di Felice (University of Bologna, Italy) * Roberto Toni (Tufts University School of Medicine, Boston, MA, USA) * Stefano Borgo (Laboratory for Applied Ontology, National Research Council of Italy Web and Publicity Chair * Alfonso Esposito (University of Bologna, Italy)

1 0

[CFP] - IEEE W2R-Health 2026 - International Workshop on intelligent environments for personalized healthcare
by Alfonso Esposito 13 Mar '26

13 Mar '26

Call for Papers: 1st International Workshop on intelligent environments for personalized healthcare(W2R-Health 2026), held in conjunction with IEEE WoWMoM 2026 in Bologna, June 16-19, 2026. Paper Submission Deadline: March 22, 2026 Call For Papers -------------------------------------------------------------------------------------------------------- -------------------------------------------------------------------------------------------------------- The 1st IEEE International Workshop on intelligent environments for personalized healthcare (IEEE W2R-Health 2026) in conjunction with IEEE WoWMoM 2026, June 16 2026, Bologna, Italy -------------------------------------------------------------------------------------------------------- -------------------------------------------------------------------------------------------------------- Submission Deadline: March 22, 2026 WEBSITE https://w2r-health.github.io/W2R-Health/ SUBMISSION LINK https://edas.info/N35071 -------------- CALL FOR PAPERS W2R-HEALTH Workshop Wearables to Robotics for Intelligent and Personalized Healthcare The W2R-HEALTH Workshop aims to advance interdisciplinary research at the intersection of wearable sensing, Internet of Things (IoT), artificial intelligence, edge computing, and robotics to enable intelligent and personalized healthcare environments. Rapid progress in wearable technologies and humanoid robotics is opening new opportunities to transform healthcare spaces into adaptive, context-aware, and patient-centered systems that support continuous monitoring, assisted living, rehabilitation, and personalized interventions. The workshop focuses on the integration of wearable IoT technologies and robotic platforms to create smart healthcare ecosystems capable of real-time sensing, intelligent decision-making, and privacy-preserving data processing. By bridging engineering and life sciences, W2R-HEALTH seeks to stimulate collaboration and foster discussion on how sensing, computation, and robotic technologies can jointly shape the next generation of personalized healthcare solutions. Topics of interest include, but are not limited to: • Wearable sensing and body-area networks for healthcare monitoring • IoT architectures and platforms for smart healthcare environments • Context-aware and personalized healthcare applications • Human activity recognition and behavioral modeling for health assessment • Physiological and multimodal sensing with data fusion techniques • Humanoid and mobile robots for healthcare assistance and rehabilitation • Human–robot interaction in assistive and clinical environments • AI-based planning, reasoning, and decision-making for personalized care • Knowledge representation and intelligent healthcare spaces • Edge and fog computing for real-time and privacy-preserving processing • Machine learning and federated learning for healthcare analytics • Wireless and mobile networking solutions for smart healthcare systems • Security, privacy, and trust in IoT- and robot-enabled healthcare • Ethical, legal, and social implications of intelligent healthcare technologies • Clinical validation, user acceptance, and real-world deployment W2R-HEALTH encourages contributions that present novel research results, system prototypes, experimental studies, and interdisciplinary perspectives, with the goal of advancing intelligent, secure, and human-centered healthcare environments. -------------- FEATURES - Best Paper Award, - Best-selected papers will be invited to submit an extended version to a workshop-dedicated Special Issue (SI) -------------- SUBMISSION RULES Papers must be formatted in the standard IEEE two-column format that is used by the IEEE WOWMOM 2026 main conference and must not exceed 6 pages in length (including references). All submitted papers will go through a peer review process, and all accepted papers which are presented by one of the authors at the workshop will be published in the IEEE WOWMOM 2026 proceedings and IEEE Xplore. ------------- IMPORTANT DATES Submission Deadline: March 22, 2026 Notification of Acceptance: April 12, 2026 Camera Ready: April 26, 2026 Workshop: June 16, 2026 ------------- ORGANIZING COMMITEEE Technical Program Chairs * Valeria Seidita (University of Palermo, Italy) * Marco Di Felice (University of Bologna, Italy) * Roberto Toni (Tufts University School of Medicine, Boston, MA, USA) * Stefano Borgo (Laboratory for Applied Ontology, National Research Council of Italy Web and Publicity Chair * Alfonso Esposito (University of Bologna, Italy)

1 0

CFP Announcement: 22nd Int Conf on Information & Systems Security (ICISS-2026), Dec 16-20 2026
by Madhavan Mukund 10 Mar '26

10 Mar '26

----- Forwarded message from Vishwas Patil <ivishwas(a)gmail.com> ----- From: Vishwas Patil <ivishwas(a)gmail.com> Date: Tue, 10 Mar 2026 02:42:03 +0530 CALL FOR PAPERS --------------- ICISS-2026 ---------- 22nd International Conference on Information Systems Security Chennai Mathematical Institute, Chennai, India December 16-20, 2026 The 22nd ICISS will be held at the Chennai Mathematical Institute, Chennai between December 16 and 20, 2026. ICISS provides a forum for researchers and industry practitioners to present their previously unpublished research work. Important Dates: ---------------- Submission deadline: July 10, 2026 Notification of acceptance: September 10, 2026 Camera-ready submission deadline: September 30, 2026 TPC Co-Chairs: -------------- Atul Prakash, University of Michigan, USA SP Suresh, Chennai Mathematical Institute, India A broad but non-exhaustive list of areas of interest is as below: Systems Security OS, VM, containers, cloud Network: SDN, NFV, SD-WAN IoT, RFID, SCADA systems IDS, IPS, Honeypot, Botnet Access control Authentication, Authorization PKI & Trust management Zero Trust Application Security Vulnerabilities, Malware Ransomware, APTs, MITRE Information flow control Threat Modelling, Attack graphs Security in AI/ML Adversarial learning/inputs Prompt injection, RLHF strategies Model stealing, Model poisoning Formal Methods for Security Verification of Security Protocols FM for AI/ML Models & Apps Hardware Security Remote attestation, PUFs Trojans, Backdoors, FPGA TEE, TRNG, SGX Privacy PETs, anonymization tech De-identification attacks Surveillance & Censorship Inference, correlation attacks Blockchain Cryptocurrency, stablecoins Interoperability, scalability Smart contracts, concurrency DIDs, NFTs, CBDCs, AML Emerging Tech/Standards ChatGPT, LaMDA, Dall-E 2, etc Security-by-design, SBOM STIX/TAXII Use Cases e-voting, e-gov, smart cities Healthcare, UPI payments Submissions must be written in English and must not exceed 20 pages in length using LNCS format. Submissions must be in PDF format. A double-blinded peer review process will be followed. Submission link will be available in the coming weeks. At the time of submission, you will have to: 1) declare potential conflict-of-interests with TPC members, 2) declare IRB status along with responsible disclosures while dealing with vulnerabilities and user privacy 3) declare use of Gen-AI in the work submitted for review. The proceedings will appear in the Springer LNCS series. ICISS has a best paper award. ICISS also accepts submissions under Industry/Demo track demonstrating implementations/PoC in the area of systems security, and a separate track for PhD students presenting their early/WiP through lightning talks & poster. ICISS has generous funds supporting students to attend pre-conference school (tutorials, etc.) and the main conference. Website: https://iciss.in CFP version 1 (March 10, 2026) ----- End forwarded message -----

1 0

IARCS Verification Seminar Series -- Talk by Siddhartha Prasad on March 10 at 1900 hrs IST
by VSS IARCS 09 Mar '26

09 Mar '26

Dear all, The next talk in the IARCS Verification Seminar Series will be given by Siddhartha Prasad, a PhD student in Computer Science at Brown University advised by Shriram Krishnamurthi. The talk is scheduled on Tuesday, March 10, at 1900 hrs IST (add to Google calendar <https://calendar.google.com/calendar/event?action=TEMPLATE&tmeid=NzZhaGpqZ3…> ). The details of the talk can be found on our webpage ( https://fmindia.cmi.ac.in/vss/) and also appended to the body of this email. The Verification Seminar Series, an initiative by the Indian Association for Research in Computing Science (IARCS), is a monthly, online talk-series, broadly in the area of Formal Methods and Programming Languages, with applications in Verification and Synthesis. The aim of this talk-series is to provide a platform for Formal Methods researchers to interact regularly. In addition, we hope that it will make it easier for researchers to explore newer problems/areas and collaborate on them, and for younger researchers to start working in these areas. All are welcome to join. Best regards, Organizers, IARCS Verification Seminar Series ============================================================= Title: Eventually, Understanding: Operationalizing Misconceptions in LTL Meeting Link: https://us02web.zoom.us/j/89164094870?pwd=eUFNRWp0bHYxRVpwVVNoVUdHU0djQT09 (Meeting ID: 891 6409 4870, Passcode: 082194) Abstract: Linear Temporal Logic (LTL) sits at the heart of verification and synthesis, yet even experienced users routinely misunderstand what formulas actually say. Over several years, we have studied LTL from a human-factors perspective across classrooms and controlled experiments, building instruments to surface the misconceptions people hold about its semantics and use. These studies show that misconceptions are not isolated mistakes but systematic misunderstandings that persist across levels of expertise and directly affect specification quality. This talk centers those misconceptions as the object of design. We present LTL Tutor, a lightweight, curriculum-agnostic system that operationalizes these insights into targeted practice with immediate, actionable feedback. The tutor generates exercises grounded in common misconceptions, explains errors in terms of the learner's answer versus the correct semantics, and uses a concept-based mutation engine to adaptively drill the ideas each learner struggles with. It is designed to fit into existing courses without requiring changes to teaching style, while also supporting independent learners with minimal prior instruction. By tying feedback to concrete errors and surfacing the underlying misconceptions over time, the tutor turns several years of research on how people misunderstand LTL into a practical, deployable tool for both classrooms and self-guided study. Bio: Siddhartha Prasad is a PhD student in Computer Science at Brown University, advised by Shriram Krishnamurthi. His research takes a programming-languages approach to improving how people express intent and reason about program behavior, drawing on ideas from formal methods, human-computer interaction, and cognitive science. He is especially interested in how models of human cognition can inform the design of languages, semantics, and interactive tools for understanding complex computational structures. Previously, he was a software engineer at Microsoft, where he worked both on Windows and Azure. He says that his research interests are informed by his time as an engineer. In his own words, "I have written code that doesn't do what I want it to, and I want to spare everyone else the indignity."

1 0

Call For Papers: ICTAC'26 -- 11-13 of November, 2026 -- Bariloche, Argentina
by B Srivathsan 09 Mar '26

09 Mar '26

ICTAC 2026 The 23rd International Colloquium on Theoretical Aspects of Computing 11-13 of November, 2026 Bariloche, Argentina https://ictac2026.github.io/ SCOPE The ICTAC conference series aims at bringing together researchers and practitioners from academia, industry, and government to present research and exchange ideas and experiences within theoretical aspects of computing through methods and tools for system development. ICTAC also aims to promote research cooperation between developing and industrial countries. IMPORTANT DATES Abstract deadline: 8-Jun-2026 (AoE) Submission deadline: 15-Jun-2026 (AoE) Notification: 10-Aug-2026 (AoE) Camera ready: 31-Aug-2026 (AoE) INVITED SPEAKERS Erika Ábrahám (RWTH Aachen University, DE) Pablo Barceló (Pontifical Catholic University of Chile - IMFD - CENIA, CL) Nazareno Aguirre (National University of Rio Cuarto, AR) TOPICS The conference concerns all aspects of theoretical computer science, including, but not limited to: - Languages and automata - Semantics of programming languages - Logic in computer science - Lambda calculus, type theory, and category theory - Domain-specific languages - Theories of concurrency and mobility - Theories of distributed computing - Models of objects and components - Coordination models, timed, hybrid, embedded, and cyber-physical systems - Security and privacy - Static analysis - Software verification - Software testing - Program generation and transformation - Model checking and theorem proving - Theory and methods of trustworthy AI - Applications and experiences. SUBMISSIONS We solicit submissions, related to the topics of ICTAC, in the following categories: A. original research contributions; B. short papers, with original work in progress or with proposals of new ideas and emerging challenges; and C. tool papers on tools that support formal techniques for software modeling, system design, and verification. Submissions of regular papers must not exceed 16 pages and short and tool papers should not exceed 8 pages, in both cases excluding bibliography of 2 pages maximum. Submissions must not have been published or be under consideration for publication elsewhere. All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference’s topics. All contributions to ICTAC 2026 have to be submitted electronically in PDF format via Easy Chair https://easychair.org/conferences/?conf=ictac2026 Papers must be formatted according to the guidelines for Springer LNCS papers (seehttps://www.springer.com/gp/computer-science/lncs) without modifications of margins and other space-saving measures. Authors should therefore consult Springer’s authors’ instructions and use their proceedings templates, either for LaTeX or for Word, for the preparation of their papers. Springer encourages authors to include their ORCIDs in their papers. PUBLICATION All accepted papers in categories A-C will appear in the proceedings of the conference that will be published as a volume in Springer’s Lecture Notes in Computer Science (LNCS) series. All accepted papers must be presented at the conference. Their authors must be prepared to sign a copyright transfer statement. At least one author of each accepted paper must register for the conference by the early registration date, and present the paper. GENERAL CHAIRS Carlos Lopez Pombo (National University of Río Negro - CONICET, AR) Pablo Francisco Castro (National University of Río Cuarto - CONICET, AR) PROGRAM COMMITTEE CHAIRS Pedro R. D'Argenio (National University of Córdoba - CONICET, AR) Ana Sokolova (University of Salzburg, AT) PROGRAM COMMITTEE Giovanni Bacci (Aalborg University, DK) Christel Baier (TU Dresden, DE) Gilles Barthe (MPI Institute for Security and Privacy, DE) Ezio Bartocci (TU Wien, AT) Roberto Bruni (University of Pisa, IT) Carlos Budde (DTU Computing, DK) Alessandro Cimatti (Fondazione Bruno Kessler, IT) Clemens Dubslaff (Eindhoven University of Technology, NL) Uli Fahrenberg (EPITA Research Laboratory, FR) Martin Fränzle (Carl von Ossietzky Universität Oldenburg, DE) Diego Garbervetsky (University of Buenos Aires, AR) Arnd Hartmanns (University of Twente, NL) Peter Höfner (Australian National University, AU) Justin Hsu (Cornell University, US) David N. Jansen (Institute of Software, Chinese Academy of Sciences, CN) Sebastian Junges (Radboud University, NL) Violet Ka I Pun (Western Norway University of Applied Sciences, NO) Mayuko Kori (RIMS, Kyoto University, JP) Martin Leucker (University of Lübeck, DE) Mieke Massink (CNR-ISTI, IT) Jorge A. Pérez (University of Groningen, NL) Elaine Pimentel (University College London, UK) Anne Remke (University of Münster, DE) Tamara Rezk (INRIA Côte d'Azur, Université Côte d'Azur, FR) César Sánchez (IMDEA Software Institute, ES) Gerardo Schneider (University of Gothenburg, SE) B Srivathsan (Chennai Mathematical Institute, IN) Maurice ter Beek (CNR-ISTI, IT) Rob van Glabbeek (University of Edinburgh, UK) Mahsa Varshosaz (IT University of Copenhagen, DK) Thorsten Wißmann (Friedrich-Alexander-Universität Erlangen-Nürnberg, DE) STEERING COMMITTEE Martin Leucker (Chair) (University of Lübeck, DE) Zhiming Liu (Southwest University, CN) Tobias Nipkow (Technische Universität München, DE) Augusto Sampaio (Universidade Federal de Pernambuco, BR) Natarajan Shankar (SRI, US) Tarmo Uustalu (Reykjavik University, IS)

1 0

IARCS Verification Seminar Series -- Talk by Siddhartha Prasad on March 10 at 1900 hrs IST
by VSS IARCS 03 Mar '26

03 Mar '26

Dear all, The next talk in the IARCS Verification Seminar Series will be given by Siddhartha Prasad, a PhD student in Computer Science at Brown University advised by Shriram Krishnamurthi. The talk is scheduled on Tuesday, March 10, at 1900 hrs IST (add to Google calendar <https://calendar.google.com/calendar/event?action=TEMPLATE&tmeid=NzZhaGpqZ3…> ). The details of the talk can be found on our webpage ( https://fmindia.cmi.ac.in/vss/) and also appended to the body of this email. The Verification Seminar Series, an initiative by the Indian Association for Research in Computing Science (IARCS), is a monthly, online talk-series, broadly in the area of Formal Methods and Programming Languages, with applications in Verification and Synthesis. The aim of this talk-series is to provide a platform for Formal Methods researchers to interact regularly. In addition, we hope that it will make it easier for researchers to explore newer problems/areas and collaborate on them, and for younger researchers to start working in these areas. All are welcome to join. Best regards, Organizers, IARCS Verification Seminar Series ============================================================= Title: Eventually, Understanding: Operationalizing Misconceptions in LTL Meeting Link: https://us02web.zoom.us/j/89164094870?pwd=eUFNRWp0bHYxRVpwVVNoVUdHU0djQT09 (Meeting ID: 891 6409 4870, Passcode: 082194) Abstract: Linear Temporal Logic (LTL) sits at the heart of verification and synthesis, yet even experienced users routinely misunderstand what formulas actually say. Over several years, we have studied LTL from a human-factors perspective across classrooms and controlled experiments, building instruments to surface the misconceptions people hold about its semantics and use. These studies show that misconceptions are not isolated mistakes but systematic misunderstandings that persist across levels of expertise and directly affect specification quality. This talk centers those misconceptions as the object of design. We present LTL Tutor, a lightweight, curriculum-agnostic system that operationalizes these insights into targeted practice with immediate, actionable feedback. The tutor generates exercises grounded in common misconceptions, explains errors in terms of the learner's answer versus the correct semantics, and uses a concept-based mutation engine to adaptively drill the ideas each learner struggles with. It is designed to fit into existing courses without requiring changes to teaching style, while also supporting independent learners with minimal prior instruction. By tying feedback to concrete errors and surfacing the underlying misconceptions over time, the tutor turns several years of research on how people misunderstand LTL into a practical, deployable tool for both classrooms and self-guided study. Bio: Siddhartha Prasad is a PhD student in Computer Science at Brown University, advised by Shriram Krishnamurthi. His research takes a programming-languages approach to improving how people express intent and reason about program behavior, drawing on ideas from formal methods, human-computer interaction, and cognitive science. He is especially interested in how models of human cognition can inform the design of languages, semantics, and interactive tools for understanding complex computational structures. Previously, he was a software engineer at Microsoft, where he worked both on Windows and Azure. He says that his research interests are informed by his time as an engineer. In his own words, "I have written code that doesn't do what I want it to, and I want to spare everyone else the indignity."

1 0