BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Events - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://events.ucsc.edu
X-WR-CALDESC:Events for Events
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20240310T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20241103T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20250309T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20251102T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20260308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20261101T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251203T110000
DTEND;TZID=America/Los_Angeles:20251203T123000
DTSTAMP:20260409T160557
CREATED:20251103T224713Z
LAST-MODIFIED:20251119T191907Z
UID:10005028-1764759600-1764765000@events.ucsc.edu
SUMMARY:When Less is More: Applications of Type-Based Underapproximate Reasoning
DESCRIPTION:Presenter: Suresh Jagganathan\, Purdue University\n\n\nAbstract:\nUnlike program verifiers\, symbolic execution and property-based testing tools underapproximate program behavior: they aim to report only real bugs (no false positives)\, at the cost of potentially missing some (false negatives). Recent work has sought to place such tools on a more formal footing\, primarily through the development of incorrectness logics that capture a program’s ‘must’ rather than ‘may’ behavior. This talk explores how to transplant these ideas of underapproximation into an expressive refinement type system. Our development enables us to:\n\n(a) Typecheck the completeness of property-based testing (PBT) generators\, ensuring that a well-typed generator produces all values (i.e.\, fully covers) its output type;\n\n(b) Synthesize effectful generators by extending the type system to model underapproximations of sequences of effects rather than just values; and\n\n(c) Guide symbolic execution in effectful functional programs\, prioritizing execution paths capable of falsifying data structure safety properties.\n\nOur results demonstrate that viewing types through the lens of underapproximation offers a principled foundation for designing\, implementing\, and reasoning about program analyzers and test generators\, significantly improving their reliability and practical utility in the process.\n\n\nBio:\nSuresh Jagannathan is the Samuel D. Conte Professor of Computer Science at Purdue University. His interests span functional programming\, program verification\, distributed and concurrent systems\, and trustworthy machine learning. In recent years\, he has spent time as an Amazon Scholar\, a program manager at the Information Innovoation Office (I2O) at DARPA\, and a visiting researcher at the University of Cambridge. He serves an Associate Editor of ACM TOPLAS\, and has served as both General and PC Chair of POPL (ACM Symposium on Programming Languages).\n\n\nHosted by: Professor Mohsen Lesani\n\n\nLocation: E2-180\n*Refreshments such as coffee and pastries will be provided\n\n\n\nZoom: https://ucsc.zoom.us/j/93445911992?pwd=YkJ2TQtF79h0PcNXbEcpZLbpK0coiY.1&jst=3
URL:https://events.ucsc.edu/event/when-less-is-more-applications-of-type-based-underapproximate-reasoning/
LOCATION:Engineering 2\, Engineering 2 1156 High Street\, Santa Cruz\, CA\, 95064
CATEGORIES:Lectures & Presentations,Seminars
ATTACH;FMTTYPE=image/png:https://events.ucsc.edu/wp-content/uploads/2025/11/Screenshot-2025-11-03-at-2.45.08-PM.png
GEO:37.0009723;-122.0632371
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Engineering 2 Engineering 2 1156 High Street Santa Cruz CA 95064;X-APPLE-RADIUS=500;X-TITLE=Engineering 2 1156 High Street:geo:-122.0632371,37.0009723
END:VEVENT
END:VCALENDAR