Skip to content
Mining for Bugs with Graph Database Queries (31c3) episode artwork

EPISODE · Dec 28, 2014 · 55 MIN

Mining for Bugs with Graph Database Queries (31c3)

from Chaos Computer Club - archive feed (high quality) · host fabs

While graph databases are primarily known as the backbone of the modern dating world, this nerd has found a much more interesting application for them: program analysis. This talk aims to demonstrate that graph databases and the typical program representations developed in compiler construction are a match made in heaven, allowing large code bases to be mined for vulnerabilities using complex bug descriptions encoded in simple, and not so simple graph database queries. about this event: http://events.ccc.de/congress/2014/Fahrplan/events/6534.html

Episode metadata supplied by the publisher feed · Published Dec 28, 2014

Embed this episode

Ready to play

Mining for Bugs with Graph Database Queries (31c3)

0:00 55:02

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

No similar podcasts found.

Frequently Asked Questions

How long is this episode of Chaos Computer Club - archive feed (high quality)?

This episode is 55 minutes long.

When was this Chaos Computer Club - archive feed (high quality) episode published?

This episode was published on December 28, 2014.

Can I download this Chaos Computer Club - archive feed (high quality) episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!