Gotowa bibliografia na temat „Logics and meaning of programs”
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 „Logics and meaning of programs”.
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 "Logics and meaning of programs"
Hornischer, Levin. "Logics of Synonymy". Journal of Philosophical Logic 49, nr 4 (9.01.2020): 767–805. http://dx.doi.org/10.1007/s10992-019-09537-5.
Pełny tekst źródłaFaber, Wolfgang, Michael Morak i Stefan Woltran. "Strong Equivalence for Epistemic Logic Programs Made Easy". Proceedings of the AAAI Conference on Artificial Intelligence 33 (17.07.2019): 2809–16. http://dx.doi.org/10.1609/aaai.v33i01.33012809.
Pełny tekst źródłaHARRISON, AMELIA, i YULIYA LIERLER. "First-order modular logic programs and their conservative extensions". Theory and Practice of Logic Programming 16, nr 5-6 (wrzesień 2016): 755–70. http://dx.doi.org/10.1017/s1471068416000430.
Pełny tekst źródłaDe Giacomo, G., i M. Lenzerini. "A Uniform Framework for Concept Definitions in Description Logics". Journal of Artificial Intelligence Research 6 (1.03.1997): 87–110. http://dx.doi.org/10.1613/jair.334.
Pełny tekst źródłaMabuchi, Hiroshi, Kiyoshi Akama, Hidekatsu Koike i Katsunori Miura. "Infinite Computation in the Equivalent Transformation Model". Journal of Advanced Computational Intelligence and Intelligent Informatics 11, nr 2 (20.02.2007): 176–86. http://dx.doi.org/10.20965/jaciii.2007.p0176.
Pełny tekst źródłaHAYES, IAN, ROBERT COLVIN, DAVID HEMER, PAUL STROOPER i RAY NICKSON. "A refinement calculus for logic programs". Theory and Practice of Logic Programming 2, nr 4-5 (lipiec 2002): 425–60. http://dx.doi.org/10.1017/s1471068402001448.
Pełny tekst źródłaSubrahmanian, V. S. "Y-Logic: A Framework for Reasoning About Chameleonic Programs with Inconsistent Completions". Fundamenta Informaticae 13, nr 4 (1.10.1990): 465–83. http://dx.doi.org/10.3233/fi-1990-13405.
Pełny tekst źródłaHirani, Anil, i V. S. Subrahmanian. "Algebraic Foundations of Logic Programming, I: The Distributive Lattice of Logic Programs". Fundamenta Informaticae 13, nr 3 (1.07.1990): 317–32. http://dx.doi.org/10.3233/fi-1990-13306.
Pełny tekst źródłaDAGNINO, FRANCESCO, DAVIDE ANCONA i ELENA ZUCCA. "Flexible coinductive logic programming". Theory and Practice of Logic Programming 20, nr 6 (22.09.2020): 818–33. http://dx.doi.org/10.1017/s147106842000023x.
Pełny tekst źródłaBergadano, F., D. Gunetti i U. Trinchero. "The Difficulties of Learning Logic Programs with Cut". Journal of Artificial Intelligence Research 1 (1.11.1993): 91–107. http://dx.doi.org/10.1613/jair.26.
Pełny tekst źródłaRozprawy doktorskie na temat "Logics and meaning of programs"
Gotsman, Olexiy. "Logics and analyses for concurrent heap-manipulating programs". Thesis, University of Cambridge, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.611774.
Pełny tekst źródłaHöllerer, Markus, Dennis Jancsary, Renate Meyer i Oliver Vettori. "Imageries of corporate social responsibility: Visual recontextualization and field-level meaning". Emerald Group Publishing Limited, 2013. http://dx.doi.org/10.1108/S0733-558X(2013)0039AB018.
Pełny tekst źródłaO'Shea, Molly. "America's hidden meaning of welcome : a Bosnian experience of two English language learner programs /". ProQuest subscription required:, 2000. http://proquest.umi.com/pqdweb?did=990270521&sid=1&Fmt=2&clientId=8813&RQT=309&VName=PQD.
Pełny tekst źródłaEmme, Michael John. "Derivation and application of a model of lens meaning". Thesis, University of British Columbia, 1991. http://hdl.handle.net/2429/32277.
Pełny tekst źródłaEducation, Faculty of
Curriculum and Pedagogy (EDCP), Department of
Graduate
Jurow, Kate. "Making Meaning Together: The role of interpretation during a short-term nature excursion". Antioch University / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=antioch1468589329.
Pełny tekst źródłaHeider, Cynthia. "Exploring the meaning of school improvement in the formulation and implementation of the Missouri school improvement program /". free to MU campus, to others for purchase, 2001. http://wwwlib.umi.com/cr/mo/fullcit?p3036830.
Pełny tekst źródłaHuddleston, Clarity. "History, Power, and Meaning: Refusing Heaven and Jack Gilbert's Poetic Career". Scholarship @ Claremont, 2018. http://scholarship.claremont.edu/scripps_theses/1117.
Pełny tekst źródłaRowland, Beverly Dianne. "Conceptualization of factors that have meaning for newly licensed registered nurses completing nurse residency programs in acute care settings". Thesis, Indiana University - Purdue University Indianapolis, 2016. http://pqdtopen.proquest.com/#viewpdf?dispub=10241295.
Pełny tekst źródłaNurse residency programs (NRPs) have been identified as a means to promote transitioning of new nurses into the professional nursing role. Questions have arisen related to which elements within those programs are most meaningful to the development of new nurses. As the nursing shortage drives the need for quick transition and development of nurses to meet workforce needs, nursing must identify what is meaningful to nurses in their transition to practice. The purpose of this multi-site study was to explicate meaning from the experiences of newly licensed registered nurses (NLRNs) who have just completed NRPs. The research question was “What factors have meaning for NLRNs who have experienced transition to practice in nurse residency programs in acute care settings?”
Semi-structured interviews were used to collect data from six NLRNs from three different NRPs after completion of their programs. Using interpretative phenomenological analysis, themes and variations within those themes were derived from the descriptive narratives provided from participant interviews. Overarching themes identified were Relationships, Reflection, Active Learning, Resources and Organizational Systems. Findings have implications for practice and education as the nursing profession strives to find ways to transform nurses in an effective and efficient manner.
Gueneau, Armaël. "Mechanized verification of the correctness and asymptotic complexity of programs : the right answer at the right time". Thesis, Université de Paris (2019-....), 2019. http://www.theses.fr/2019UNIP7110.
Pełny tekst źródłaThis dissertation is concerned with the question of formally verifying that the imple- mentation of an algorithm is not only functionally correct (it always returns the right result), but also has the right asymptotic complexity (it reliably computes the result in the expected amount of time).In the algorithms literature, it is standard practice to characterize the performance of an algorithm by indicating its asymptotic time complexity, typically using Landau’s “big-O” notation. We first argue informally that asymptotic complexity bounds are equally useful as formal specifications, because they enable modular reasoning: a O bound abstracts over the concrete cost expression of a program, and therefore abstracts over the specifics of its implementation. We illustrate—with the help of small illustrative examples—a number of challenges with the use of the O notation, in particular in the multivariate case, that might be overlooked when reasoning informally.We put these considerations into practice by formalizing the O notation in the Coq proof assistant, and by extending an existing program verification framework, CFML, with support for a methodology enabling robust and modular proofs of asymptotic complexity bounds. We extend the existing framework of Separation Logic with Time Credits, which allows to reason at the same time about correctness and time complexity, and introduce negative time credits. Negative time credits increase the expressiveness of the logic, and enable convenient reasoning principles as well as elegant specifications. At the level of specifications, we show how asymptotic complexity specifications using O can be integrated and composed within Separation Logic with Time Credits. Then, in order to establish such specifications, we develop a methodology that allows proofs of complexity in Separation Logic to be robust and carried out at a relatively high level of abstraction, by relying on two key elements: a mechanism for collecting and deferring constraints during the proof, and a mechanism for semi-automatically synthesizing cost expressions without loss of generality.We demonstrate the usefulness and practicality of our approach on a number of increasingly challenging case studies. These include algorithms whose complexity analysis is relatively simple (such as binary search, which is nonetheless out of the scope of many automated complexity analysis tools) and data structures (such as Okasaki’s binary random access lists). In our most challenging case study, we establish the correctness and amortized complexity of a state-of-the-art incremental cycle detection algorithm: our methodology scales up to highly non-trivial algorithms whose complexity analysis intimately depends on subtle functional invariants, and furthermore makes it possible to formally verify OCaml code which can then actually be used as part of real world programs
王楨. "金錢、市場與意義 : 中國「宅門」電視劇的意識形態分析 = Money, market, meaning : an ideological analysis of the Chinese Zhaimen drama". HKBU Institutional Repository, 2008. http://repository.hkbu.edu.hk/etd_ra/924.
Pełny tekst źródłaKsiążki na temat "Logics and meaning of programs"
Voronkov, Andrei. Programming Logics: Essays in Memory of Harald Ganzinger. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.
Znajdź pełny tekst źródłaBinder, Walter. Software Composition: 12th International Conference, SC 2013, Budapest, Hungary, June 19, 2013. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.
Znajdź pełny tekst źródłaLive Data Structures in Logic Programs: Derivation by Means of Abstract Interpretation. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993.
Znajdź pełny tekst źródłaP, Aalst Wil M., Balbo Gianfranco, Koutny Maciej 1958-, Wolf Karsten i SpringerLink (Online service), red. Transactions on Petri Nets and Other Models of Concurrency VII. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.
Znajdź pełny tekst źródłaHalpin, Harry. Social Semantics: The Search for Meaning on the Web. Boston, MA: Springer US, 2013.
Znajdź pełny tekst źródłaNelma, Moreira, Reis Rogério i SpringerLink (Online service), red. Descriptional Complexity of Formal Systems: 14th International Workshop, DCFS 2012, Braga, Portugal, July 23-25, 2012. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.
Znajdź pełny tekst źródłaParikh, Rohit, red. Logics of Programs. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15648-8.
Pełny tekst źródłaFelleisen, Matthias. Programming Languages and Systems: 22nd European Symposium on Programming, ESOP 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.
Znajdź pełny tekst źródłaJohnsen, Einar Broch. Integrated Formal Methods: 10th International Conference, IFM 2013, Turku, Finland, June 10-14, 2013. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.
Znajdź pełny tekst źródłaShankar, A. Udaya. Distributed Programming: Theory and Practice. New York, NY: Springer New York, 2013.
Znajdź pełny tekst źródłaCzęści książek na temat "Logics and meaning of programs"
Bohrer, Brandon, i André Platzer. "Constructive Game Logic". W Programming Languages and Systems, 84–111. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44914-8_4.
Pełny tekst źródłaMurali, Adithya, Lucas Peña, Christof Löding i P. Madhusudan. "A First-Order Logic with Frames". W Programming Languages and Systems, 515–43. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44914-8_19.
Pełny tekst źródłaAbadi, Martin, i Zohar Manna. "Nonclausal temporal deduction". W Logics of Programs, 1–15. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15648-8_1.
Pełny tekst źródłaGrabowski, Michał. "On the relative incompleteness of logics for total correctness". W Logics of Programs, 118–27. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15648-8_10.
Pełny tekst źródłaGraf, S., i J. Sifakis. "From synchronization tree logic to acceptance model logic". W Logics of Programs, 128–42. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15648-8_11.
Pełny tekst źródłaKamin, Sam. "A FASE specification of FP". W Logics of Programs, 143–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15648-8_12.
Pełny tekst źródłaKolaitis, Phokion G. "On asymptotic probabilities of inductive queries and their decision problem". W Logics of Programs, 153–66. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15648-8_13.
Pełny tekst źródłaKoymans, R., R. K. Shyamasundar, W. P. Roever, R. Gerth i S. Arun-Kumar. "Compositional semantics for real-time distributed computing". W Logics of Programs, 167–89. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15648-8_14.
Pełny tekst źródłaLeviant, Daniel. "Partial-correctness theories as first-order theories". W Logics of Programs, 190–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15648-8_15.
Pełny tekst źródłaLichtenstein, Orna, Amir Pnueli i Lenore Zuck. "The glory of the past". W Logics of Programs, 196–218. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15648-8_16.
Pełny tekst źródłaStreszczenia konferencji na temat "Logics and meaning of programs"
Bogaerts, Bart, Joost Vennekens i Marc Denecker. "Safe Inductions: An Algebraic Study". W Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/119.
Pełny tekst źródłaBodden, Eric. "Session details: The meaning of programs". W MODULARITY '14: 13th International Conference on Modularity. New York, NY, USA: ACM, 2014. http://dx.doi.org/10.1145/3251086.
Pełny tekst źródłaZhao, Jidi, i Harold Boley. "Combining Fuzzy Description Logics and Fuzzy Logic Programs". W 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology. IEEE, 2008. http://dx.doi.org/10.1109/wiiat.2008.363.
Pełny tekst źródłaEmerson, E. A., i C. S. Jutla. "The complexity of tree automata and logics of programs". W [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science. IEEE, 1988. http://dx.doi.org/10.1109/sfcs.1988.21949.
Pełny tekst źródłaLucas, Salvador, i José Meseguer. "Proving Operational Termination of Declarative Programs in General Logics". W the 16th International Symposium. New York, New York, USA: ACM Press, 2014. http://dx.doi.org/10.1145/2643135.2643152.
Pełny tekst źródłaVardi, M. Y., i L. Stockmeyer. "Improved upper and lower bounds for modal logics of programs". W the seventeenth annual ACM symposium. New York, New York, USA: ACM Press, 1985. http://dx.doi.org/10.1145/22145.22173.
Pełny tekst źródła"How Many Realities Fit Into a Program? - Notes on the Meaning of Meaning for Programs". W International Workshop on Software Knowledge. SciTePress - Science and and Technology Publications, 2011. http://dx.doi.org/10.5220/0003700000920099.
Pełny tekst źródłaFulton, Nathan, i André Platzer. "A logic of proofs for differential dynamic logic: toward independently checkable proof certificates for dynamic logics". W CPP 2016: Certified Proofs and Programs. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2854065.2854078.
Pełny tekst źródłaMiranda, María del Rosario Landín, Diana Ramírez Hernández i Félix Eduardo Núñez Olvera. "Graduate programs in education, exploring its meaning and significance of training". W Third International Conference on Higher Education Advances. Valencia: Universitat Politècnica València, 2017. http://dx.doi.org/10.4995/head17.2017.5566.
Pełny tekst źródłaShi, Lian, Shuai Lu, Tao Sun i DanTong Ouyang. "A hybrid system combining intuitionistic fuzzy description logics with intuitionistic fuzzy logic programs". W 2011 Eighth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2011). IEEE, 2011. http://dx.doi.org/10.1109/fskd.2011.6019517.
Pełny tekst źródłaRaporty organizacyjne na temat "Logics and meaning of programs"
Yatsymirska, Mariya. SOCIAL EXPRESSION IN MULTIMEDIA TEXTS. Ivan Franko National University of Lviv, luty 2021. http://dx.doi.org/10.30970/vjo.2021.49.11072.
Pełny tekst źródła