BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20230124T171522Z
LOCATION:C143-149
DTSTART;TZID=America/Chicago:20221113T153000
DTEND;TZID=America/Chicago:20221113T160000
UID:submissions.supercomputing.org_SC22_sess433_ws_prot105@linklings.com
SUMMARY:Generating and Analyzing Program Call Graphs Using Ontology
DESCRIPTION:Workshop\n\nGenerating and Analyzing Program Call Graphs Using
  Ontology\n\nDorta, Yan, Liao\n\nCallgraph or caller-callee relationships 
 have been used for various kinds of static program analysis, performance a
 nalysis and profiling, and for program safety or security analysis such as
  detecting anomalies of program execution or code injection attacks. Howev
 er, different tools generate call graphs in different formats, which preve
 nts efficient reuse of call graph results. We present an approach of using
  ontology and resource description framework (RDF) to create knowledge gra
 ph for specifying callgraphs to facilitate the construction of full-fledge
 d and complex call graph of computer programs, realizing more interoperabl
 e and scalable program analyses than conventional approach. We create form
 al ontology-based specification of call graph information to capture conce
 pts and properties of both static and dynamic callgraphs so different tool
 s can collaboratively contribute to comprehensive analysis results. Our ex
 periments show that ontology enables merging of call graphs generated from
  different tools and flexible queries using a standard query interface.\n\
 nSession Format: Recorded\n\nRegistration Category: Workshop Reg Pass
END:VEVENT
END:VCALENDAR