Authors: Balbiani, Philippe, Gao, Han, Gencer, Cigdem, Olivetti, Nicola
Contributors: Logique, Interaction, Langue et Calcul (IRIT-LILaC), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Centre National de la Recherche Scientifique (CNRS), Laboratoire d'Informatique et des Systèmes (LIS) (Marseille, Toulon) (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)
Superior Title:
32nd EACSL Annual Conference on Computer Science Logic (CSL 2024)
https://amu.hal.science/hal-04457356
32nd EACSL Annual Conference on Computer Science Logic (CSL 2024), Feb 2024, Naples, Italy. pp.1--21, ⟨10.4230/LIPIcs.CSL.2024.13⟩
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2024.13
Subject Terms: Axiomatization, Completeness, Intuitionistic Modal Logic, Sequent Calculus, Modal and temporal logics, Proof theory, [INFO]Computer Science [cs], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
Relation: hal-04457356; https://amu.hal.science/hal-04457356; https://amu.hal.science/hal-04457356/document; https://amu.hal.science/hal-04457356/file/CSL_24_final_versionPROVVISORIA.pdf
Authors: Balbiani, Philippe, Gao, Han, Gencer, Cigdem, Olivetti, Nicola
Contributors: Logique, Interaction, Langue et Calcul (IRIT-LILaC), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Centre National de la Recherche Scientifique (CNRS), Laboratoire d'Informatique et des Systèmes (LIS) (Marseille, Toulon) (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)
Superior Title:
32nd EACSL Annual Conference on Computer Science Logic (CSL 2024)
https://amu.hal.science/hal-04457356
32nd EACSL Annual Conference on Computer Science Logic (CSL 2024), Feb 2024, Naples, Italy. pp.1--21, ⟨10.4230/LIPIcs.CSL.2024.13⟩
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2024.13
Subject Terms: Axiomatization, Completeness, Intuitionistic Modal Logic, Sequent Calculus, Modal and temporal logics, Proof theory, [INFO]Computer Science [cs], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
Relation: hal-04457356; https://amu.hal.science/hal-04457356; https://amu.hal.science/hal-04457356/document; https://amu.hal.science/hal-04457356/file/CSL_24_final_versionPROVVISORIA.pdf
Authors: Acclavio, Matteo, Curzi, Gianluca, Guerrieri, Giulio
Subject Terms: cut-elimination, non-wellfounded proofs, parsimonious logic, linear logic, proof theory, approximation, sequent calculus, non-uniform proofs, Theory of computation → Linear logic, Theory of computation → Proof theory
File Description: application/pdf
Relation: http://gianlucacurzi.com/Non-uniform-polynomial-time-via-non-wellfounded-parsimonious-proofs.pdf; https://hal-lirmm.ccsd.cnrs.fr/lirmm-03271408; https://dx.doi.org/10.4230/LIPIcs.CSL.2024; https://dx.doi.org/10.48550/ARXIV.2308.07789; https://dx.doi.org/10.4204/EPTCS.353.2; https://dx.doi.org/10.1017/CBO9780511804090; https://dx.doi.org/10.4230/LIPIcs.CSL.2016.42; https://dx.doi.org/10.1007/978-3-540-75560-9_9; https://dx.doi.org/10.1016/0304-3975(83)90059-2; https://dx.doi.org/10.1145/3531130.3533340; https://dx.doi.org/10.4230/LIPIcs.CSL.2023.16; https://dx.doi.org/10.1016/S0890-5401(03)00010-5; https://dx.doi.org/10.4230/LIPIcs.FSCD.2021.29; https://dx.doi.org/10.1017/S0960129516000372; https://dx.doi.org/10.1016/J.TCS.2006.08.003; https://dx.doi.org/10.1016/J.TCS.2008.06.001
Availability: https://doi.org/10.4230/lipics.csl.2024.810.4230/LIPIcs.CSL.202410.48550/ARXIV.2308.0778910.4204/EPTCS.353.210.1017/CBO978051180409010.4230/LIPIcs.CSL.2016.4210.1007/978-3-540-75560-9_910.1016/0304-3975(83)90059-210.1145/3531130.353334010.4230/LIPIcs.CSL.2023.1610.1016/S0890-5401(03)00010-510.4230/LIPIcs.FSCD.2021.2910.1017/S096012951600037210.1016/J.TCS.2006.08.00310.1016/J.TCS.2008.06.001
Authors: Tritschler, Marius
Subject Terms: Team semantics, guarded logics, expressiveness, model checking games, Theory of computation → Logic
File Description: application/pdf
Relation: https://www.sciencedirect.com/bookseries/studies-in-logic-and-practical-reasoning/vol/3/suppl/C; https://dx.doi.org/10.4230/LIPIcs.CSL.2024; https://dx.doi.org/10.1023/A:1004275029985; https://dx.doi.org/10.1016/s1570-2464(07)80017-6; https://dx.doi.org/10.1109/LICS.2010.26; https://dx.doi.org/10.1007/978-3-642-22012-8_28; https://dx.doi.org/10.4230/LIPIcs.ICALP.2017.107; https://dx.doi.org/10.1017/CBO9781107050884; https://dx.doi.org/10.1145/588111.588141; https://dx.doi.org/10.1145/588058.588065; https://dx.doi.org/10.1016/S0049-237X(08)71879-2; https://dx.doi.org/10.1016/j.apal.2011.08.005; https://dx.doi.org/10.4230/LIPIcs.CSL.2013.281; https://dx.doi.org/10.1016/0890-5401(91)90077-F; https://dx.doi.org/10.1007/BFb0013985; https://dx.doi.org/10.2307/2586808; https://dx.doi.org/10.1145/507382.507388; https://dx.doi.org/10.1007/978-3-319-06025-5_1
Availability: https://doi.org/10.4230/lipics.csl.2024.4810.4230/LIPIcs.CSL.202410.1023/A:100427502998510.1016/s1570-2464(07)80017-610.1109/LICS.2010.2610.1007/978-3-642-22012-8_2810.4230/LIPIcs.ICALP.2017.10710.1017/CBO978110705088410.1145/588111.58814110.1145/588058.58806510.1016/S0049-237X(08)71879-210.1016/j.apal.2011.08.00510.4230/LIPIcs.CSL.2013.28110.1016/0890-5401(91)90077-F10.1007/BFb001398510.2307/258680810.1145/507382.50738810.1007/978-3-319-06025-5_1
Authors: Mottet, Antoine
Subject Terms: promise constraint satisfaction problems, polymorphisms, homogeneous structures, first-order logic, Theory of computation → Complexity theory and logic
File Description: application/pdf
Relation: https://dx.doi.org/10.4230/LIPIcs.CSL.2024; https://dx.doi.org/10.4230/LIPIcs.MFCS.2021.11; https://dx.doi.org/10.1016/j.ejc.2007.11.004; https://dx.doi.org/10.1016/j.tcs.2008.12.049; https://dx.doi.org/10.1137/1.9781611977073.48; https://dx.doi.org/10.4230/LIPIcs.CSL.2016.16; https://dx.doi.org/10.1137/15M1006507; https://dx.doi.org/10.1109/LICS.2019.8785671; https://dx.doi.org/10.1145/3457606; https://dx.doi.org/10.1145/2556646; https://dx.doi.org/10.1137/1.9781611977073.50; https://dx.doi.org/10.1007/978-3-540-70583-3_16; https://dx.doi.org/10.1109/LICS.2010.13; https://dx.doi.org/10.1137/19M128466X; https://dx.doi.org/10.1109/LICS.2019.8785883; https://dx.doi.org/10.2178/jsl.7804020; https://dx.doi.org/10.1137/1.9781611975482.28; https://dx.doi.org/10.1137/19M128212X
Authors: Lucas, Salvador
Subject Terms: Conditional rewriting, Confluence, Program analysis, Theory of computation → Automated reasoning, Theory of computation → Logic and verification, Theory of computation → Equational logic and rewriting
File Description: application/pdf
Relation: http://www.cs.unm.edu/~mccune/prover9/; https://dx.doi.org/10.4230/LIPIcs.CSL.2024; https://dx.doi.org/10.1017/CBO9781139172752; https://dx.doi.org/10.1016/b978-044450813-3/50010-2; https://dx.doi.org/10.48550/ARXIV.2306.00498; https://dx.doi.org/10.1016/j.jlap.2011.12.004; https://dx.doi.org/10.1007/978-1-4612-2360-3; https://dx.doi.org/10.1007/978-3-030-29436-6_17; https://dx.doi.org/10.1007/978-3-030-51054-1_27; https://dx.doi.org/10.1007/978-3-031-16767-6_2; https://dx.doi.org/10.1145/322217.322230; https://dx.doi.org/10.1007/3-540-12727-5_16; https://dx.doi.org/10.1137/0215084; https://dx.doi.org/10.1145/3397677; https://dx.doi.org/10.1016/j.jlamp.2023.100926; https://dx.doi.org/10.1016/j.jlamp.2022.100749; https://dx.doi.org/10.1007/978-1-4757-3661-8; https://dx.doi.org/10.1145/322248.322251
Subject Terms: Concurrent games, multi-agent systems, temporal logic, game theory, Theory of computation → Logic and verification, Theory of computation → Verification by model checking, Theory of computation → Solution concepts in game theory
File Description: application/pdf
Relation: https://cra.org/ccc/wp-content/uploads/sites/2/2020/11/AI-and-Cooperation.pdf; http://www.springer.com/mathematics/geometry/book/978-0-387-00424-2; https://dx.doi.org/10.48550/arXiv.2311.15883; https://dx.doi.org/10.4230/LIPIcs.CSL.2024; https://dx.doi.org/10.1145/585265.585270; https://dx.doi.org/10.1016/j.jcss.2011.08.007; https://dx.doi.org/10.1145/2629686; https://dx.doi.org/10.2168/lmcs-11(2:9)2015; https://dx.doi.org/10.4230/LIPIcs.CONCUR.2021.8; https://dx.doi.org/10.2200/S00355ED1V01Y201107AIM016; https://dx.doi.org/10.4230/LIPIcs.FSTTCS.2010.505; https://dx.doi.org/10.1109/DATE.2008.4484790; https://dx.doi.org/10.1609/AAAI.V37I13.26791; https://dx.doi.org/10.1007/BF01768705; https://dx.doi.org/10.1016/0167-6423(87)90036-0; https://dx.doi.org/10.1109/ICRA46639.2022.9812068; https://dx.doi.org/10.24963/kr.2021/30; https://dx.doi.org/10.1016/j.ic.2015.03.011
Availability: https://doi.org/10.4230/lipics.csl.2024.3210.48550/arXiv.2311.1588310.4230/LIPIcs.CSL.202410.1145/585265.58527010.1016/j.jcss.2011.08.00710.1145/262968610.2168/lmcs-11(2:9)201510.4230/LIPIcs.CONCUR.2021.810.2200/S00355ED1V01Y201107AIM01610.4230/LIPIcs.FSTTCS.2010.50510.1109/DATE.2008.448479010.1609/AAAI.V37I13.2679110.1007/BF0176870510.1016/0167-6423(87)90036-010.1109/ICRA46639.2022.981206810.24963/kr.2021/3010.1016/j.ic.2015.03.011
Authors: Place, Thomas, Zeitoun, Marc
Subject Terms: Classes of regular languages, Generalized unary temporal logic, Generalized two-variable first-order logic, Generic decidable characterizations, Membership, Separation, Theory of computation → Formal languages and automata theory
File Description: application/pdf
Relation: https://www.irif.fr/~jep/PDF/MPRI/MPRI.pdf; https://dx.doi.org/10.4230/LIPIcs.CSL.2024; https://dx.doi.org/10.46298/theoretics.23.11
Subject Terms: Quantified Linear-time temporal logic, Model-cheking, Verification, Automata theory, Theory of computation → Logic and verification
File Description: application/pdf
Subject Terms: Logic, Classical Realizability, Set Theory, Large Cardinals, Theory of computation → Logic, Theory of computation → Proof theory, Theory of computation → Type theory
File Description: application/pdf
Relation: https://dx.doi.org/10.4230/LIPIcs.CSL.2024; https://dx.doi.org/10.1016/0304-3975(87)90109-5
Availability: https://doi.org/10.4230/lipics.csl.2024.2810.4230/LIPIcs.CSL.202410.1016/0304-3975(87)90109-5
Authors: Goubault, Éric, Kniazev, Roman, Ledent, Jérémy
Subject Terms: Modal logics, epistemic logics, multi-agent systems, hypergraphs, Theory of computation → Modal and temporal logics
File Description: application/pdf
Relation: https://books.google.co.uk/books?id=WK4-DwAAQBAJ; https://dx.doi.org/10.4230/LIPIcs.CSL.2024; https://dx.doi.org/10.4230/LIPIcs.CSL.2015.211; https://dx.doi.org/10.1007/s11229-022-04032-y; https://dx.doi.org/10.1007/978-3-030-88853-4_3; https://dx.doi.org/10.1007/978-3-030-75267-5_1; https://dx.doi.org/10.1007/978-1-4020-5839-4; https://dx.doi.org/10.1109/LICS56636.2023.10175737; https://dx.doi.org/10.1016/j.ic.2020.104597; https://dx.doi.org/10.4230/LIPIcs.STACS.2022.33; https://dx.doi.org/10.1145/79147.79161; https://dx.doi.org/10.1016/0022-0000(89)90039-1; https://dx.doi.org/10.1007/BFb0015245; https://dx.doi.org/10.1016/S1571-0661(05)01148-5; https://dx.doi.org/10.48550/arXiv.2211.13543; https://dx.doi.org/10.1016/j.entcs.2009.07.102
Availability: https://doi.org/10.4230/lipics.csl.2024.3010.4230/LIPIcs.CSL.202410.4230/LIPIcs.CSL.2015.21110.1007/s11229-022-04032-y10.1007/978-3-030-88853-4_310.1007/978-3-030-75267-5_110.1007/978-1-4020-5839-410.1109/LICS56636.2023.1017573710.1016/j.ic.2020.10459710.4230/LIPIcs.STACS.2022.3310.1145/79147.7916110.1016/0022-0000(89)90039-110.1007/BFb001524510.1016/S1571-0661(05)01148-510.48550/arXiv.2211.1354310.1016/j.entcs.2009.07.102
Authors: Balbiani, Philippe, Gao, Han, Gencer, Çiğdem, Olivetti, Nicola
Subject Terms: Intuitionistic Modal Logic, Axiomatization, Completeness, Sequent Calculus, Theory of computation → Modal and temporal logics, Theory of computation → Proof theory
File Description: application/pdf
Relation: http://eudml.org/doc/114664; https://hal.science/hal-03048959; https://cir.nii.ac.jp/crid/1371132818982119684; https://api.semanticscholar.org/CorpusID:2309858; https://dx.doi.org/10.48550/arXiv.2309.06309; https://dx.doi.org/10.4230/LIPIcs.CSL.2024; https://dx.doi.org/10.1109/LICS52264.2021.9470643; https://dx.doi.org/10.1007/S00153-009-0137-3; https://dx.doi.org/10.1007/978-3-031-43513-3_16; https://dx.doi.org/10.1215/00294527-2377869; https://dx.doi.org/10.1109/LICS56636.2023.10175684; https://dx.doi.org/10.1007/978-3-030-86059-2_24; https://dx.doi.org/10.1093/LOGCOM/EXAB020; https://dx.doi.org/10.5555/1029786.1029823; https://dx.doi.org/10.2307/2271676; https://dx.doi.org/10.1007/BF02121259; https://dx.doi.org/10.1007/978-94-009-8937-5_5; https://dx.doi.org/10.1016/0168-0072(90)90059-B
Authors: Das, Anupam, van der Giessen, Iris, Marin, Sonia
Subject Terms: provability logic, proof theory, intuitionistic modal logic, cyclic proofs, non-wellfounded proofs, proof search, cut-elimination, labelled sequents, Theory of computation → Proof theory
File Description: application/pdf
Relation: https://prooftheory.blog/2022/08/19/brouwer-meets-kripke-constructivising-modal-logic/; https://dx.doi.org/10.4230/LIPIcs.CSL.2024; https://dx.doi.org/10.2307/2273508; https://dx.doi.org/10.48550/arXiv.2206.00445
Authors: Badyl, Anita, Parys, Paweł
Subject Terms: Boundedness, logic, decidability, expressivity, recursion schemes, Theory of computation → Logic and verification, Theory of computation → Verification by model checking, Theory of computation → Rewrite systems
File Description: application/pdf
Relation: https://dx.doi.org/10.4230/LIPIcs.CSL.2024; https://dx.doi.org/10.1145/321479.321488; https://dx.doi.org/10.4230/LIPIcs.ICALP.2020.109; https://dx.doi.org/10.1007/978-3-540-30124-0_7; https://dx.doi.org/10.1007/s00224-010-9279-2; https://dx.doi.org/10.1007/978-3-662-43951-7_4; https://dx.doi.org/10.1109/LICS.2006.17; https://dx.doi.org/10.4230/LIPIcs.STACS.2012.648; https://dx.doi.org/10.1007/978-3-642-31424-7_8; https://dx.doi.org/10.1142/S0129054196000191; https://dx.doi.org/10.1145/3452917; https://dx.doi.org/10.1007/978-3-642-40184-8_32; https://dx.doi.org/10.4230/LIPIcs.FSTTCS.2015.163; https://dx.doi.org/10.1145/2933575.2934527; https://dx.doi.org/10.1007/978-3-642-02930-1_12; https://dx.doi.org/10.23638/DMTCS-19-4-1; https://dx.doi.org/10.1016/0304-3975(82)90009-3
Subject Terms: lambda-calculus, computational complexity, geometry of interaction, abstract machines, intersection types, Theory of computation → Logic and verification, Theory of computation → Lambda calculus, Theory of computation → Equational logic and rewriting
File Description: application/pdf
Authors: de Frutos-Fernández, María Inés, Nuccio Mortarino Majno Di Capriglio, Filippo Alberto Edoardo
Contributors: Universidad Autónoma de Madrid (UAM), Combinatoire, théorie des nombres (CTN), Institut Camille Jordan (ICJ), École Centrale de Lyon (ECL), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Jean Monnet - Saint-Étienne (UJM)-Centre National de la Recherche Scientifique (CNRS)-École Centrale de Lyon (ECL), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Jean Monnet - Saint-Étienne (UJM)-Centre National de la Recherche Scientifique (CNRS), CA1/RSUE/2021-00623 of the Spanish Ministry ofUniversities, the Recovery, Transformation and Resilience Plan, and Universidad Autónoma de Madrid., Appel à Projets Recherche UJM 2023 of Université Jean Monnet Saint-Étienne
Superior Title:
13th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP ’24)
https://ujm.hal.science/ujm-04222610
13th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP ’24), Jan 2024, London, United Kingdom. pp.190-204, ⟨10.1145/3636501.3636942⟩
https://popl24.sigplan.org/home/CPP-2024
Subject Terms: Logic and verification, Proof theory formal mathematics, Lean, mathlib, algebraic number theory, local fields, discrete valuation rings, Theory of computation, CCS Concepts: Theory of computation → Logic and verification, Proof theory formal mathematics Lean mathlib algebraic number theory local fields discrete valuation rings, CCS Concepts, Theory of computation → Logic and verification, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT]
Subject Geographic: London, United Kingdom
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2310.01998; ujm-04222610; https://ujm.hal.science/ujm-04222610; https://ujm.hal.science/ujm-04222610v3/document; https://ujm.hal.science/ujm-04222610v3/file/deFrutosFerandez%26Nuccio-A%20Formalization%20of%20Complete%20DVR%20and%20Local%20Fields.pdf; ARXIV: 2310.01998
Authors: de Frutos-Fernández, María Inés, Nuccio Mortarino Majno Di Capriglio, Filippo Alberto Edoardo
Contributors: Universidad Autónoma de Madrid (UAM), Combinatoire, théorie des nombres (CTN), Institut Camille Jordan (ICJ), École Centrale de Lyon (ECL), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Jean Monnet - Saint-Étienne (UJM)-Centre National de la Recherche Scientifique (CNRS)-École Centrale de Lyon (ECL), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Jean Monnet - Saint-Étienne (UJM)-Centre National de la Recherche Scientifique (CNRS), CA1/RSUE/2021-00623 of the Spanish Ministry ofUniversities, the Recovery, Transformation and Resilience Plan, and Universidad Autónoma de Madrid., Appel à Projets Recherche UJM 2023 of Université Jean Monnet Saint-Étienne
Superior Title:
13th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP ’24)
https://ujm.hal.science/ujm-04222610
13th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP ’24), Jan 2024, London, United Kingdom. pp.190-204, ⟨10.1145/3636501.3636942⟩
https://popl24.sigplan.org/home/CPP-2024
Subject Terms: Logic and verification, Proof theory formal mathematics, Lean, mathlib, algebraic number theory, local fields, discrete valuation rings, Theory of computation, CCS Concepts: Theory of computation → Logic and verification, Proof theory formal mathematics Lean mathlib algebraic number theory local fields discrete valuation rings, CCS Concepts, Theory of computation → Logic and verification, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT]
Subject Geographic: London, United Kingdom
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2310.01998; ujm-04222610; https://ujm.hal.science/ujm-04222610; https://ujm.hal.science/ujm-04222610v3/document; https://ujm.hal.science/ujm-04222610v3/file/deFrutosFerandez%26Nuccio-A%20Formalization%20of%20Complete%20DVR%20and%20Local%20Fields.pdf; ARXIV: 2310.01998
Authors: de Frutos-Fernández, María Inés, Nuccio Mortarino Majno Di Capriglio, Filippo Alberto Edoardo
Contributors: Universidad Autónoma de Madrid (UAM), Combinatoire, théorie des nombres (CTN), Institut Camille Jordan (ICJ), École Centrale de Lyon (ECL), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Jean Monnet - Saint-Étienne (UJM)-Centre National de la Recherche Scientifique (CNRS)-École Centrale de Lyon (ECL), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Jean Monnet - Saint-Étienne (UJM)-Centre National de la Recherche Scientifique (CNRS), CA1/RSUE/2021-00623 of the Spanish Ministry ofUniversities, the Recovery, Transformation and Resilience Plan, and Universidad Autónoma de Madrid., Appel à Projets Recherche UJM 2023 of Université Jean Monnet Saint-Étienne
Superior Title:
13th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP ’24)
https://ujm.hal.science/ujm-04222610
13th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP ’24), Jan 2024, London, United Kingdom. pp.190-204, ⟨10.1145/3636501.3636942⟩
https://popl24.sigplan.org/home/CPP-2024
Subject Terms: Logic and verification, Proof theory formal mathematics, Lean, mathlib, algebraic number theory, local fields, discrete valuation rings, Theory of computation, CCS Concepts: Theory of computation → Logic and verification, Proof theory formal mathematics Lean mathlib algebraic number theory local fields discrete valuation rings, CCS Concepts, Theory of computation → Logic and verification, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT]
Subject Geographic: London, United Kingdom
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2310.01998; ujm-04222610; https://ujm.hal.science/ujm-04222610; https://ujm.hal.science/ujm-04222610v3/document; https://ujm.hal.science/ujm-04222610v3/file/deFrutosFerandez%26Nuccio-A%20Formalization%20of%20Complete%20DVR%20and%20Local%20Fields.pdf; ARXIV: 2310.01998
Authors: Balbiani, Philippe, Gao, Han, Gencer, Cigdem, Olivetti, Nicola
Contributors: Logique, Interaction, Langue et Calcul (IRIT-LILaC), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Centre National de la Recherche Scientifique (CNRS), Laboratoire d'Informatique et des Systèmes (LIS) (Marseille, Toulon) (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)
Superior Title:
32nd EACSL Annual Conference on Computer Science Logic (CSL 2024)
https://amu.hal.science/hal-04457356
32nd EACSL Annual Conference on Computer Science Logic (CSL 2024), Feb 2024, Naples, Italy. pp.1--21, ⟨10.4230/LIPIcs.CSL.2024.13⟩
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2024.13
Subject Terms: Axiomatization, Completeness, Intuitionistic Modal Logic, Sequent Calculus, Modal and temporal logics, Proof theory, [INFO]Computer Science [cs], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
Relation: hal-04457356; https://amu.hal.science/hal-04457356; https://amu.hal.science/hal-04457356/document; https://amu.hal.science/hal-04457356/file/CSL_24_final_versionPROVVISORIA.pdf
Contributors: Security & PrIvaCY (SPICY), SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom Paris (IMT)-Institut Mines-Télécom Paris (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom Paris (IMT)-Institut Mines-Télécom Paris (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut Mines-Télécom Paris (IMT)-Institut Mines-Télécom Paris (IMT), 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), Programming securely with cryptography (PROSECCO), Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), ANR-22-PECY-0006,SVP,Verification of Security Protocols(2022)
Superior Title: CSF 2024 - 37th IEEE Computer Security Foundations Symposium ; https://hal.science/hal-04577828 ; CSF 2024 - 37th IEEE Computer Security Foundations Symposium, Jul 2024, Enschede, Netherlands
Subject Terms: Logic, Concrete Security, Crypto Protocols, [INFO]Computer Science [cs]
Subject Geographic: Enschede, Netherlands
Relation: hal-04577828; https://hal.science/hal-04577828; https://hal.science/hal-04577828/document; https://hal.science/hal-04577828/file/main.pdf
Availability:
https://hal.science/hal-04577828
https://hal.science/hal-04577828/document
https://hal.science/hal-04577828/file/main.pdf
