Filtrer vos résultats
- 35
- 24
- 5
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 34
- 1
- 1
- 1
- 1
- 3
- 2
- 1
- 1
- 4
- 6
- 4
- 3
- 4
- 2
- 3
- 1
- 33
- 1
- 1
- 23
- 22
- 18
- 15
- 11
- 8
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 35
- 8
- 5
- 4
- 4
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
35 résultats
|
|
triés par
|
|
Heartbeat scheduling: provable efficiency for nested parallelismPLDI’18 - 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, Jun 2018, Philadelphia, United States. ⟨10.1145/3192366.3192391⟩
Communication dans un congrès
hal-01937946v1
|
||
|
Improving Type Error Messages in OCamlML Family/OCaml Users and Developers workshops, 2015, Vancouver, Canada. pp.80-97, ⟨10.4204/EPTCS.198.4⟩
Communication dans un congrès
hal-01245843v1
|
||
|
JSExplain: A Double Debugger for JavaScriptThe Web Conference 2018, Apr 2018, Lyon, France. pp.1-9, ⟨10.1145/3184558.3185969⟩
Communication dans un congrès
hal-01745792v1
|
||
|
A High-Level Separation Logic for Heap Space under Garbage Collection (Extended Version)Proceedings of the ACM on Programming Languages, 2023, 7 (POPL), pp.718-747. ⟨10.1145/3571218⟩
Article dans une revue
hal-03823056v2
|
||
|
France-IOI : l'apprentissage de l'algorithmique pour tousSciences et technologies de l'information et de la communication en milieu éducatif : Analyse de pratiques et enjeux didactiques., Oct 2011, Patras, Grèce. pp.213-220
Communication dans un congrès
edutice-00676167v1
|
||
|
Poster: Performance challenges in modular parallel programsPPoPP 2018 - 23rd ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, Feb 2018, Vienna, Austria. ⟨10.1145/3178487.3178516⟩
Communication dans un congrès
hal-01887717v1
|
||
|
Omnisemantics: Smooth Handling of NondeterminismACM Transactions on Programming Languages and Systems (TOPLAS), 2023, 45 (1), pp.1-43. ⟨10.1145/3579834⟩
Article dans une revue
hal-03255472v3
|
||
|
Formal Proof and Analysis of an Incremental Cycle Detection AlgorithmInteractive Theorem Proving, Sep 2019, Portland, United States
Communication dans un congrès
hal-02167236v1
|
||
|
Dag-calculus: a calculus for parallel computationProceedings of the 21st ACM SIGPLAN International Conference on Functional Programming (ICFP), Sep 2016, Nara, Japan. pp.18 - 32, ⟨10.1145/2951913.2951946⟩
Communication dans un congrès
hal-01409022v1
|
||
|
Oracle-Guided Scheduling for Controlling Granularity in Implicitly Parallel LanguagesJournal of Functional Programming, 2016, 26, ⟨10.1017/S0956796816000101⟩
Article dans une revue
hal-01409069v1
|
||
|
Atomic Read-Modify-Write Operations are Unnecessary for Shared-Memory Work Stealing[Research Report] 2013
Rapport
hal-00910130v1
|
||
|
Higher-order representation predicates in separation logicProceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs (CPP), Jan 2016, St. Petersburg, FL, United States. pp.3 - 14, ⟨10.1145/2854065.2854068⟩
Communication dans un congrès
hal-01408670v1
|
||
|
Specification and Verification of a Transient Stack (Artifact)Logiciel hal-03473197v1 |
||
|
Specification and Verification of a Transient StackCPP 2022 - 11th ACM SIGPLAN International Conference on Certified Programs and Proofs, Jan 2022, Philadelphia, United States. ⟨10.1145/3497775.3503677⟩
Communication dans un congrès
hal-03472028v1
|
||
|
An AST for Representing Programs with Invariants and ProofsJFLA 2023 - 34èmes Journées Francophones des Langages Applicatifs, Jan 2023, Praz-sur-Arly, France. pp.43-58
Communication dans un congrès
hal-03936618v1
|
||
|
GOSPEL -Providing OCaml with a Formal Specification LanguageFM 2019 - 23rd International Symposium on Formal Methods, Oct 2019, Porto, Portugal
Communication dans un congrès
hal-02157484v2
|
||
|
Pretty-Big-Step Semantics22nd European Symposium on Programming (ESOP), Mar 2013, Rome, Italy
Communication dans un congrès
hal-00798227v1
|
||
|
Machine-Checked Verification of the Correctness and Amortized Complexity of an Efficient Union-Find Implementation6th International Conference on Interactive Theorem Proving (ITP), Aug 2015, Nanjing, China. ⟨10.1007/978-3-319-22102-1_9⟩
Communication dans un congrès
hal-01245872v1
|
||
|
Theory and Practice of Chunked SequencesEuropean Symposium on Algorithms, Sep 2014, Wrocław, Poland. pp.25 - 36, ⟨10.1007/978-3-662-44777-2_3⟩
Communication dans un congrès
hal-01087245v1
|
||
|
OptiTrust: an Interactive Framework for Source-to-Source Transformations2022
Pré-publication, Document de travail
hal-03773485v1
|
||
|
VOCAL – A Verified OCAml Library2017
Autre publication scientifique
hal-01561094v1
|
||
|
Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time CreditsJournal of Automated Reasoning, 2019, 62 (3), pp.331--365. ⟨10.1007/s10817-017-9431-7⟩
Article dans une revue
hal-01652785v1
|
||
|
A Trusted Mechanised JavaScript SpecificationPOPL 2014 - 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Jan 2014, San Diego, United States
Communication dans un congrès
hal-00910135v1
|
||
|
Efficient Strict-Binning Particle-in-Cell Algorithm for Multi-Core SIMD ProcessorsEuro-Par 2018 - 24th International European Conference on Parallel and Distributed Computing, Aug 2018, Turin, Italy. ⟨10.1007/978-3-319-96983-1_53⟩
Communication dans un congrès
hal-01890318v1
|
||
|
MoSeL: a general, extensible modal framework for interactive proofs in separation logicInternational Conference on Functional Programming (ICFP 2018), ACM, Sep 2018, St Louis, MO, United States. pp.77, ⟨10.1145/3236772⟩
Communication dans un congrès
hal-01898522v1
|
||
|
Source-to-Source Optimizations Validated using Separation Logic35es Journées Francophones des Langages Applicatifs (JFLA 2024), Jan 2024, Saint-Jacut-de-la-Mer, France
Communication dans un congrès
hal-04406229v1
|
||
|
Separation Logic for Sequential ProgramsProceedings of the ACM on Programming Languages, 2020, 4, ⟨10.1145/3408998⟩
Article dans une revue
hal-03108936v1
|
||
|
Scheduling Parallel Programs by Work Stealing with Private DequesPPOPP - 18th ACM SIGPLAN symposium on Principles and practice of parallel programming, Feb 2013, Shenzhen, China. pp.219-228
Communication dans un congrès
hal-00863028v1
|
||
|
Fast Parallel Graph-Search with Splittable and Catenable Frontiers[Technical Report] Inria. 2015
Rapport
hal-01089125v2
|
||
|
A Work-Efficient Algorithm for Parallel Unordered Depth-First SearchProceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, Nov 2015, Austin, Texas, United States. ⟨10.1145/2807591.2807651⟩
Communication dans un congrès
hal-01245837v1
|
- 1
- 2