BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:6a1dc4904a95486c0aaf46523137cf25
DTSTAMP:20260813T021901Z
SUMMARY:CS MSc Thesis Presentation 25 August 2026
DESCRIPTION:Kontakt: birger.swahn@cs.lth.se\n\nTuesday\, 25 August there wi
 ll be a master thesis presentation in Computer Science at Lund University\
 , Faculty of Engineering.The presentation will take place in E:2116.Note t
 o potential opponents: Register as an opponent to the presentation of your
  choice by sending an email to the examiner for that presentation (firstna
 me.lastname@cs.lth.se). Do not forget to specify the presentation you regi
 ster for! Note that the number of opponents may be limited (often to two)\
 , so you might be forced to choose another presentation if you register to
 o late. Registrations are individual\, just as the oppositions are! More i
 nstructions for opponents are found here on the LTH thesis project page.13
 :15-14:00 in E:2116Presenters: Daniel Adu-Gyan\, Dag HembergTitle: DeCyphe
 r: Debugging Queries in Graph DatabasesExaminer: Görel HedinSupervisors: 
 Anton Risberg Alaküla (LTH)\, Oskar Damkjaer (Neo4j)Debugging tools are u
 seful for software development. Imperative languages often have debuggers 
 that allow developers to execute the code step-by-step\, but declarative l
 anguages\, like database query languages\, largely lack equivalent support
 . Instead\, special-purpose debuggers are needed.In this thesis we present
  DeCypher\, a query-plan-based step-by-step debugger for Neo4j’s declara
 tive query language Cypher\, which lets developers perform many debugging 
 tasks similar to ones found in imperative languages.We evaluate the useful
 ness and experience of using DeCypher through a user study\, comparing deb
 ugging performance with and without the tool across four debugging tasks. 
 We show that participants using DeCypher achieve a higher success rate in 
 locating bugs\, but no meaningful change in perceived difficulty when doin
 g so.These findings suggest that step-by-step debugging based on the query
  plan can help Cypher developers\, but is likely not a complete replacemen
 t for existing approaches.&nbsp\;\n\nMer information om händelsen: https:
 //www.cs.lth.se/evenemang/cs-msc-thesis-presentation-25-august-2026
DTSTART;TZID=GMT:20260825T111500
DTEND;TZID=GMT:20260825T120000
LOCATION:E:2116
END:VEVENT
END:VCALENDAR