Programming Language Validation and Verification Professors and Supervisors | ApplySharif

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

استاد راهنما، استاد دانشگاه یا پژوهشگر مناسب برای مسیر پژوهشی‌تان را پیدا کنید و با او ارتباط بگیرید.

نمایش ۷۲۱-۷۳۵ از ۸۰۸ استاد راهنما

اطلاعات این پروفایل‌ها از صفحات عمومی دانشگاه‌ها جمع‌آوری شده و ممکن است به‌روز نباشد.

Sandrine Blazyمشاهده پروفایل

استاد

InriaFrance

Sandrine Blazy is a Professor at the University of Rennes , where she teaches mechanized semantics (in Coq), functional programming (in OCaml), formal methods (using Why3), and software vulnerabilities. She is a member of the CELTIQUE and Epicure project-teams, both affiliated with Inria Rennes and IRISA laboratory. Her research focuses on formal verification of compilers and program transformations, notably through the CompCert compiler and Versaco static analyzer. Education : HDR (Habilitation à Diriger des Recherches) in Computer Science, Université d'Évry Val d'Essonne (2008). Research Interests : Her work ensures mathematical guarantees in compiler correctness, preventing security bugs during program translation. She specializes in deductive verification , static analysis , and software security , with applications in critical systems like avionics and cryptography. Scientific Awards : CNRS Silver Medal (2023) Lucas Award from Formal Methods Europe (2023) ACM SIGPLAN Programming Languages Software Award (2022) ACM Software System Award (2021) Best Paper Award at FMTea 2014 La Recherche Award in Information Sciences (2011) Advising and Grants : She has advised numerous PhD students (e.g., Solène Mirliaz, Aurèle Barrière) and led research projects like Scrypt (secure compilation for cryptography), ERC VESTA (verified static analysis), and VERASCO (formal verification of compilers). Her grants include ANR and FNRAE funding. Labs and Teams : Actively involved in IRISA CNRS UMR 6074 as deputy director (2021), and collaborates with Inria Rennes and CNRS project teams.

پروفایل رسمی دانشگاه

Işıl Dilligمشاهده پروفایل

دانشیار

InriaFrance

Işıl Dillig is an Associate Professor in the Department of Computer Science at the University of Texas at Austin, leading the UToPiA research group. She focuses on programming languages, with emphasis on static analysis, verification, and synthesis to enhance software reliability and security. Education: BS, MS, PhD in Computer Science from Stanford University Her research addresses critical challenges in: Program analysis for security and correctness Automated program synthesis for complex tasks Verification of concurrent and database-driven systems Recent publications span neurosymbolic synthesis, database integration, and smart contract optimization. Trends include hybrid AI-formal methods approaches and domain-specific language design. Scientific recognition includes: Sloan Fellowship NSF CAREER award She actively contributes to academic leadership as committee member, program chair, and keynote speaker in top conferences like PLDI, OOPSLA, and POPL.

پروفایل رسمی دانشگاه

Nikita Kovalمشاهده پروفایل

پژوهشگر

InriaFrance

Nikita Koval is a Researcher at JetBrains , specializing in concurrent programming, Kotlin coroutines, and testing frameworks. His work bridges academic research with industrial application, focusing on synchronization primitives, lock-free data structures, and JVM-based concurrency tools. Academic rank: Researcher Affiliation: JetBrains Research interests include: Concurrent algorithm design and optimization Formal verification of synchronization mechanisms Testing frameworks for JVM-based languages Memory-efficient lock-free data structures Scalability in coroutine communication Distributed systems debugging Publication trends show a focus on Kotlin coroutines, JVM concurrency, and testing frameworks like Lincheck. His work spans algorithm design (union-find, queues), formal verification (CQS), and practical tools for concurrency testing (Lincheck) across conferences like PPoPP, PLDI, and ECOOP. Scientific recognition: Nikita received the Best Paper Award at OPODIS 2019 for his work on concurrent union-find algorithms. His contributions to Lincheck and CQS have been adopted into Kotlin's core libraries. Workshop leadership: He offers a 4-day corporate workshop on concurrent algorithms, covering testing, debugging, and implementation of lock-free data structures, now booked for Q3/Q4 2025. The curriculum includes hands-on Java/Kotlin coding with topics like segment queues, fetch-and-add queues, flat combining, and concurrent hash tables.

پروفایل رسمی دانشگاه

Peisen Yaoمشاهده پروفایل

پژوهشگر

InriaFrance

Peisen Yao is an academic researcher affiliated with Zhejiang University in China. His work spans programming languages, software engineering, and cybersecurity, with a focus on developing techniques to enhance software security, usability, and performance. He actively contributes to premier conferences as a committee member (e.g., PLDI, ICSE, ASE, ISSTA, OOPSLA, SAS). Research Focus: Yao's research integrates program analysis, verification, synthesis, and optimization. Key areas include: Advanced static analysis for security vulnerabilities (e.g., buffer overflows, divide-by-zero errors) Efficient symbolic abstraction and SMT solver testing Context-sensitive program analysis using formal language theory Automated invariant generation and code synthesis Publication Trends: His 15 most recent articles (2021–2025) emphasize scalable program analysis techniques, security validation, and practical tools for industry applications. Common themes include static analysis optimizations, formal verification, and novel testing methodologies for complex systems.

پروفایل رسمی دانشگاه

Daniel W. Barowyمشاهده پروفایل

دانشیار

InriaFrance

Daniel W. Barowy is an Associate Professor in the Department of Computer Science at Williams College . His research focuses on programming languages , particularly end-user programming , crowdsourcing , and spreadsheet debugging . He integrates program analysis with statistical techniques to improve software usability and robustness. Current affiliations: Williams College (2017-present) Education: University of Massachusetts Amherst (PhD, 2017) His research explores language abstractions for human-computer integration , with notable projects like ExceLint (spreadsheet error detection), FlashRelate (spreadsheet data extraction), and Riker (incremental build systems). He emphasizes artifact verification , securing PLDI 2015 Distinguished Artifact Award and USENIX ATC 2022 Best Paper . Recent publications demonstrate trends in spreadsheet reliability , crowdsourcing frameworks , and scalable educational tools . He has received "Artifact Verified" badges for multiple projects and actively contributes to software tool development , including AutoMan , ExceLint , and CheckCell . USENIX ATC 2022 Best Paper PLDI 2015 Distinguished Artifact Award Multiple "Artifact Verified" badges As an educator, he teaches CSCI 334: Principles of Programming Languages and CSCI 331: Computer Security . His work bridges theoretical PL research with practical applications in spreadsheet programming and crowdsourcing platforms .

پروفایل رسمی دانشگاه

Julia Belyakovaمشاهده پروفایل

پژوهشگر

InriaFrance

Julia Belyakova is a Postdoctoral Researcher at Purdue University since 2023, focusing on type theory and programming languages. She earned her Ph.D. in Computer Science from Northeastern University (2023) and an M.S. from Southern Federal University (2014). Current Position: Postdoc, Purdue University Ph.D. Institution: Northeastern University Education: M.S. in Computer Science from Southern Federal University Her research spans type theory, programming languages, theorem proving, generic programming, compiler construction, and software testing . Recent work includes formalizing subtyping in Julia, analyzing type stability for JIT compilation, and type-theoretic approaches to program incorrectness. Trends in her publications emphasize empirical validation of type systems and compiler optimizations for dynamic languages. She has served on program committees for OOPSLA Review Committee (2025), TyDe Program Committee (2024), and ARRAY Committee (2024). No formal scientific awards are documented in the provided text.

پروفایل رسمی دانشگاه

Michele Chiariمشاهده پروفایل

پژوهشگر

InriaFrance

Michele Chiari is a researcher at TU Wien (Vienna University of Technology) specializing in formal methods, software verification, and approximate computing. With active contributions to academic conferences like SPLASH, ICFP, and ECOOP, they combine theoretical rigor with practical applications in programming language design and analysis. Research Focus Temporal logic and model checking Probabilistic program inference Floating-point verification techniques Parallel parsing algorithms Conference Involvement 2025: Member of OOPSLA Review Committee (SPLASH conference) 2025: Program Committee member for VORTEX-track 2024: Committee Member in VORTEX conference 2023: External Reviewer for ECOOP Research Papers-track Publications 2025: Boosting Parallel Parsing through Cyclic Operator Precedence Grammars (SLE track) 2025: Exact Inference for Nested Discrete Probabilistic Programs (LAFI track) 2021: Verification of Floating-Point C/C++ Programs with math.h/cmath Functions (ICSE Journal-First Papers)

پروفایل رسمی دانشگاه

Karine Even-Mendozaمشاهده پروفایل

مدرس

InriaFrance

Karine Even-Mendoza is a Lecturer at King's College London specializing in software reliability, with active contributions to SPLASH, ASE, and ISSTA conferences. Her research bridges traditional software engineering with emerging domains like quantum computing and green software. Her research interests focus on: Advanced testing methodologies (Fuzzing, Model Checking) Machine Learning integration for test generation Quantum software validation Energy-efficient computing solutions Recent publications (2020-2025) reveal a strategic evolution from compiler testing foundations to ML-augmented quantum and green computing research. This progression demonstrates consistent innovation in software reliability while addressing industry-critical challenges in emerging technologies. As a Lecturer, she actively supervises student projects and conference submissions. Her involvement in conference organization (SPLASH, ICTSS) and industry collaborations (eBay, IBM legacy) provide students with real-world exposure to software engineering challenges. Her research group develops practical tools like CsmithEdge and SearchGEM5, maintaining strong GitHub engagement for open-source contributions to compiler and simulator testing.

پروفایل رسمی دانشگاه

Stefan Grunerمشاهده پروفایل

استاد

Western Norway University of Applied SciencesNorway

Stefan Gruner is a Professor in the Department of Computer Science, Faculty of Engineering, Built Environment and Information Technology, at the University of Pretoria, South Africa. He holds advanced degrees in Informatics (PhD, MSc) and Philosophy (MA), reflecting his interdisciplinary research that bridges formal software engineering, digital forensics, and the philosophy of technology. His work is widely published in international journals and conferences, and he is deeply involved in academic service, including supervision, examination, and program committees. Education: MA in Philosophy, Germany, 2010 PhD in Informatics, RWTH Aachen, Germany, 1999 MSc (Dipl.-Inform.) in Informatics, Germany, 1996 His research interests center on Formal Methods , Software Engineering , and the Philosophy of Computer Science . He has made significant contributions to parameterized and three-valued model checking, formal methods for railway systems, and the scientific foundations of digital forensics. His recent work explores historical semantics in software architecture and the philosophical underpinnings of informatics. His publications from the last few years reveal a strong trend towards formal verification, safety-critical systems, and the epistemological aspects of digital investigation and software engineering. Scientific Recognition: Biographic entry in Who's Who in the World (2010 edition) Member of the selection committee for the Annual Best Dissertation Award (EAPLS) Stefan Gruner is an active advisor and supervisor, having guided numerous MSc and PhD students to completion. He has secured research funding from the South African National Research Foundation (NRF) and international partners for projects on model-driven development, CSP protocol verification, and visualization of distributed algorithms. His academic service is extensive, including roles as program chair for workshops like FM+AM and SEFM, editor for conference proceedings, and external examiner for multiple universities. He has also been a visiting researcher at institutions in Bordeaux and Swansea. He was a central organizer of the Distributed Systems Research Group at the University of Pretoria and has fostered international collaborations, particularly within the formal methods and software engineering communities.

پروفایل رسمی دانشگاه

Jan Friso Grooteمشاهده پروفایل

استاد

Eindhoven University of TechnologyNetherlands

Jan Friso Groote is a Full Professor and Chair of the Formal System Analysis group in the Department of Mathematics and Computer Science at Eindhoven University of Technology (TU/e). He also holds professorial roles in the EAISI Foundational and EAISI High Tech Systems institutes. Since 2016, he has been working part-time at ASML, contributing his expertise in formal verification to industrial applications. Education: Born in 1965, studied Computer Science at Twente University of Technology (now University of Twente), 1983–1988. PhD in 1991 from the University of Amsterdam with thesis 'Process algebra and structured operational semantics', based on research at CWI (Centrum Wiskunde en Informatica). Jan Friso Groote is a leading researcher in formal methods and software verification. His work focuses on enabling the development of flawless software through rigorous formal analysis. Key research areas include structural operational semantics, model checking, branching bisimulation, protocol verification, and the development of the mCRL2 toolset. His current goal is to integrate formal techniques into complete software system design, improving both development speed and quality. His research has demonstrated that formal methods can reduce development time by a factor of three and increase quality tenfold, with potential for zero-defect software. His recent publications demonstrate sustained contributions in formal verification, including work on mutual exclusion algorithms, industrial control system modeling, probabilistic systems, and efficient bisimulation algorithms. The articles span topics such as tunnel control systems, simulation lower bounds, and formal methods for critical systems, reflecting both theoretical depth and practical application. Scientific Awards: Best Paper Award FACS 2018 FMICS-AVoCS Best Paper Award (2017) Jan Friso Groote has held significant leadership roles in education, including Director of Education for Computer Science (2000–2010) and for multiple bachelor’s and master’s programs. He has advised numerous researchers and supervised a large body of research output (over 320 publications). He leads the Formal System Analysis group and has been involved in projects such as 'Composable Embedded Systems for Healthcare'. His work bridges academia and industry, particularly through collaborations with ASML and Rijkswaterstaat, and he has been a visiting researcher at institutions across Europe and China. He is a key contributor to the mCRL2 toolset, which supports modeling and verification of software behavior with data, time, and probabilities. His research fingerprints highlight strong expertise in model checking, transition systems, software design, and process algebra. He teaches courses such as System Validation, Embedded Software, and Capita Selecta in Formal System Analysis.

پروفایل رسمی دانشگاه

Besnik Selimiمشاهده پروفایل

استاد

South East European UniversityMacedonia

Besnik Selimi is a Full Professor at the Faculty of Contemporary Sciences and Technologies, South East European University (SEEU). He holds a Ph.D. in Computer Sciences from Joseph Fourier University (Grenoble 1), France, specializing in Software Testing. His academic career spans roles as Associate Professor (2015–present), Assistant Professor (2010–2015), and part-time Lecturer (2009–2010). He also served as a State Advisor on Information Technologies for the Republic of Macedonia (2007–2008) and held research roles in France. Education: Ph.D. in Computer Sciences (2009), Joseph Fourier University, Grenoble Master in Software Engineering (2004), Joseph Fourier University Bachelor of Computer Sciences (2002), Joseph Fourier University Research Interests: Software Testing and Formal Methods Blockchain Technology and Smart Contracts IoT and Smart Agriculture Natural Language Processing for Low-Resource Languages Recommender Systems and Trust Metrics Cybersecurity and Data Privacy Recent work focuses on systematic reviews in testing methodologies, blockchain applications, and AI-driven solutions for education and agriculture. His contributions include the BCERT blockchain-based academic certification system and neural network models for low-resource language processing. Labs/Teams: Active in SEEU's research initiatives, collaborating with institutions like the "Max van der Stoel" Institute and the Institute for Environment and Health .

پروفایل رسمی دانشگاه

Julian Erhardمشاهده پروفایل

پژوهشگر

Technical University of MunichGermany

Julian Erhard is a researcher and lecturer at the Technical University of Munich (TUM), affiliated with the Chair of Languages and Description Structures in Computer Science under Prof. Helmut Seidl. His research focuses on static analysis techniques, particularly leveraging abstract interpretation to enhance precision and performance in compiler optimization and concurrency analysis. He contributes to the Goblint static analyzer and is a member of the ConVeY research training group. Erhard has organized preparatory mathematics courses and served as an exercise instructor for core computer science courses such as Functional Programming and Verification, Compiler Construction, and Static Analysis. His teaching spans multiple semesters from 2019 to 2025, emphasizing practical programming concepts and theoretical foundations. In research, he addresses challenges in context-sensitivity management, concurrency validation, and pointer analysis. His work includes developing frameworks like the digest framework for concurrency-sensitivity and tools like C-2PO for weakly relational pointer domains. Recent publications explore correctness witnesses for concurrent programs and optimizing context sensitivity dynamically. Erhard has co-organized ConVeY retreats and contributed to projects such as the Goblint validator and the Clustered relational thread-modular analysis framework. His expertise bridges theoretical advancements in abstract interpretation with practical compiler tool development.

پروفایل رسمی دانشگاه

Michael Petterمشاهده پروفایل

مدرس

Technical University of MunichGermany

Michael Petter is a faculty member at the Technische Universität München (TUM), affiliated with the School of Computer Science II (Informatik 2) and the Department of Languages and Description Structures in Computer Science. He specializes in compiler design, static analysis, and formal verification, with a focus on developing tools like the Goblint framework for multi-threaded C programs. His teaching spans courses such as Compiler Construction, Program Optimization, and Functional Programming, reflecting his expertise in programming languages and software engineering. His research interests include static analysis techniques, concurrency control, and abstract interpretation frameworks. He has contributed to advancements in flow-sensitive analysis, context-sensitivity management, and precision recovery in program analysis. Recent work emphasizes improving static analysis tools for industrial benchmarks and enhancing their usability through incremental methods. Petter’s publications highlight innovations in numerical abstract domains (e.g., octagons), non-local jump misuse detection, and thread-modular analysis for multi-threaded systems. His involvement in projects like the DFG Research Training Group ConVeY underscores his commitment to advancing continuous verification in cyber-physical systems. He advises thesis projects on topics like quantum computing at compile time and program synthesis, fostering interdisciplinary collaboration. While actively engaged in academic events and editorial roles, he maintains a lab focused on cutting-edge compiler and static analysis research.

پروفایل رسمی دانشگاه

Mark Uttingمشاهده پروفایل

دانشیار

University of QueenslandAustralia

Associate Professor Mark Utting is affiliated with the University of Queensland (UQ), specifically within the School of Electrical Engineering and Computer Science. He holds the rank of Associate Professor and focuses on software verification, model-based testing, and programming language design. His academic journey includes roles at multiple Queensland universities, Waikato University (NZ), and the University of Franche-Comte (France). He earned his PhD from UNSW on object-oriented language semantics. Utting has authored over 80 publications and the book 'Practical Model-Based Testing: A Tools Approach.' His current research emphasizes verifying compilers, blockchain smart contracts, ARM64 binaries, and AI-generated code. Key projects include the Algorand Centre for Sustainability Informatics and the BASIL project on secure information-flow logics. His research spans formal methods, theorem proving, and software engineering. Utting leads supervision in areas like compiler verification and smart contract analysis, with active involvement in grants such as the 'Directed and Incremental Analysis for DevSecOps' project. Utting collaborates on interdisciplinary projects, including energy grid simulations and cybersecurity strategies. His work bridges academia and industry, with past experience in genomics and manufacturing software development.

پروفایل رسمی دانشگاه

Ioannis Stefanakosمشاهده پروفایل

عضو هیئت علمی

University of YorkUnited Kingdom

Ioannis Stefanakos is a Research Associate at the Department of Computer Science, University of York, affiliated with the High Integrity Systems research group. His work focuses on formal verification of autonomous systems, safety-critical robotics, and software performance analysis. Current projects include assurance frameworks for drones, adaptive reinforcement learning in healthcare robotics, and probabilistic modeling of software performance. Recent research emphasizes interdisciplinary applications in UAV systems, medical decision support systems, and collaborative manufacturing robots. No academic awards are listed, though his work has been published in top-tier conferences. Advising and grants details are not explicitly stated, but his involvement in doctoral forum papers suggests potential supervision roles in software systems research.

پروفایل رسمی دانشگاه