This paper describes QL, a language for querying complex, potentially recursive data structures. QL compiles to Datalog and runs on a standard relational database, yet it provides familiar-looking object-oriented features such as classes and methods, reinterpreted in logical terms: classes are logical properties describing sets of values, subclassing is implication, and virtual calls are dispatched dynamically by considering the most specific classes containing the receiver. Furthermore, types in QL are prescriptive and actively influence program evaluation rather than just describing it. In combination, these features enable the development of concise queries based on reusable libraries, which are written in a purely declarative style, yet can be efficiently executed even on very large data sets. In particular, we have used QL to implement static analyses for various programming languages, which scale to millions of lines of code.
Note: The version of the paper included in the proceedings contains some misprints and typographical glitches that are fixed in the version available on the Semmle website, which should be considered the canonical version.
Wed 20 JulDisplayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
15:30 - 16:45
|Making an Embedded DBMS JIT-friendly|
Carl Friedrich Bolz-Tereick King's College London , Darya Melicher Carnegie Mellon University, Laurence Tratt King's College LondonLink to publication DOI Pre-print Media Attached
|QL: Object-oriented Queries on Relational Data|
Research TrackLink to publication DOI Pre-print
|Transactional Tasks: Parallelism in Software Transactions|
Janwillem Swalens Vrije Universiteit Brussel, Joeri De Koster Vrije Universiteit Brussel, Wolfgang De Meuter Vrije Universiteit BrusselLink to publication DOI Pre-print Media Attached