Foto del docente

Claudio Sacerdoti Coen

Professore associato

Dipartimento di Informatica - Scienza e Ingegneria

Settore scientifico disciplinare: INF/01 INFORMATICA

Coordinatore del Corso di Laurea in Informatica

Pubblicazioni

Accattoli, B.; Sacerdoti Coen, C., On the value of variables, in: Logic, Language, Information and Computation, Berlin, Springer Berlin Heidelberg, «LECTURE NOTES IN COMPUTER SCIENCE», 2014, 8652 LNCS, pp. 36 - 50 (atti di: 21st Workshop on Logic, Language, Information and Communication, WoLLIC 2014, Valparaiso, Chile, 01-04/09/2014) [Contributo in Atti di convegno]

R. M. Amadio; N. Ayache; Y. Régis-Gianas; R. Saillard; B. Campbell; D. Mulligan; P. Tranquilli; C. Sacerdoti Coen, CerCo Cost Annotating Compiler, 2013. [software]

J. Boender; B. Campbell; I. Gardner; J. McKinna; D. P. Mulligan; M. Piccolo; C. Sacerdoti Coen; I. Stark; P. Tranquilli, Trusted CerCo Cost Annotating Compiler, 2013. [software]

A. Asperti; W. Ricciotti; C. Sacerdoti Coen; E. Tassi, A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions, «LOGICAL METHODS IN COMPUTER SCIENCE», 2012, 8, pp. 1 - 49 [articolo]

O. Al-Hassani; Q. Mahesar; C. Sacerdoti Coen; V. Sorge, A Term Rewriting System for Kuratowski's Closure-Complement Problem, in: Leibniz International Proceedings in Informatics (LIPIcs), DAGSTUHL, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, «LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS», 2012, 15, pp. 38 - 52 (atti di: 23rd International Conference on Rewriting Techniques and Applications (RTA'12), Nagoya (Japan), May 30-June 1, 2012) [Contributo in Atti di convegno]

A. Asperti; W. Ricciotti; C. Sacerdoti Coen; E. Tassi, Formal Metatheory of Programming Languages in the Matita Interactive Theorem Prover, «JOURNAL OF AUTOMATED REASONING», 2012, 49(3), pp. 427 - 451 [articolo]

C. Sacerdoti Coen; E. Zoli, Lebesgue's dominated convergence theorem in Bishop's style, «ANNALS OF PURE AND APPLIED LOGIC», 2012, 163(2), pp. 140 - 150 [articolo]

A. Asperti; F. Guidi; W. Ricciotti; C. Sacerdoti Coen; E. Tassi, Matita 0.99.1, 2012. [software]

Dominic P. Mulligan;Claudio Sacerdoti Coen, On the Correctness of an Optimising Assembler for the Intel MCS-51 MicroprocessorCertified Programs and Proofs, in: Lecture Notes in Computer ScienceCertified Programs and Proofs, Springer Verlag, «LECTURE NOTES IN ARTIFICIAL INTELLIGENCE», 2012, 7679, pp. 43 - 59 (atti di: Certified Programs and Proofs, Kyoto, 13-15 Dicembre 2012) [Contributo in Atti di convegno]

D. Aspinall; C. Sacerdoti Coen, Proceedings of the 9th International Workshop On User Interfaces for Theorem Provers (UITP10), Amsterdam, Academic Press (Elsevier), 2012, pp. 120 . [curatela]

F.Rabe; M.Kohlhase; C.Sacerdoti Coen, A Foundational View on Integration Problems, in: Intelligence Computer Mathematics - Lecture Notes in Artificial Intelligence, HEIDELBERG, Springer-Verlag, «LECTURE NOTES IN COMPUTER SCIENCE», 2011, 6824, pp. 107 - 122 (atti di: International Conference on Intelligent Computer Mathematics (CICM 2011), Bertinoro (Italy), 18-23/07/2011) [Contributo in Atti di convegno]

R. Armadio; A. Asperti; N. Ayache; B. Campbell; D. Mulligan; R. Pollack; Y. Regis-Gianas; C. Sacerdoti Coen; I. Stark, Certified Complexity, «PROCEDIA COMPUTER SCIENCE», 2011, 7, pp. 175 - 177 [articolo]

C. Sacerdoti Coen; E. Tassi, Formalising Overlap Algebras in Matita, «MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE», 2011, 21(4), pp. 763 - 793 [articolo]

Asperti, Andrea; Maietti, M. E.; SACERDOTI COEN, Claudio; Sambin, G.; Valentini, S., Formalization of Formal Topology by Means of the Interactive Theorem Prover Matita., in: Lecture Notes in Computer Science, Springer-Verlag, 2011, 6824, pp. 278 - 280 (atti di: Intelligent Computer Mathematics - 18th Symposium, Calculemus 2011, and 10th International Conference, MKM 2011., Bertinoro, Italy,, 18-23 Luglio 2011) [Contributo in Atti di convegno]

Claudio Sacerdoti Coen;Enrico Tassi, Nonuniform Coercions via Unification Hints, «ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE», 2011, 53, pp. 16 - 29 [articolo]