Manuel Rigger
@mrigger.bsky.social
Assistant Professor at the National University of Singapore, leading the Trustworthy Engineering of Software Technologies lab (https://nus-test.github.io/). We focus on improving data-centric systems, particularly their reliability.
Thanks to @ningkeli.bsky.social and Yibo Dong for co-organizing!
October 19, 2025 at 2:13 PM
Thanks to @ningkeli.bsky.social and Yibo Dong for co-organizing!
To set expectations: on some other days, we saw close to nothing on the same hike.
August 25, 2025 at 6:59 AM
To set expectations: on some other days, we saw close to nothing on the same hike.
SQuaLity is a unified database system test suite. Currently, database test suites are not systematically re-used across systems. We explore the opportunities and challenges of doing so. Reusing test suites is difficult due to multiple factors, but also allows finding otherwise overlooked bugs.
June 19, 2025 at 8:10 AM
SQuaLity is a unified database system test suite. Currently, database test suites are not systematically re-used across systems. We explore the opportunities and challenges of doing so. Reusing test suites is difficult due to multiple factors, but also allows finding otherwise overlooked bugs.
CODDTest is a new testing approach for finding logic bugs in relational database systems. We got inspiration from constant folding and propagation and compilers; by ensuring that the database state is constant, we can fold elements of a query to then check whether its result remains unchanged.
June 19, 2025 at 8:10 AM
CODDTest is a new testing approach for finding logic bugs in relational database systems. We got inspiration from constant folding and propagation and compilers; by ensuring that the database state is constant, we can fold elements of a query to then check whether its result remains unchanged.
Our second paper is on finding bugs in graph libraries and databases. The key insight behind "Graph-Cutting" is that graph algorithms are sensitive to graph structures. By dividing one graph into multiple subgraphs, we can infer checkable relationships between the results while stressing the system.
June 19, 2025 at 8:10 AM
Our second paper is on finding bugs in graph libraries and databases. The key insight behind "Graph-Cutting" is that graph algorithms are sensitive to graph structures. By dividing one graph into multiple subgraphs, we can infer checkable relationships between the results while stressing the system.
We will present "Affine Equivalent Inputs", an approach to finding logic bugs in spatial databases like PostGIS. The key contribution of the paper is a new test oracle. If we apply an affine transformation like rotation to two geometries, topological relationships like intersection are preserved.
June 19, 2025 at 8:10 AM
We will present "Affine Equivalent Inputs", an approach to finding logic bugs in spatial databases like PostGIS. The key contribution of the paper is a new test oracle. If we apply an affine transformation like rotation to two geometries, topological relationships like intersection are preserved.