Dr Cécilia Pradic

Research Highlights

1. Benedikt, M., Pradic, C., & Wernhard, C. (2023). Synthesizing Nested Relational Queries from Implicit Specifications. In Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database SystemsACM.

   https://doi.org/10.1145/3584372.3588653, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa61306

   http://dx.doi.org/10.1145/3584372.3588653
2. Pradic, C. & Riba, C. (2018). LMSO: A Curry-Howard Approach to Church's Synthesis via Linear Logic. In Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer ScienceACM.

   https://doi.org/10.1145/3209108.3209195, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa58115
3. Pradic, C. & Riba, C. (2019). A Dialectica-Like Interpretation of a Linear MSO on Infinite Words. In Lecture Notes in Computer Science (pp. 470-487). Springer International Publishing.

   https://doi.org/10.1007/978-3-030-17127-8_27, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa58114
4. Doumane, A., Kuperberg, D., Pous, D., & Pradic, C. (2019). Kleene Algebra with Hypotheses. In Lecture Notes in Computer Science (pp. 207-223). Springer International Publishing.

   https://doi.org/10.1007/978-3-030-17127-8_12, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa58113
5. Kolodziejczyk, L., Michalewski, H., Pradic, C., & Skrzypczak, M. (2016). The logical strength of Büchi's decidability theorem. In 25th EACSL Annual Conference on Computer Science Logic (CSL 2016) (pp. 36:1-36:16). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik.

   https://doi.org/10.4230/LIPIcs.CSL.2016.36, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa58112

   http://drops.dagstuhl.de/opus/volltexte/2016/6576

All Research