جستجوی استاد راهنمای دانشگاهی

Chang Xuمشاهده پروفایل

استاد

• Big data software engineering
• Intelligent software testing and analysis
• Adaptive and autonomous software systems
• +۳ مورد دیگر

Chang Xu is a Professor and Ph.D. supervisor at Nanjing University, affiliated with the State Key Laboratory for Novel Software Technology, School of Computer Science, and Institute of Computer Software (ICS). He has been a full-time faculty member since 2010, when he joined as an associate professor and was later promoted to full professor in 2015. Education: Ph.D. from The Hong Kong University of Science and Technology (HKUST) in 2008 (advisor: Prof. S.C. Cheung) M.Eng. from Institute of Software, Chinese Academy of Sciences (ISCAS) in 2003 B.Eng. from University of Science and Technology of China (USTC) in 2000 Research Interests: Professor Xu's research focuses on big data software engineering, intelligent software testing and analysis, and adaptive and autonomous software systems. His recent work centers on constructing and providing runtime support for intelligent software in open environments, with emphasis on inconsistency detection and resolution for environments, and quality assurance for adaptive, concurrent, learning-based, smartphone-based, and spreadsheet-based applications. His work bridges theoretical foundations with practical applications in software engineering, particularly in program analysis, software testing, and self-adaptive systems. Scientific Awards: ACM SIGSOFT Distinguished Paper Award from ICSE 2025 Best Student Paper Award from EUROSYS 2025 ACM Distinguished Member in 2024 Best Paper Award from SOSP 2023 Best Paper Candidate from ISSRE 2022 Yangtze River Scholar by the Ministry of Education in 2021 Multiple ACM SIGSOFT Distinguished Paper Awards from conferences including ASE, ICSE National Science and Technology Progress Award (Second Class) in 2011 Academic Service and Advising: Professor Xu has served on numerous program committees for top software engineering conferences including ICSE, ASE, ESEC/FSE, and ISSTA. He is an editorial board member for several journals including Journal of Computer Science and Technology and Frontiers of Computer Science. He has supervised numerous Ph.D. and MSc students, with research topics spanning program analysis, software testing, self-adaptive systems, and more. His students have gone on to successful careers in both academia and industry. Research Groups: Professor Xu is associated with the SPAR research group at Nanjing University and the CASTLE research group at HKUST, focusing on software analysis, reliability, and testing.

Matthieu Sozeauمشاهده پروفایل

پژوهشگر

• Type Theory
• Proof Assistants
• Functional Programming
• +۴ مورد دیگر

Matthieu Sozeau is a prominent researcher at Inria in the Gallinette team in Nantes, France, and a key contributor and coordinator of the Coq/Rocq proof assistant project. His work bridges theoretical computer science and practical software development, focusing on creating reliable formal verification tools. His research interests span Type Theory, Proof Assistants, Functional Programming, and Unification. He has made significant contributions to the development of Coq (recently renamed to Rocq Prover), particularly through the MetaCoq project which aims to verify Coq's kernel within Coq itself, the Equations plugin for dependent pattern matching, and CertiCoq, a verified compiler from Coq to assembly. His work enables stronger guarantees about formalized mathematics and verified software. Sozeau's publications reveal a consistent focus on foundational aspects of proof assistants. His recent work includes verified type checking ('Coq Coq Correct!'), verified extraction from Coq to OCaml, and sort polymorphism for proof assistants. These contributions advance both theoretical understanding and practical implementation of dependently-typed programming languages. Distinguished paper award for Verified Compilation from Coq to OCaml at PLDI'24 As an academic mentor, Sozeau has supervised PhD students including Théo Winterhalter and Antoine Allioux. He regularly teaches courses on proof assistants, notably at MPRI (Master Parisien de Recherche en Informatique), and actively participates in the academic community through program committees, invited talks, and workshops. His work has significantly influenced both the theoretical foundations and practical applications of interactive theorem proving.

Dominique Devrieseمشاهده پروفایل

استاد

• Functional Programming
• Object Capabilities
• Secure Compilation
• +۵ مورد دیگر

Dominique Devriese is a professor at the Department of Computer Science, KU Leuven, and a member of the DistriNet research group. His work bridges computer security, programming languages, and formal verification. Research interests: Functional Programming, Object Capabilities, Secure Compilation, Dependently-typed Programming, Modal Type Theory Teaching: Formal Systems, Object-Oriented Programming, CyberSecurity, Secure Software His research focuses on rigorous software systems security through capability machines and secure compilation techniques. He actively contributes to formal verification using Agda and Haskell, with recent work on multimode type theory and effect parametricity. Key publication trends include: multimode/presheaf type theory, capability-based security models, formal verification of hardware/software abstractions, and parametricity applications in programming languages. Contact: Email: dominique.devriese@kuleuven.be ORCID: 0000-0002-3862-6856

Kevin Baumمشاهده پروفایل

پژوهشگر

• Explainable AI
• AI Ethics
• AI Fairness
• +۴ مورد دیگر

Kevin Baum is a computer scientist currently serving as the deputy head of the Neuro-Mechanistic Modelling (NMM) department at the German Research Center for Artificial Intelligence (DFKI) since January 2023, and head of the Centre for European Research in Trusted AI (CERTAIN) at DFKI since December 2023. Based at the Saarland Informatics Campus in Saarbrücken, Germany, he completed his doctorate in philosophy in March 2024, combining technical expertise with philosophical depth. His work bridges computer science with ethics, focusing on making AI systems transparent and accountable to human users. Dr. Baum's research program centers on interdisciplinary questions concerning the explainability and transparency of AI systems. His work spans multiple significant projects including the Explainable Intelligent System (EIS) initiative and project E7 of the Transregional Collaborative Research Centre 248 "Foundations of Perspicuous Software Systems" (CPEC). He has developed frameworks for understanding stakeholder perspectives on explainable AI and investigated how different information types about automated systems affect user perceptions of fairness and justice. His approach consistently combines theoretical foundations with practical implementations across diverse contexts. Analysis of his publication trends reveals a clear trajectory from theoretical foundations in machine ethics toward practical implementations of explainability requirements in real-world contexts. His work demonstrates increasing focus on human oversight effectiveness, fairness monitoring, and ethical considerations across various AI applications. He has made significant contributions to both academic discourse and practical AI development guidelines, with publications spanning computer science, philosophy, psychology, and human-computer interaction venues. Award for Ethics for Nerds lecture series As a research leader, Dr. Baum contributes to shaping AI development practices through his departmental leadership and interdisciplinary collaborations. His current work with CERTAIN focuses on establishing European research standards for trusted AI development and deployment, emphasizing the practical implementation of ethical requirements in AI systems. He maintains active collaborations across multiple institutions and disciplines, reflecting his commitment to bridging technical and philosophical considerations in AI development. At DFKI, he leads research that combines neuroscientific insights with AI development to create more interpretable systems. The NMM department focuses on both theoretical research on explainable AI foundations and practical applications in various domains, with particular attention to how different stakeholders understand and require explanations from AI systems.

Tibor Szabóمشاهده پروفایل

استاد

• Combinatorics
• Extremal Graph Theory
• Random Structures and Algorithms
• +۵ مورد دیگر

Tibor Szabó is a Professor in the Combinatorics and Graph Theory group at the Department of Mathematics, Freie Universität Berlin. He holds a PhD from The Ohio State University, advised by Ákos Seress. Prior to his current position, he held roles at McGill University, ETH Zürich, the Institute for Advanced Study (Princeton), and the University of Illinois (UIUC) as a J.L. Doob Research Assistant Professor. Research Interests: His work focuses on combinatorics and combinatorial optimization, including extremal problems, random structures and algorithms, pseudorandom graphs, positional games, and the combinatorics of linear programming. He explores tools from algebra, probability theory, and topology applied to combinatorics. Teaching: He teaches courses such as Algorithmic Combinatorics, Extremal Combinatorics, and runs the Combinatorics Seminar. His lecture notes include works on positional games and explicit constructions in extremal combinatorics. Students & Postdocs: Notable PhD advisees include Yamaan Attwa, Silas Rathke, Simona Boyadzhiyska, and Patrick Morris. Postdoctoral fellows include Olaf Parczyk and Anurag Bishnoi. His research has involved collaborations with over 50 co-authors. Funding & Grants: Supported by grants from the Swiss National Science Foundation (SNF) and German Research Foundation (DFG), focusing on topics like positional games and extremal graph theory.

Dmitriy Traytelمشاهده پروفایل

دانشیار

• Logic
• Automata Theory
• Runtime Verification
• +۷ مورد دیگر

Dmitriy Traytel is an Associate Professor at the University of Copenhagen's Department of Computer Science since August 2020, where he currently heads the Software, Data, People & Society (SDPS) section. Prior to this position, he worked as a senior researcher (Oberassistent) in the Information Security Group led by David Basin at ETH Zürich. He completed his PhD at TU München under Tobias Nipkow's supervision in 2015. His research focuses on formal methods, particularly logic, automata theory, runtime verification and monitoring, decision procedures, (co)induction and (co)recursion, and interactive theorem proving. Traytel develops formally verified tools for runtime monitoring including VeriMon, TimelyMon, and WhyMon, emphasizing correctness and efficiency in monitoring complex temporal properties. His recent publications (2021-2025) demonstrate a strong focus on first-order temporal logic monitoring, with particular attention to explainable verdicts, scalable parallel implementations, and formal verification of monitoring algorithms. The work spans theoretical foundations in logic and category theory while maintaining practical applications in runtime verification systems. Distinguished Paper Award at POPL 2025 for 'Barendregt Convenes with Knaster and Tarski' Best Student Paper Award at FSCD 2016 Distinguished Paper Award at ATVA 2018 Traytel has supervised numerous PhD, Master's, and Bachelor's students in areas spanning formal verification, runtime monitoring, and theorem proving. His research has been supported through collaborations with major institutions including ETH Zürich and TU München. He actively contributes to the academic community by serving on program committees for major conferences including ITP 2025 and RV 2025. He leads the Software, Data, People & Society section at the University of Copenhagen, focusing on developing formally verified tools for runtime verification that bridge theoretical computer science with practical applications in security and system monitoring.

Xin Pengمشاهده پروفایل

استاد

• Software Analytics
• Intelligent Software Development
• Microservice
• +۴ مورد دیگر

Xin Peng is a Professor and Deputy Dean at the School of Computer Science, Fudan University, China. He leads the CodeWisdom research team focusing on intelligent software engineering techniques for development, maintenance, and operation of software systems. His educational background includes a PhD in Computer Science (2001-2006) and Bachelor's degree in Computer Science (1997-2001), both from Fudan University. He progressed through the academic ranks from Assistant Professor (2006-2010) to Associate Professor (2010-2015) and finally to Professor (2015-present). Professor Peng's research interests span Software Analytics, Intelligent Software Development, Microservice systems, and AIOps. His work leverages AI technologies including deep learning and knowledge graphs to develop intelligent software engineering techniques. A significant portion of his recent work focuses on applying Large Language Models to various software engineering tasks, including vulnerability detection, API usage analysis, and test automation. His publication record shows a clear trend toward increasingly sophisticated applications of AI in software engineering, with recent work heavily featuring LLMs for tasks ranging from vulnerability patch porting to resource leak detection. The research spans multiple domains including microservice systems, automotive software, and Web of Things security. Best Paper Award of ICSM 2011 ACM SIGSOFT Distinguished Paper Award of ASE 2018 and 2021 IEEE TCSE Distinguished Paper Award of ICSME 2018, 2019, and 2020 IEEE Transactions on Software Engineering Best Paper award for 2018 Professor Peng serves in numerous leadership roles including Deputy Director of CCF Technical Committee on Software Engineering, Co-Editor-in-Chief of Journal of Software: Evolution and Process, and Associate Editor for ACM Transactions on Software Engineering and Methodology. He has been actively involved in program committees for major software engineering conferences including ICSE, ASE, ESEC/FSE, and ICSME. He leads the CodeWisdom research team at Fudan University, which has developed several benchmark systems including TrainTicket for microservice research. The team's work bridges academic research with industrial applications, particularly in microservice systems analysis and intelligent software development tools.

James C. Davisمشاهده پروفایل

استادیار

• Empirical software engineering
• Security
• Safety
• +۷ مورد دیگر

James C. Davis is an Assistant Professor in the Elmore Family School of Electrical and Computer Engineering at Purdue University. He leads the Duality Lab, which focuses on the engineering of software-intensive computing systems with particular interest in how these systems fail and how those failures can be mitigated. His research takes a socio-technical approach, considering both human and technical perspectives in system engineering. Dr. Davis received his PhD in Computer Science from Virginia Tech, where he was advised by Dongyoon Lee. His research interests span empirical software engineering, security, safety, testing, and web technologies, with a strong emphasis on practical impact and measurement. He applies a socio-technical philosophy to his work, believing high-quality systems must be engineered considering both human and technical perspectives. His recent research focuses on software supply chain security, regular expression vulnerabilities (particularly ReDoS), pre-trained model security, and failure analysis in software systems. His work often involves empirical studies of real-world software systems and security practices, with a strong emphasis on practical impact and measurable results. Dr. Davis has received significant funding from the National Science Foundation, Google, Cisco, and Rolls Royce for his research. His publications appear in top-tier venues including ICSE, FSE, ASE, and USENIX Security. He has served on program committees for many major software engineering and security conferences. Among his notable achievements are being elevated to IEEE Senior Member in 2022, receiving the Ruth and Joel Spira Outstanding Teacher Award from ECE@Purdue in 2022, and multiple Best Paper and Best Poster awards. He has successfully mentored numerous PhD and Master's students, with several completing their theses on topics related to software security and engineering. Dr. Davis actively recruits graduate and undergraduate research assistants for his Duality Lab, which has produced influential work on software failure analysis, regular expression security, and machine learning supply chain security. His lab is supported by multiple federal and industry grants focused on improving the security and reliability of software systems.

Heiko Falkمشاهده پروفایل

استاد

• Real-Time Systems
• Embedded Systems
• Compiler Optimization
• +۴ مورد دیگر

Heiko Falk is a Professor and Head of the Institute of Embedded Systems at Technische Universität Hamburg (TUHH). His roles include serving as Workshop Chair for the 2024 Embedded Systems Week (ESWEEK), Scientific Coordinator for the B.Sc. and M.Sc. Computer Science programs, and Deputy Head of the Board of Examiners for Computer Science and Engineering. His research focuses on real-time systems, compiler optimizations, and worst-case execution time (WCET) analysis. Key areas include multi-core architectures, cache management, energy efficiency, and hardware/software co-design. Falk's work emphasizes practical compiler techniques for improving real-time performance, such as WCET-aware memory allocation, dynamic SPM optimization, and event-driven scheduling. His publications analyze shared cache interference, preemptive/non-preemptive scheduling, and DMA-aware optimizations. Recent work explores multi-objective trade-offs between WCET, energy consumption, and code size in embedded systems. No scientific awards are explicitly listed, but his contributions to WCET benchmarking (e.g., haRTStone project) and compiler frameworks demonstrate significant impact in the field. Advising and grants: No formal advisees are listed in the provided texts. Falk's work is supported through projects like teamplay, focusing on cyber-physical systems optimization. Labs/Teams: His group operates within TUHH's Institute of Embedded Systems, collaborating on projects addressing real-time system challenges in multi-core environments.

Yingfei Xiongمشاهده پروفایل

دانشیار

• Software Engineering
• Programming Languages

Yingfei Xiong is an active Associate Professor at Peking University, China, specializing in software engineering and programming languages. With a consistent research trajectory from 2013 through 2026, Xiong has established themselves as a prominent figure in the software engineering research community, regularly contributing to top-tier conferences including SPLASH, ICSE, ASE, and PLDI. Dr. Xiong's research primarily focuses on program synthesis, automated program repair, and software analysis techniques. Their work bridges theoretical programming language concepts with practical software engineering applications, particularly in developing novel approaches for code generation, bug fixing, and program optimization. The research demonstrates strong interdisciplinary connections between traditional software engineering, programming languages theory, and emerging AI techniques. Analysis of Xiong's publication trends reveals a clear evolution in research focus, beginning with foundational work in API transformations and program adaptation around 2013-2016, shifting toward program repair techniques from 2017-2020, and most recently incorporating machine learning and neural approaches into program synthesis and repair (2021-2026). The work consistently addresses practical challenges in software development while maintaining theoretical rigor, with increasing integration of AI techniques in recent years. Dr. Xiong has served in various leadership roles across the software engineering conference ecosystem, including program committee membership and session chair positions at major conferences. Their extensive service demonstrates recognition by peers as a subject matter expert in software engineering and programming languages research. While specific grant information isn't detailed in the provided text, the sustained publication record suggests successful research funding.

Shuvendu K. Lahiriمشاهده پروفایل

پژوهشگر

• Formal Verification
• Smart Contracts
• Program Synthesis
• +۵ مورد دیگر

Shuvendu K. Lahiri is a researcher at Microsoft Research, focusing on formal verification, program synthesis, and software testing. His work bridges artificial intelligence with formal methods, particularly in blockchain security and automated code generation. 2025 : Published LLM-Vectorizer (verified loop vectorizer) and neural synthesis for SMT-assisted proof-oriented programming 2024 : Explored LLM-based test-driven code generation and natural precondition inference 2023 : Developed resource management specifications and contributed to test generation with pre-trained models 2022 : Advanced Solidity type systems and merge conflict resolution using language models His research combines large language models with formal verification tools to improve software correctness. He actively contributes to conferences like ICSE, PLDI, and ISSTA as author and committee member.

Martín Hötzel Escardóمشاهده پروفایل

استاد

• Homotopy Type Theory
• Univalent Mathematics
• Martin-Löf Type Theory
• +۱۲ مورد دیگر

Martín Hötzel Escardó is a Professor of Theoretical Computer Science in the School of Computer Science at the University of Birmingham, UK. He has been a faculty member since 2000, following previous academic positions at Imperial College London, the University of Edinburgh, and the University of St Andrews. His research bridges theoretical computer science and pure mathematics, with a strong emphasis on foundational aspects of computation. His educational background includes a BSc and MSc from Universidade Federal do Rio Grande Sul (Brazil) and a PhD from Imperial College London (1997) under Michael B. Smyth. Escardó's research interests center on topology in computation , constructive mathematics , dependent and univalent type theory (including Homotopy Type Theory and Cubical Type Theory), domain theory , locale theory , and exact real-number computation . His work explores deep connections between logic, topology, and programming, often using functional languages like Haskell and Agda to formalize and experiment with theoretical ideas. He is particularly known for his discoveries on exhaustively searchable infinite sets and the topological nature of computability. The trend in his recent publications reflects a sustained focus on univalent foundations, constructive domain and order theory, game semantics with dependent types, and the logical structure of type universes. His work consistently advances the formalization and understanding of higher-type computation and constructive mathematics within modern type theories. He has no listed scientific awards in the provided text, but his influence is evident through his extensive publication record and software developments like TypeTopology. Escardó has advised several students and collaborators, though specific names are not listed. He has been involved in significant research projects, particularly in the formalization of mathematics in type theory and the semantics of programming languages. His work often involves developing Agda libraries to formalize new mathematical results constructively. He leads and contributes to a vibrant research group in theoretical computer science at Birmingham, with a focus on logic, semantics, and type theory. His public research blog, lecture notes, and open-source Agda code (e.g., TypeTopology, HoTT-UF-in-Agda) serve as important resources for the community.

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

استادیار

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

Dr. Farzaneh Derakhshan is an Assistant Professor in the Computer Science Department at Illinois Institute of Technology (Illinois Tech), where she explores logical foundations of concurrency and develops formal methods for program verification. She earned her Ph.D. in Pure and Applied Logic from Carnegie Mellon University in 2021 under Frank Pfenning, followed by a postdoctoral fellowship at CMU with Limin Jia and Stephanie Balzer. Current affiliation: Illinois Tech (since ~2021) Previous affiliation: Carnegie Mellon University (Ph.D. and postdoc) Research focus: Type theory, logical verification, and security for concurrent systems Teaching: Courses on programming languages, type systems, and security Her research addresses fundamental challenges in concurrent programming, including: Developing modal logic frameworks for system verification Designing type systems for intermittent computing Creating behavioral type systems for security guarantees Applying relational logic to GPU security and secure compilation Investigating logical foundations of session-typed processes Formal verification of cyclic process networks Current research trends include: Hybrid dynamic verification for parallel systems Logical approaches to side-channel security Formal methods for cyber-physical systems Crash-resilient computing models Security verification in decentralized applications Noninterference proofs in session-typed concurrency Scientific recognition: NSF SaTC CORE Collaborative Award #2350217 Organizing committee member at Dagstuhl Seminar 26071 Professional leadership: Program committee co-chair for PLACES 2025 Committee roles at LICS 2026, ESOP 2026, ICFP 2025, and ECOOP 2025 Regular reviewer for ACM Transactions journals Laboratory involvement: Co-director of behavioral types research at Illinois Tech Collaboration with Carnegie Mellon's formal verification group Key participant in the FACCT workshop

Steve Zdancewicمشاهده پروفایل

استاد

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

Steve Zdancewic is the Schlein Family President's Distinguished Professor and Associate Chair in the Department of Computer and Information Science at the University of Pennsylvania's School of Engineering and Applied Science. He is a leading researcher in programming languages, formal methods, and computer security with over two decades of impactful contributions to the field. His research interests span programming languages, type theory, logic, computer security, quantum programming, and formal verification. Zdancewic has made significant contributions to information-flow security, memory safety, program synthesis, and the verification of low-level systems. His work often bridges theoretical foundations with practical applications, particularly through the development of verified systems using Coq and other proof assistants. Analysis of his recent publications reveals a strong focus on formal verification techniques, particularly using Interaction Trees and the Coq proof assistant. His research trajectory shows consistent evolution from foundational work on information-flow security toward increasingly sophisticated verification of complex systems including LLVM, quantum computing, and distributed systems. His work demonstrates a commitment to building practically useful verification tools while maintaining rigorous theoretical foundations. Distinguished Paper Award for Semantics for Noninterference with Interaction Trees (ECOOP 2023) Schlein Family President's Distinguished Professor (2021) Distinguished Paper Award for Interaction Trees (POPL 2020) Christian R. and Mary F. Lindback Foundation Award for Distinguished Teaching (2018) IEEE MICRO top picks (2013) Alfred P. Sloan Fellow (2009-2010) NSF CAREER award (2004) Zdancewic has advised numerous PhD students who have gone on to successful careers in academia and industry. His research has been supported by significant grants from NSF, including the NSF Expedition on the Science of Deep Specification. He is actively involved in multiple major research projects including Vellvm (verified LLVM), DeepSpec, and quantum programming verification. Zdancewic also co-organizes Penn's PL Club programming languages research group with Benjamin Pierce and Stephanie Weirich.

Ori Lahavمشاهده پروفایل

دانشیار

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

Ori Lahav is a faculty member in the School of Computer Science at Tel Aviv University. His research is generously supported by an ERC Starting Grant and an ISF Grant. He actively supervises PhD and MSc students, and seeks highly motivated candidates for postdoc, PhD, and MSc positions in programming language theory, concurrency, and formal methods. Dr. Lahav completed his PhD at Tel Aviv University under the supervision of Arnon Avron. In 2014, he was a postdoctoral researcher at Tel Aviv University hosted by Mooly Sagiv. From 2014 to September 2017, he was a postdoctoral researcher at MPI-SWS in Germany hosted by Viktor Vafeiadis and Derek Dreyer. His primary research areas focus on programming languages and verification, with specialization in concurrency and relaxed memory models. He also has significant interests in proof-theory, semantics of non-classical logics, and automated reasoning. His work bridges theoretical foundations with practical applications in programming language design and implementation. Dr. Lahav's publication record shows a consistent trajectory of high-impact research in top-tier conferences including PLDI, POPL, OOPSLA, and ESOP. His recent work (2023-2025) demonstrates continued leadership in memory models, concurrency semantics, and verification techniques. His research spans both theoretical contributions in denotational semantics and practical tools for verification. Best Paper Award DISC 2024 Best Student Paper Award DISC 2024 Distinguished Artifact Award ESOP 2022 Distinguished Paper Award OOPSLA 2021 Kleene Award for Best Student Paper LICS 2013 Dr. Lahav actively advises students including Yoav Ben Shimon, Yotam Dvir, Amir Karniel, and Roy Margalit (PhD students), Yuval Katsman Ezra (MSc student), and has alumni including Ori Saporta (MSc) and Abhishek Kr Singh (postdoc, now Assistant Professor at IIIT Hyderabad). He has organized significant events including VMCAI 2024 and Dagstuhl Seminars on persistent programming. His teaching portfolio includes courses on Shared Memory Concurrency Semantics, Programming Language Foundations, and Software Foundations in Coq.