Rozprawy doktorskie na temat „Higher order logics”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Higher order logics”.
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.
Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.
Assaf, Ali. "A framework for defining computational higher-order logics". Palaiseau, Ecole polytechnique, 2015. https://theses.hal.science/tel-01235303v4/document.
Pełny tekst źródłaFreire, Cibele Matos. "Complexidade descritiva das lÃgicas de ordem superior com menor ponto fixo e anÃlise de expressividade de algumas lÃgicas modais". Universidade Federal do CearÃ, 2010. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=6359.
Pełny tekst źródłaIn Descriptive Complexity, we investigate the use of logics to characterize computational classes os problems through complexity. Since 1974, when Fagin proved that the class NP is captured by existential second-order logic, considered the rst result in this area, other relations between logics and complexity classes have been established. Wellknown results usually involve rst-order logic and its extensions, and complexity classes in polynomial time or space. Some examples are that the rst-order logic extended by the least xed-point operator captures the class P and the second-order logic extended by the transitive closure operator captures the class PSPACE. In this dissertation, we will initially analyze the expressive power of some modal logics with respect to the decision problem REACH and see that is possible to express it with temporal logics CTL and CTL. We will also analyze the combined use of higher-order logics extended by the least xed-point operator and obtain as result that each level of this hierarchy captures each level of the deterministic exponential time hierarchy. As a corollary, we will prove that the hierarchy of HOi(LFP), for i 2, does not collapse, that is, HOi(LFP) HOi+1(LFP)
TEICA, ELENA. "FORMAL CORRECTNESS AND COMPLETENESS FOR A SET OF UNINTERPRETED RTL TRANSFORMATIONS". University of Cincinnati / OhioLINK, 2001. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1001432470.
Pełny tekst źródłaFreire, Cibele Matos. "Complexidade descritiva das lógicas de ordem superior com menor ponto fixo e análise de expressividade de algumas lógicas modais". reponame:Repositório Institucional da UFC, 2010. http://www.repositorio.ufc.br/handle/riufc/17668.
Pełny tekst źródłaApproved for entry into archive by guaracy araujo (guaraa3355@gmail.com) on 2016-06-14T19:48:16Z (GMT) No. of bitstreams: 1 2010_dis_cmfreire.pdf: 426798 bytes, checksum: 4ad13c09839833ee22b0396a445e8a26 (MD5)
Made available in DSpace on 2016-06-14T19:48:16Z (GMT). No. of bitstreams: 1 2010_dis_cmfreire.pdf: 426798 bytes, checksum: 4ad13c09839833ee22b0396a445e8a26 (MD5) Previous issue date: 2010
In Descriptive Complexity, we investigate the use of logics to characterize computational classes os problems through complexity. Since 1974, when Fagin proved that the class NP is captured by existential second-order logic, considered the rst result in this area, other relations between logics and complexity classes have been established. Wellknown results usually involve rst-order logic and its extensions, and complexity classes in polynomial time or space. Some examples are that the rst-order logic extended by the least xed-point operator captures the class P and the second-order logic extended by the transitive closure operator captures the class PSPACE. In this dissertation, we will initially analyze the expressive power of some modal logics with respect to the decision problem REACH and see that is possible to express it with temporal logics CTL and CTL . We will also analyze the combined use of higher-order logics extended by the least xed-point operator and obtain as result that each level of this hierarchy captures each level of the deterministic exponential time hierarchy. As a corollary, we will prove that the hierarchy of HOi(LFP), for i 2, does not collapse, that is, HOi(LFP) HOi+1(LFP)
Em Complexidade Descritiva investigamos o uso de logicas para caracterizar classes problemas pelo vies da complexidade. Desde 1974, quando Fagin provou que NP e capturado pela logica existencial de segunda-ordem, considerado o primeiro resultado da area, outras relac~oes entre logicas e classes de complexidade foram estabelecidas. Os resultados mais conhecidos normalmemte envolvem logica de primeira-ordem e suas extens~oes, e classes de complexidade polinomiais em tempo ou espaco. Alguns exemplos são que a l ogica de primeira-ordem estendida com o operador de menor ponto xo captura a clsse P e que a l ogica de segunda-ordem estendida com o operador de fecho transitivo captura a classe PSPACE. Nesta dissertação, analisaremos inicialmente a expressividade de algumas l ogicas modais com rela cão ao problema de decisão REACH e veremos que e poss vel express a-lo com as l ogicas temporais CTL e CTL . Analisaremos tamb em o uso combinado de l ogicas de ordem superior com o operador de menor ponto xo e obteremos como resultado que cada n vel dessa hierarquia captura cada n vel da hierarquia determin stica em tempo exponencial. Como corol ario, provamos que a hierarquia de HOi(LFP) não colapsa, ou seja, HOi(LFP) HOi+1(LFP)
FREIRE, Cibele Matos. Complexidade descritiva das lógicas de ordem superior com menor ponto fixo e análise de expressividade de algumas lógicas modais. 2010. 54 f. : Dissertação (mestrado) - Universidade Federal do Ceará, Centro de Ciências, Departamento de Computação, Fortaleza-CE, 2010.
Krishnaswami, Neelakantan R. "Verifying Higher-Order Imperative Programs with Higher-Order Separation Logic". Research Showcase @ CMU, 2012. http://repository.cmu.edu/dissertations/164.
Pełny tekst źródłaZardini, Elia. "Living on the slippery slope : the nature, sources and logic of vagueness". Thesis, St Andrews, 2008. http://hdl.handle.net/10023/508.
Pełny tekst źródłaNesi, Monica. "Formalising process calculi in higher order logic". Thesis, University of Cambridge, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.627495.
Pełny tekst źródłaCamilleri, Albert John. "Executing behavioural definitions in Higher Order Logic". Thesis, University of Cambridge, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.232795.
Pełny tekst źródłaSultana, Nikolai. "Higher-order proof translation". Thesis, University of Cambridge, 2015. https://www.repository.cam.ac.uk/handle/1810/247345.
Pełny tekst źródłaFritz, Peter. "Intensional type theory for higher-order contingentism". Thesis, University of Oxford, 2015. http://ora.ox.ac.uk/objects/uuid:b9415266-ad21-494a-9a78-17d2395eb8dd.
Pełny tekst źródłaHaftmann, Florian. "Code generation from specifications in higher-order logic". kostenfrei, 2009. https://mediatum2.ub.tum.de/node?id=886023.
Pełny tekst źródłaCardell-Oliver, Rachel Mary. "The formal verification of hard real-time systems". Thesis, University of Cambridge, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.239756.
Pełny tekst źródłaBerghofer, Stefan. "Proofs, programs and executable specifications in higher order logic". [S.l. : s.n.], 2003. http://deposit.ddb.de/cgi-bin/dokserv?idn=969627661.
Pełny tekst źródłaBruse, Florian [Verfasser]. "Extremal fixpoints for higher-order modal logic / Florian Bruse". Kassel : Universitätsbibliothek Kassel, 2020. http://d-nb.info/1220854093/34.
Pełny tekst źródłaGrellois, Charles. "Semantics of linear logic and higher-order model-checking". Sorbonne Paris Cité, 2016. http://www.theses.fr/2016USPCC024.
Pełny tekst źródłaThis thesis studies problems of higher-order model-checking from a semantic and logical perspective. Higher-order model-checking is concerned with the verification of properties expressed in monadic second-order logic, specified over infinite trees generated by a class of rewriting systems called higher-order recursion schemes. These systems are equivalent to lambda-terms with recursion, and can therefore be studied using semantic methods. The more specific purpose of this thesis is to connect higher-order model-checking to a series of advanced ideas in contemporary semantics, such as linear logic and its relational semantics, indexed linear logic, distributive laws between comonads, parametric comonads and tensorial logic. As we will see, all these ingredients meet and combine surprisingly well with higher-order model-checking. The starting point of our approach is the study of the intersection type system of Kobayashi and Ong. This intersection type system enables one to type a higher-order recursion scheme with states of a given automaton, associated with a formula of monadic second-order logic. The recursion scheme is typable with the initial state of the automaton if and only if the infinite tree it represents satisfies the formula of interest. In spite of this soundness-and-completeness result, the original type system by Kobayashi and Ong was not designed with the connection between intersection types and models of linear logic observed by Bucciarelli, Ehrhard, de Carvalho and Terui in mind. Our work has thus been to connect these two fields. Our analysis leads us to the definition of an alternative intersection type system, which enjoys a similar soundness-and-completeness theorem with respect to higher-order model-checking. In contrast to the original type system by Kobayashi and Ong, our modal formulation is the proof-theoretic counterpart of a finitary semantics of linear logic, obtained by composing the traditional exponential modality with a coloring comonad. We equip the semantics of linear logic with an inductive-coinductive fixpoint operator. We obtain in this way a model of the lambda-calculus with recursion in which the interpretation of a higher-order recursion scheme is the set of states from which the infinite tree it represents is accepted. The finiteness of the semantics enables us to reestablish several results of decidability for higher-order model-checking problems, among which the selection problem recently formulated and proved by Carayol and Serre. This finitary semantics are inspired from the extensional collapse theorem of Ehrhard, who shows that the relational semantics of linear logic collapses extensionally to the finitary semantics provided by Scott lanices. For that reason, we start in a preliminary approach to define the coloring comonad and the inductive-coinductive fixpoint operator in the quantitative semantics provided by an infinitary (and non-continuous) version of the relational model of linear logic
Dhingra, Inderpreet Singh. "Formalising an integrated circuit design style in higher order logic". Thesis, University of Cambridge, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.278296.
Pełny tekst źródłaMelham, Thomas Frederick. "Formalizing abstraction mechanisms for hardware verification in higher order logic". Thesis, University of Cambridge, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.334206.
Pełny tekst źródłaGilbert, Frédéric. "Extending higher-order logic with predicate subtyping : application to PVS". Thesis, Sorbonne Paris Cité, 2018. http://www.theses.fr/2018USPCC009/document.
Pełny tekst źródłaThe type system of higher-order logic allows to exclude some unexpected expressions such as the application of a predicate to itself. However, it is not sufficient to verify more complex criteria such as the absence of divisions by zero. This thesis is dedicated to the study of an extension of higher-order logic, named predicate subtyping, whose purpose is to make the assignment of types as expressive as the assignment of predicates. Starting from a type A and a predicate P(x) of domain A, predicate subtyping allows to build a subtype of A, denoted {x : A | P(x)}, whose elements are the terms t of type A such that P(t) is provable. Predicate subtyping is at the heart of the proof system PVS.This work presents the formalization of a minimal system expressing predicate subtyping, named PVS-Core, as well as a system of verifiable certificates for PVS-Core. This second system, named PVS-Cert, is based on the introduction of proof terms and explicit coercions. PVS-Core and PVS-Cert are equipped with a notion of conversion corresponding respectively to equality modulo beta and to equality modulo beta and the erasure of coercions, chosen to establish a simple correspondence between the two systems.The construction of PVS-Cert is similar to that of PTSs (Pure Type Systems) with dependent pairs and PVS-Cert can be equipped with the notion of beta-sigma-reduction used at the core of these systems. One of the main theorems proved in this work is the strong normalization of both the reduction underlying the conversion and beta-sigma-reduction. This theorem allows, on the one hand, to build a type-checking (and proof-checking) algorithm for PVS-Cert and, on the other hand, to prove a cut elimination result, used in turn to prove important properties of the two studied systems. Furthermore, it is also proved that PVS-Cert is a conservative extension of the PTS lambda-HOL and that, as a consequence, PVS-Core is a conservative extension of higher-order logic.A second part presents the prototype of an instrumentation of PVS to generate proof certificates. A third and final part is dedicated to the study of links between classical and constructive logic, with the definition of a minimal double-negation translation as well as the presentation of an automated proof constructivization algorithm
Pandya, Rashmibala. "A multi-layered framework for higher order probabilistic reasoning". Thesis, University of Exeter, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.364432.
Pełny tekst źródłaMiura, Kinya. "Proof System of Higher-Order Clausal Logic and its Parallel Implementation". Kyoto University, 1995. http://hdl.handle.net/2433/160754.
Pełny tekst źródłaKyoto University (京都大学)
0048
新制・論文博士
博士(工学)
乙第8773号
論工博第2935号
新制||工||978(附属図書館)
UT51-95-B238
(主査)教授 堂下 修司, 教授 矢島 脩三, 教授 石田 亨
学位規則第4条第2項該当
Martin, Alan J. "Reasoning Using Higher-Order Abstract Syntax in a Higher-Order Logic Proof Environment: Improvements to Hybrid and a Case Study". Thesis, Université d'Ottawa / University of Ottawa, 2010. http://hdl.handle.net/10393/19711.
Pełny tekst źródłaBattell, Chelsea. "The Logic of Hereditary Harrop Formulas as a Specification Logic for Hybrid". Thesis, Université d'Ottawa / University of Ottawa, 2016. http://hdl.handle.net/10393/35264.
Pełny tekst źródłaNg, Kee Siong, i kee siong@rsise anu edu au. "Learning Comprehensible Theories from Structured Data". The Australian National University. Research School of Information Sciences and Engineering, 2005. http://thesis.anu.edu.au./public/adt-ANU20051031.105726.
Pełny tekst źródłaKotzsch, Hans-Christoph [Verfasser], i Hannes [Akademischer Betreuer] Leitgeb. "Topos semantics for higher-order modal logic / Hans-Christoph Kotzsch ; Betreuer: Hannes Leitgeb". München : Universitätsbibliothek der Ludwig-Maximilians-Universität, 2016. http://d-nb.info/1125883928/34.
Pełny tekst źródłaMukhopadhyay, Trisha. "A Flexible, Natural Deduction, Automated Reasoner for Quick Deployment of Non-Classical Logic". Scholar Commons, 2019. https://scholarcommons.usf.edu/etd/7862.
Pełny tekst źródłaAtzemoglou, George Philip. "Higher-order semantics for quantum programming languages with classical control". Thesis, University of Oxford, 2012. http://ora.ox.ac.uk/objects/uuid:9fdc4a26-cce3-48ed-bbab-d54c4917688f.
Pełny tekst źródłaReynolds, James. "An automatic proof-generating translation from higher-order to first-order logic : with applications to linking HOL4 and ACL2". Thesis, University of Cambridge, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.611133.
Pełny tekst źródłaKohlhase, Michael [Verfasser]. "A Mechanization of Sorted Higher-Order Logic Based on the Resolution Principle / Michael Kohlhase". Kaiserslautern : Technische Universität Kaiserslautern, Fachbereich Informatik, 1999. http://d-nb.info/1027386598/34.
Pełny tekst źródłaBulwahn, Lukas [Verfasser], Tobias [Akademischer Betreuer] Nipkow i Colin [Akademischer Betreuer] Runciman. "Counterexample Generation for Higher-Order Logic Using Functional and Logic Programming / Lukas Bulwahn. Gutachter: Tobias Nipkow ; Colin Runciman. Betreuer: Tobias Nipkow". München : Universitätsbibliothek der TU München, 2013. http://d-nb.info/1033891142/34.
Pełny tekst źródłaSofianatos, Georgios. "Higher order QCD effects for Higgs boson studies at colliders /". May be available electronically:, 2009. http://proquest.umi.com/login?COPT=REJTPTU1MTUmSU5UPTAmVkVSPTI=&clientId=12498.
Pełny tekst źródłaBöhme, Sascha Verfasser], Tobias [Akademischer Betreuer] [Nipkow i Andrey [Akademischer Betreuer] Rybalchenko. "Proving Theorems of Higher-Order Logic with SMT Solvers / Sascha Böhme. Gutachter: Andrey Rybalchenko. Betreuer: Tobias Nipkow". München : Universitätsbibliothek der TU München, 2012. http://d-nb.info/1023128497/34.
Pełny tekst źródłaKohlhase, Michael [Verfasser], i Jörg [Akademischer Betreuer] Siekmann. "A mechanization of sorted higher-order logic based on the resolution principle / Michael Kohlhase. Betreuer: Jörg Siekmann". Saarbrücken : Saarländische Universitäts- und Landesbibliothek, 2007. http://d-nb.info/1049538501/34.
Pełny tekst źródłaCarreno, Coll Victor Alberto. "Transition assertions : a higher-order logic based method for the specification and verification of real-time systems". Thesis, University of Cambridge, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.627145.
Pełny tekst źródłaWong, Wai. "A formal theory of railway track networks in higher-order logic and its applications in interlocking design". Thesis, University of Warwick, 1992. http://wrap.warwick.ac.uk/110541/.
Pełny tekst źródłaAnglès, d'Auriac Paul-Elliot. "Infinite Computations in Algorithmic Randomness and Reverse Mathematics". Thesis, Paris Est, 2019. http://www.theses.fr/2019PESC0061.
Pełny tekst źródłaThis thesis focuses on the gains of infinite time computations to mathematical logic. Infinite time computations is a variant of the traditional definition of computations as a finite sequence of stages, each stage being defined from the previous ones, and finally reaching a halting state. In this thesis, we consider the case where the number of stages is not necessarily finite, but can continue along ordinals, an extension of the integers. There exists several ways to implement this idea, we will use three of them: higher recursion, infinite time Turing machines and α-recursion.Part of this works concerns the domain of reverse mathematics, and especially Hindman's theorem. Reverse mathematics is a program consisting in the study of theorems and axioms from the point of view of their "strength", and establishing a hierarchy on these. In particular the question of which axioms are needed in a proof of a given statement is central. We study Hindman's theorem under this lens, a combinatorial result from Ramsey's theory stating that for every partitioning of the integers into finitely many colors, there must exists an infinite set such that any sum of elements taken from it has a fixed color. In this thesis, we make some progress in the question of the minimal axiomatic system needed to show this result, by showing that the existence of some intermediate combinatorial objects is provable in a weak system.Weihrauch reduction is a way to compare the strength of theorems, that has been introduced in reverse mathematics recently. It sees theorems as problems to solve, and then compare their difficulties. This reduction is still less studied in this context, in particular few of the most important principles of reverse mathematics are not yet well comprehended. One of these is the Arithmetical Transfinite Recursion principle, an axiomatic system with strong links with infinite time computations and especially higher recursion. We continue the study of this principle by showing its links with a particular type of axiom of choice, and use it to separate the dependent and independent version of this choice.Yet another field of mathematical logic that benefits from computability theory is the one of algorithmic randomness. It studies "random" reals, those that it would seem reasonable to think that they arise from a process picking a real uniformly in some interval. A way to study this is to considerate, for a given real, the smallest algorithmic complexity of a null set containing it. This domain has proven very rich and has already been extended to certain type of infinite time computation, thereby modifying the complexity class considered. However, it has been extended to infinite time Turing machine and α-recursion only recently, by Carl and Schlicht. In this thesis, we contribute to the study of the most natural randomness classes for ITTMs and α-recursion. We show that two important classes, Σ-randomness and ITTM-randomness, are not automatically different; in particular their categorical equivalent are in fact the same classes
Raghunandan, Jayshan. "Curry-Howard Calculi from Classical Logical Connectives : A Generic Tool for Higher-Order Term Graph Rewriting". Thesis, Imperial College London, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.508781.
Pełny tekst źródłaBlanchette, Jasmin Christian Verfasser], Tobias [Akademischer Betreuer] [Nipkow i Koen [Akademischer Betreuer] Claessen. "Automatic Proofs and Refutations for Higher-Order Logic / Jasmin Christian Blanchette. Gutachter: Tobias Nipkow ; Koen Claessen. Betreuer: Tobias Nipkow". München : Universitätsbibliothek der TU München, 2012. http://d-nb.info/1024354997/34.
Pełny tekst źródłaBlanchette, Jasmin [Verfasser], Tobias [Akademischer Betreuer] Nipkow i Koen [Akademischer Betreuer] Claessen. "Automatic Proofs and Refutations for Higher-Order Logic / Jasmin Christian Blanchette. Gutachter: Tobias Nipkow ; Koen Claessen. Betreuer: Tobias Nipkow". München : Universitätsbibliothek der TU München, 2012. http://nbn-resolving.de/urn:nbn:de:bvb:91-diss-20120628-1097834-1-6.
Pełny tekst źródłaDubcová, Lenka. "Novel self-adaptive higher-order finite elements methods for Maxwell's equations of electromagnetics". To access this resource online via ProQuest Dissertations and Theses @ UTEP, 2008. http://0-proquest.umi.com.lib.utep.edu/login?COPT=REJTPTU0YmImSU5UPTAmVkVSPTI=&clientId=2515.
Pełny tekst źródłaWisnesky, Ryan. "Functional Query Languages with Categorical Types". Thesis, Harvard University, 2013. http://dissertations.umi.com/gsas.harvard:11288.
Pełny tekst źródłaEngineering and Applied Sciences
Kunčar, Ondřej Verfasser], Tobias [Akademischer Betreuer] [Gutachter] [Nipkow i Lawrence C. [Gutachter] Paulson. "Types, Abstraction and Parametric Polymorphism in Higher-Order Logic / Ondřej Kunčar. Betreuer: Tobias Nipkow. Gutachter: Lawrence C. Paulson ; Tobias Nipkow". München : Universitätsbibliothek der TU München, 2016. http://d-nb.info/1106382153/34.
Pełny tekst źródłaTian, Chun. "A formalization of unique solutions of equations in process algebra". Master's thesis, Alma Mater Studiorum - Università di Bologna, 2017. http://amslaurea.unibo.it/14798/.
Pełny tekst źródłaSbardolini, Giorgio. "From Language to Thought: On the Logical Foundations of Semantic Theory". The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu155307880402531.
Pełny tekst źródłaBacon, Andrew Jonathan. "Indeterminacy : an investigation into the Soritical and semantical paradoxes". Thesis, University of Oxford, 2012. http://ora.ox.ac.uk/objects/uuid:b4490a8c-0089-4c77-8d24-1ab1ca5baaf0.
Pełny tekst źródłaHölzl, Johannes Verfasser], Tobias [Akademischer Betreuer] [Nipkow i Estaun Francisco Javier [Akademischer Betreuer] Esparza. "Construction and Stochastic Applications of Measure Spaces in Higher-Order Logic / Johannes Hölzl. Gutachter: Tobias Nipkow ; Francisco Javier Esparza Estaun. Betreuer: Tobias Nipkow". München : Universitätsbibliothek der TU München, 2013. http://d-nb.info/1033640344/34.
Pełny tekst źródłaWorth, Andrew Christopher. "English Coordination in Linear Categorial Grammar". The Ohio State University, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=osu1451933040.
Pełny tekst źródłaHague, Matthew. "Saturation methods for global model-checking pushdown systems". Thesis, University of Oxford, 2009. http://ora.ox.ac.uk/objects/uuid:40263ddb-312d-4e18-b774-2caf4def0e76.
Pełny tekst źródłaJacinto, Bruno. "Necessitism, contingentism and theory equivalence". Thesis, University of St Andrews, 2016. http://hdl.handle.net/10023/8814.
Pełny tekst źródłaMaffre, Faustine. "Le bonheur est dans l'ignorance : logiques épistémiques dynamiques basées sur l'observabilité et leurs applications". Thesis, Toulouse 3, 2016. http://www.theses.fr/2016TOU30112/document.
Pełny tekst źródłaIn epistemic logic, knowledge is usually modelled by a graph of possible worlds, representing the alternatives to the current state of the world. So edges between worlds stand for indistinguishability. To know a proposition means that that proposition is true in all possible alternatives. Theoretical computer scientists however noticed that this led to several issues, both intuitively and technically: the more an agent is ignorant, the more alternatives she must consider; models may then become too big for system verification. They recently investigated how knowledge could be reduced to the notion of visibility. Intuitively, the basic idea is that when an agent sees something, then she knows its truth value. The other way round, any combination of truth values of the non-observable variables is possible for the agent. Such observability information allows us to reconstruct the standard semantics of knowledge: two worlds are indistinguishable for an agent if and only if every variable observed by her has the same value in both worlds. We aim to demonstrate that visibility-based epistemic logics provide a suitable tool for several important applications in the field of artificial intelligence. In the current settings of these logics of visibility, every agent has a set of propositional variables that she can observe; these visibilities are constant across the model. This comes with a strong assumption: visibilities are known to everyone, and are even common knowledge. Moreover, constructing knowledge from visibility brings about counter-intuitive validities, the most important being that the knowledge operator distributes over disjunction of literals: if an agent knows that p or q is true, then she knows that p is true or that q is true because she can see them. In this thesis, we propose solutions to these two problems and illustrate them on various applications such as epistemic planning or epistemic boolean games, and on more specific examples such as the muddy children problem or the gossip problem. We moreover study formal properties of the logics we design, providing axiomatizations and complexity results
Lundberg, Didrik. "Provably Sound and Secure Automatic Proving and Generation of Verification Conditions". Thesis, KTH, Teoretisk datalogi, TCS, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-239441.
Pełny tekst źródłaBevis av säkerhetsegenskaper hos program genom formell verifiering kan göras med hjälp av interaktiva teorembevisare. Det program som skall verifieras representeras i en mellanliggande språkrepresentation inuti den interaktiva teorembevisaren, varefter påståenden kan konstrueras, som sedan bevisas. Detta är en process som kan automatiseras i hög grad. Här presenterar vi en metod för att effektivt skapa och bevisa ett teorem som visar sundheten hos den svagaste förutsättningen för att ett program avslutas framgångsrikt under ett givet postvillkor. Specifikt använder vi Poly/ML-implementationen av SML för att generera ett teorem i den interaktiva teorembevisaren HOL4 som beskriver egenskaper hos ett program i BIR, en abstrakt mellanrepresentation av maskinkod som används i PROSPER-projektet.