Claudio Sacerdoti Coen

Citado por

	Total	Desde 2019
Citas	1669	505
Índice h	22	13
Índice i10	47	18

140

105

20012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202411 20 39 30 21 46 85 55 88 89 86 111 70 88 80 67 85 64 126 87 85 87 97 23

Acceso público

Ver todo

12 artículos

1 artículo

disponibles

no disponibles

Basado en requisitos de financiación

Coautores

aspertiUniversity of BolognaDirección de correo verificada de cs.unibo.it
Stefano ZacchiroliLTCI, Télécom Paris, Polytechnique Institute of Paris, FranceDirección de correo verificada de telecom-paris.fr
Ferruccio GuidiUniversity of BolognaDirección de correo verificada de cs.unibo.it
Wilmer RicciottiUniversity of EdinburghDirección de correo verificada de wilmer-ricciotti.net
Andrea CondoluciPhD at University of BolognaDirección de correo verificada de studio.unibo.it
Dominic MulliganPrincipal Applied Scientist, Amazon Web ServicesDirección de correo verificada de amazon.co.uk
Florian RabeUniversity Erlangen-NurembergDirección de correo verificada de fau.de
Yann Régis-GianasIRIF, CNRS, INRIA, Paris Diderot UniversityDirección de correo verificada de pps.univ-paris-diderot.fr
Ian StarkLaboratory for Foundations of Computer Science, School of Informatics, University of EdinburghDirección de correo verificada de ed.ac.uk
Jaap BoenderFormal Verification Engineer, Hensoldt Cyber GmbHDirección de correo verificada de kerguelen.org
Cosimo LaneveProfessor of Computer Science, University of BolognaDirección de correo verificada de unibo.it
Brian CampbellLaboratory for Foundations of Computer Science, University of EdinburghDirección de correo verificada de ed.ac.uk
Giulio GuerrieriDepartment of Computer Science, University of BathDirección de correo verificada de bath.ac.uk
Matteo CiminiUniversity of Massachusetts LowellDirección de correo verificada de uml.edu
James McKinnaHeriot-Watt University, EdinburghDirección de correo verificada de hw.ac.uk
Ilias GarnierPostdoc, École Normale SupérieureDirección de correo verificada de di.ens.fr
François BobotDirección de correo verificada de bobot.eu
Silvio ValentiniUniversità di PadovaDirección de correo verificada de math.unipd.it
Fabio VitaliProfessor of Computer Science, University of BolognaDirección de correo verificada de unibo.it
Davide SangiorgiProfessor of Computer Science, University of BolognaDirección de correo verificada de cs.unibo.it

Seguir

Claudio Sacerdoti Coen

University of Bologna

Dirección de correo verificada de unibo.it - Página principal

Interactive Theorem Proving Mathematical Knowledge Management


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
The Matita interactive theorem prover A Asperti, W Ricciotti, C Sacerdoti Coen, E Tassi Automated Deduction–CADE-23: 23rd International Conference on Automated …, 2011	114	2011
User interaction with the Matita proof assistant A Asperti, C Sacerdoti Coen, E Tassi, S Zacchiroli Journal of Automated Reasoning 39, 109-139, 2007	103	2007
Mathematical knowledge management in HELM A Asperti, L Padovani, C Sacerdoti Coen, F Guidi, I Schena Annals of Mathematics and Artificial Intelligence 38, 27-46, 2003	98	2003
A content based mathematical search engine: Whelp A Asperti, F Guidi, CS Coen, E Tassi, S Zacchiroli Types for Proofs and Programs: International Workshop, TYPES 2004, Jouy-en …, 2006	78	2006
HELM and the semantic math-web A Asperti, L Padovani, CS Coen, I Schena International Conference on Theorem Proving in Higher Order Logics, 59-74, 2001	72	2001
Hints in unification A Asperti, W Ricciotti, C Sacerdoti Coen, E Tassi Theorem Proving in Higher Order Logics: 22nd International Conference …, 2009	69	2009
ELPI: fast, embeddable, prolog interpreter C Dunchev, F Guidi, C Sacerdoti Coen, E Tassi Logic for Programming, Artificial Intelligence, and Reasoning, 460-468, 2015	58	2015
Crafting a proof assistant A Asperti, CS Coen, E Tassi, S Zacchiroli Types for Proofs and Programs: International Workshop, TYPES 2006 …, 2007	50	2007
On the relative usefulness of fireballs B Accattoli, CS Coen 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 141-155, 2015	48	2015
Certified complexity (cerco) RM Amadio, N Ayache, F Bobot, JP Boender, B Campbell, I Garnier, ... Foundational and Practical Aspects of Resource Analysis: Third International …, 2014	48	2014
A survey on retrieval of mathematical knowledge F Guidi, C Sacerdoti Coen Mathematics in Computer Science 10 (4), 409-427, 2016	46	2016
Schemapath, a minimal extension to XML Schema for conditional constraints CS Coen, P Marinelli, F Vitali Proceedings of the 13th international conference on World Wide Web, 164-174, 2004	44	2004
A bi-directional refinement algorithm for the calculus of (co) inductive constructions A Asperti, W Ricciotti, CS Coen, E Tassi Logical Methods in Computer Science 8, 2012	38	2012
A compact kernel for the calculus of inductive constructions A Asperti, W Ricciotti, C Sacerdoti Coen, E Tassi Sadhana 34, 71-144, 2009	38	2009
SmartTools: a development environment generator based on XML technologies I Attali, C Courbis, P Degenne, A Fau, J Fillon, D Parigot, C Pasquier, ... XML Technologies and Software Engineering, 2001	31	2001
A survey on retrieval of mathematical knowledge F Guidi, C Sacerdoti Coen International Conference on Intelligent Computer Mathematics, 296-315, 2015	30	2015
Tinycals: step by step tacticals CS Coen, E Tassi, S Zacchiroli Electronic Notes in Theoretical Computer Science 174 (2), 125-142, 2007	25	2007
A semi-reflexive tactic for (sub-) equational reasoning CS Coen Types for Proofs and Programs: International Workshop, TYPES 2004, Jouy-en …, 2006	25	2006
Mathematical knowledge management and interactive theorem proving CS Coen PhD thesis, University of Bologna, 2004. Technical Report UBLCS 2004-5, 2004	25	2004
Crumbling abstract machines B Accattoli, A Condoluci, G Guerrieri, CS Coen Proceedings of the 21st International Symposium on Principles and Practice …, 2019	23	2019

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Seguir

Citado por

Coautores