Assoc. Prof. Dr. Ali GÜLBAĞ is an academic at the Faculty of Computer and Information Sciences , Sakarya University , specializing in Computer Engineering . His career spans over two decades, focusing on FPGA-based hardware design, machine learning applications, and educational methodologies in computer architecture. Doctorate (2003-2006): Quantitative determination of volatile organic compounds using artificial neural network and fuzzy logic-based algorithms MSc (1998-2000): Building automation using telephone lines BSc (1994-1998): Electrical-Electronics Engineering His research interests include Artificial Neural Networks , FPGA Design , and Water Resource Management , with applications in seismic event differentiation, environmental modeling, and educational technologies. Recent work emphasizes water consumption prediction using machine learning. Key projects: BZK.SAU.FPGA microcomputer architecture , Remote FPGA laboratories Publications demonstrate expertise in combining machine learning techniques (ANNs, gradient boosting, random forests) with hardware implementations for real-world problem-solving.
Eric Reiner serves as an Adjunct Professor of Finance and Faculty Director of the Master of Financial Engineering program at UCLA Anderson School of Management. His unique academic profile bridges finance and formal methods, combining financial engineering expertise with advanced computational verification techniques. Dr. Reiner's research spans two distinct domains: traditional finance and formal methods in computer science. His work in formal methods focuses on satisfiability modulo theories (SMT), bit-precise reasoning, and model checking, with publications appearing in leading formal methods venues. This unusual interdisciplinary approach suggests innovative applications of verification techniques to financial systems, potentially addressing challenges in algorithmic trading verification, risk model validation, and financial protocol security. Analysis of his recent publications (2022-2024) reveals a strong focus on improving SMT solver capabilities, particularly for bit-vector reasoning and user extensibility. His work shows progression from theoretical foundations toward practical industrial applications, with increasing attention to proof generation, solver performance optimization, and machine learning techniques for algorithm selection. The consistent publication record in formal methods venues indicates deep technical expertise that complements his finance role. As Faculty Director of the Master of Financial Engineering program, Dr. Reiner oversees curriculum development that likely integrates both traditional finance knowledge and cutting-edge computational verification methods. This distinctive combination prepares students to develop and validate complex financial algorithms with mathematical rigor, addressing growing industry needs for verified financial technologies.
Magnus O. Myreen is a Professor in the Department of Computer Science and Engineering at Chalmers University of Technology, Sweden. He has been with Chalmers since 2014, becoming a tenured Associate Professor in 2015 and being promoted to full Professor in June 2023. Myreen has an extensive record of service to the programming languages and formal methods communities, including serving on program committees for major conferences like PLDI, POPL, ICFP, and CPP, and chairing the steering committee for the ITP conference series since November 2023. Myreen received his academic training at prestigious institutions: B.A. in Computer Science at the University of Oxford, tutored by Dr. Jeff Sanders Ph.D. on program verification in 2009 at the University of Cambridge, supervised by Prof. Mike Gordon Myreen's research focuses on program verification, interactive theorem proving, and compiler verification. He is best known for his work on the CakeML project, which is an ML-style language with a formal semantics and a growing ecosystem of proofs and tools that support construction of verified applications. As he states on his website, "My most recent work has focused on CakeML, which is an ML-style language with a formal semantics and a growing ecosystem of proofs and tools that support construction of verified applications. As far as I know, the CakeML compiler is the first verified compiler to have been bootstrapped." His research spans several key areas: Decompilation into logic — verification of machine code Proof-producing synthesis from logic Verified Lisp and ML runtimes Connecting things up: verified stacks Myreen's publication record shows a strong focus on verified compilation and theorem proving, particularly through the CakeML ecosystem. His work consistently bridges the gap between theoretical foundations and practical implementation, with numerous papers on verified compilers, program verification, and theorem proving. A significant trend in his recent work (2021-2024) has been extending CakeML's capabilities to handle more complex language features, improve performance, and verify increasingly sophisticated compilation techniques including bootstrapping and dynamic computation. Myreen has received several prestigious awards and recognitions: Winner of the BCS Distinguished Dissertation Competition 2010 for his PhD work Royal Society Research Fellow (UK) since 2012 ACM SIGPLAN Most Influential POPL Paper Award for the 2014 CakeML paper Amazon Research Award for his proposal "Compiling Dafny to CakeML" Myreen has advised several PhD students to completion, including Alejandro Gomez (Sep 2017 – Jun 2023), Oskar Abrahamsson (Aug 2017 – Dec 2022), and Andreas Loow (Sept 2016 – Sep 2021). He also collaborated with postdocs including Hira Syeda, Thomas Sewell, and Johannes Aman Pohjola. His research has been supported by various funding sources, though specific grants aren't detailed in the provided text. Notably, he received an Amazon Research Award for his work on compiling Dafny to CakeML, and his CakeML project has clearly attracted significant attention in the programming languages and formal methods communities. Myreen leads research on the CakeML project, which has grown into a substantial ecosystem for verified compilation. The project involves a team of researchers working on various aspects including compiler verification, program synthesis, and theorem proving. Myreen also collaborates with researchers at other institutions, as evidenced by his visits to EPFL (meeting Viktor Kuncak, Martin Odersky, and James Larus) and NUS (visiting Ilya Sergey's group). In October 2023, he began a ten-month sabbatical at Cambridge UK, where he worked part-time for Arm Ltd., indicating ongoing industrial collaboration.
Chandrakana Nandi is the Director of US R&D at Certora and an affiliate assistant professor in the Department of Computer Science & Engineering at the University of Washington's College of Engineering. She completed her PhD at the University of Washington working with Zachary Tatlock and Dan Grossman in the PLSE research group. Her research focuses on building tools for scaling automated formal verification to real-world programs, particularly for DeFi applications. She works extensively with equality saturation techniques (egg project) and has made significant contributions to computational fabrication through projects like Carpentry Compiler, Szalinski, and LambdaCAD. Her work bridges programming languages, compilers, and digital fabrication, creating novel tools that transform how we design and manufacture physical objects. Nandi's publication record shows a strong trajectory in programming language techniques applied to verification and fabrication. Her work on equality saturation has become foundational in the field, with the egg library enabling state-of-the-art results in compiler optimization and program synthesis. Recent work has expanded into formal verification of smart contracts, demonstrating the versatility of her research approach across different domains. Distinguished Paper Award at OOPSLA 2021 Sigplan Research Highlight for POPL 2021 As Director of US R&D at Certora, she leads research efforts on verification tools for languages like WASM and techniques to help users write formal specifications more easily using mutation testing. She has served in numerous organizational roles for major programming languages conferences including as Workshops Co-Chair for ICFP 2025 and Committee Member for PLDI Review Committee. Nandi has established herself as a leader in the intersection of programming languages and computational fabrication, with her work on equality saturation becoming particularly influential across multiple subfields of programming languages research.
Mariusz Węgrzyn is a Lecturer in the Department of Automation and Computer Science at the Faculty of Electrical and Computer Engineering, Cracow University of Technology. His research focuses on algorithm design, embedded systems, and FPGA applications, with recent publications on square root computation, IoT-based fire detection, and test vector optimization for soft processors. University: Cracow University of Technology School: Faculty of Electrical and Computer Engineering Department: Department of Automation and Computer Science Academic Rank: Lecturer Research Trends: Mariusz Węgrzyn’s work spans hardware acceleration, numerical algorithms, and IoT systems. His 2025 publications emphasize FPGA efficiency and floating-point approximation, while 2021 studies explore energy optimization in safety systems and test vector reduction. Contact: Email: mariusz.wegrzyn@pk.edu.pl
Zhenbang Chen is a Professor in the College of Computer at National University of Defense Technology (NUDT), China. His academic career spans over a decade with significant contributions to software engineering, particularly in program analysis and formal methods. He has served on program committees for major conferences including ASE, ICSE, and FSE, and has been actively involved in research that bridges theoretical formal methods with practical software engineering applications. Dr. Chen received his Ph.D. and Bachelor degrees in computer science from National University of Defense Technology (NUDT) in June 2009 and July 2002, respectively. His educational background from NUDT has provided a strong foundation for his research in software engineering and formal methods. Ph.D. in Computer Science, National University of Defense Technology (NUDT), 2009 Bachelor's Degree in Computer Science, National University of Defense Technology (NUDT), 2002 Zhenbang Chen's research primarily focuses on program analysis, with special emphasis on symbolic execution techniques. His work extends to formal methods and their practical applications in software engineering. He investigates constraint solving approaches to improve the efficiency of program analysis and explores program synthesis techniques to automate software development tasks. His research bridges theoretical foundations with practical software engineering challenges, particularly in the areas of software verification and testing. His recent work has increasingly focused on optimizing symbolic execution through novel constraint solving techniques and exploring multi-modal approaches to behavior tree synthesis. This demonstrates his commitment to advancing both the theoretical underpinnings and practical applications of software analysis techniques. Professor Chen's publication record shows a consistent focus on symbolic execution and constraint solving, with a clear progression toward more sophisticated optimization techniques. His recent work demonstrates a shift toward multi-objective optimization for floating-point constraints and multi-modal approaches to program synthesis. The research spans both theoretical foundations and practical implementations, with several tools developed from his research participating in international competitions. Dr. Chen's research excellence has been recognized through multiple prestigious awards: ACM SIGSOFT Distinguished Paper Award for FSE 2025 paper "QSF: Multi-Objective Optimization based Efficient Solving for Floating-Point Constraints" ACM SIGSOFT Distinguished Paper Award for ISSTA 2021 paper "Type and interval aware array constraint solving for symbolic execution" ACM SIGSOFT Distinguished Paper Award for ICSE 2018 paper "Towards optimal concolic testing" Bronze Medal (3rd place) in Cover-Branches category at Test-COMP 2025 for the FDSE tool Professor Chen is actively involved in mentoring the next generation of researchers, currently seeking Ph.D. and M.Sc. students to work with him on cutting-edge research in program analysis and formal methods. His research group has developed several tools that have gained recognition in international competitions, including AISE which ranked 1st in SV-COMP 2025's ReachSafety-Loops category and FDSE which won Bronze Medal in Test-COMP 2025. His research has been supported by grants that enable participation in major international conferences and competitions, fostering collaborations with researchers worldwide. Dr. Chen leads a research group focused on program analysis and formal methods at NUDT. His team has developed several notable tools including AISE for program verification and FDSE for software testing, which have achieved top rankings in international competitions like SV-COMP and Test-COMP. The research group maintains active collaborations with other institutions and participates regularly in major software engineering conferences, contributing to both theoretical advancements and practical tool development in the field.
Panagiotis (Pete) Manolios is a Professor in the Department of Computer Science within Northeastern University's College of Engineering in Boston. He leads the Northeastern University Formal Methods (NUFM) research group and maintains an active research program with multiple current PhD students. His primary affiliation is with the College of Computer Science (CCS) at Northeastern University, where he holds a tenured faculty position. Manolios' research focuses on formal methods with particular emphasis on program verification, theorem proving, and safety analysis of systems. His work spans several key areas including floating-point program analysis, resource-aware program verification, protocol verification, and safety-critical systems. He has developed significant tools and methodologies such as ACL2s (a powerful theorem prover) and pioneered approaches for analyzing numeric stability in compiler optimizations. His recent publications demonstrate substantial activity in formal verification, with particular focus on numeric stability analysis, invariant discovery through gamification, and model-based safety analysis of complex system architectures. These works reflect a consistent research trajectory toward making formal verification more practical and applicable to real-world systems, especially those with safety-critical requirements. Manolios has received recognition through multiple NSF grants including the SaTC: CORE: Medium collaborative project on bridging the gap between protocol design and implementation. His work on confidentiality and integrity of deep neural networks represents cutting-edge research at the intersection of formal methods and AI security. He has successfully mentored numerous PhD students who have gone on to positions at major technology companies including Google, Facebook, Intel, and MathWorks. His students' dissertations cover diverse topics within formal methods, from rank-polymorphic programming languages to resource-aware program analysis. Manolios directs several significant research projects including ACL2s (a powerful theorem prover), CID: Confidentiality and Integrity of Deep Neural Networks, Compilation-Dependent Security Properties of Software, and Platform Dependencies of Floating-Point Programs. These projects address fundamental challenges in making formal verification more practical and applicable to real-world systems.
