BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CECS - ECPv6.18.4//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://www.cecs.uci.edu
X-WR-CALDESC:Events for CECS
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:20030406T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20031026T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20040404T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20041031T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20050403T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20051030T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20040817T150000
DTEND;TZID=America/Los_Angeles:20040817T160000
DTSTAMP:20231011T183336Z
CREATED:20231011T183336Z
LAST-MODIFIED:20231011T183336Z
UID:14299-1092754800-1092758400@www.cecs.uci.edu
SUMMARY:Taming Pointers – A Symbolic Approach
DESCRIPTION:Taming Pointers – A Symbolic Approach\n\n\n\n\nSpeaker\n\n\nProfessor Jianwen Zhu \nDepartment of Electrical and Computer Engineering\nUniversity of Toronto\, Canada\n\n\n\n\n\n\n\n\n\n\nCECS Host\n\n\nProfessor Daniel Gajski\n\n\n\n\n\n\n\n\n\n\nLocation\n\n\nMcDonnell Douglas Auditorium\n\n\n\n\n\n\n\n\n\n\nDate & Time\n\n\nTuesday\, August 17\, 2004\nRefreshments at 2:30pm\, Seminar begins at 3:00pm\n\n\n\n\n\n\n\n\n\n\nAbstract\n\n\nThe silicon real estate available in systems-on-chip (SOC) has given hope for the massive-parallel\, high-performance implementation of complex applications. However\, new efforts in silicon compilers that synthesize applications in C into SOC cannot dodge an old problem\, called pointer analysis\, which has been actively pursued in the programming language and compiler community for two decades. The challenges of precise pointer analysis stem from the need to explore an exponential number of program execution paths\, and the need to maintain program state for every program point under all such paths. In this talk\, I will introduce a new method for constructing scalable graph algorithms (ICCAD’02\, PLDI’04)\, called superposition\, which solves different problem instances in an aggregate fashion. Applying this method to pointer analysis\, different program states under different execution paths are combined into a single Boolean function\, and solved together using the efficient\, BDD-based image computation operator developed by the formal verification community. Experimental results show that context-sensitive\, flow-insensitive analysis on programs with billions of different calling paths can be performed\, and benchmarks as large as GCC (200KLOC) can be completed in seconds. The subject of this talk can be of interest to researchers in CAD\, compiler\, software engineering and security.\n\n\n\n\n\n\n\n\n\n\nBiography\n\n\n  \n\n \nJianwen Zhu received the B.S degree in electrical engineering from the Tsinghua University\, Beijing\, China\, and the M.S. and Ph.D. degrees in computer science from the University of California\, Irvine\, in 1993\, 1996 and 1999 respectively. He is currently an assistant professor in the Department of Electrical and Computer Engineering\, University of Toronto\, Canada. He is the coauthor of the book SpecC: Specification Language and Methodology (Kluwer-Academic\, 2000). His research interest includes hardware/software codesign\, high-level synthesis for high-performance circuits and retargetable compilation. \n\n\n\n\n\nTaming Pointers – A Symbolic Approach\nclick on the thumbnails to view the full-sized images
URL:https://www.cecs.uci.edu/event/taming-pointers-a-symbolic-approach/
LOCATION:CA
CATEGORIES:Seminars at CECS
END:VEVENT
END:VCALENDAR