جست‌وجوی استاد و پژوهشگر

Farzaneh Derakhshanمشاهده پروفایل

استادیار

• Concurrency
• Formal Methods
• Programming Languages
• +۴ مورد دیگر

Farzaneh Derakhshan is an Assistant Professor in the Computer Science Department at Illinois Institute of Technology. She received her Ph.D. in Pure and Applied Logic from Carnegie Mellon University in 2021 under Prof. Frank Pfenning and completed a postdoctoral fellowship at CMU with Profs. Limin Jia and Stephanie Balzer. Her research focuses on formal methods for concurrent and secure systems. Education: Ph.D. in Pure and Applied Logic, Carnegie Mellon University (2021) Dr. Derakhshan's research explores logical foundations for concurrent program design, emphasizing correctness guarantees (safety, reactivity) and security properties (fault tolerance, side-channel protection). Current projects include modal logics for under/over-approximation, relational logic for GPU security, type systems for intermittent computing, and behavioral types for security enforcement. Her work bridges theoretical logic with practical systems challenges. Recent publications (2021-2025) reveal strong thematic continuity in concurrency, security, and formal verification. Key trends include session-typed process models for secure communication, modal type systems for intermittent computing, and logical frameworks for program assurance. These contributions demonstrate consistent innovation at the intersection of programming languages, logic, and cybersecurity. Scientific Awards: No scientific awards are mentioned in the provided text. Advising and Research Funding: Current Students: PhD: Godha Pallavi Bhogadi, Myra Dotzel, Lang Liu; Master's: Akash Madhu Former Students: Narasimha Karthik G. (MS), Griffin Colomer (BSc) Grants: NSF SaTC CORE #2350217: "Mixed Assurance Reasoning via Modal Logic" (2024) Dr. Derakhshan leads an active research group focused on programming language security, collaborating with Carnegie Mellon University researchers. She co-organizes community initiatives including the 2026 Dagstuhl Seminar on Behavioural Types for Resilience and serves on multiple program committees for top programming languages conferences.

Willem Heijltjesمشاهده پروفایل

مدرس ارشد

• Logic
• Proof Theory
• Lambda-Calculus
• +۳ مورد دیگر

Willem Heijltjes is a Senior Lecturer in the Department of Computer Science at the University of Bath. His research focuses on logic and proof theory, particularly on canonical graphical representations of proofs (proof nets) and their applications in lambda-calculus and type systems. He is actively involved in theoretical computer science, exploring foundational aspects of programming languages and computational logic. He leads the project 'Typed Lambda-Calculi with Sharing and Unsharing', funded by the Engineering and Physical Sciences Research Council (EPSRC) from 2019 to 2022. This project investigates advanced type systems and computational models, contributing to the understanding of call-by-value and call-by-name evaluation strategies in the context of linear logic and sequent calculus. His research interests span lambda-calculus, linear logic, proof nets, type systems, and programming language semantics. He has published extensively in top-tier conferences such as CSL, FSCD, and LICS, addressing topics like probabilistic termination, functional machine calculus, and normalization without syntax. He is currently accepting doctoral students in these areas. Heijltjes collaborates internationally on foundational computer science topics, including the development of combinatorial proofs and the exploration of confluence in higher-order rewriting systems.

Lars-Henrik Erikssonمشاهده پروفایل

مدرس ارشد

• Formal Methods
• Logic in Computer Science
• Programming Language Theory
• +۷ مورد دیگر

Lars-Henrik Eriksson is a Senior Lecturer in the Department of Computer Science at Uppsala University, part of the Department of Information Technology. He holds a PhD and is recognized as an Excellent Teacher and educational mentor. He currently serves as the program director for the Master's program in Computer Science and has previously held leadership roles, including Head of the Department of Computer Science from 2004 to 2018. PhD in Computer Science Excellent Teacher Award Pedagogical Mentor at Uppsala University His research focuses on the applications of logic in computer science, particularly formal methods for software development. His work spans formal specification, verification, and synthesis, with strong emphasis on logic programming, interactive theorem proving, and logical frameworks. He has made significant contributions to the use of formal methods in safety-critical domains such as railway signaling. His current research includes modeling application domains within formal methods and formalizing concurrency theory using the Isabelle proof assistant. The recent publications reflect a sustained focus on modal logics for nominal transition systems, formal verification tools (e.g., GTO), and domain-specific applications of formal methods. These works demonstrate deep integration of theoretical logic and practical software engineering, especially in distributed and safety-critical systems. The recurring themes include concurrency, verification, and the use of domain models to enhance formal reasoning. Scientific Awards and Recognitions: Excellent Teacher Pedagogical Mentor Lars-Henrik Eriksson has advised numerous students through project supervision, thesis reviews, and course mentorship, though no formal list of advisees is provided. He has been involved in significant research management, including leading the department and directing a master’s program. He has also collaborated with industry, particularly in railway signaling, contributing to safety analysis and formal verification projects with Trafikverket and through companies he co-founded. He is a board member of Formal Methods Europe and served as program committee chair for the FME Symposium 2002 (part of FLoC’02). His work bridges academia and industry, especially in the application of formal methods to real-world engineering challenges.

Nobuko Yoshidaمشاهده پروفایل

استاد

• Programming Languages
• Concurrent and Distributed Systems
• Formal Verification
• +۴ مورد دیگر

Prof. Nobuko Yoshida is the Christopher Strachey Chair of Computing at the University of Oxford's Department of Computer Science, leading the Programming Languages research theme. She joined Oxford in 2022 from Imperial College London, holding one of the oldest chairs in the department, previously held by Tony Hoare and Samson Abramsky. Her research focuses on session types , notably introducing Multiparty Session Types in 2008, which revolutionized protocol verification and earned the Most Influential POPL Paper Award (2018). Her work spans concurrent and distributed systems , formal verification, and industry collaborations with companies like Red Hat, Google, and EDF Energy. She holds EPSRC funding, is an Honorary Fellow at Glasgow University, and serves on editorial boards for leading journals like ACM Transactions on Programming Languages and Systems. Her research group develops tools such as Scribble for runtime monitoring, deployed in projects like the US Ocean Observatories Initiative. Awards include the British Computing Society Fellowship and EPSRC Established Career Fellowship. She mentors over 19 researchers who have secured academic and industry roles globally. Current students include Ari Hernawan, Kai Pischke, Jessica Richards, and Litu Zou.

Sangiorgi Davideمشاهده پروفایل

استاد

• Computer Science
• Theory of Concurrent Systems
• Theory of Distributed Systems
• +۲ مورد دیگر

Davide Sangiorgi is a Full Professor at the University of Bologna, Italy, with a distinguished career in computer science and theoretical concurrency. He has held significant roles as Director of Research at INRIA (2000), Researcher at INRIA (1995), and Research Fellow at the University of Edinburgh (1993). His work spans programming languages, distributed systems, and formal verification. Laurea (Master) in Computer Science, University of Pisa, 1987 PhD in Computer Science, University of Edinburgh, 1993 His research focuses on the theory of concurrent and distributed systems, with contributions to bisimulation, process calculi, and type systems. His publications highlight advancements in lock-freedom, environmental bisimulation, and behavioral equivalence, primarily in programming languages and concurrency theory. Key trends in his articles include the development of formal methods for concurrency, type systems for mobile processes, and the application of bisimulation in higher-order languages. His work bridges theoretical foundations with practical verification techniques in distributed systems and programming languages. Elected Chairman of IFIP Working Group 2.2 (FORMAL DESCRIPTION OF PROGRAMMING CONCEPTS) in 2005 and re-elected in 2008 Member of the Council of the Italian Chapter of the European Association for Theoretical Computer Science (EATCS), re-elected 3 times Sangiorgi has supervised 10 PhD students across France and Italy, currently advising 3. He has led 3 large EU projects and bilateral initiatives (France-USA, France-Germany, France-Italy). He co-founded the joint INRIA-University of Bologna laboratory, the first of its kind for INRIA in a foreign institution.

Gabriel Ciobanuمشاهده پروفایل

استاد

• Membrane Computing
• Natural Computing
• Distributed Systems
• +۶ مورد دیگر

Gabriel Ciobanu is a Professor at Alexandru Ioan Cuza University of Iasi, Romania, and a Senior Researcher at the Romanian Academy, Iasi. He has held various academic positions internationally including as a Visiting Professor at Newcastle University (UK) from 2010-2015 and as a Research Fellow/Professor at the National University of Singapore (2000-2004). His educational background includes PhD studies at A.I.Cuza University and Edinburgh University (1990-1994) under the mentorship of Robin Milner, and his undergraduate studies in the Faculty of Mathematics and Computer Science at A.I.Cuza University of Iasi (1977-1982). Professor Ciobanu's research focuses on Membrane Computing and Natural Computing , Distributed Systems Models including process calculi with emphasis on semantics, behavioral equivalences, logics, and verification. He has made significant contributions to bridging membrane computing and process calculi, and to the Foundations of Mathematics and Computer Science through his work on Finitely Supported Mathematics. His research has applications in theoretical computer science, formal methods, and computational biology. His publication record shows a consistent research trajectory focusing on theoretical computer science with applications to natural computing, membrane systems, process calculi, and finitely supported structures. Recent work (2023-2025) continues to explore these areas with increasing focus on multi-agent systems, continuation semantics, and applications to medical systems and reaction systems. Scientific Awards and Recognition 2013 Grigore Moisil Award, Romanian Academy (as co-author of "Mobility in Process Calculi and Natural Computing", Springer) 2010-2013 Member of the National Research Council (CNCS) in Romania 2008-2010 Royal Society of London Joint International Project (Newcastle University, School of Computing) 2004 Octav Mayer Award for Scientific Achievements, Romanian Academy of Sciences, Iasi branch 2000 Grigore Moisil Award of the Romanian Academy of Sciences for results in Theoretical Computer Science 1995-1996 Japan Society for the Promotion of Science Fellowship (Tohoku University and Kyoto University) 1994 DAAD Research Fellowship (Institute of Computer Science, University of Kiel) 1991-1992 Royal Society of London and Romanian Academy Fellowship (University of Edinburgh) Professor Ciobanu has supervised 8 PhD students and numerous master's students. He has served as Editor-in-Chief of the Scientific Annals of Computer Science since 2006 and has been a guest editor for special issues of several international journals. He has collaborated with researchers from numerous countries including UK, France, Netherlands, Spain, Italy, Russia, China, Singapore, and India. He has been involved in various research projects and has spent research periods at prestigious institutions worldwide including Edinburgh University, Universite de Paris XI, CWI and VU Amsterdam, Tohoku and Kyoto University, National University of Singapore, and Newcastle University.

Daniel Schwartzمشاهده پروفایل

استاد

• Artificial Intelligence
• Formal Methods
• Autonomous Systems
• +۳ مورد دیگر

Dr. Daniel G. Schwartz is a Professor in the Computer Science Department at Florida State University (FSU). He holds a B.A. in Mathematics from Portland State University (1969), an M.S. in Mathematics from Simon Fraser University (1974), and a Ph.D. in Systems Science from Portland State University (1981). His career includes roles as Assistant Professor at Binghamton University (1981–1983) and Florida State University (1984–1989), and Associate Professor at FSU (1989–2021) before becoming a full Professor in 2021. Dr. Schwartz's research focuses on artificial intelligence, formal methods, and autonomous systems. Key areas include nonmonotonic reasoning, fuzzy logic, and applications to mission planning for autonomous vehicles (e.g., driverless cars, unmanned naval systems). He has pioneered work on dynamic reasoning systems, qualified syllogisms, and agent-oriented epistemic reasoning. His recent projects involve secure communications for unmanned aerial vehicles (funded by the U.S. Navy) and path planning for autonomous surface/underwater vehicles with doctoral student Mohamad Imran Chowdhury. Teaching includes courses on artificial intelligence, Java programming, databases, and theoretical computer science (e.g., automata theory, formal languages). His work on network security includes a U.S. Army-funded project (2001–2006) developing case-based reasoning systems for intrusion detection. His research outputs span over 20 years, with contributions to robotics, formal logic, and fuzzy systems. Current projects emphasize autonomous vehicle navigation and event possibility theory for decision-making under uncertainty.

• Lambda Calculus
• Functional Programming
• Computational Complexity
• +۵ مورد دیگر

Beniamino Accattoli is a Researcher in Computer Science at Inria , where he has been a member of the PARTOUT team since January 2015. His work centers on higher-order computation, particularly the lambda calculus, connecting theoretical mathematics with practical implementations of functional languages. Current Projects : CANofGAS (2022–2025), COCA HOLA (2016–2021). Recent Events : Program Committee member for LSFA 2025, ICFP 2024, and FSCD 2024; lecturer at MPRI 2023–24. Research Themes : Internal : Developing mathematical theories of sharing in lambda calculus to enhance efficiency in functional language implementations. External : Establishing reasonable cost models for time and space in lambda calculus, resolving long-standing open problems in computational complexity. Scientific Awards : Distinguished Paper Award at ICFP 2022. Best Paper Award at RTA 2013. Academic Contributions : Co-inventor of the Linear Substitution Calculus , a canonical framework for higher-order computation with sharing. Proved polynomial equivalence between lambda calculus and Turing machines for time complexity with Ugo Dal Lago. Refuted token-machine conjectures and introduced environment-based machines for space complexity with Ugo Dal Lago and Gabriele Vanoni.

Stephanie Balzerمشاهده پروفایل

استادیار

• Programming Languages
• Program Verification
• Type Theory
• +۷ مورد دیگر

Dr. Stephanie Balzer is an Assistant Professor in the Principles of Programming Group at Carnegie Mellon University's School of Computer Science. Her research focuses on enabling failure-free software through formal methods like type systems and verification logics. She emphasizes compositional proofs for scalability and practical validation via software artifacts. Programming Languages Type Theory Program Verification Concurrency & Security Her recent work explores timed protocols, disentanglement logic, and multiparty session types. Articles demonstrate semantic logical relations for termination (2025), deadlock freedom in Rust embeddings (2022), and information flow control (2024). Key collaborative papers address cyclic process networks and separation logic frameworks. Scientific recognition includes: NSF CAREER Award (2025) ACM SIGPLAN Distinguished Paper (2022) ECOOP Distinguished Paper (2022) She supervises PhD candidates Yue Yao, Yinsen Zhang, and Zak Kent (with Guy Blelloch), plus Master's student Sonya Simkin. Former advisee Jules Jacobs received Cum Laude distinction at Radboud University. Active in academic service, Balzer chairs PLMW@POPL workshops and co-organizes Oregon Programming Language Summer School. She serves on program committees for LICS, POPL, and ICFP.

• Cryptography
• Security Protocols
• Formal Methods
• +۳ مورد دیگر

Pedro Miguel Adão is an Assistant Professor at the Department of Computer Science and Engineering (DEI) of Instituto Superior Técnico (IST), University of Lisbon. He holds a PhD in Mathematics from IST (2006) and a Diploma in Applied Mathematics and Computation from the same institution (2002). His research focuses on cryptography, security protocols, formal methods, quantum security, and process calculi. He has conducted research at Microsoft Research Cambridge and the INRIA-Microsoft Research Centre in Paris, and is a member of the SQIG research group. Education: PhD in Mathematics, IST - University of Lisbon (2006) Diploma in Applied Mathematics and Computation, IST - University of Lisbon (2002) Research Interests: Adão’s work spans formal verification of cryptographic protocols, computational soundness, quantum security models, and security tool development. He has contributed to frameworks for analyzing security protocols and designing secure systems. Recent work includes firewall configuration tools (Mignis) and type-based analysis of cryptographic APIs. Affiliations & Activities: Organizer of the SQIG Information Security Seminar, PC member in multiple conferences (e.g., INForum, POST), and invited researcher at international institutions. His publications address topics like computational soundness, symbolic attackers, and Bayesian network classifiers.

• Programming Languages
• Logic and Type Theory
• Logical Frameworks
• +۵ مورد دیگر

Frank Pfenning is a Professor in the Department of Computer Science at Carnegie Mellon University's School of Computer Science. With decades of active research and service in programming languages and logic communities, he maintains a significant presence across major conferences including POPL, ICFP, and ESOP. His research spans foundational work in Programming Languages , Logic and Type Theory , Logical Frameworks , Automated Deduction , and Trustworthy Computing . Recent publications reveal a strong focus on session types, substructural logics, and their applications to concurrency and distributed systems. His work bridges theoretical foundations with practical implementations for reliable communication protocols. Analysis of his publication trends shows a consistent evolution from foundational type theory toward practical applications in concurrent and distributed systems. The integration of logical frameworks with session types represents a signature research trajectory, increasingly addressing real-world challenges in protocol verification and deadlock freedom. As an active community member, Pfenning has served on numerous program committees including POPL (2016-2025), ICFP (2015-2022), and ESOP. His mentoring activities include PLMW@POPL presentations, demonstrating commitment to training next-generation researchers. His technical contributions are primarily disseminated through premier venues in programming languages research. The absence of explicit grant information in available sources suggests focus on theoretical contributions rather than large-scale funded projects, though his sustained conference participation indicates stable institutional support.

Diogo Poçasمشاهده پروفایل

استادیار

• Theoretical Computer Science
• Applied Computer Science
• Session Types
• +۵ مورد دیگر

Diogo Poças serves as Assistant Professor in the Department of Mathematics at Instituto Superior Técnico (University of Lisbon) and Researcher at Instituto de Telecomunicações since 2024. Previously, he held faculty positions at the University of Lisbon's Faculty of Sciences (2020-2024) and conducted postdoctoral research at TU München (2018-2020), demonstrating continuous academic engagement within Portugal's leading technical institution. His academic foundation includes: PhD in Mathematics from McMaster University (2014-2017) supervised by Prof. Jeffery Zucker MSc in Mathematics and Applications from Instituto Superior Técnico (2011-2013) supervised by Prof. José Félix Costa BSc in Applied Mathematics and Computation from Instituto Superior Técnico (2008-2011) Dr. Poças' research program integrates theoretical computer science with practical applications across three interconnected domains: Session Types (developing algorithms for type equivalence and communication safety in concurrent systems), Algorithmic Game Theory (analyzing equilibrium computation complexity in congestion games and auctions), and Analog Computation (modeling continuous-data computation through frameworks like the General Purpose Analog Computer). His work consistently bridges formal methods with real-world computational challenges. His publication record reveals a cohesive research trajectory where session type theory advances directly inform game-theoretic mechanism design. Recent papers demonstrate growing sophistication in handling higher-order polymorphic types while simultaneously addressing fundamental questions in auction revenue maximization and congestion game equilibria, indicating a unique interdisciplinary approach to computational theory. No scientific awards or fellowships are documented in available sources. Dr. Poças has mentored students through teaching assistant roles (2013-2015) and supervised his own MSc thesis on stochastic oracle complexity. Current research funding derives from his affiliations with LASIGE (2020-2024) and Instituto de Telecomunicações, though specific grant mechanisms remain unspecified. He contributes to Portugal's computational research ecosystem through Instituto de Telecomuncações, building on prior work with LASIGE where he developed theoretical frameworks now reflected in his recent publications on session types and game equilibria.

Marek Czachorمشاهده پروفایل

استاد

• Quantum Mechanics
• Relativity
• Computational Linguistics
• +۳ مورد دیگر

Professor Marek Czachor is affiliated with the Institute of Physics and Applied Informatics at Gdańsk University of Technology . His research spans quantum mechanics, relativity, and mathematical physics. He explores connections between quantum foundations, computational linguistics, and electromagnetic phenomena. Recent publications reveal interdisciplinary work: (1) 2025 studies relativistic effects on exponential decay patterns linked to Zipf-Mandelbrot laws; (2) 2025 quantum cosmology formalism with timelike hyperlayers; (3) 2024 hidden tensor structures in Hilbert spaces; (4) 2024 local hidden-variable models challenging Bell's theorem; (5) 2023 fractional calculus in electromagnetics. His work demonstrates mathematical unification across diverse domains. Email: mczachor@pg.edu.pl .

• Type Systems
• Formal Methods
• Set Theory
• +۳ مورد دیگر

Joe Wells is a Senior Research Fellow at the School of Mathematical & Computer Sciences, Department of Computer Science, Heriot-Watt University. His research focuses on type systems, formal methods, and foundational aspects of computer science and mathematics. He has contributed to areas including calculi, set theories, and formal proof environments. His research interests include the theoretical underpinnings of programming languages, mathematical logic, and the development of tools for semantic markup of mathematical documents. His work often intersects with automated reasoning and formal verification systems. Wells has been recognized with the 2018 Global Learning and Teaching Award (Highly Commended) for contributions to educational excellence. His recent publications explore topics such as generalized set theories and type systems, demonstrating a commitment to advancing foundational computer science research.

Liyi Liمشاهده پروفایل

استادیار

• Formal Methods
• Programming Languages
• Software Engineering
• +۴ مورد دیگر

Liyi Li is an Assistant Professor in the Department of Computer Science at Iowa State University. He holds a Ph.D. from the University of Illinois at Urbana-Champaign, where his research focused on compiler verification and formal methods. After completing his postdoctoral work at the University of Maryland, he expanded his research to include quantum computing, software engineering, and compiler optimization. Education: B.S. in Computer Science, University of Illinois at Urbana-Champaign (2012) M.S. in Computer Science, University of Illinois at Urbana-Champaign (2014) Ph.D. in Computer Science, University of Illinois at Urbana-Champaign (2020) Research Interests: Liyi Li’s work bridges formal methods, programming languages, and quantum computing. Key areas include quantum program verification, compiler correctness, memory-safe dialects (e.g., Checked C), and distributed quantum systems. He emphasizes applying formal techniques to ensure software reliability and security. Awards: 2020 UMD Victor Basili Postdoctoral Fellowship 2019 UIUC Spring Outstanding Teaching Assistant Award 2012 UIUC University Honor (Bronze Tablet) Grants & Advising: Co-PI for NSF Grant NQVL:QSTD (2024–2025) focusing on quantum analog pathways PI for NSF Grant CCF-2422127 (2024–2027) on Just-in-Time Verification Advises over 13 students, including PhD candidates at Iowa State, University of Maryland, and William & Mary Collaborations: Liyi Li collaborates with institutions such as the University of Maryland and works with researchers like Mingwei Zhu and Xiaodi Wu on quantum verification and compiler optimization tools.