Stratulat Sorin
UFR MIM - Département Informatique
MCF, membre Permanent du LITA.
Membre du conseil de laboratoire
equipe Calculs, Graphes et Logique
Téléphone | 0387315329 |
---|---|
sorin.stratulat@univ-lorraine.fr | |
Web | http://www.lita.univ-lorraine.fr/~stratula |
Publications
Articles dans des revues internationales ou nationales avec comité de lecture répertoriées par l'HCRES
2017 | Mechanically certifying formula-based Noetherian induction reasoning [] S. Stratulat Journal of Symbolic Computation, Volume 80, Part 1. Pages 209-249 |
2016 | Mechanically Certifying Formula-based Noetherian Induction Reasoning [ACL85] S. Stratulat Journal of Symbolic Computation. 50 pages. à paraître |
Articles dans les proceedings de conférences internationales avec comité de lecture
2016 | Structural vs. cyclic induction: a report on some experiments with Coq [] S. Stratulat SYNASC 2016 : Proceedings of the 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, IEEE Computer Society. Pages 27-34 |
2016 | A case study on Algorithm Discovery from Proofs : The insert Function on Binary Trees [] I. Dramnesc, T. Jebelean, S. Stratulat SACI 2016 : 11th IEEE International Symposium on Applied Computational Intelligence and Informatics, IEEE, pages 231-236 |
2016 | Proof-based Synthesis of Sorting Algorithms for Trees [ACTI69] I. Dramnesc, T. Jebelean, S. Stratulat In LATA 2016: Proceedings of the 10th International Conference on Language and Automata Theory and Applications. LNCS, Springer Verlag, pages 562-575 |
2016 | Combinatorial Techniques for Proof-based Synthesis of Sorting Algorithms [ACTI70] I. Dramnesc, T. Jebelean, S. Stratulat In SYNASC 2015: Proceedings of the 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. IEEE Computer Society. à paraître |
2015 | Theory exploration of binaries trees [ACTI67] I. Dramnesc, T. Jebelean, S. Stratulat In SISY 2015: 13th IEEE International Symposium on INtelligent Systems and Informatics, IEEE Publishing, pages 139-144 |
2015 | Better Carriers for Transnational European Students ? A Case Study for French-German Diploma Alumni. [ACTI68] G. Michel, V. Jeanclaude, S. Stratulat In ICEUTE 2015: 6th International Conference on EUropean Transnational Education. In Advances in Intelligent Systems and Computing 369, Springer, pages 517-524 |
2014 | Decision procedures for proving inductive theorems without induction [ACTI74] T. Aoto, S. Stratulat In Proc. of the 16th International Symposium on Principles and Practice of Declarative Programming (PPDP 2014), pages 237–248 |
2014 | Implementing reasoning modules in implicit induction theorem provers. [ACTI75] S. Stratulat In SYNASC 2014: Proceedings of the 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. IEEE Computer Society, pages 133-140 |
2013 | Performing implicit induction reasoning with certifying proof environments [ACTI84] A. Henaien, S. Stratulat In Adel Bouhoula and Tetsuo Ida and Fairouz Kamareddine éditeur : SCSS’ 2013 (International Symposium on Symbolic Computation in Software Science), pages 97-108, EPTCS (Electronic Proceedings in Theoretical Computer Science), 2013 |
2012 | A Unified View of Induction Reasoning for First-Order Logic [ACTI92] S. Stratulat In Turing-100 (The Alan Turing Centenary Conference), Manchester. Volume 10 of EPiC Series. pages 326-352. Attribution d'un des prix 'Best Paper' |
2011 | Creating transnational courses : Feedback and solutions [ACTI98] G. Michel, S. Stratulat In ICEUTE |
2011 | Automated certification of implicit induction proofs [ACTI99] S. Stratulat, V. Demange In CPP'2011 (First International Conference on Certified Programs and Proofs), LNCS, vol. 7086, Kenting (Taiwan), Springer Verlag, pages 37-53 |
Ouvrages scientifiques (ou chapitres de ces ouvrages).
2012 | Preuves par récurrence avec ensembles couvrants contextuels [OS6] S. Stratulat Editions Universitaires Européennes. 200p |