Authors: Timany, Amin, Guéneau, Armaël, Birkedal, Lars
Contributors: Aarhus University Aarhus, Formally Verified Programs, Certified Tools and Numerical Computations (TOCCATA), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Méthodes Formelles (LMF), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Laboratoire Méthodes Formelles (LMF), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), SIGPLAN
Superior Title: Proceedings of the ACM ; POPL 2024 - 51st ACM SIGPLAN Symposium on Principles of Programming Languages ; https://hal.science/hal-04271457 ; POPL 2024 - 51st ACM SIGPLAN Symposium on Principles of Programming Languages, SIGPLAN, Jan 2024, Londres, United Kingdom ; popl24.sigplan.org
Subject Terms: well-bracketedness, stack discipline, program logics, program verification, logical relations, semantic typing, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL]
Subject Geographic: Londres, United Kingdom
Relation: hal-04271457; https://hal.science/hal-04271457; https://hal.science/hal-04271457/document; https://hal.science/hal-04271457/file/timany-gueneau-birkedal-wbcf24.pdf
Availability:
https://hal.science/hal-04271457
https://hal.science/hal-04271457/document
https://hal.science/hal-04271457/file/timany-gueneau-birkedal-wbcf24.pdf
Authors: Sterling, Jonathan, Gratzer, Daniel, Birkedal, Lars
Subject Terms: univalent foundations, homotopy type theory, impredicative encodings, synthetic guarded domain theory, guarded recursion, higher-order store, reference types, Theory of computation → Denotational semantics, Theory of computation → Categorical semantics, Theory of computation → Type structures, Theory of computation → Type theory
File Description: application/pdf
Relation: http://www.ccs.neu.edu/home/amal/ahmedthesis.pdf; https://www.andrew.cmu.edu/user/awodey/talks/BigProofs.pdf; https://dx.doi.org/10.4230/LIPIcs.CSL.2024; https://dx.doi.org/10.48550/arXiv.2203.13000; https://dx.doi.org/10.1109/LICS.1998.705669; https://dx.doi.org/10.1017/S0960129522000032; https://dx.doi.org/10.23638/LMCS-15(1:20)2019; https://dx.doi.org/10.1145/3434293; https://dx.doi.org/10.1145/504709.504712; https://dx.doi.org/10.1016/0304-3975(80)90045-6; https://dx.doi.org/10.48550/arXiv.2205.10917; https://dx.doi.org/10.1145/3209108.3209130; https://dx.doi.org/10.4230/LIPIcs.CSL.2016.23; https://dx.doi.org/10.1007/s10817-018-9471-7; https://dx.doi.org/10.1109/LICS.2013.27; https://dx.doi.org/10.1109/LICS.2011.16; https://dx.doi.org/10.1017/S0960129510000162
Availability: https://doi.org/10.4230/lipics.csl.2024.4710.4230/LIPIcs.CSL.202410.48550/arXiv.2203.1300010.1109/LICS.1998.70566910.1017/S096012952200003210.23638/LMCS-15(1:20)201910.1145/343429310.1145/504709.50471210.1016/0304-3975(80)90045-610.48550/arXiv.2205.1091710.1145/3209108.320913010.4230/LIPIcs.CSL.2016.2310.1007/s10817-018-9471-710.1109/LICS.2013.2710.1109/LICS.2011.1610.1017/S0960129510000162
Subject Terms: 46 Information and Computing Sciences, 4904 Pure Mathematics, 49 Mathematical Sciences, 4602 Artificial Intelligence, 50 Philosophy and Religious Studies, 5003 Philosophy, 4612 Software Engineering
File Description: application/pdf
Availability: https://www.repository.cam.ac.uk/handle/1810/363219
Authors: Frumin, Dan, Timany, Amin, Birkedal, Lars
Superior Title: Frumin , D , Timany , A & Birkedal , L 2024 , ' Modular Denotational Semantics for Effects with Guarded Interaction Trees ' , Proceedings of the ACM on Programming Languages , vol. 8 , no. POPL , 12 . https://doi.org/10.1145/3632854
Subject Terms: Coq, denotational semantics, Iris, logical relations
Authors: Hammond, Angus, Liu, Zongyuan, Pérami, Thibaut, Sewell, Peter, Birkedal, Lars, Pichon-Pharabod, Jean
Superior Title: Hammond , A , Liu , Z , Pérami , T , Sewell , P , Birkedal , L & Pichon-Pharabod , J 2024 , ' An Axiomatic Basis for Computer Programming on the Relaxed Arm-A Architecture : The AxSL Logic ' , Proceedings of the ACM on Programming Languages , vol. 8 , 21 , pp. 604-637 . https://doi.org/10.1145/3632863
Subject Terms: Arm, Iris, program logic, relaxed memory models, separation logic
Subject Terms: 4904 Pure Mathematics, 49 Mathematical Sciences
File Description: application/pdf
Availability: https://www.repository.cam.ac.uk/handle/1810/363221
Authors: Georges, Aïna Linn, Guéneau, Armaël, Van Strydonck, Thomas, Timany, Amin, Trieu, Alix, Devriese, Dominique, Birkedal, Lars
Superior Title: Journal of the ACM; Feb2024, Vol. 71 Issue 1, p1-59, 59p
Authors: Guéneau, Armaël, Hostert, Johannes, Spies, Simon, Sammler, Michael, Birkedal, Lars, Dreyer, Derek
Contributors: Formally Verified Programs, Certified Tools and Numerical Computations (TOCCATA), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Méthodes Formelles (LMF), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Laboratoire Méthodes Formelles (LMF), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Saarland University Saarbrücken, Max Planck Institute for Software Systems (MPI-SWS), Aarhus University Aarhus, SIGPLAN
Superior Title: Proceedings of the ACM ; OOPSLA 2023 - Object-Oriented Programming, Systems, Languages & Applications 2023 ; https://inria.hal.science/hal-04203298 ; OOPSLA 2023 - Object-Oriented Programming, Systems, Languages & Applications 2023, SIGPLAN, Oct 2023, Cascais, Portugal. ⟨10.1145/3622823⟩
Subject Terms: OCaml, program logics, multi-language semantics, garbage collection, separation logic, angelic non-determinism, transfinite step-indexing, Iris, Coq, foreign-function interfaces, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL]
Relation: hal-04203298; https://inria.hal.science/hal-04203298; https://inria.hal.science/hal-04203298v2/document; https://inria.hal.science/hal-04203298v2/file/melocoton.pdf
Authors: Stassen, Philipp, Gratzer, Daniel, Birkedal, Lars
Subject Terms: Dependent type theory, guarded recursion, modal type theory, proof assistants, Theory of computation → Type theory, Theory of computation → Modal and temporal logics
File Description: application/pdf
Relation: https://dx.doi.org/10.4230/LIPIcs.TYPES.2022; https://dx.doi.org/10.1017/S0960129508006853; https://dx.doi.org/10.1145/3158111; https://dx.doi.org/10.1109/LICS.2017.8005097; https://dx.doi.org/10.1145/3341713; https://dx.doi.org/10.1145/3531130.3533359; https://dx.doi.org/10.1017/S0960129519000197; https://dx.doi.org/10.2168/LMCS-8(4:1)2012; https://dx.doi.org/10.4204/EPTCS.360.5; https://dx.doi.org/10.1016/0167-6423(95)00021-6; https://dx.doi.org/10.1016/j.entcs.2016.06.010; https://dx.doi.org/10.1145/3531130.3532398; https://dx.doi.org/10.4230/LIPIcs.FSCD.2022.23; https://dx.doi.org/10.46298/lmcs-17(3:11)2021; https://dx.doi.org/10.1145/3373718.3394736; https://dx.doi.org/10.1145/3341711; https://dx.doi.org/10.48550/arXiv.2206.07823; https://dx.doi.org/10.4230/LIPIcs.FSCD.2018.22
Availability: https://doi.org/10.4230/lipics.types.2022.610.4230/LIPIcs.TYPES.202210.1017/S096012950800685310.1145/315811110.1109/LICS.2017.800509710.1145/334171310.1145/3531130.353335910.1017/S096012951900019710.2168/LMCS-8(4:1)201210.4204/EPTCS.360.510.1016/0167-6423(95)00021-610.1016/j.entcs.2016.06.01010.1145/3531130.353239810.4230/LIPIcs.FSCD.2022.2310.46298/lmcs-17(3:11)202110.1145/3373718.339473610.1145/334171110.48550/arXiv.2206.0782310.4230/LIPIcs.FSCD.2018.22
Subject Terms: separation logic, distributed systems, CRDT, replicated data type, formal verification, Theory of computation → Program verification, Theory of computation → Distributed algorithms, Theory of computation → Separation logic
File Description: application/pdf
Relation: http://iris-project.org/tutorial-pdfs/iris-lecture-notes.pdf; http://hal.inria.fr/inria-00555588/; https://dx.doi.org/10.4230/DARTS.9.2.15; https://dx.doi.org/10.4230/LIPIcs.ECOOP.2023; https://dx.doi.org/10.1145/128738.128742; https://dx.doi.org/10.1145/2535838.2535848; https://dx.doi.org/10.1145/3133933; https://dx.doi.org/10.1145/3434323; https://dx.doi.org/10.1145/2676726.2676980; https://dx.doi.org/10.1145/359545.359563; https://dx.doi.org/10.1145/3301419.3323971; https://dx.doi.org/10.1145/3453483.3454067; https://dx.doi.org/10.1145/3428284; https://dx.doi.org/10.1007/978-3-662-43613-4_3
Authors: Georges, Aïna Linn, Guéneau, Armaël, Van Strydonck, Thomas, Timany, Amin, Trieu, Alix, Devriese, Dominique, Birkedal, Lars
Contributors: Max Planck Institute for Software Systems (MPI-SWS), Laboratoire Méthodes Formelles (LMF), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Formally Verified Programs, Certified Tools and Numerical Computations (TOCCATA), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Méthodes Formelles (LMF), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Department of Computer Science (KU Leuven - CS), Catholic University of Leuven = Katholieke Universiteit Leuven (KU Leuven), Aarhus University Aarhus, Agence nationale de la sécurité des systèmes d'information (ANSSI)
Superior Title: ISSN: 0004-5411.
Subject Terms: capability machines, capability safety, universal contracts, program logic, Separation logic, CHERI, [INFO]Computer Science [cs], [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL]
Relation: hal-03826854; https://hal.science/hal-03826854; https://hal.science/hal-03826854v3/document; https://hal.science/hal-03826854v3/file/cerise-journal.pdf
Authors: Aguirre, Alejandro, Birkedal, Lars
Superior Title: Aguirre , A & Birkedal , L 2023 , ' Step-Indexed Logical Relations for Countable Nondeterminism and Probabilistic Choice ' , Proceedings of the ACM on Programming Languages , vol. 7 , pp. 33-60 . https://doi.org/10.1145/3571195
Subject Terms: Functional Languages, Logical Relations, Probabilistic programming
Superior Title: Aagaard , F L , Sterling , J & Birkedal , L 2023 , ' A denotationally-based program logic for higher-order store ' , EPTICS , vol. 3 . https://doi.org/10.46298/entics.12232
Authors: Vindum, Simon Friis, Birkedal, Lars
Superior Title: Vindum , S F & Birkedal , L 2023 , ' Spirea : A Mechanized Concurrent Separation Logic for Weak Persistent Memory ' , Proceedings of the ACM on Programming Languages , vol. 7 , no. OOPSLA2 , 244 , pp. 632-657 . https://doi.org/10.1145/3622820
Subject Terms: Iris, non-volatile memory, persistency, persistent memory, program logic, program verification, weak memory
Contributors: NOVALincs
Subject Terms: concurrency, Distributed systems, formal verification, higher-order logic, refinement, separation logic, Software, Safety, Risk, Reliability and Quality
Relation: PURE: 75819714; PURE UUID: f42f5927-080d-417d-b060-89ff1caa6106; Scopus: 85170638815; WOS: 001063711900030; ORCID: /0000-0003-4234-5376/work/151423840; http://hdl.handle.net/10362/159825; https://doi.org/10.1145/3607859
Authors: Gregersen, Simon Oddershede, Aguirre, Alejandro, Haselwarter, Philipp G., Tassarotti, Joseph, Birkedal, Lars
Subject Terms: coq, iris, separation logic, probabilistic relational hoare logic