Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Arthur Charguéraud"'
Autor:
Arthur Charguéraud
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 198, Iss Proc. ML/OCaml 2014, Pp 80-97 (2015)
Cryptic type error messages are a major obstacle to learning OCaml or other ML-based languages. In many cases, error messages cannot be interpreted without a sufficiently-precise model of the type inference algorithm. The problem of improving type er
Externí odkaz:
https://doaj.org/article/670ae6144441483b9bb9fbe95b41cd11
Autor:
Arthur Charguéraud
Publikováno v:
Formal Aspects of Computing.
Publikováno v:
Journées Francophones des Langages Applicatifs
JFLA 2023-34èmes Journées Francophones des Langages Applicatifs
JFLA 2023-34èmes Journées Francophones des Langages Applicatifs, Jan 2023, Praz-sur-Arly, France. pp.43-58
HAL
JFLA 2023-34èmes Journées Francophones des Langages Applicatifs
JFLA 2023-34èmes Journées Francophones des Langages Applicatifs, Jan 2023, Praz-sur-Arly, France. pp.43-58
HAL
National audience; Deductive verification enables one to check that a program satisfies its specification. There are mainly two approaches: either the user provides invariants in the form of annotations and use a tool to extract proof obligations, li
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::08535ba18d69bdd404e2cd6993ef9ff1
https://inria.hal.science/hal-03936618
https://inria.hal.science/hal-03936618
Autor:
Arthur Charguéraud
Publikováno v:
Proceedings of the ACM on Programming Languages. 4:1-34
This paper presents a simple mechanized formalization of Separation Logic for sequential programs. This formalization is aimed for teaching the ideas of Separation Logic, including its soundness proof and its recent enhancements. The formalization se
Publikováno v:
CPP 2022-11th ACM SIGPLAN International Conference on Certified Programs and Proofs
CPP 2022-11th ACM SIGPLAN International Conference on Certified Programs and Proofs, Jan 2022, Philadelphia, United States. ⟨10.1145/3497775.3503677⟩
CPP 2022-11th ACM SIGPLAN International Conference on Certified Programs and Proofs, Jan 2022, Philadelphia, United States. ⟨10.1145/3497775.3503677⟩
International audience; A transient data structure is a package of an ephemeral data structure, a persistent data structure, and fast conversions between them. We describe the specification and proof of a transient stack and its iterators. This data
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4ec834bd1adabfaa65bce2b975b82fb0
https://hal.inria.fr/hal-03472028
https://hal.inria.fr/hal-03472028
Publikováno v:
Proceedings of the ACM on Programming Languages
Proceedings of the ACM on Programming Languages, In press, POPL, 7, ⟨10.1145/3571218⟩
Proceedings of the ACM on Programming Languages, In press, POPL, 7, ⟨10.1145/3571218⟩
We present a Separation Logic with space credits for reasoning about heap space in a sequential call-by-value lambda-calculus equipped with garbage collection and mutable state. A key challenge is to design sound, modular, lightweight mechanisms for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6decef0d37438ca240c892cddcf0f9e2
https://inria.hal.science/hal-03852060/file/spacelambda.pdf
https://inria.hal.science/hal-03852060/file/spacelambda.pdf
This article gives an in-depth presentation of the omni-big-step and omni-small-step styles of semantic judgments. These styles describe operational semantics by relating starting states to sets of outcomes rather than to individual outcomes. A singl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7fbed6d35089744fd04b242b07004f87
https://hal.inria.fr/hal-03255472v3
https://hal.inria.fr/hal-03255472v3
Autor:
Arthur Charguéraud, François Pottier
Publikováno v:
Journal of Automated Reasoning
Journal of Automated Reasoning, 2019, 62 (3), pp.331--365. ⟨10.1007/s10817-017-9431-7⟩
Journal of Automated Reasoning, Springer Verlag, 2019, 62 (3), pp.331--365. ⟨10.1007/s10817-017-9431-7⟩
Journal of Automated Reasoning, 2019, 62 (3), pp.331--365. ⟨10.1007/s10817-017-9431-7⟩
Journal of Automated Reasoning, Springer Verlag, 2019, 62 (3), pp.331--365. ⟨10.1007/s10817-017-9431-7⟩
Union-Find is a famous example of a simple data structure whose amortized asymptotic time complexity analysis is nontrivial. We present a Coq formalization of this analysis, following Alstrup et al.’s recent proof. Moreover, we implement Union-Find
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b410cbacf931e73f6f55a595d56fe3e1
https://inria.hal.science/hal-01652785
https://inria.hal.science/hal-01652785
Publikováno v:
PPoPP
PPoPP 2019-Principles and Practice of Parallel Programming
PPoPP 2019-Principles and Practice of Parallel Programming, Feb 2019, Washington DC, United States. ⟨10.1145/3293883.3295725⟩
PPoPP 2019-Principles and Practice of Parallel Programming
PPoPP 2019-Principles and Practice of Parallel Programming, Feb 2019, Washington DC, United States. ⟨10.1145/3293883.3295725⟩
International audience; Over the past decade, many programming languages and systems for parallel-computing have been developed, e.g., Fork/Join and Habanero Java, Parallel Haskell, Parallel ML, and X10. Although these systems raise the level of abst
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030309411
FM
FM
This paper introduces GOSPEL, a behavioral specification language for OCaml. It is designed to enable modular verification of data structures and algorithms. GOSPEL is a contract-based, strongly typed language, with a formal semantics defined by mean
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c4d334a73e513c2db894ff9646780812
https://doi.org/10.1007/978-3-030-30942-8_29
https://doi.org/10.1007/978-3-030-30942-8_29