Výsledky vyhľadávania - "Implicit computational complexity"

Artifact for 'Applied Implicit Computational Complexity'

Autori: Rusch, Neea

Predmety: formal methods, programming languages, static program analysis, implicit computational complexity

mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity

Autori: Aubert, Clément Rubiano, Thomas Rusch, Neea a ďalší

Prispievatelia: Aubert, Clément Rubiano, Thomas Rusch, Neea a ďalší

Predmety: Program Verification, FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Implicit Computational Complexity, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Formal Languages and Automata Theory (cs.FL), Computer Science - Formal Languages and Automata Theory, Mathematics - Logic, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Automatic Complexity Analysis, Logic in Computer Science (cs.LO), Static Program Analysis, Complexity theory and logic, Logic and verification phrases Static Program Analysis, 0202 electrical engineering, electronic engineering, information engineering, FOS: Mathematics, [MATH.MATH-LO] Mathematics [math]/Logic [math.LO], ddc:004, Logic (math.LO), 2012 ACM Subject Classification Automated static analysis, [INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2203.03943
https://hal.science/hal-03596285v1
https://hal.science/hal-03596285v1/document
https://doi.org/10.4230/lipics.cvit.2016.23
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2022.26

Formally Verified Resource Bounds through Implicit Computational Complexity

Autori: Neea Rusch

Zdroj: Companion Proceedings of the 2022 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity. :17-20

Predmety: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Realizing Implicit Computational Complexity

Autori: Aubert, Clément Rubiano, Thomas Rusch, Neea a ďalší

Prispievatelia: Aubert, Clément Rubiano, Thomas Rusch, Neea a ďalší

Predmety: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Implicit Computational Complexity, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], Code Optimization, 0102 computer and information sciences, 02 engineering and technology, Static Analyzer, [INFO] Computer Science [cs], Computational Complexity (cs.CC), 01 natural sciences, Logic in Computer Science (cs.LO), Computer Science - Computational Complexity, 0202 electrical engineering, electronic engineering, information engineering

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2203.05221
https://hal.science/hal-04098255v1

Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs

Autori: Patrick Baillot Ugo Dal Lago Gilles Barthe a ďalší

Prispievatelia: Patrick Baillot Ugo Dal Lago Gilles Barthe a ďalší

Zdroj: Lecture Notes in Computer Science ISBN: 9783662488980

Predmety: [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], 4. Education, 0202 electrical engineering, electronic engineering, information engineering, Computer Science (all), Theoretical Computer Science, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], Complexity analysis, Cryptographic proofs, Implicit computational complexity, Linear dependent types, 01 natural sciences, [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR]

Popis súboru: application/pdf

Prístupová URL adresa: https://hal.archives-ouvertes.fr/hal-01197456/file/paper28juin2019.pdf
https://hal.archives-ouvertes.fr/hal-01197456/document
https://hal.science/hal-01197456v3
https://hal.science/hal-01197456v3/document
https://doi.org/10.1007/978-3-662-48899-7_15
https://link.springer.com/article/10.1007/s10817-019-09530-2
https://dblp.uni-trier.de/db/journals/jar/jar63.html#BaillotBL19
https://hal.archives-ouvertes.fr/hal-01197456/document
https://hal.archives-ouvertes.fr/hal-01197456
https://link.springer.com/content/pdf/10.1007/s10817-019-09530-2.pdf
https://rd.springer.com/chapter/10.1007/978-3-662-48899-7_15
https://link.springer.com/chapter/10.1007/978-3-662-48899-7_15/fulltext.html
https://link.springer.com/chapter/10.1007/978-3-662-48899-7_15
https://dblp.uni-trier.de/db/conf/lpar/lpar2015.html#BaillotBL15
https://hal.science/hal-01948334v1
http://springerlink.com/content/0302-9743/copyright/2005/
https://hdl.handle.net/11585/543032
https://doi.org/10.1007/978-3-662-48899-7_15

mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity

Autori: Clément Aubert and Thomas Rubiano and Neea Rusch and Thomas Seiller Aubert, Clément Rubiano, Thomas a ďalší

Témy: Static Program Analysis, Implicit Computational Complexity, Automatic Complexity Analysis, Program Verification, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2022.26
Is Part Of LIPIcs, Volume 228, 7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022)

Proceedings Third Joint Workshop on Developments in Implicit Computational complExity and Foundational & Practical Aspects of Resource Analysis: Modular Runtime Complexity Analysis of Probabilistic While Programs

Autori: Michael Schaper Martin Avanzini Georg Moser

Zdroj: Electronic Proceedings in Theoretical Computer Science. 298:81-86

Proceedings Third Joint Workshop on Developments in Implicit Computational complExity and Foundational & Practical Aspects of Resource Analysis: A Hierarchical System of Linear Logic for Exponential Time Complexity

Autori: Brian F. Redmond

Zdroj: Electronic Proceedings in Theoretical Computer Science. 298:75-80

Predmety: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

A Novel Loop Fission Technique Inspired by Implicit Computational Complexity

Autori: Aubert, Clément Rubiano, Thomas Rusch, Neea a ďalší

Témy: Computer Science - Programming Languages, Computer Science - Logic in Computer Science, text

URL: http://arxiv.org/abs/2206.08760

Quantum implicit computational complexity

Autori: Dal Lago U. MASINI, Andrea ZORZI, Margherita

Zdroj: Theoretical Computer Science. 411:377-409

Predmety: Implicit computational complexity, quantum computing, implicit computational complexity, lambda calculus, Quantum computation, 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, Lambda calculus, Theoretical Computer Science, Computer Science(all)

Prístupová URL adresa: https://iris.univr.it/handle/11562/332193
https://www.sciencedirect.com/science/article/pii/S0304397509005167
https://cris.unibo.it/handle/11585/99496
http://profs.scienze.univr.it/~zorzim./DLMZ10-TCS.pdf
http://profs.sci.univr.it/~zorzim/DLMZ10-TCS.pdf
https://dblp.uni-trier.de/db/journals/tcs/tcs411.html#LagoMZ10
https://hdl.handle.net/11562/332193
https://doi.org/10.1016/j.tcs.2009.07.045
https://hdl.handle.net/11585/99496
https://doi.org/10.1016/j.tcs.2009.07.045

Dual-context multicategories as models for implicit computational complexity

Autori: Fomenko, Fedor

Predmety: 519

Prístupová URL adresa: http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.650995

Probabilistic Recursion Theory and Implicit Computational Complexity

Autori: DAL LAGO, UGO ZUPPIROLI, SARA Dal Lago, Ugo

Prispievatelia: DAL LAGO, UGO ZUPPIROLI, SARA Dal Lago, Ugo

Zdroj: Lecture Notes in Computer Science ISBN: 9783319108810

Predmety: Implicit Computational Complexity, 13. Climate action, probabilistic computation, recursion theory, implicit computational complexity, Probabilistic Computation, 0102 computer and information sciences, [INFO] Computer Science [cs], 0101 mathematics, 16. Peace & justice, 01 natural sciences, Recursion Theory

Popis súboru: application/pdf

Prístupová URL adresa: https://hal.inria.fr/hal-01091595/file/main.pdf
https://inria.hal.science/hal-01091595v1
https://doi.org/10.1007/978-3-319-10882-7_7
https://inria.hal.science/hal-01091595v1/document
https://core.ac.uk/display/76519714
https://dblp.uni-trier.de/db/conf/ictac/ictac2014.html#LagoZ14
https://amsdottorato.unibo.it/6723/
https://hal.inria.fr/hal-01091595
https://link.springer.com/chapter/10.1007/978-3-319-10882-7_7
https://rd.springer.com/chapter/10.1007/978-3-319-10882-7_7
https://hdl.handle.net/11585/520886
https://doi.org/10.1007/978-3-319-10882-7_7

Formal security proofs with minimal fuss: Implicit computational complexity at work

Autori: Nowak, David Zhang, Yu

Prispievatelia: Nowak, David Zhang, Yu

Zdroj: Information and Computation. 241:96-113

Predmety: cryptography, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], probabilistic computation, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], 0102 computer and information sciences, lambda-calculus, 0101 mathematics, 16. Peace & justice, 01 natural sciences, safe recursion, [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-PL] Computer Science [cs]/Programming Languages [cs.PL], 3. Good health

Popis súboru: application/pdf

Prístupová URL adresa: http://dblp.uni-trier.de/db/journals/iandc/iandc241.html#NowakZ15
https://www.sciencedirect.com/science/article/pii/S0890540114001394
https://dblp.uni-trier.de/db/journals/iandc/iandc241.html#NowakZ15
https://www.sciencedirect.com/science/article/abs/pii/S0890540114001394
https://hal.science/hal-01144726v1
https://hal.science/hal-01144726v1/document
https://doi.org/10.1016/j.ic.2014.10.008

A Short Introduction to Implicit Computational Complexity

Autori: DAL LAGO, UGO

Zdroj: Lecture Notes in Computer Science ISBN: 9783642314841

Predmety: IMPLICIT COMPUTATIONAL COMPLEXITY

Prístupová URL adresa: http://www.cs.unibo.it/~dallago/FICQRA/esslli.pdf
https://cris.unibo.it/handle/11585/153230
https://link.springer.com/content/pdf/10.1007%2F978-3-642-31485-8_3.pdf
https://dl.acm.org/citation.cfm?id=2359231
https://rd.springer.com/chapter/10.1007/978-3-642-31485-8_3
https://link.springer.com/chapter/10.1007/978-3-642-31485-8_3
https://hdl.handle.net/11585/153230
https://doi.org/10.1007/978-3-642-31485-8_3

Proceedings Third Joint Workshop on Developments in Implicit Computational complExity and Foundational & Practical Aspects of Resource Analysis

Autori: Seiller, Thomas Jost, Steffen

Témy: Computer Science - Computational Complexity, text

URL: http://arxiv.org/abs/1908.04478

Proceedings Third Joint Workshop on Developments in Implicit Computational complExity and Foundational & Practical Aspects of Resource Analysis

Autori: Thomas Seiller Steffen Jost

Zdroj: arXiv: Computational Complexity.

Predmety: FOS: Computer and information sciences, Computer Science - Computational Complexity, 9. Industry and infrastructure, 11. Sustainability, Computational Complexity (cs.CC), 7. Clean energy

Prístupová URL adresa: http://arxiv.org/abs/1908.04478
http://arxiv.org/pdf/1908.04478.pdf
https://arxiv.org/abs/1908.04478
http://ui.adsabs.harvard.edu/abs/2019arXiv190804478S/abstract

Analyzing the Implicit Computational Complexity of object-oriented programs

Autori: Marion, Jean-Yves Péchoux, Romain R. Hariharan, M. Mukund, V. Vinay a ďalší

Prispievatelia: Marion, Jean-Yves Péchoux, Romain R. Hariharan, M. Mukund, V. Vinay a ďalší

Predmety: Implicit computational complexity, sup-interpretation, resource upper bounds, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], ddc:004, object-oriented programs

Popis súboru: application/pdf

Prístupová URL adresa: https://inria.hal.science/inria-00332550v1
https://drops.dagstuhl.de/opus/volltexte/2008/1763/
https://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2008.html#MarionP08
https://drops.dagstuhl.de/opus/volltexte/2008/1763/pdf/08004.MarionJean_Yves.1763.pdf
https://hal.inria.fr/inria-00332550/document
https://hal.inria.fr/inria-00332550
https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1763
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1763

Implicit computational complexity and compilers

Autori: Rubiano, Thomas

Zdroj: Rubiano , T 2017 , Implicit computational complexity and compilers . Department of Computer Science, Faculty of Science, University of Copenhagen . <

Témy: book

URL: https://researchprofiles.ku.dk/da/publications/implicit-computational-complexity-and-compilers(d191eec5-a3aa-4897-8fc2-2b5f6b6e0107).html
https://soeg.kb.dk/permalink/45KBDK_KGL/1f0go08/cdi_abes_theses_2017USPCD076

Proceedings Third Joint Workshop on Developments in Implicit Computational complExity and Foundational & Practical Aspects of Resource Analysis: Preface

Autori: Steffen Jost

Zdroj: Electronic Proceedings in Theoretical Computer Science. 298

Probabilistic Recursion Theory and Implicit Computational Complexity

Autori: Sara Zuppiroli Ugo Dal Lago Maurizio Gabbrielli

Zdroj: Scientific Annals of Computer Science, Vol XXIV, Iss 2, Pp 177-216 (2014)

Predmety: Electronic computers. Computer science, 0202 electrical engineering, electronic engineering, information engineering, QA75.5-76.95, 02 engineering and technology

Prístupová URL adresa: http://www.info.uaic.ro/bin/download/Annals/XXIV2/XXIV2_1.pdf
https://doaj.org/article/d0a9a87d5fcf441e977987a548681687
https://dblp.uni-trier.de/db/journals/cuza/cuza24.html#LagoZG14
http://www.info.uaic.ro/bin/Annals/Article?v=XXIV2&a=1
https://doi.org/10.7561/SACS.2014.2.177
https://www.info.uaic.ro/bin/Annals/Article?v=XXIV2&a=1