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

Brigitte Pientkaمشاهده پروفایل

استاد

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

Brigitte Pientka is a Professor at McGill University's School of Computer Science , where she leads the Computation and Logic group . She earned her PhD from Carnegie Mellon University in 2003 and previously studied at the University of Edinburgh and Technical University of Darmstadt. Education PhD in Computer Science, Carnegie Mellon University (2003) University of Edinburgh Technical University of Darmstadt Research Interests Her work focuses on the theoretical and practical foundations for building reliable software systems, combining logic, type theory, and verification with system-building. Key areas include: Type Theory and Dependent Types Logical Frameworks and Mechanized Metatheory Session-Typed Concurrency and Linear Logic Metaprogramming and Contextual Type Systems Theorem Proving and Formal Verification Functional Programming and Language-Based Security Professional Roles She has served as: PC Chair for ICFP'24 and CPP'24 General Chair for POPL'20 Executive Editor of Logical Methods in Computer Science Steering Committee Member for LICS, POPL, and ESOP Scientific Awards Dr. Pientka has received: Test of Time Award at PPDP'18 Humboldt Fellowship for research at MPI-SWS, Germany Labs & Teams She actively develops the Beluga programming language , a tool for mechanizing meta-theory proofs and type-driven program manipulation.

• Software Verification
• Formal Methods
• Program Synthesis
• +۴ مورد دیگر

Madhusudan Parthasarathy is a Professor in the Department of Computer Science at the University of Illinois at Urbana-Champaign, College of Engineering. His research focuses on software verification, formal methods, and logic in computer science, with significant contributions to trustworthy AI systems, program synthesis, and security. Ph.D. in Theoretical Computer Science (2002), Institute of Mathematical Sciences, University of Madras Research interests include automating software verification, building correct-by-design systems, and exploring synergies between machine learning and program synthesis. He pioneered visibly pushdown languages , impacting XML processing and program verification. His tools like VEX and Strand advanced security and heap reasoning. Recent articles focus on blockchain verification, timed automata, and learning logics from data. His work has been widely cited, with the visibly pushdown language paper alone generating over 940 scholarly entries. Best Paper Award, 19th USENIX Security Symposium (2010) He has advised numerous students and postdocs, with former advisees now at institutions like Purdue University and Google. His outreach initiatives include the ConTraIL privacy-preserving contact tracing project and the MASSIVELY EMPOWERED CLASSROOMS MOOC platform for Indian undergraduates. He teaches courses like CS 521: Advanced Topics in Programming Systems and CS 474: Logic in Computer Science , while actively serving on program committees for top-tier conferences such as POPL and PLDI.

• Statistical Relational Learning
• Machine Learning
• Probabilistic Graphical Models
• +۵ مورد دیگر

Lise Getoor is a Professor in the Department of Computer Science at the University of California, Santa Cruz, within the Baskin School of Engineering. She previously held positions at the University of Maryland, College Park and has established herself as a leading researcher in statistical relational learning and neuro-symbolic artificial intelligence. Her research focuses on developing principled approaches to reasoning and learning with rich, relational data. She has made significant contributions to probabilistic soft logic, statistical relational learning, knowledge graph construction, and the integration of symbolic and neural approaches to AI. Her work bridges theoretical foundations with practical applications in areas including social network analysis, sustainable recommendations, cyberbullying detection, and fair machine learning systems. Analysis of her recent publications reveals a strong trend toward neuro-symbolic integration, with increasing focus on combining neural networks with logical reasoning frameworks. Her research demonstrates consistent innovation in developing scalable algorithms for structured prediction across diverse application domains while addressing critical issues of fairness and interpretability in AI systems. Professor Getoor has advised numerous PhD students who have become active contributors to the field, including Connor Pryor, Charles Dickens, Eriq Augustine, and Varun Embar. Her research has been supported by multiple grants from major funding agencies, though specific details aren't provided in the current data. She leads research in the Statistical Relational AI (StaRAI) Lab at UC Santa Cruz, where her team develops frameworks that combine logical reasoning with probabilistic modeling to address complex real-world problems requiring both structured knowledge and statistical learning.

Peter Dybjerمشاهده پروفایل

استاد

• Intuitionistic Type Theory
• Categorical Type Theory
• Proof Assistants
• +۹ مورد دیگر

Peter Dybjer is a Professor of Computing Science at the Department of Computer Science and Engineering, Chalmers University of Technology in Sweden. He is a leading researcher in the field of type theory, with a focus on intuitionistic type theory, categorical semantics, and proof assistants. His work bridges foundational aspects of mathematics and computer science, emphasizing constructive methods and formal verification. Research Interests: Intuitionistic Type Theory and its categorical semantics Proof assistants and formal verification Inductive and inductive-recursive definitions Game semantics and normalization techniques Dependent type systems and their applications Homotopy Type Theory and univalent foundations Activities & Contributions: Editor of the Bulletin of Symbolic Logic Member of program committees for conferences like TYPES, FSCD, and MFPS Keynote speaker at events including the European Congress of Mathematics and the Hausdorff Research Institute's Summer School on Types, Sets, and Constructions Initiated and directed the Master's Program in Computer Science – Algorithms, Languages, and Logic at Chalmers Teaching & Outreach: Professor Dybjer has taught advanced courses at international summer schools, including: Inductive Definitions in Constructive Type Theory (TYPES Summer School, 2005) Dependent Types at Work (LerNet Summer School, Uruguay, 2008) Normalization by Evaluation (Midlands Graduate School, 2009 and 2015)

James Brotherstonمشاهده پروفایل

استاد

• Logic
• Computation
• Separation Logic
• +۵ مورد دیگر

James Brotherston is Professor of Logic and Computation in the Programming Principles, Logic and Verification Group (PPLV) at University College London's Department of Computer Science. His research spans logic, computation, and verification, with a focus on separation logic, cyclic proofs, and automated reasoning for program correctness. Research interests include: Foundations of program verification using separation logic Automated reasoning via cyclic proof systems Concurrency and deadlock detection Formal methods for security and resource management Applications of substructural logics in computer science His publications demonstrate consistent focus on logical foundations of verification, with recent work expanding into concurrency testing and atomic operations compatibility. Trends include theoretical advances in proof systems alongside practical verification tools. Scientific awards and grants: Facebook Testing and Verification Research Award (2019) £6M EPSRC Programme Grant for IRIS project (2018-2024) Facebook Faculty Grant (2015) Multiple EPSRC fellowships and grants totaling over £1.2M (2008-2017) He has supervised 12+ PhD students and research fellows, with current students working on verification of concurrent systems. Leads research in the PPLV group and collaborates internationally on logical frameworks.

• Computational Sociology
• Social Movements
• Gender and Sexuality Studies
• +۵ مورد دیگر

Laura Nelson is an Associate Professor in the Department of Sociology at the University of British Columbia and Director of the Centre for Computational Social Science. She specializes in computational sociology, social movements, gender studies, and intersectionality, employing text analysis, machine learning, and network methods to study organizational inequality, STEM equity, and historical activism. Education: PhD (2014) - University of California, Berkeley MA (2009) - University of California, Berkeley BA (2006) - University of Wisconsin-Madison (Phi Beta Kappa) Her research spans feminist movements, environmental activism, and computational methods, with a focus on combining quantitative analysis with qualitative interpretation. Current projects include studying gender-equity idea diffusion in higher education networks (funded by an NSF grant), analyzing social movement media coverage, and developing frameworks for computational grounded theory. Key publication trends reveal interdisciplinary work across gender studies , computational social science , historical sociology , and organizational equity . Articles frequently utilize machine learning , text mining , and network analysis to examine intersectionality , activism cycles , and institutional change . Scientific Awards: Best Meta-Reviewer, 12th International Conference on Social Informatics (2020) Outstanding Faculty of the Year at Northeastern University (2020) As a methodological innovator, she has advised graduate students like Jinyang Yu and developed courses on Python/R for social scientists, computational text analysis, and sociological theory. Her work appears in journals such as American Sociological Review , Signs , and Social Science Quarterly , with replication repositories available on GitHub and Zenodo.

Nikolaos Papaspyrouمشاهده پروفایل

استاد

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

Nikolaos Papaspyrou is a Professor at the School of Electrical and Computer Engineering of the National Technical University of Athens (NTUA) and a member of the Software Engineering Laboratory . His research focuses on the theory and implementation of programming languages, including semantics, type systems, compilers, static analysis, and formal verification. Since October 2021, he has been on leave from NTUA, working as a Software Engineer for Google in the memory management team for the V8 JavaScript and WebAssembly engine. He previously served as Director of the Division of Computer Science (2017-2019) and was on sabbatical with Google's compiler group in Munich (2015-2016). His work includes the RELEASE project (EU FP7 STREP) for reliable large-scale server software and uncertainty handling in distributed databases (European Social Fund). Ph.D. and Diploma in Electrical and Computer Engineering from NTUA M.Sc. in Computer Science from Cornell University His research interests span programming languages , software engineering , and formal verification , with recent publications on coinductive proofs in Liquid Haskell, concurrency semantics, and quantum compilation. He has supervised over 50 diploma projects and mentored numerous students now at institutions like MIT, Princeton, and UC Berkeley. Awards include conference organizing and program committee roles, though no formal scientific prizes are listed.

Kadir Vardarمشاهده پروفایل

دانشیار

• Power Electronics
• Embedded Systems
• Renewable Energy Systems (PV)
• +۳ مورد دیگر

Assoc. Prof. Dr. Kadir Vardar is an Associate Professor at the Department of Electrical and Electronics Engineering, Faculty of Engineering, Dumlupınar University. He has held academic and administrative roles since 2012, including Vice President of Department (2015–2019). His research focuses on power electronics, embedded systems, renewable energy, and neural network applications in control systems. Education: BSc (2001) and MSc (2004) from Dumlupınar University; PhD (2011, English Program) from Dokuz Eylül University. Projects: Over 15 projects, including TÜBİTAK-funded initiatives on smart home automation, PV inverters, and embedded HIL simulators. Awards: 2011 Dokuz Eylül University Doctoral Publication Honor Award; 2001 Department First Place at Dumlupınar University. Research interests span power electronics (inverters, active filters), renewable energy systems (PV), and embedded systems (STM32, microcontrollers). He has published 29 articles and supervised multiple theses. Current courses include Power Electronics, Advanced Microcontrollers, and System Programming.

Sylvain Conchonمشاهده پروفایل

استاد

• Formal Methods
• Automated Deduction
• Program Verification
• +۱۰ مورد دیگر

Sylvain Conchon is a Professor at Université Paris-Saclay, affiliated with the Laboratoire Méthodes Formelles (LMF, UMR 9021) and the Toccata research team, a joint project with INRIA Saclay – Île-de-France. His work lies at the intersection of formal methods, automated reasoning, and software verification. Research Interests: His primary research areas include SMT solving, automated deduction, program verification, model checking for parameterized systems, and information flow analysis. He develops theoretical foundations and practical tools to ensure software correctness, particularly in safety-critical and concurrent systems. Publications and Tools: His recent work centers on projects like BPI IDemo ARGOS (2024) and PEPR Secureval (2022), focusing on industrial software verification and cybersecurity. He is the main developer of Alt-Ergo , an SMT-based theorem prover, and Cubicle , a model checker for parameterized systems. His publications span formal methods, logic in computer science, and static analysis, with a strong emphasis on tool building and application. Scientific Awards: Advising and Grants: He has advised several PhD students including Guillaume Girol, Alain Mebsout, and Mohamed Iguernelala. He has led and participated in numerous research projects funded by ANR, FUI, PEPR, and industrial partners, demonstrating sustained grant success in formal methods and verification. Labs and Teams: He is a core member of the Toccata team at INRIA Saclay and the LMF laboratory, where he collaborates on advancing the state-of-the-art in deductive program verification and automated reasoning.

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

استادیار

• Programming Languages
• Type Theory
• Category Theory
• +۱۰ مورد دیگر

Daniel Gratzer is an assistant professor in the Department of Computer Science at Aarhus University, affiliated with the Logic and Semantics group. He studies programming languages and type theories through category theory, focusing on dependent, modal, and homotopy type theory. He co-teaches graduate courses on type theory and maintains a forthcoming textbook with Carlo Angiuli. Daniel is visiting Oxford from August 2024 to February 2025. His research explores applications of modal type theory to synthetic (∞,1)-category theory, guarded type theory for denotational semantics, and categorical methods in program logics like Iris. He collaborates with researchers including Carlo Angiuli, Lars Birkedal, and Jonathan Sterling. Recent work includes publications at LICS 2025, FoSSaCS 2025, and LMCS 2025. He contributed to the development of proof assistants like mitten and formal verification tools for higher-order concurrent separation logic. Contact: gratzer@cs.au.dk

Elena Zuccaمشاهده پروفایل

دانشیار

• Programming Languages
• Type Systems
• Formal Semantics
• +۶ مورد دیگر

Elena Zucca is an Associate Professor in the Department of Computer Science, Bioengineering, Robotics and Systems Engineering (DIBRIS) at the University of Genoa, Italy. She has a strong research focus on programming languages, particularly in the areas of type systems, formal semantics, and coinduction. Her work bridges theoretical foundations with practical implementations, as evidenced by her publications on topics like Featherweight Java, corecursion, and soundness proofs for programming language features. Her research interests span the theoretical and practical aspects of programming languages. She investigates the formal semantics of programming constructs, particularly focusing on the boundaries between finite and infinite computations. Her work on coinduction and corecursion explores how to safely handle infinite data structures and computations. She has made significant contributions to understanding soundness in programming language features, especially in relation to resource-aware semantics. Her research often combines theoretical foundations with practical implementations, as seen in her work on Featherweight Java extensions and effect systems. Analysis of her recent publications reveals a consistent focus on advanced type systems and semantics. Her work explores the theoretical boundaries of programming language features while maintaining practical relevance. A recurring theme is the relationship between finite and infinite computations, with particular attention to soundness guarantees. Her research has evolved from foundational work on lambda calculus and object-oriented programming toward more specialized topics like graded types, coeffects, and resource-aware semantics. Elena Zucca has been actively involved in the programming languages research community, serving on program committees for major conferences including SPLASH, ECOOP, and POPL. She has mentored students through doctoral courses on Declarative Programming and (Co)Induction. Her research has been supported through participation in various academic programs, including the SEPL research program mentioned in her course materials. She teaches a diverse range of courses at the University of Genoa, from undergraduate to doctoral levels. Her teaching portfolio includes Automata Theory and Computability, Algorithms Analysis and Design, Principles and Paradigms of Programming Languages, and specialized doctoral courses on Declarative Programming and (Co)Induction. Her courses often reflect her research interests, covering theoretical foundations of programming languages, formal methods, and advanced programming paradigms.

Corrado Loglisciمشاهده پروفایل

استادیار

• Temporal Data Mining
• Temporal Learning
• Textual Data Mining
• +۱۳ مورد دیگر

Corrado Loglisci is an Assistant Professor at the Department of Computer Science, University of Bari Aldo Moro, Italy. His research focuses on Temporal Data Mining , Machine Learning , and Quantum Computing , with applications in bioinformatics, medical informatics, and cybersecurity. He earned his Ph.D. in Computer Science with a thesis on temporal projection in longitudinal data. Research Highlights : Temporal Learning, Textual Data Mining, Quantum-Classical Hybrid Systems Collaborations : IRSTEA Research Institute (France), Aristotle University of Thessaloniki (Greece) His publications address dynamic network analysis , emotion detection in social media , and quantum-enhanced classification . He contributes to program committees and journal editorial work, including a special issue on Mining Complex Patterns in the Journal of Intelligent Information Systems . Notable contributions include the jKarma framework for change detection and studies on concept drift robustness in intrusion detection systems. His work spans European/National research projects, leveraging machine learning for tasks like mobile crowd sensing trustworthiness prediction (2020) and investor behavior analysis (2023-2025).

Greg Morrisettمشاهده پروفایل

استاد

• Programming Languages
• Software Security
• Formal Verification
• +۴ مورد دیگر

Greg Morrisett is the Jack and Rilla Neafsey Dean and Vice Provost of Cornell Tech, a graduate campus in New York City focusing on technology, business, law, and design. Previously, he served as Dean of Computing and Information Sciences at Cornell University and held the Allen B. Cutting Chair in Computer Science at Harvard University (2004–2015). He earned a B.S. from the University of Richmond and M.S./Ph.D. from Carnegie Mellon University. His research focuses on programming language technologies for secure, reliable software systems, including typed assembly language, proof-carrying code, and provably correct compilers. Notable projects include CertiCoq, GoNative, and CRASH-SAFE. He is an ACM Fellow and recipient of awards such as the Presidential Early Career Award and NSF Career Award. He has advised over 17 PhD students and mentored numerous postdocs. His work spans formal verification, cryptographic protocols, and secure systems design. Morrisett has served on editorial boards for journals like Communications of the ACM and advisory councils for NSF, DARPA, and Microsoft Research. Current research includes formal verification of cryptographic protocols with the INRIA Prosecco Team and advancing compiler correctness through projects like CertiCoq.

Laura Kovacsمشاهده پروفایل

استاد

• Automated Reasoning
• Program Analysis
• Symbolic Summation
• +۵ مورد دیگر

Laura Kovacs is a full Professor at TU Wien's Faculty of Informatics, where she serves as head of the FORSYTE research unit focused on Automated Program Reasoning. She also holds a part-time associate professorship at Chalmers University of Technology in Sweden. As a leading researcher in automated reasoning, she was recently elected President and Chair of the ETAPS steering committee (2025) and has received prestigious awards including ERC Consolidator and Starting Grants. TU Wien, Faculty of Informatics (2016-present) Chalmers University of Technology, Sweden (part-time) Postdoctoral researcher at EPFL and ETH Zurich (2007-2010) FWF Hertha Firnberg Research Fellow (2010-2013) Her research spans automated theorem proving, program analysis, symbolic summation, and computer algebra, with a particular focus on developing theoretical foundations and practical tools for software verification. She is best known as co-developer of the Vampire theorem prover, which recently made history by winning all eight divisions at the CASC competition in 2025. Her recent publications demonstrate strong activity in first-order reasoning, quantifier handling, and security applications, with notable work including the Amazon-funded FOREST project (2020) and QuAT (2023). The 2025 CAV conference awarded her co-authored paper 'The Vampire Diary' a Distinguished Paper Award, highlighting continued leadership in the field. ERC Consolidator Grant 2020 for 'ARTIST: Automated Reasoning with Theories and Induction for Software Technology' Wallenberg Academy Fellowship (2014) ERC Starting Grant (2014) Amazon Research Awards (2020, 2023) Distinguished Paper Award at CAV 2025 Professor Kovacs actively supervises PhD students working on cutting-edge topics in automated reasoning, with recent successful defenses including Márton Hajdu's 'Redundancy, Rewriting, and Induction' (2025) and Sophie Rain's 'Automated Security Analysis of Blockchain Protocols' (2025). She leads the newly established Doctoral College on Automated Reasoning at TU Wien, which received FWF funding for 13 doctoral positions focusing on security and AI applications. As head of FORSYTE, she oversees research in automated program reasoning, working closely with colleagues on projects spanning software model checking, static analysis, and formal methods for distributed systems. Her group has established strong industry connections, particularly with Amazon through the Amazon Research Awards program.

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.