PhD Comprehensive Examination
Relevant information regarding my PhD comprehensive examination.
Exam date & location
May 17, 2022 11:00 - 13:00
College of Education's conference room, Room 227, University Hall 2nd floor, Summerville Campus.
Documents
List of papers
Committee members can obtain these papers following this link.
-
Gilles Barthe, Delphine Demange, and David Pichardie. “Formal Verification of an SSA-based Middle-end for CompCert”. In: ACM Transactions on Programming Languages and Systems 36.1 (Mar. 2014), 1–35. doi: 10.1145/2579080.
-
Amir M Ben-Amram and Geoff Hamilton. “Tight Polynomial Worst-Case Bounds for Loop Programs”. In: Logical Methods in Computer Science 16.2 (May 2020), 4:1–4:39. doi: 10.23638/LMCS-16(2:4)2020.
-
Neil D. Jones and Lars Kristiansen. “A Flow Calculus of mwp-Bounds for Complexity Analysis“. In: ACM Transactions on Computational Logic 10.4 (Aug. 2009), 28:1–28:41. doi: 10.1145/1555746.1555752.
-
Jacques-Henri Jourdan et al. “A Formally-Verified C Static Analyzer”. In: ACM SIGPLAN Notices 50.1 (Jan. 2015), pp. 247–259. doi: 10.1145/2775051.2676966.
-
Moyen, Jean-Yves, Thomas Rubiano, and Thomas Seiller. “Loop Quasi-Invariant Chunk Detection“. In: International Symposium on Automated Technology for Verification and Analysis. Springer, 2017, pp. 91–108. doi: 10.1007/978-3-319-68167-2_7.
-
Jean-Yves Moyen. “Implicit Complexity in Theory and Practice“. HDR, University of Copenhagen, 2017.
Timeline and plan
| Date | Description | |
|---|---|---|
| ✔️ | March 28 | Possible composition of the committee is sent to program director |
| ✔️ | April 1 | The committee is approved, and the list of paper is shared |
| ✔️ | April 11 | The committee approves the list of papers |
| ✔️ | April 25 | The "Pre-Approval Form" is sent to TGS |
| ✔️ | May 2 | Submission of written document to committee |
| ✔️ | May 2 | Invitations to oral exam are sent to fellow graduate students |
| ✔️ | May 17 | The oral exam, in front of the committee and students |