1.2k citations
- Université Sorbonne Paris NordFR291 papers
- Centre National de la Recherche ScientifiqueFR216 papers
- Sorbonne Paris CitéFR64 papers
- Sorbonne UniversitéFR40 papers
- Université Paris CitéFR34 papers
- Laboratoire de Physique Théorique de la Matière CondenséeFR32 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR20 papers
- Institut national de recherche en sciences et technologies du numériqueFR19 papers
- The Open UniversityGB19 papers
- Institute of Nuclear Physics, Polish Academy of SciencesPL18 papers
- Université Pierre-et-Marie-CurieFR18 papers
- Horia Hulubei National Institute for R and D in Physics and Nuclear EngineeringRO17 papers
5 papers · 2 filters
Proof-Carrying Parameters in Certified Symbolic Execution: The Case Study of Antiunification
Andrei Arusoaie, Dorel Lucanu
Symbolic execution uses various algorithms (matching, (anti)unification), whose executions are parameters for proof object generation. This paper proposes a generic method for gene…
The Multiverse: Logical Modularity for Proof Assistants
Kenji Maillard, Nicolas Margulies, Matthieu Sozeau +2
Proof assistants play a dual role as programming languages and logical systems. As programming languages, proof assistants offer standard modularity mechanisms such as first-class…
An extended and more practical mwp flow analysis
Clément Aubert, Thomas Rubiano, Neea Rusch +1
We improve and refine a method for certifying that the values' sizes computed by an imperative program will be bounded by polynomials in the program's inputs' sizes. Our work ''tam…
Addressing Machines as models of lambda-calculus
Giuseppe Della Penna, Benedetto Intrigila, Giulio Manzonetto
Turing machines and register machines have been used for decades in theoretical computer science as abstract models of computation. Also the -calculus has played a central role…
Reduction Free Normalisation for a proof irrelevant type of propositions
Thierry Coquand
We show normalisation and decidability of convertibility for a type theory with a hierarchy of universes and a proof irrelevant type of propositions, close to the type system used…