Добірка наукової літератури з теми "Logics and meaning of programs"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Logics and meaning of programs".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Logics and meaning of programs"
Hornischer, Levin. "Logics of Synonymy." Journal of Philosophical Logic 49, no. 4 (January 9, 2020): 767–805. http://dx.doi.org/10.1007/s10992-019-09537-5.
Повний текст джерелаFaber, Wolfgang, Michael Morak, and Stefan Woltran. "Strong Equivalence for Epistemic Logic Programs Made Easy." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 2809–16. http://dx.doi.org/10.1609/aaai.v33i01.33012809.
Повний текст джерелаHARRISON, AMELIA, and YULIYA LIERLER. "First-order modular logic programs and their conservative extensions." Theory and Practice of Logic Programming 16, no. 5-6 (September 2016): 755–70. http://dx.doi.org/10.1017/s1471068416000430.
Повний текст джерелаDe Giacomo, G., and M. Lenzerini. "A Uniform Framework for Concept Definitions in Description Logics." Journal of Artificial Intelligence Research 6 (March 1, 1997): 87–110. http://dx.doi.org/10.1613/jair.334.
Повний текст джерелаMabuchi, Hiroshi, Kiyoshi Akama, Hidekatsu Koike, and Katsunori Miura. "Infinite Computation in the Equivalent Transformation Model." Journal of Advanced Computational Intelligence and Intelligent Informatics 11, no. 2 (February 20, 2007): 176–86. http://dx.doi.org/10.20965/jaciii.2007.p0176.
Повний текст джерелаHAYES, IAN, ROBERT COLVIN, DAVID HEMER, PAUL STROOPER, and RAY NICKSON. "A refinement calculus for logic programs." Theory and Practice of Logic Programming 2, no. 4-5 (July 2002): 425–60. http://dx.doi.org/10.1017/s1471068402001448.
Повний текст джерелаSubrahmanian, V. S. "Y-Logic: A Framework for Reasoning About Chameleonic Programs with Inconsistent Completions." Fundamenta Informaticae 13, no. 4 (October 1, 1990): 465–83. http://dx.doi.org/10.3233/fi-1990-13405.
Повний текст джерелаHirani, Anil, and V. S. Subrahmanian. "Algebraic Foundations of Logic Programming, I: The Distributive Lattice of Logic Programs." Fundamenta Informaticae 13, no. 3 (July 1, 1990): 317–32. http://dx.doi.org/10.3233/fi-1990-13306.
Повний текст джерелаDAGNINO, FRANCESCO, DAVIDE ANCONA, and ELENA ZUCCA. "Flexible coinductive logic programming." Theory and Practice of Logic Programming 20, no. 6 (September 22, 2020): 818–33. http://dx.doi.org/10.1017/s147106842000023x.
Повний текст джерелаBergadano, F., D. Gunetti, and U. Trinchero. "The Difficulties of Learning Logic Programs with Cut." Journal of Artificial Intelligence Research 1 (November 1, 1993): 91–107. http://dx.doi.org/10.1613/jair.26.
Повний текст джерелаДисертації з теми "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.
Повний текст джерелаHöllerer, Markus, Dennis Jancsary, Renate Meyer, and 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.
Повний текст джерелаO'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.
Повний текст джерелаEmme, Michael John. "Derivation and application of a model of lens meaning." Thesis, University of British Columbia, 1991. http://hdl.handle.net/2429/32277.
Повний текст джерелаEducation, 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.
Повний текст джерелаHeider, 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.
Повний текст джерелаHuddleston, Clarity. "History, Power, and Meaning: Refusing Heaven and Jack Gilbert's Poetic Career." Scholarship @ Claremont, 2018. http://scholarship.claremont.edu/scripps_theses/1117.
Повний текст джерелаRowland, 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.
Повний текст джерелаNurse 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.
Повний текст джерелаThis 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.
Повний текст джерелаКниги з теми "Logics and meaning of programs"
Voronkov, Andrei. Programming Logics: Essays in Memory of Harald Ganzinger. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.
Знайти повний текст джерелаBinder, Walter. Software Composition: 12th International Conference, SC 2013, Budapest, Hungary, June 19, 2013. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.
Знайти повний текст джерелаLive Data Structures in Logic Programs: Derivation by Means of Abstract Interpretation. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993.
Знайти повний текст джерелаP, Aalst Wil M., Balbo Gianfranco, Koutny Maciej 1958-, Wolf Karsten, and SpringerLink (Online service), eds. Transactions on Petri Nets and Other Models of Concurrency VII. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.
Знайти повний текст джерелаHalpin, Harry. Social Semantics: The Search for Meaning on the Web. Boston, MA: Springer US, 2013.
Знайти повний текст джерелаNelma, Moreira, Reis Rogério, and SpringerLink (Online service), eds. Descriptional Complexity of Formal Systems: 14th International Workshop, DCFS 2012, Braga, Portugal, July 23-25, 2012. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.
Знайти повний текст джерелаParikh, Rohit, ed. Logics of Programs. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15648-8.
Повний текст джерелаFelleisen, 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.
Знайти повний текст джерелаJohnsen, Einar Broch. Integrated Formal Methods: 10th International Conference, IFM 2013, Turku, Finland, June 10-14, 2013. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.
Знайти повний текст джерелаShankar, A. Udaya. Distributed Programming: Theory and Practice. New York, NY: Springer New York, 2013.
Знайти повний текст джерелаЧастини книг з теми "Logics and meaning of programs"
Bohrer, Brandon, and André Platzer. "Constructive Game Logic." In Programming Languages and Systems, 84–111. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44914-8_4.
Повний текст джерелаMurali, Adithya, Lucas Peña, Christof Löding, and P. Madhusudan. "A First-Order Logic with Frames." In Programming Languages and Systems, 515–43. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44914-8_19.
Повний текст джерелаAbadi, Martin, and Zohar Manna. "Nonclausal temporal deduction." In Logics of Programs, 1–15. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15648-8_1.
Повний текст джерелаGrabowski, Michał. "On the relative incompleteness of logics for total correctness." In Logics of Programs, 118–27. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15648-8_10.
Повний текст джерелаGraf, S., and J. Sifakis. "From synchronization tree logic to acceptance model logic." In Logics of Programs, 128–42. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15648-8_11.
Повний текст джерелаKamin, Sam. "A FASE specification of FP." In Logics of Programs, 143–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15648-8_12.
Повний текст джерелаKolaitis, Phokion G. "On asymptotic probabilities of inductive queries and their decision problem." In Logics of Programs, 153–66. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15648-8_13.
Повний текст джерелаKoymans, R., R. K. Shyamasundar, W. P. Roever, R. Gerth, and S. Arun-Kumar. "Compositional semantics for real-time distributed computing." In Logics of Programs, 167–89. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15648-8_14.
Повний текст джерелаLeviant, Daniel. "Partial-correctness theories as first-order theories." In Logics of Programs, 190–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15648-8_15.
Повний текст джерелаLichtenstein, Orna, Amir Pnueli, and Lenore Zuck. "The glory of the past." In Logics of Programs, 196–218. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15648-8_16.
Повний текст джерелаТези доповідей конференцій з теми "Logics and meaning of programs"
Bogaerts, Bart, Joost Vennekens, and Marc Denecker. "Safe Inductions: An Algebraic Study." In 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.
Повний текст джерелаBodden, Eric. "Session details: The meaning of programs." In MODULARITY '14: 13th International Conference on Modularity. New York, NY, USA: ACM, 2014. http://dx.doi.org/10.1145/3251086.
Повний текст джерелаZhao, Jidi, and Harold Boley. "Combining Fuzzy Description Logics and Fuzzy Logic Programs." In 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology. IEEE, 2008. http://dx.doi.org/10.1109/wiiat.2008.363.
Повний текст джерелаEmerson, E. A., and C. S. Jutla. "The complexity of tree automata and logics of programs." In [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science. IEEE, 1988. http://dx.doi.org/10.1109/sfcs.1988.21949.
Повний текст джерелаLucas, Salvador, and José Meseguer. "Proving Operational Termination of Declarative Programs in General Logics." In the 16th International Symposium. New York, New York, USA: ACM Press, 2014. http://dx.doi.org/10.1145/2643135.2643152.
Повний текст джерелаVardi, M. Y., and L. Stockmeyer. "Improved upper and lower bounds for modal logics of programs." In the seventeenth annual ACM symposium. New York, New York, USA: ACM Press, 1985. http://dx.doi.org/10.1145/22145.22173.
Повний текст джерела"How Many Realities Fit Into a Program? - Notes on the Meaning of Meaning for Programs." In International Workshop on Software Knowledge. SciTePress - Science and and Technology Publications, 2011. http://dx.doi.org/10.5220/0003700000920099.
Повний текст джерелаFulton, Nathan, and André Platzer. "A logic of proofs for differential dynamic logic: toward independently checkable proof certificates for dynamic logics." In CPP 2016: Certified Proofs and Programs. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2854065.2854078.
Повний текст джерелаMiranda, María del Rosario Landín, Diana Ramírez Hernández, and Félix Eduardo Núñez Olvera. "Graduate programs in education, exploring its meaning and significance of training." In Third International Conference on Higher Education Advances. Valencia: Universitat Politècnica València, 2017. http://dx.doi.org/10.4995/head17.2017.5566.
Повний текст джерелаShi, Lian, Shuai Lu, Tao Sun, and DanTong Ouyang. "A hybrid system combining intuitionistic fuzzy description logics with intuitionistic fuzzy logic programs." In 2011 Eighth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2011). IEEE, 2011. http://dx.doi.org/10.1109/fskd.2011.6019517.
Повний текст джерелаЗвіти організацій з теми "Logics and meaning of programs"
Yatsymirska, Mariya. SOCIAL EXPRESSION IN MULTIMEDIA TEXTS. Ivan Franko National University of Lviv, February 2021. http://dx.doi.org/10.30970/vjo.2021.49.11072.
Повний текст джерела