| IT305 | > | Proof assistants | > | PVS Mini Project |
created 8 November 2006, last edition 22 October 2010
Remark: there will
be a project defence in
the context of IT304
twin module.
|
|
|
|
Project archive prof advice |
Public Defence All students must attend whole session! 27 January 2010 |
| Graph library and graph coloring problem: continuation and improvement of last year related project. | CHARRE
Martial EGRON Gerome GOURNAY Sylvain RICCIO Damien |
|
team1 [pvs, slides] prof advice |
9:00am with Prof. ??? ??? |
| Transitive closure of a finite relation: equivalence of a mathematical definition of transitive closure and a computational one, see last year related project: complete proofs, and redo from scratch, using a more general approach (based on operational and theoretical fixpoint) | El Assas Akram Martin Bousquet Arthur Redondy Pascal Noisette Théo Tatinclaux Cameron van den Bergh |
|
team2 [pvs] prof advice |
9:30am with Prof. ??? ??? |
| Marienbad game (a Nim variant): show that the second player has a winning strategy | TRAN QUANG Thanh Truc LONG Qin Qin Aïcha Hamza Laetitia Higonenq |
|
|
10:00am with Prof. ??? ??? |
| Adapt PVS 2.3 libraries of First Order Logic and Imperative Program Verification to PVS 2.4 (and/or higher). | Meryem Alaoui Soulimani Elizabeth Flores Chavez Ghileg Gharbi Saad Seffar |
|
team4 [pvs] prof advice |
10:45am with Prof. ??? ??? |
| Extend a library of matrix calculus developed over the years by previous students: generalize from real number to some adequate structure (probably a ring), and add some interesting theorems. [not sure what could be added ...]; | Jendoubi Walid Boughanmi Hamdi Frikha Kamel Baccouche Taha |
|
team5 [pvs] prof advice |
11:45am with Prof. ??? ??? |
Back to Top