Roberto Di Cosmo

According to our database1, Roberto Di Cosmo authored at least 77 papers between 1991 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Announcing biblatex-software: software citation made easy.
ACM SIGSOFT Softw. Eng. Notes, 2020

Software provenance tracking at the scale of public source code.
Empir. Softw. Eng., 2020

Referencing Source Code Artifacts: A Separate Concern in Software Citation.
Comput. Sci. Eng., 2020

Attributing and Referencing (Research) Software: Best Practices and Outlook From Inria.
Comput. Sci. Eng., 2020

Dependency Solving Is Still Hard, but We Are Getting Better at It.
Proceedings of the 27th IEEE International Conference on Software Analysis, 2020

Archiving and Referencing Source Code with Software Heritage.
Proceedings of the Mathematical Software - ICMS 2020, 2020

2019
How to use Software Heritage for archiving and referencing your source code: guidelines and walkthrough.
CoRR, 2019

Growth and Duplication of Public Source Code over Time: Provenance Tracking at Scale.
CoRR, 2019

Software Heritage: que faire avec tout le code source du monde?
Proceedings of the Extraction et Gestion des connaissances, 2019

2018
Building the universal archive of source code.
Commun. ACM, 2018

Software heritage: collecting, preserving, and sharing all our source code (keynote).
Proceedings of the 33rd ACM/IEEE International Conference on Automated Software Engineering, 2018

Identifiers for Digital Objects: The case of software source code preservation.
Proceedings of the 15th International Conference on Digital Preservation, 2018

2017
Scaling up functional programming education: under the hood of the OCaml MOOC.
Proc. ACM Program. Lang., 2017

Adoption of Academic Tools in Open Source Communities: The Debian Case Study.
Proceedings of the Open Source Systems: Towards Robust Practices, 2017

Software Heritage: Why and How to Preserve Software Source Code.
Proceedings of the 14th International Conference on Digital Preservation, 2017

NightSplitter: A Scheduling Tool to Optimize (Sub)group Activities.
Proceedings of the Principles and Practice of Constraint Programming, 2017

2015
A Historical Analysis of Debian Package Incompatibilities.
Proceedings of the 12th IEEE/ACM Working Conference on Mining Software Repositories, 2015

Mining Component Repositories for Installability Issues.
Proceedings of the 12th IEEE/ACM Working Conference on Mining Software Repositories, 2015

Automatic Deployment of Services in the Cloud with Aeolus Blender.
Proceedings of the Service-Oriented Computing - 13th International Conference, 2015

Automatic Application Deployment in the Cloud: from Practice to Theory and Back (Invited Paper).
Proceedings of the 26th International Conference on Concurrency Theory, 2015

2014
Learning from the future of component repositories.
Sci. Comput. Program., 2014

Aeolus: A component model for the cloud.
Inf. Comput., 2014

Automated synthesis and deployment of cloud applications.
Proceedings of the ACM/IEEE International Conference on Automated Software Engineering, 2014

Easing software component repository evolution.
Proceedings of the 36th International Conference on Software Engineering, 2014

2013
On software component co-installability.
ACM Trans. Softw. Eng. Methodol., 2013

A modular package manager architecture.
Inf. Softw. Technol., 2013

Broken sets in software repository evolution.
Proceedings of the 35th International Conference on Software Engineering, 2013

Component Reconfiguration in the Presence of Conflicts.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Aeolus: Mastering the Complexity of Cloud Application Deployment.
Proceedings of the Service-Oriented and Cloud Computing - Second European Conference, 2013

2012
A "Minimal Disruption" Skeleton Experiment: Seamless Map & Reduce Embedding in OCaml.
Proceedings of the International Conference on Computational Science, 2012

Dependency solving: A separate concern in component evolution management.
J. Syst. Softw., 2012

Towards a Formal Component Model for the Cloud.
Proceedings of the Software Engineering and Formal Methods - 10th International Conference, 2012

Why do software packages conflict?
Proceedings of the 9th IEEE Working Conference of Mining Software Repositories, 2012

Formal Aspects of Free and Open Source Software Components - A Short Survey.
Proceedings of the Formal Methods for Components and Objects, 2012

2011
Supporting software evolution in component-based FOSS systems.
Sci. Comput. Program., 2011

Sources of Inter-package Conflicts in Debian
CoRR, 2011

Aligning component upgrades
Proceedings of the Proceedings Second Workshop on Logics for Component Configuration, 2011

Predicting upgrade failures using dependency analysis.
Proceedings of the Workshops Proceedings of the 27th International Conference on Data Engineering, 2011

MPM: a modular package manager.
Proceedings of the 14th International ACM Sigsoft Symposium on Component Based Software Engineering, 2011

2010
On isomorphisms of intersection types.
ACM Trans. Comput. Log., 2010

Feature Diagrams as Package Dependencies.
Proceedings of the Software Product Lines: Going Beyond - 14th International Conference, 2010

Using strong conflicts to detect quality issues in component-based complex systems.
Proceedings of the Proceeding of the 3rd Annual India Software Engineering Conference, 2010

2009
Strong dependencies between software components.
Proceedings of the Third International Symposium on Empirical Software Engineering and Measurement, 2009

2008
Skeletal Parallel Programming with OCamlP3l 2.0.
Parallel Process. Lett., 2008

Package Upgrades In FOSS Distributions: Details And Challenges.
Proceedings of the 1st ACM Workshop on Hot Topics in Software Upgrades, 2008

Improving the Quality of GNU/Linux Distributions.
Proceedings of the 32nd Annual IEEE International Computer Software and Applications Conference, 2008

2007
A calculus for parallel computations over multidimensional dense arrays.
Comput. Lang. Syst. Struct., 2007

2006
Domain decomposition and skeleton programming with OCamlP3l.
Parallel Comput., 2006

Remarks on isomorphisms in typed lambda calculi with empty and sum types.
Ann. Pure Appl. Log., 2006

Managing the Complexity of Large Free and Open Source Package-Based Software Distributions.
Proceedings of the 21st IEEE/ACM International Conference on Automated Software Engineering (ASE 2006), 2006

Educating the e-citizen.
Proceedings of the 11th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2006

2005
A short survey of isomorphisms of types.
Math. Struct. Comput. Sci., 2005

Subtyping Recursive Types Modulo Associative Commutative Products.
Proceedings of the Typed Lambda Calculi and Applications, 7th International Conference, 2005

2004
Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums.
Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2004

The Equational Theory of < N, 0, 1, +, ×, uparrow > Is Decidable, but Not Finitely Axiomatisable.
Proceedings of the Logic for Programming, 2004

2003
A Calculus for Dense Array Distributions.
Parallel Process. Lett., 2003

Proof Nets And Explicit Substitutions.
Math. Struct. Comput. Sci., 2003

2000
Playing Logic Programs with the Alpha-Beta Algorithm.
Proceedings of the Logic for Programming and Automated Reasoning, 2000

1999
Strong Normalization of Proof Nets Modulo Structural Congruences.
Proceedings of the Rewriting Techniques and Applications, 10th International Conference, 1999

A Linear Logical View of Linear Type Isomorphisms.
Proceedings of the Computer Science Logic, 13th International Workshop, 1999

1998
A Game Semantics Foundation for Logic Programming (Extended Abstract).
Proceedings of the Principles of Declarative Programming, 10th International Symposium, 1998

1997
Strong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets (Extended Abstract).
Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997

On Modular Properties of Higher Order Extensional Lambda Calculi.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996
Combining Algebraic Rewriting, Extensional Lambda Calculi, and Fixpoints.
Theor. Comput. Sci., 1996

A Confluent Reduction for the lambda-Calculus with Surjective Pairing and Terminal Object.
J. Funct. Program., 1996

On the Power of Simple Diagrams.
Proceedings of the Rewriting Techniques and Applications, 7th International Conference, 1996

Type Isomorphisms for Module Signatures.
Proceedings of the Programming Languages: Implementations, 1996

1995
Second Order Isomorphic Types: A Proof Theoretic Study on Second Order lambda-Calculus with Surjective Paring and Terminal Object
Inf. Comput., June, 1995

Expanding Extensional Polymorphism.
Proceedings of the Typed Lambda Calculi and Applications, 1995

Rewriting with Extensional Polymorphic Lambda-Calculus.
Proceedings of the Computer Science Logic, 9th International Workshop, 1995

1994
Simulating Expansions without Expansions.
Math. Struct. Comput. Sci., 1994

Combining First Order Algebraic Rewriting Systems, Recursion and Extensional Lambda Calculi.
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1993
Deciding Type Isomorphisms in a Type-Assignment Framework.
J. Funct. Program., 1993

A Confluent Reduction for the Extensional Typed lambda-Calculus with Pairs, Sums, Recursion and terminal Object.
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992
Provable Isomorphisms of Types.
Math. Struct. Comput. Sci., 1992

Type Isomorphisms in a Type-Assignment Framework.
Proceedings of the Conference Record of the Nineteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1992

1991
A Concluent Reduction for the Lambda-Calculus with Surjective Pairing and Terminal Object.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991


  Loading...