Gotowa bibliografia na temat „Certified programming”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Certified programming”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Certified programming"
Tanter, Éric, i Nicolas Tabareau. "Gradual certified programming in coq". ACM SIGPLAN Notices 51, nr 2 (11.05.2016): 26–40. http://dx.doi.org/10.1145/2936313.2816710.
Pełny tekst źródłaMagron, Victor, George Constantinides i Alastair Donaldson. "Certified Roundoff Error Bounds Using Semidefinite Programming". ACM Transactions on Mathematical Software 43, nr 4 (23.03.2017): 1–31. http://dx.doi.org/10.1145/3015465.
Pełny tekst źródłaNi, Zhaozhong, i Zhong Shao. "Certified assembly programming with embedded code pointers". ACM SIGPLAN Notices 41, nr 1 (12.01.2006): 320–33. http://dx.doi.org/10.1145/1111320.1111066.
Pełny tekst źródłaSyafrizal, Mutiara, i Agus Siswanto. "MAGANG STUDI INDEPENDEN BERSERTIFIKAT WEBSITE APLIKASI ONLINE PMB DI PT ARKATAMA MULTI SOLUSINDO". Jurnal SINTA: Sistem Informasi dan Teknologi Komputasi 1, nr 1 (6.01.2024): 31–39. http://dx.doi.org/10.61124/sinta.v1i1.12.
Pełny tekst źródłaBARTHE, GILLES, DAVID PICHARDIE i TAMARA REZK. "A certified lightweight non-interference Java bytecode verifier". Mathematical Structures in Computer Science 23, nr 5 (17.05.2013): 1032–81. http://dx.doi.org/10.1017/s0960129512000850.
Pełny tekst źródłaJacobs, Jules, Stephanie Balzer i Robbert Krebbers. "Multiparty GV: functional multiparty session types with certified deadlock freedom". Proceedings of the ACM on Programming Languages 6, ICFP (29.08.2022): 466–95. http://dx.doi.org/10.1145/3547638.
Pełny tekst źródłaClaflin, Kellie, Josh Stewart i Haley Q. Traini. "Here are the keys, go teach: How alternatively certified agriculture teachers learn to be agriculture teachers". Journal of Agricultural Education 64, nr 2 (30.06.2023): 98–115. http://dx.doi.org/10.5032/jae.v64i2.110.
Pełny tekst źródłaBogaerts, Bart, Stephan Gocht, Ciaran McCreesh i Jakob Nordström. "Certified Symmetry and Dominance Breaking for Combinatorial Optimisation". Proceedings of the AAAI Conference on Artificial Intelligence 36, nr 4 (28.06.2022): 3698–707. http://dx.doi.org/10.1609/aaai.v36i4.20283.
Pełny tekst źródłaHe, Guo Tian, Jie Sheng Chen, Li Song, Yan Ma, Ming Li, Ze Yu Xu, De Sheng Zhang i Ying Chun Ran. "Test Unit Design of Magnetorheological Greases Conductivity Research Based on Labview". Applied Mechanics and Materials 246-247 (grudzień 2012): 1130–34. http://dx.doi.org/10.4028/www.scientific.net/amm.246-247.1130.
Pełny tekst źródłaCHLIPALA, ADAM. "Modular development of certified program verifiers with a proof assistant",. Journal of Functional Programming 18, nr 5-6 (15.08.2008): 599–647. http://dx.doi.org/10.1017/s0956796808006904.
Pełny tekst źródłaRozprawy doktorskie na temat "Certified programming"
Popescu, Valentina. "Towards fast and certified multiple-precision librairies". Thesis, Lyon, 2017. http://www.theses.fr/2017LYSEN036/document.
Pełny tekst źródłaMany numerical problems require some very accurate computations. Examples can be found in the field ofdynamical systems, like the long-term stability of the solar system or the long-term iteration of the Lorenz attractor thatis one of the first models used for meteorological predictions. We are also interested in ill-posed semi-definite positiveoptimization problems that appear in quantum chemistry or quantum information.In order to tackle these problems using computers, every basic arithmetic operation (addition, multiplication,division, square root) requires more precision than the ones offered by common processors (binary32 and binary64).There exist multiple-precision libraries that allow the manipulation of very high precision numbers, but their generality(they are able to handle numbers with millions of digits) is quite a heavy alternative when high performance is needed.The major objective of this thesis was to design and develop a new arithmetic library that offers sufficient precision, isfast and also certified. We offer accuracy up to a few tens of digits (a few hundred bits) on both common CPU processorsand on highly parallel architectures, such as graphical cards (GPUs). We ensure the results obtained by providing thealgorithms with correctness and error bound proofs
Sall, Boubacar Demba. "Programmation impérative par raffinements avec l'assistant de preuve Coq". Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS181.
Pełny tekst źródłaThis thesis investigates certified programming by stepwise refinement in the framework of the Coq proof assistant. This allows the construction of programs that are correct by construction. The programming language that is considered is a simple imperative language with assignment, selection, sequence, and iteration. The semantics of this language is formalized in a relational and predicative setting, and is shown to be equivalent to an axiomatic semantics in the style of a Hoare logic. The stepwise refinement approach to programming requires that refinement steps from the specification to the program be proved correct. For so doing, we use a calculus of weakest pre-specifications which is a generalisation of the calculus of weakest pre-conditions. Finally, to capture the whole refinement history of a program development, we formalize a design language and a logic for reasoning about program designs in order to establish that all refinement steps are indeed correct. The approach developed during this thesis is entirely mecanised using the Coq proof assistant
Tejiščák, Matúš. "On the semantics of exceptions for high level and low level languages". Master's thesis, 2012. http://www.nusl.cz/ntk/nusl-305104.
Pełny tekst źródłaKsiążki na temat "Certified programming"
Anderson, Bill. Java 2 Platform Sun Certified Programmer. Upper Saddle River, NJ: Prentice Hall PTR, 2000.
Znajdź pełny tekst źródłaOrwant, Jon. Perl 5 interactive course: Certified edition. Corte Madera, CA: Waite Group Press, 1998.
Znajdź pełny tekst źródłaLinkletter, Terry. Certified computing professional examination review outlines. Des Plaines, Ill: Institute for Certification of Computing Professionals, 2000.
Znajdź pełny tekst źródłaInc, Syngress Media, red. Sun certified programmer for Java 2 study guide. Berkeley, Calif: Osborne/McGraw Hill, 2000.
Znajdź pełny tekst źródłaSun Microsystems. Sun certified JAVA programmer: Data structures and algorithms lab manual. Santa Clara, Calif: Sun Microsystems, Inc., 2010.
Znajdź pełny tekst źródłaSAP certified development associate--ABAP with SAP NetWeaver 7.4. Wyd. 3. Bonn: Rheinwerk Pub., 2015.
Znajdź pełny tekst źródłaInc, Syngress Media, red. Sun certified programmer for Java 2 study guide / Syngress Media, Inc. Wyd. 2. New York: Osborne McGraw Hill, 2001.
Znajdź pełny tekst źródłaRaposa, Richard F. SCJP: Sun Certified Programmer for Java Platform Study Guide. New York: John Wiley & Sons, Ltd., 2009.
Znajdź pełny tekst źródłaSCJP Sun certified programmer for Java platform, standard edition 6, study guide. Indianapolis, Ind: Wiley Pub., 2009.
Znajdź pełny tekst źródłaBlokdijk, Gerard. SCJP 100 success secrets: Success with the Sun Certified Java Programmer (SCJP)exam, before and after passing. [S.l: s.n.], 2007.
Znajdź pełny tekst źródłaCzęści książek na temat "Certified programming"
Rozplokhas, Dmitry, Andrey Vyatkin i Dmitry Boulytchev. "Certified Semantics for Relational Programming". W Programming Languages and Systems, 167–85. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-64437-6_9.
Pełny tekst źródłaLopes, Raul, Rodrigo Ribeiro i Carlos Camarão. "Certified Derivative-Based Parsing of Regular Expressions". W Programming Languages, 95–109. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-45279-1_7.
Pełny tekst źródłaBarthe, Gilles, César Kunz i Jorge Luis Sacchini. "Certified Reasoning in Memory Hierarchies". W Programming Languages and Systems, 75–90. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-89330-1_6.
Pełny tekst źródłaVandesande, Dieter, Wolf De Wulf i Bart Bogaerts. "QMaxSATpb: A Certified MaxSAT Solver". W Logic Programming and Nonmonotonic Reasoning, 429–42. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-15707-3_33.
Pełny tekst źródłaFronc, Lukasz, i Franck Pommereau. "Towards a Certified Petri Net Model-Checker". W Programming Languages and Systems, 322–36. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-25318-8_24.
Pełny tekst źródłaSavary-Belanger, Olivier, Stefan Monnier i Brigitte Pientka. "Programming Type-Safe Transformations Using Higher-Order Abstract Syntax". W Certified Programs and Proofs, 243–58. Cham: Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-03545-1_16.
Pełny tekst źródłaCosmina, Iuliana. "Aspect Oriented Programming with Spring". W Pivotal Certified Professional Spring Developer Exam, 153–84. Berkeley, CA: Apress, 2017. http://dx.doi.org/10.1007/978-1-4842-0811-3_4.
Pełny tekst źródłaYu, Dachuan, Nadeem A. Hamid i Zhong Shao. "Building Certified Libraries for PCC: Dynamic Storage Allocation". W Programming Languages and Systems, 363–79. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-36575-3_25.
Pełny tekst źródłaGarrigue, Jacques. "A Certified Implementation of ML with Structural Polymorphism". W Programming Languages and Systems, 360–75. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-17164-2_25.
Pełny tekst źródłaBarthe, Gilles, David Pichardie i Tamara Rezk. "A Certified Lightweight Non-interference Java Bytecode Verifier". W Programming Languages and Systems, 125–40. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-71316-6_10.
Pełny tekst źródłaStreszczenia konferencji na temat "Certified programming"
Tanter, Éric, i Nicolas Tabareau. "Gradual certified programming in coq". W SPLASH '15: Conference on Systems, Programming, Languages, and Applications: Software for Humanity. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2816707.2816710.
Pełny tekst źródłaGu, Ronghui, Zhong Shao, Jieung Kim, Xiongnan (Newman) Wu, Jérémie Koenig, Vilhelm Sjöberg, Hao Chen, David Costanzo i Tahina Ramananandro. "Certified concurrent abstraction layers". W PLDI '18: ACM SIGPLAN Conference on Programming Language Design and Implementation. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3192366.3192381.
Pełny tekst źródłaCarbonneaux, Quentin, Jan Hoffmann i Zhong Shao. "Compositional certified resource bounds". W PLDI '15: ACM SIGPLAN Conference on Programming Language Design and Implementation. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2737924.2737955.
Pełny tekst źródłaRibeiro, Rodrigo, i André Du Bois. "Certified Bit-Coded Regular Expression Parsing". W SBLP 2017: 21st Brazilian Symposium on Programming Languages. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3125374.3125381.
Pełny tekst źródłaNi, Zhaozhong, i Zhong Shao. "Certified assembly programming with embedded code pointers". W Conference record of the 33rd ACM SIGPLAN-SIGACT symposium. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1111037.1111066.
Pełny tekst źródłaAnnenkov, Danil, i Martin Elsman. "Certified Compilation of Financial Contracts". W PPDP '18: The 20th International Symposium on Principles and Practice of Declarative Programming. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3236950.3236955.
Pełny tekst źródłaSoundarapandian, Vimala, Adharsh Kamath, Kartik Nagar i KC Sivaramakrishnan. "Certified mergeable replicated data types". W PLDI '22: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3519939.3523735.
Pełny tekst źródłaCastro-Perez, David, Francisco Ferreira, Lorenzo Gheri i Nobuko Yoshida. "Zooid: a DSL for certified multiparty computation: from mechanised metatheory to certified multiparty processes". W PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3453483.3454041.
Pełny tekst źródłaKoenig, Jérémie, i Zhong Shao. "CompCertO: compiling certified open C components". W PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3453483.3454097.
Pełny tekst źródłaDoenges, Ryan, Tobias Kappé, John Sarracino, Nate Foster i Greg Morrisett. "Leapfrog: certified equivalence for protocol parsers". W PLDI '22: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3519939.3523715.
Pełny tekst źródłaRaporty organizacyjne na temat "Certified programming"
Johnny, Teneisha, i Mark D. Wenner. Tourism and Ecotourism Development in Guyana: Issues and Challenges and the Critical Path Forward. Inter-American Development Bank, grudzień 2015. http://dx.doi.org/10.18235/0009267.
Pełny tekst źródłaHlushak, Oksana M., Volodymyr V. Proshkin i Oksana S. Lytvyn. Using the e-learning course “Analytic Geometry” in the process of training students majoring in Computer Science and Information Technology. [б. в.], wrzesień 2019. http://dx.doi.org/10.31812/123456789/3268.
Pełny tekst źródła