Thematische Bibliographien / Certified programming

Auswahl der wissenschaftlichen Literatur zum Thema „Certified programming“

Autor: Grafiati

Veröffentlicht am 25. Mai 2024

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Bücher
Buchteile
Konferenzberichte
Berichte der Organisationen

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Certified programming" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Certified programming"

Tanter, Éric, und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Magron, Victor, George Constantinides und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ni, Zhaozhong, und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Syafrizal, Mutiara, und 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 (06.01.2024): 31–39. http://dx.doi.org/10.61124/sinta.v1i1.12.

Der volle Inhalt der Quelle

Annotation:

PT Arkatama Multi Solusindo is an experienced company in IT consulting services and application development. Certified Independent Study Database Programming is one of the independent study programs at PT Arkatama Multi Solusindo. The series of activities in the separate database programming study program includes individual learning; participants will take part in a synchronous learning process (delivery of material by the trainer via Zoom meeting) and asynchronous (study of the material provided in the form of teaching modules/teaching videos/practical materials). At each learning meeting, participants will be given a pre-test, post-test, and written or practical assignments to test their understanding of the learning provided by the teacher. The Certified Independent Database Programming Study aims to enable participants to become competent Database Programmers in data management systems. Certified independent study database programming has minimum graduation requirements (SKM), namely, Creating a web-based database application with case studies that have been determined by the trainer to display data in intuitive graphic form and published using a domain and hosting. The final project given was creating a web application for new student admissions using the Codeigniter framework, Bootstrap, and the Highcharts plugin.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

BARTHE, GILLES, DAVID PICHARDIE und 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.

Der volle Inhalt der Quelle

Annotation:

Non-interference guarantees the absence of illicit information flow throughout program execution. It can be enforced by appropriate information flow type systems. Much of the previous work on type systems for non-interference has focused on calculi or high-level programming languages, and existing type systems for low-level languages typically omit objects, exceptions and method calls. We define an information flow type system for a sequential JVM-like language that includes all these programming features, and we prove, in the Coq proof assistant, that it guarantees non-interference. An additional benefit of the formalisation is that we have extracted from our proof a certified lightweight bytecode verifier for information flow. Our work provides, to the best of our knowledge, the first sound and certified information flow type system for such an expressive fragment of the JVM.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Jacobs, Jules, Stephanie Balzer und 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.

Der volle Inhalt der Quelle

Annotation:

Session types have recently been integrated with functional languages, bringing message-passing concurrency to functional programming. Channel endpoints then become first-class and can be stored in data structures, captured in closures, and sent along channels. Representatives of the GV (Wadler's "Good Variation") session type family are of particular appeal because they not only assert session fidelity but also deadlock freedom, inspired by a Curry-Howard correspondence to linear logic. A restriction of current versions of GV, however, is the focus on binary sessions, limiting concurrent interactions within a session to two participants. This paper introduces Multiparty GV (MPGV), a functional language with multiparty session types, allowing concurrent interactions among several participants. MPGV upholds the strong guarantees of its ancestor GV, including deadlock freedom, despite session interleaving and delegation. MPGV has a novel redirecting construct for modular programming with first-class endpoints, thanks to which we give a type-preserving translation from binary session types to MPGV to show that MPGV is strictly more general than binary GV. All results in this paper have been mechanized using the Coq proof assistant.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Claflin, Kellie, Josh Stewart und 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.

Der volle Inhalt der Quelle

Annotation:

Teacher shortages in agricultural education are one reason for an increase in alternatively certified teachers, with 22.8% of new hires in school-based agricultural education (SBAE) being alternative licensure route completers in 2018. While prior research in SBAE has provided insight into the needs of alternatively certified teachers, we do not know how alternatively certified agriculture teachers are acquiring the practices of the profession. The purpose of this study was to explore how alternatively certified agriculture teachers acquire the practices of agriculture teachers using Wenger’s social learning theory, Communities of Practice. Data analysis resulted in four themes regarding how the participants acquired practices and the context of acquisition: (1) here are the keys, go teach; (2) connectors to the community, (3) in it for the kids, and (4) agricultural education is different from anything else. These findings highlight the social aspects of acquiring the unique practices of agriculture teachers through experience and mentors, as well as the dedication of participants to supporting students. Consequently, we recommend state leaders in SBAE to acknowledge the importance of social learning as they develop programming and supports for alternatively certified agriculture teachers.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bogaerts, Bart, Stephan Gocht, Ciaran McCreesh und 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.

Der volle Inhalt der Quelle

Annotation:

Symmetry and dominance breaking can be crucial for solving hard combinatorial search and optimisation problems, but the correctness of these techniques sometimes relies on subtle arguments. For this reason, it is desirable to produce efficient, machine-verifiable certificates that solutions have been computed correctly. Building on the cutting planes proof system, we develop a certification method for optimisation problems in which symmetry and dominance breaking are easily expressible. Our experimental evaluation demonstrates that we can efficiently verify fully general symmetry breaking in Boolean satisfiability (SAT) solving, thus providing, for the first time, a unified method to certify a range of advanced SAT techniques that also includes XOR and cardinality reasoning. In addition, we apply our method to maximum clique solving and constraint programming as a proof of concept that the approach applies to a wider range of combinatorial problems.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

He, Guo Tian, Jie Sheng Chen, Li Song, Yan Ma, Ming Li, Ze Yu Xu, De Sheng Zhang und Ying Chun Ran. „Test Unit Design of Magnetorheological Greases Conductivity Research Based on Labview“. Applied Mechanics and Materials 246-247 (Dezember 2012): 1130–34. http://dx.doi.org/10.4028/www.scientific.net/amm.246-247.1130.

Der volle Inhalt der Quelle

Annotation:

This paper described the characteristics of open virtual equipment platform LabVIEW, and introduced the method to construct data collecting system using this platform. And developed computer controlled monitoring unit of magneto-rheological grease conductivity, tested the relation between magneto-rheological grease conductivity and external magnetic field, particle concentration, and thickness of magneto-rheological grease. In windows system, the virtual instrument constructed by using LabVIEW programming implemented the real time measurement, display, record of conductivity output, analysis its conductivity characteristics, and fitted the output electric resistance data and determined the best fitting curve. The experiment certified that this method doesn't need complex programming, reduces the programming time, and simplifies the development procedure, and increases the flexibility of detection system.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

CHLIPALA, 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.

Der volle Inhalt der Quelle

Annotation:

AbstractWe report on an experience using the Coq proof assistant to develop a program verification tool with a machine-checked proof of full correctness. The verifier is able to prove memory safety of x86 machine code programs compiled from code that uses algebraic datatypes. The tool's soundness theorem is expressed in terms of the bit-level semantics of x86 programs, so its correctness depends on very few assumptions. We take advantage of Coq's support for programming with dependent types and modules in the structure of the development. The approach is based on developing a library of reusable functors for transforming a verifier at one level of abstraction into a verifier at a lower level. Using this library, it is possible to prototype a verifier based on a new type system with a minimal amount of work, while obtaining a very strong soundness theorem about the final product.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Certified programming"

Popescu, Valentina. „Towards fast and certified multiple-precision librairies“. Thesis, Lyon, 2017. http://www.theses.fr/2017LYSEN036/document.

Der volle Inhalt der Quelle

Annotation:

De nombreux problèmes de calcul numérique demandent parfois à effectuer des calculs très précis. L'étude desystèmes dynamiques chaotiques fournit des exemples très connus: la stabilité du système solaire ou l’itération à longterme de l'attracteur de Lorenz qui constitue un des premiers modèles de prédiction de l'évolution météorologique. Ons'intéresse aussi aux problèmes d'optimisation semi-définie positive mal-posés qui apparaissent dans la chimie oul'informatique quantique.Pour tenter de résoudre ces problèmes avec des ordinateurs, chaque opération arithmétique de base (addition,multiplication, division, racine carrée) demande une plus grande précision que celle offerte par les systèmes usuels(binary32 and binary64). Il existe des logiciels «multi-précision» qui permettent de manipuler des nombres avec unetrès grande précision, mais leur généralité (ils sont capables de manipuler des nombres de millions de chiffres) empêched’atteindre de hautes performances. L’objectif majeur de cette thèse a été de développer un nouveau logiciel à la foissuffisamment précis, rapide et sûr : on calcule avec quelques dizaines de chiffres (quelques centaines de bits) deprécision, sur des architectures hautement parallèles comme les processeurs graphiques et on démontre des bornesd'erreur afin d'être capables d’obtenir des résultats certains
Many 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

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

Annotation:

Cette thèse s’intéresse à la programmation certifiée correcte dans le cadre formel fourni par l’assistant de preuve Coq, et conduite par étapes de raffinements, avec l'objectif d’aboutir à un résultat correct par construction. Le langage de programmation considéré est un langage impératif simple, avec affectations, alternatives, séquences, et boucles. La sémantique associée à ce langage est une sémantique relationnelle exprimée dans un cadre prédicatif plus adapté à un plongement dans la théorie des types, plutôt que dans le calcul des relations. Nous étudions la relation entre d’une part la sémantique prédicative et relationnelle que nous avons choisie, et d’autre part une approche plus classique dans le style de la logique de Hoare. En particulier, nous montrons que les deux approches ont en théorie la même puissance. La démarche que nous étudions consiste à certifier, avec l’aide d’un assistant de preuve, les raffinements successifs permettant de passer de la spécification au programme. Nous nous intéressons donc aussi aux techniques de preuve permettant en pratique d’établir la validité des raffinements. Plus précisément, nous utilisons un calcul de la plus faible pré-spécification jouant ici le rôle du calcul de la plus faible pré-condition dans les approches classiques. Afin que l’articulation des étapes de raffinement reste aussi proche que possible de l’activité de programmation, nous formalisons un langage de développement qui permet de décrire l’arborescence des étapes de raffinement, ainsi qu’une logique permettant de raisonner sur ces développements, et de garantir leur correction
This 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

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

Annotation:

The thesis deals with correctness of a compiler of a simple language featuring exceptions. We present formal semantics, both denotational semantics of a~high-level language and operational semantics of a low-level language for a~simple stack machine. We study the method of stack unwinding and then iteratively, improving upon a naive solution, we present a different method that is structurally recursive and thus suitable for implementation in total dependently typed languages. Finally, we provide an implementation of the compiler in the dependently typed functional programming language Agda, along with a mechanically verifiable proof of adherence of the implementation to the semantics.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bücher zum Thema "Certified programming"

Anderson, Bill. Java 2 Platform Sun Certified Programmer. Upper Saddle River, NJ: Prentice Hall PTR, 2000.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Orwant, Jon. Perl 5 interactive course: Certified edition. Corte Madera, CA: Waite Group Press, 1998.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Linkletter, Terry. Certified computing professional examination review outlines. Des Plaines, Ill: Institute for Certification of Computing Professionals, 2000.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Inc, Syngress Media, Hrsg. Sun certified programmer for Java 2 study guide. Berkeley, Calif: Osborne/McGraw Hill, 2000.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Sun Microsystems. Sun certified JAVA programmer: Data structures and algorithms lab manual. Santa Clara, Calif: Sun Microsystems, Inc., 2010.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

SAP certified development associate--ABAP with SAP NetWeaver 7.4. 3. Aufl. Bonn: Rheinwerk Pub., 2015.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Inc, Syngress Media, Hrsg. Sun certified programmer for Java 2 study guide / Syngress Media, Inc. 2. Aufl. New York: Osborne McGraw Hill, 2001.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Raposa, Richard F. SCJP: Sun Certified Programmer for Java Platform Study Guide. New York: John Wiley & Sons, Ltd., 2009.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

SCJP Sun certified programmer for Java platform, standard edition 6, study guide. Indianapolis, Ind: Wiley Pub., 2009.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Blokdijk, Gerard. SCJP 100 success secrets: Success with the Sun Certified Java Programmer (SCJP)exam, before and after passing. [S.l: s.n.], 2007.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Buchteile zum Thema "Certified programming"

Rozplokhas, Dmitry, Andrey Vyatkin und Dmitry Boulytchev. „Certified Semantics for Relational Programming“. In Programming Languages and Systems, 167–85. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-64437-6_9.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Lopes, Raul, Rodrigo Ribeiro und Carlos Camarão. „Certified Derivative-Based Parsing of Regular Expressions“. In Programming Languages, 95–109. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-45279-1_7.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Barthe, Gilles, César Kunz und Jorge Luis Sacchini. „Certified Reasoning in Memory Hierarchies“. In Programming Languages and Systems, 75–90. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-89330-1_6.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Vandesande, Dieter, Wolf De Wulf und Bart Bogaerts. „QMaxSATpb: A Certified MaxSAT Solver“. In Logic Programming and Nonmonotonic Reasoning, 429–42. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-15707-3_33.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Fronc, Lukasz, und Franck Pommereau. „Towards a Certified Petri Net Model-Checker“. In Programming Languages and Systems, 322–36. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-25318-8_24.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Savary-Belanger, Olivier, Stefan Monnier und Brigitte Pientka. „Programming Type-Safe Transformations Using Higher-Order Abstract Syntax“. In Certified Programs and Proofs, 243–58. Cham: Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-03545-1_16.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Cosmina, Iuliana. „Aspect Oriented Programming with Spring“. In Pivotal Certified Professional Spring Developer Exam, 153–84. Berkeley, CA: Apress, 2017. http://dx.doi.org/10.1007/978-1-4842-0811-3_4.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Yu, Dachuan, Nadeem A. Hamid und Zhong Shao. „Building Certified Libraries for PCC: Dynamic Storage Allocation“. In Programming Languages and Systems, 363–79. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-36575-3_25.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Garrigue, Jacques. „A Certified Implementation of ML with Structural Polymorphism“. In Programming Languages and Systems, 360–75. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-17164-2_25.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Barthe, Gilles, David Pichardie und Tamara Rezk. „A Certified Lightweight Non-interference Java Bytecode Verifier“. In Programming Languages and Systems, 125–40. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-71316-6_10.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Certified programming"

Tanter, Éric, und Nicolas Tabareau. „Gradual certified programming in coq“. In 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Gu, Ronghui, Zhong Shao, Jieung Kim, Xiongnan (Newman) Wu, Jérémie Koenig, Vilhelm Sjöberg, Hao Chen, David Costanzo und Tahina Ramananandro. „Certified concurrent abstraction layers“. In 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Carbonneaux, Quentin, Jan Hoffmann und Zhong Shao. „Compositional certified resource bounds“. In 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ribeiro, Rodrigo, und André Du Bois. „Certified Bit-Coded Regular Expression Parsing“. In SBLP 2017: 21st Brazilian Symposium on Programming Languages. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3125374.3125381.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ni, Zhaozhong, und Zhong Shao. „Certified assembly programming with embedded code pointers“. In 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annenkov, Danil, und Martin Elsman. „Certified Compilation of Financial Contracts“. In 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Soundarapandian, Vimala, Adharsh Kamath, Kartik Nagar und KC Sivaramakrishnan. „Certified mergeable replicated data types“. In 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Castro-Perez, David, Francisco Ferreira, Lorenzo Gheri und Nobuko Yoshida. „Zooid: a DSL for certified multiparty computation: from mechanised metatheory to certified multiparty processes“. In 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Koenig, Jérémie, und Zhong Shao. „CompCertO: compiling certified open C components“. In 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Doenges, Ryan, Tobias Kappé, John Sarracino, Nate Foster und Greg Morrisett. „Leapfrog: certified equivalence for protocol parsers“. In 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Certified programming"

Johnny, Teneisha, und Mark D. Wenner. Tourism and Ecotourism Development in Guyana: Issues and Challenges and the Critical Path Forward. Inter-American Development Bank, Dezember 2015. http://dx.doi.org/10.18235/0009267.

Der volle Inhalt der Quelle

Annotation:

Guyana has high potential to develop a nature-based tourist niche market and help diversify its economic base, which now depends on the export of primary commodities. Despite many natural attractions, Guyana is still at a nascent stage of nature-based development relying on primary factors for tourism development as opposed to thorough planning, focused investments, and aggressive marketing efforts. Other segments of traditional tourism development such as business and leisure also are undeveloped and little studied. The tourism sector in general faces many constraints, such as high air travel cost, inadequate infrastructure, a slew of small-scale lodging properties that are not graded or certified, lack of marketing, and limited government budgetary outlays and incentives that would serve to stimulate development of the sector. Some important steps have been taken to improve competitiveness of the sector, but still a critical mass of interventions has not been realized that can lead to a dramatic transformation. This paper reviews the main issues and challenges and posits that critical path modeling, mathematical programming and spatial economic analysis could be used to identify two or three of the most binding constraints that should be addressed first given budgetary limitations and low levels of private sector investments.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Hlushak, Oksana M., Volodymyr V. Proshkin und Oksana S. Lytvyn. Using the e-learning course “Analytic Geometry” in the process of training students majoring in Computer Science and Information Technology. [б. в.], September 2019. http://dx.doi.org/10.31812/123456789/3268.

Der volle Inhalt der Quelle

Annotation:

As a result of literature analysis the expediency of free access of bachelors majoring in Computer Sciences and Information Technologies to modern information educational resources, in particular, e-learning courses in the process of studying mathematical disciplines is substantiated. It was established that the e-learning course is a complex of teaching materials and educational services created for the organization of individual and group training using information and communication technologies. Based on the outlined possibilities of applying the e-learning course, as well as its didactic functions, the structure of the certified e-learning course “Analytic Geometry” based on the Moodle platform was developed and described. Features of application of cloud-oriented resources are considered: Desmos, Geogebra, Wolfram|Alpha, Sage in the study of the discipline “Analytic Geometry”. The results of the pedagogical experiment on the basis of Borys Grinchenko Kyiv University and A. S. Makarenko Sumy State Pedagogical University are presented. The experiment was conducted to verify the effectiveness of the implementation of the e-learning course “Analytic Geometry”. Using the Pearson criterion it is proved that there are significant differences in the level of mathematical preparation of experimental and control group of students. The prospect of further scientific research is outlined through the effectiveness of the use of e-learning courses for the improvement of additional professional competences of students majoring in Computer Sciences and Information Technologies (specialization “Programming”, “Internet of Things”).

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!