BEGIN:VCALENDAR VERSION:2.0 PRODID:-//jEvents 2.0 for Joomla//EN CALSCALE:GREGORIAN METHOD:PUBLISH BEGIN:VEVENT UID:4bf399d8f90862e24f4a016bbaedce29 CATEGORIES:Lectures & Presentations CREATED:20161005T145833 SUMMARY:Guest Talk: "(anti-)unification-based techniques for program analysis" LOCATION:Vienna DESCRIPTION:Automation Systems Group, SBA Research, and AIT Safety and Security Departm ent are happy to present the "Cyber Security Lecture Series" organizing lea ding edge talks by international ICT security experts in Austria.\nThe next lecture will be given by Temur Kutsia, RISC Johannes Kepler University Lin z.\nTalk: (anti-)unification-based techniques for program analysis\nAbstrac t: Unification and anti-unification are dual methods, studied in computatio nal logic. Given two terms, unification helps to compute their most general common instance, while anti-unification gives their least general generali zation. Both techniques have a wide range of applications. Unification is a n important computational mechanism for automated reasoning, term rewriting , declarative programming, type inference. Anti-unification has been used i n machine learning, program synthesis, reasoning and programming by analogy , etc. In this talk we overview some recent advances in these techniques an d discuss their application in program analysis, with the focus on clone de tection.\nThis event is hosted by the IEEE CS/SMCS Austria Chapter (http:// www.ieee-austria.org/index.php/chapters/36-cs-smcs).\n\n X-ALT-DESC;FMTTYPE=text/html:
Automation Systems Group, SBA Research, and AIT Safety and Securit y Department are happy to present the "Cyber Security Lecture Series" organ izing leading edge talks by international ICT security experts in Austria.< /p>
The next lecture will be given by Temur Kutsia, RISC Johannes K epler University Linz.
Talk: (an ti-)unification-based techniques for program analysis
Abstract: Unification and anti-unif ication are dual methods, studied in computational logic. Given two terms, unification helps to compute their most general common instance, while anti -unification gives their least general generalization. Both techniques have a wide range of applications. Unification is an important computational me chanism for automated reasoning, term rewriting, declarative programming, t ype inference. Anti-unification has been used in machine learning, program synthesis, reasoning and programming by analogy, etc. In this talk we overv iew some recent advances in these techniques and discuss their application in program analysis, with the focus on clone detection.
This ev ent is hosted by the IEE E CS/SMCS Austria Chapter.
CONTACT:This email address is being protected from spambots. You need JavaScript enabled to view it. document.getElementById('cloak532a1985041d9366b61436ade0c8c2a8').innerHTML = ''; var prefix = 'ma' + 'il' + 'to'; var path = 'hr' + 'ef' + '='; var addy532a1985041d9366b61436ade0c8c2a8 = 'events' + '@'; addy532a1985041d9366b61436ade0c8c2a8 = addy532a1985041d9366b61436ade0c8c2a8 + 'sba-research' + '.' + 'org'; var addy_text532a1985041d9366b61436ade0c8c2a8 = 'events' + '@' + 'sba-research' + '.' + 'org';document.getElementById('cloak532a1985041d9366b61436ade0c8c2a8').innerHTML += ''+addy_text532a1985041d9366b61436ade0c8c2a8+''; X-EXTRAINFO:04/08 DTSTAMP:20240329T064037 DTSTART:20160928T093000 DTEND:20160928T103000 SEQUENCE:0 TRANSP:OPAQUE END:VEVENT END:VCALENDAR