The 7th FSCD (International
Conference on Formal Structures for Computation and Deduction)
will be held in Haifa, August 2-5, 2022, as part of FLoC
2022, with workshops on the preceding two days.
FSCD is a series of annual conferences, started in 2016, which merged and superseded two long-running conferences:
Building on the RTA and TLCA communities, FSCD updates and modernizes the RTA and TLCA core topics and broadens their scope to closely related areas in logics, models of computation (e.g. quantum computing, probabilistic computing, homotopy type theory), semantics and verification in new challenging areas.
FSCD 2022 is the 7th edition of FSCD and accepts submissions in two categories: (1) original and unpublished regular research papers presenting original and unpublished research; (2) system descriptions about software tools.
Previous editions of FSCD have been held at:
FSCD stands by a Code of Conduct.
A special session celebrating Frank Pfenning's contributions on the occasion of his (belated) 60th birthday will take place during the workshop, jointly organized by FSCD and the Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (see below), and open to those registered for either event.
|Cynthia Kop, Radboud University Nijmegen,|
Cutting a proof into bite-sized chunks: Incrementally proving termination in higher-order term rewriting
|Cynthia Kop is an assistant professor at the Institute in Computing and Information Sciences of Radboud University Nijmegen. She received her Bachelor and Masters degrees in Nijmegen, and her PhD at the Free University Amsterdam in 2012. After doing postdocs in Innsbruck and Copenhagen, she returned to Nijmegen in 2017. Her research interests are centered around term rewriting, in particular higher-order term rewriting. This includes both the automated analysis of term rewriting systems (e.g., termination and complexity) and the use of term rewriting systems as a tool in other domains.|
|Alwen Tiu, The Australian National University,
A methodology for designing proof search calculi for non-classical logics
|Alwen Tiu is an associate professor at the School of Computing, the Australian National University. He obtained his PhD degree from Pennsylvania State University. He spent about a year as a visiting student at Ecole Polytechnique (France) during his PhD. After his PhD, he did a one-year postdoc at LORIA/INRIA Lorraine, prior to joining ANU in 2006. Between 2013-2017 he worked as an assistant professor at Nanyang Technological University (Singapore), before re-joining ANU in 2017. His research interests span theoretical as well as practical aspects of computer science, most notably, proof theory, concurrency theory, security protocol verification and language-based security. He is currently Area Editor for proof theory for ACM Transactions on Computational Logic.|
|Orna Kupferman, Hebrew University (FLoC plenary speaker)|
|Catuscia Palamidessi, INRIA Saclay and LIX (FLoC keynote speaker)|
Several one- and two-day workshops will be held as satellite events prior to the conference proper.