Dr Hana Chockler Professor Hana Chockler Academics Supervisors Professor of Computer Science Research subject areas Computer science Contact details +44 020 7848 2928 hana.chockler@kcl.ac.uk
Explaining Negative Classifications of AI Models in Tumor Diagnosis Counterfactual Influence in Markov Decision Processes Test Where Decisions Matter: Importance-driven Testing for Deep Reinforcement Learning Explaining Image Classifiers A Causal Analysis of Harm Quantifying Harm A Study of Demographic Bias in CNN-Based Brain MR Segmentation Specifiable robustness in reactive synthesis Finding rare numerical stability errors in concurrent computations A Causal Analysis of Harm On Testing for Discrimination Using Causal Models Ranking Policy Decisions Explanations for Occluded Images Vacuity in synthesis Preface of the special issue on the conference on computer-aided verification 2018 Explaining Image Classifiers Using Statistical Fault Localization Combining Experts’ Causal Judgments Learning the Language of Software Errors Which bases admit non-trivial shrinkage of formulae? A Practical Approach to Coverage in Model Checking omega-Regular Languages Are Testable with a Constant Number of Queries Coverage of Implementations by Simulating Specifications Responsibility and Blame: A Structural-Model Approach Coverage Metrics for Formal Verification w-Regular languages are testable with a constant number of queries Synthesizing reactive systems using robustness and recovery specifications Responsibility and Blame: A Structural-Model Approach A lower bound for testing juntas Lattice-based SMT for Program Verification Efficiently Verifiable Conditions for Deadlock-Freedom of Large Concurrent Programs Temporal Modalities for Concisely Capturing Timing Diagrams Formal verification of concurrent software: two case studies Behavioral Compatibility Without State Explosion: Design and Verification of a Component-Based Elevator Control System Coverage metrics for formal verification Coverage metrics for temporal logic model checking Automatic Verification of Fault-Tolerant Register Emulations Easier and More Informative Vacuity Checks Cross-Entropy Based Testing Computing Interpolants without Proofs Verification of software changes with ExpliSAT Using cross-entropy for satisfiability Finding rare numerical stability errors in concurrent computations Beyond Vacuity: Towards the Strongest Passing Formula PINCETTE - Validating Changes and Upgrades in Networked Software Verifying cloud services: present and future Lookahead-Based SMT Solving Function Summarization Modulo Theories Lattice-Based Refinement in Bounded Model Checking Timed Vacuity Which formulae shrink under random restrictions? View all publications
6 February 2024 King's part of £80 million boost in AI research to deliver revolutionary new technologies Nine research hubs across the UK will help underpin the country’s commitment to leading AI research,…