Find Academic Supervisors

• Cybersecurity
• Formal Methods
• Attack Trees
• +5 more

Stefano M. Nicoletti is a Researcher at the University of Twente, holding dual affiliations with the Digital Society Institute and the Formal Methods and Tools department. His academic profile features an h-index of 31 with 26 documented research outputs spanning from 2020 to projected publications in 2025, demonstrating consistent scholarly productivity in formal methods for cybersecurity. Dr. Nicoletti's research expertise encompasses several critical domains in cybersecurity: Attack tree modeling and ontological frameworks Formal verification of security properties Risk management systems using ontology-based approaches Boolean logic applications in security analysis Quantification of MITRE ATT&CK campaigns Interoperability in security modeling frameworks His recent scholarly trajectory shows increasing focus on applying formal methods to practical security challenges in critical infrastructure, particularly smart grids and aerospace systems. The WATCHDOG framework represents his innovative approach to risk assessment through object-oriented disruption graphs, while his work on ontological lenses for attack trees addresses fundamental issues of adequacy and interoperability in security modeling. Professional recognition includes: Best Paper Award at the 21st International Conference on Software Engineering and Formal Methods (2023) Dr. Nicoletti maintains active collaborations with prominent researchers including M. Stoelinga, G. Guizzardi, and E.M. Hahn. His research bridges theoretical computer science with practical security applications, contributing significantly to both academic knowledge and potential real-world security solutions through datasets like Quantitative Comparisons of MITRE ATT&CK Campaigns and experimental reproduction packages for attack tree analysis.

Michael GeneserethView profile

Professor

• Computational Logic
• Enterprise Management
• Computational Law
• +4 more

Michael Genesereth is a Professor of Computer Science at Stanford University and a professor by courtesy in the Stanford Law School. He serves as director of the Logic Group at Stanford and is the founder and research director of CodeX - the Stanford Center for Legal Informatics. Genesereth is renowned for his groundbreaking work on Computational Logic and its diverse applications in Enterprise Management, Computational Law, and General Game Playing. His academic journey includes an Sc.B. in Physics from M.I.T. and a Ph.D. in Applied Mathematics from Harvard University (1978). These foundational studies paved the way for his influential career at the intersection of logic, computer science, and law. Genesereth's research program spans from theoretical foundations of logic programming to practical implementations across multiple domains. His work on General Game Playing has established frameworks enabling AI systems to understand and play games based purely on logical descriptions of rules. In Computational Law, he pioneers approaches for representing legal rules in machine-processable formats to automate compliance checking and legal reasoning. His Logic For All initiative has successfully introduced logic education to high schools across the United States, with teachers reporting significant improvements in students' preparedness for college-level coursework. The publication pattern reveals a sustained research trajectory focused on logic foundations, with recent work expanding into practical applications in computational law, insurance portfolio management, and knowledge representation systems. His 2022-2025 publications demonstrate continued innovation in logic programming frameworks and their real-world implementations. Genesereth has founded multiple technology companies including Teknowledge, CommerceNet, Mergent Systems, and Symbium, translating theoretical work into practical solutions. His educational impact extends through widely adopted textbooks and his free massive open online course (MOOC) on Introduction to Logic, which has enrolled hundreds of thousands of students globally. His current initiatives include the International Logic Olympiad, launched in 2024, which engages high school students worldwide in logic problem-solving competitions. This effort builds on his observation that high school students consistently perform well in his university-level logic courses, demonstrating the readiness of secondary students for formal logic education.

Jaco van de PolView profile

Professor

• Model Checking
• Quantum Computing
• Symbolic Computation
• +5 more

Jaco van de Pol is a Professor at the Department of Computer Science, Aarhus University. His research focuses on formal methods, quantum computing, and symbolic computation. He specializes in model checking, timed automata, decision diagram algorithms, and quantum circuit synthesis. Education background includes expertise in computer science with a strong foundation in theoretical computer science and formal verification techniques. Key research interests include: Development of scalable symbolic algorithms for large systems Quantum circuit optimization using SAT-based approaches External memory implementations of decision diagrams Formal verification of real-time and parametric systems Recent work emphasizes quantum computing applications, such as layout-aware CNOT circuit synthesis for NISQ processors, and novel algorithms for parametric timed games. His contributions include the Adiar framework for external memory BDD manipulation and the Sylvan decision diagram library. No academic awards or grants are explicitly mentioned in the provided materials. He has advised multiple collaborations but no specific student names are listed. His research group focuses on advancing formal methods through practical tools and theoretical advancements.

• Databases
• Artificial Intelligence
• Text Mining
• +2 more

Ingo Feinerer serves as an Associate Professor at Vienna University of Technology's Faculty of Informatics, specifically within the Institute of Information Systems Engineering (E192-02). His research bridges theoretical computer science and practical applications in database systems, artificial intelligence, and text mining, with significant contributions to configuration management and formal methods. His educational background includes: PhD Dissertation (2007): A formal treatment of UML class diagrams as an efficient method for configuration management Diploma Thesis (2005): Formal program verification: a comparison of selected tools and their theoretical foundations Feinerer's research focuses on database theory (particularly schema mapping and dependencies), AI-driven configuration systems using integer linear programming, and text mining infrastructure development in R. His work combines theoretical rigor with practical tool development, notably through the textcat and tm packages. The integration of formal methods in software engineering remains a consistent thread throughout his publications. Analysis of his 15 most recent publications reveals strong specialization in database constraints (40%), text mining applications (30%), and software configuration systems (30%), with increasing interdisciplinary work connecting computer science to digital humanities. His notable recognition includes: INiTS Award (2007) for technology commercialization potential Feinerer has supervised doctoral research including F. I. Chertes' work on schema mapping languages and diploma theses on UML semantics and probabilistic databases. He led major research projects HINT (2012-2017) and SEE (2012-2016) focusing on database technologies and information systems. His work demonstrates consistent funding through Austrian national research programs. As a core member of the Databases and Artificial Intelligence research group, he collaborates extensively on R package development for text analysis and contributes to international workshops on theoretical aspects of software engineering.

• Software Verification
• Automated Reasoning
• Code Synthesis
• +3 more

Ruzica Piskac is a Professor of Computer Science at Yale University, leading the Rigorous Software Engineering (ROSE) group. She previously held an Independent Research Group Leader position at the Max Planck Institute for Software Systems (2012–2013) and earned her PhD from EPFL (2011), awarded the Patrick Denantes Prize for her thesis on decision procedures for program synthesis and verification. Her research focuses on improving software reliability and trustworthiness through formal methods, encompassing software verification, automated reasoning, applied cryptography, and code synthesis. Notable honors include multiple Amazon Research Awards, the Yale Ackerman Award, and the Microsoft Research Award. She currently serves as Program Chair for the International Conference on Computer Aided Verification (CAV 2024) and on the Steering Committee for Formal Methods in Computer-Aided Design (FMCAD). Education: PhD in Computer Science (EPFL, 2011), MSc in Computer Science (Saarland University, 2005) Key Projects: ROSE group’s work on legal accountability for automated decisions (soid tool), privacy-preserving model checking, and quantum computing security Professional Activities: Editorial roles for conferences like LPAR, FMCAD, and VMCAI Her research group has graduated five PhD students, four now holding assistant professor roles. Current projects include formal XAI via syntax-guided synthesis, privacy-preserving cryptographic protocols, and quantum circuit vulnerability analysis.

Ruben MartinsView profile

Assistant Professor

• Program Synthesis
• Software Verification
• Security
• +7 more

Ruben Martins is an Assistant Professor at Carnegie Mellon University, focusing on constraint programming, program synthesis, analysis, and verification. His work aims to enhance programmer productivity and automate data science tasks through synthesis techniques. Education: Ph.D. (2013) from Technical University of Lisbon; Postdoc at University of Oxford (2014-2015) and UT Austin (2015-2017). Research Interests: Program Synthesis, Software Verification, Security, Decision Procedures, Boolean Satisfiability, MaxSAT, and their applications in real-world optimization. Article Trends: Recent publications emphasize integrating large language models (LLMs) with synthesis techniques for automated repair and refactoring, alongside advancements in MaxSAT solvers like Open-WBO. His work spans venues such as POPL, PLDI, FSE, and SAT. Scientific Awards: Distinguished Paper Award at PLDI 2018; Gold Medals in MaxSAT Competitions for Open-WBO. Current Roles: Committee Member in OOPSLA Review Committees across multiple conferences.

Daniel Le BerreView profile

Professor

• Artificial Intelligence
• Propositional Logic
• Constraint Programming
• +2 more

Daniel Le Berre is a Professor at the Faculty of Sciences Jean Perrin within the University of Artois . His academic journey includes undergraduate and graduate studies at the University of Western Brittany (UBO), Brest, and a doctoral thesis on propositional logic at Paul Sabatier University, Toulouse III. He transitioned from a Research Assistant at the University of Newcastle, Australia (2000-2001) to a Lecturer at Jean Perrin Faculty since 2001, becoming a University Professor in 2013 . Education Undergraduate & Graduate: University of Western Brittany (UBO), Brest Doctorate: Paul Sabatier University, Toulouse III (thesis: "Around SAT: the calculation of P-restricted implicants, algorithms and applications" , defended 2000-01-12) His research focuses on Artificial Intelligence and Propositional Logic , particularly in SAT, MAXSAT, Pseudo-Boolean Optimization, QBF, Non-monotonic reasoning, and Modal logics. He also explores constraint solvers in software engineering . His recent work trends include: SAT-based CEGAR methods for Hamiltonian cycle problems Pseudo-Boolean optimization proof logging Research software policy (CODE beyond FAIR, University of Artois Forges analysis) Compressed UNSAT CDCL trees with caching Daniel contributes to academic governance as a member of the Scientific Council of the INS2I Institute (CSI INS2I) and the editorial board of the Journal on Satisfiability, Boolean Modeling and Computation (JSAT) . He has supervised notable doctoral students including Romain Wallon (2017-2020) and Valentin Montmirail (2015-2018). His lab CRIL-CNRS UMR 8188 serves as a hub for his research.

Fabio PatriziView profile

Associate Professor

• Formal Methods
• Knowledge Representation
• Machine Learning
• +7 more

Fabio Patrizi is an Associate Professor in Computer Science at the Department of Computer, Control and Management Engineering (DIAG) at Sapienza University of Rome. He serves as Coordinator of the Bachelor in Information Engineering program at the Latina site. His academic career includes significant service roles such as Editorial Board Member for the prestigious Artificial Intelligence Journal (AIJ) since 2023, Area Chair for ICSOC 2023, and co-chair for the KR 2025 track on Knowledge Representation & Reasoning and Planning & Scheduling. Patrizi's educational background led to National Scientific Habilitation for Full Professorship for sector SC 09/H1 (now GSD 09/IINF-05). His research spans Formal Methods, Knowledge Representation, Machine Learning, Reasoning about Action, Planning in AI, Service-oriented Computing, and Business Processes. His work focuses on theoretical, methodological, and practical aspects including Behavior and Service composition, Planning programs, MAS Verification, Reasoning About Actions, Infinite-plan synthesis, Data abstraction techniques, and Reinforcement Learning with non-Markovian Rewards. His publication record includes over 70 scientific papers in top-level international journals and conferences. Recent research trends show a strong focus on temporal reasoning in reinforcement learning, planning frameworks, process mining, and verification techniques. His work bridges theoretical foundations with practical applications in AI planning and verification. ICDT Test of Time Award on Automatic verification of data-centric business processes (2009) RMIT Visiting Researcher's Award (2011) ICAPS 2024 Outstanding SPC Award Patrizi has supervised 2 PhD students and actively serves on program committees for major AI conferences including AAAI, IJCAI, ICAPS, AAMAS, KR, and ECAI. His research projects include MARLeN (Principal Investigator, 2023-2025), AIPlan4EU (Task Leader, 2021-2023), DRAPE (Principal Investigator, 2019-2022), WhiteMech (Participant, 2019-2024), TAILOR (Participant, 2020-2023), VerySynCopated (Principal Investigator, 2014-2016), ACSI (Participant, 2010-2013), and SM4All (Participant, 2008-2011). He is a member of the Data Management & Service-Oriented Computing and Artificial Intelligence & Knowledge Representation research groups at DIAG, contributing to collaborative efforts in advanced AI research and applications.

Ashutosh TrivediView profile

Associate Professor

• Formal Methods
• Cyber-Physical Systems
• Reinforcement Learning
• +5 more

Ashutosh Trivedi is an Associate Professor of Computer Science at the University of Colorado Boulder, currently on leave from his position as Assistant Professor in the Department of Computer Science and Engineering at the Indian Institute of Technology Bombay. He is affiliated with multiple research initiatives including the Centre for Formal Design and Verification of Software (CFDVS) at IIT Bombay, Free and Open Source Software for Education (FOSSEE), and the Indo-French project on Algorithmic Verification of Real-Time Systems (AVeRTS). At CU Boulder, he leads the Programming Languages and Verification (CUPLV) research group focusing on trustworthy AI systems. Trivedi's research centers on bridging formal methods with artificial intelligence to create more trustworthy systems. His work spans formal verification of cyber-physical systems, reinforcement learning with formal guarantees, and developing techniques for ensuring software fairness and accountability. He specializes in using formal languages, automata, and logic to transform vague natural-language instructions into precise specifications for AI systems. His recent projects include developing reinforcement learning algorithms for cardiac pacemaker design based on formal safety requirements, using SAT solvers to ground large language model outputs in logical reasoning, and encoding state representations in reinforcement learning using formal languages. His publication trends reveal a strong focus on neurosymbolic approaches that combine neural networks with symbolic reasoning, particularly for safety-critical applications. Recent work demonstrates increasing integration of formal methods with reinforcement learning, with applications spanning medical devices, tax preparation software, and puzzle-solving AI. His research shows a clear trajectory toward making AI systems more explainable, accountable, and verifiable through principled mathematical frameworks. Distinguished Paper Award at CAV for Regular Reinforcement Learning (2024) NeuS 2025 Disruptive Idea Award for Stochastic Neural Simulation Relations for Transferring Control under Uncertainty ACM Senior Member recognition (2024) Royal Society Wolfson Visiting Fellowship (2024) Trivedi has successfully advised multiple PhD students to completion, including Shadi Tasdighi Kalat (2025), Mateo Perez (2025), John Komp (2024), Vishnu Murali (2024), and Taylor Dohmen (2024). His teaching portfolio includes foundational courses in automata theory, digital logic design, and cyber-physical systems at both IIT Bombay and CU Boulder. He has served on program committees for major conferences including FSTTCS, HSCC, and FORMATS, and organized workshops such as ICLA 2015 and ALC 2015. As leader of the CUPLV research group, Trivedi directs projects focused on formal verification of AI systems, reinforcement learning with safety guarantees, and software fairness. His group collaborates with medical researchers on cardiac device verification and with legal scholars on tax software accountability, reflecting his commitment to applying formal methods to real-world problems with significant societal impact.

Aarti GuptaView profile

Professor

• Formal verification
• Model checking
• Program analysis
• +6 more

Aarti Gupta is a Professor in the Department of Computer Science at Princeton University, where she conducts research in formal verification, program analysis, and automated decision procedures. She has made significant contributions to the field of system analysis and verification, with her work being applied in industrial settings. Before joining Princeton, she led research in systems analysis and verification at NEC Labs America. Dr. Gupta received her PhD in Computer Science from Carnegie Mellon University. Her academic journey has positioned her as a leading figure in formal methods and verification techniques. Her research focuses on two main areas: theoretical foundations and practical applications. Foundations include formal methods, model checking, program analysis, automated synthesis, and SAT/SMT solvers. Applications span verification of software, hardware, networks, and distributed systems. Gupta's work bridges the gap between theoretical advances and real-world implementation, with particular emphasis on developing techniques that scale to handle complex industrial systems. Gupta's recent publications demonstrate a clear trajectory toward more modular, scalable, and practical verification techniques. She has increasingly focused on network verification, with several papers addressing the challenges of verifying distributed network control planes. Her work also shows growing interest in hardware verification, particularly for Systems-on-Chip (SoCs), and the intersection of formal methods with neural networks. A notable trend is the development of techniques that combine symbolic reasoning with learning approaches to improve verification scalability. Dr. Gupta has received numerous prestigious awards for her contributions: ACM Fellow (2017) - for contributions to system analysis and verification techniques and their transfer to industrial practice PLDI 2023 Distinguished Paper Award for "Synthesizing MILP Constraints for Efficient and Robust Optimization" IEEE ICNP 2022 Best Paper Award DATE 2021 Best Paper Award (Track D) ACM TODAES 2020 Best Paper Award IEEE Micro Top Pick 2018 Honorable Mention Dr. Gupta has advised numerous graduate students and postdoctoral researchers, including current PhD candidates Divya Raghunathan, Akash Gaonkar, Deyuan He, and Dexin Zhang. Among her former students are Timothy Alberdingk Thijm and Lauren Pick. She has also mentored postdoctoral fellow Grigory Fedyukovich and visiting student Yueling Zhang. Her research has been supported by significant grants that have enabled her to lead projects such as SyLVer (Synthesis, Learning, and Verification) and network verification initiatives in collaboration with researchers like Dave Walker and Ryan Beckett. Dr. Gupta leads the SyLVer research group at Princeton, which focuses on developing techniques that improve the scalability of algorithmic verification by combining deductive learning with learning on data and examples. Her group collaborates extensively on network verification projects, particularly through the Minesweeper initiative with Dave Walker and Ryan Beckett, and on Instruction Level Abstraction (ILA) for System-on-Chip verification in collaboration with Sharad Malik's group.

Cyrille ArthoView profile

Associate Professor

• Software Verification
• Software Engineering
• Concurrent Software
• +5 more

Cyrille Artho is an Associate Professor at KTH Royal Institute of Technology in the School of Computer Science and Communication, Department of EECS/TCS (Theoretical Computer Science). He joined KTH in August 2016 after working as a Senior Researcher at the National Institute of Advanced Industrial Science and Technology (AIST) in Tokyo and Osaka from April 2007 to July 2016. Prior to that, he was a Postdoctoral Researcher at the National Institute of Informatics in Tokyo. He completed his Ph.D. at ETH Zurich, where his thesis focused on finding multi-threading faults beyond data races. Dr. Artho's research focuses on software verification and engineering, particularly in concurrent and networked software systems. His work spans model-based testing, software model checking, and the development of verification tools. He has made significant contributions to the Java PathFinder ecosystem, developing the net-iocache extension for networked software and the Modbat model-based testing framework. His recent work has expanded into smart contracts, blockchain technology, and formal verification of distributed systems. Dr. Artho has published over 100 papers in top software engineering conferences and journals. His most recent publications demonstrate a continued focus on verification techniques, with increasing attention to smart contracts and formal methods for distributed systems. His work shows a consistent trajectory from foundational research on concurrency verification to practical applications in modern distributed systems. ACM SIGSOFT Distinguished Paper Award (2015) QRS 2015 best paper award Best tool (competition winner) at SBST 2015 Most influential ASWEC paper award (awarded in 2013) Dr. Artho is actively involved in the academic community as a committee member, session chair, and workshop organizer for major conferences including ASE, ICSE, ISSTA, and FM. He is also a member of the management group for the KTH Center for Cyber Defense and Information Security, reflecting his contributions to security-related research.

Philipp RuemmerView profile

Professor

• Program Verification
• Theorem Proving
• SMT Solving
• +9 more

Philipp Ruemmer is a Professor of Theoretical Computer Science at University of Regensburg (2022–present) and a Senior Lecturer at Uppsala University's Department of Information Technology (2018–present). His research focuses on Program verification and theorem proving SMT/SAT solving and automata theory Embedded systems analysis and Java verification Machine learning applications in formal methods Concurrent and timed systems modeling His recent work includes string constraint solvers (Norn, OSTRICH, Sloth) and model checking tools (JayHorn, Eldarica). He has authored key papers in POPL, CPP, PLDI, and VMCAI on topics like Transducer-based string solving Certified decision procedures Regular constraint propagation Flattening techniques for constraints Notable scientific awards include the 2013 Uppsala University Oscar Prize and the 2005 SAP Award for academic excellence. He has led and participated in research grants from the Knut and Alice Wallenberg Foundation, Swedish Research Council, and Microsoft.

Nazareno AguirreView profile

Professor

• Software Engineering
• Formal Methods for Software Development
• Formal Analyses of Software
• +7 more

Nazareno Aguirre is a Full Professor at the Departamento de Computación, Facultad de Ciencias Exactas, Físico-Químicas y Naturales (FCEFQyN), Universidad Nacional de Río Cuarto, Argentina. He is also an Independent Researcher at Argentina's National Council for Scientific and Technical Research (CONICET) and a Visiting Professor at Guangdong Technion - Israel Institute of Technology in Shantou, China. Aguirre was promoted to Full Professor at the University of Rio Cuarto in November 2024, having previously served as an Associate Professor. His research interests focus on Software Engineering, particularly Formal Methods for Software Development. Aguirre specializes in formal analyses of software based on SAT solving, including specification inference, automated testing, bounded verification, and program repair. His work aims to build reliable quality software through formal underpinnings and automated techniques. He has made significant contributions to the analysis of Alloy specifications, test generation, and program verification. Analysis of Aguirre's recent publications (2023-2025) reveals a strong focus on advancing formal methods for software verification and testing. His work spans multiple dimensions including specification inference (SpecFuzzer, EvoSpex), test generation (BEAPI, combinatorial test generation for Alloy), program repair (ACoRe), and verification techniques (LTL solvers, Alloy model analysis). A common thread through his research is the application of formal methods and SAT solving to practical software engineering challenges, with emphasis on automation and scalability. Nazareno Aguirre serves in several important academic roles: Associate Editor of IEEE Transactions on Software Engineering Coordinator of the Informatics, Electronics and Communications Commission at Argentina's National Agency for the Promotion of Research Program Committee member for major conferences including ICSE 2025, ISSTA 2025, ASE 2025, and ICST 2025 His research group at Universidad Nacional de Río Cuarto collaborates extensively with international researchers, particularly with Marcelo Frias and colleagues at the same institution, as well as with researchers from institutions worldwide including the University of Bergamo in Italy. Aguirre's work is characterized by a strong theoretical foundation combined with practical tool development, as evidenced by numerous tool demonstration papers at top software engineering conferences.

• Quantum Computing
• Logic Synthesis
• Quantum Compilation
• +3 more

Mathias Soeken is a Lecturer at the École Polytechnique Fédérale de Lausanne (EPFL), affiliated with the School of Computer and Communication Sciences and the Integrated Systems Laboratory (LSI1). He is actively involved in teaching and research related to quantum computing, logic synthesis, and compiler optimization. His research focuses on quantum circuit optimization resource estimation design automation for quantum technologies reversible logic synthesis compiler frameworks for quantum computing Key trends in his publications include: fault-tolerant quantum computing quantum compilation techniques logic network optimization symbolic resource estimation logic synthesis for emerging technologies XOR-Majority logic integration He has supervised multiple PhD students including Haaswijk Winston Jason, Meuli Giulia, Schmitt Antunes Bruno, and Testa Eleonora.

Orna GrumbergView profile

Professor

• Computer Science
• Formal Verification
• Model Checking
• +8 more

Orna Grumberg is a Professor at the Computer Science Department , Technion – Israel Institute of Technology . She is a member of the Academia Europaea and an ACM Fellow , recognized for her work in formal verification and model checking. PhD in Computer Science, Technion Honorary Doctorate from Technical University of Munich (2017) Her research focuses on automated verification of software and hardware systems, including model checking , program repair , and abstraction-refinement techniques . She pioneered the CEGAR (Counterexample-guided Abstraction Refinement) framework, which won the CAV award. Her work spans temporal logics , automata on infinite objects , and security vulnerability detection using formal methods. Her publications highlight trends in SAT-based model checking , compositional verification , and multi-valued systems , with applications to UML systems , STE refinement , and distributed model checking . She has co-authored foundational texts such as Model Checking (1999) and its second edition (2018). CAV Award (2000) for CEGAR ACM Fellow Dr.h.c. from Technical University of Munich (2017) Member, Academia Europaea Grumberg has delivered tutorials and lectures at prestigious events like the NATO Summer School Marktoberdorf (2001–2017), covering topics such as 3-valued abstraction , SAT-based model checking , and program repair . She served on the steering committee of the Computer-Aided Verification (CAV) conference and contributed to distributed and parallel model checking algorithms.