Relevant bibliographies by topics / Hoare Logic

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Hoare Logic'

Author: Grafiati
Published: 4 June 2021
Last updated: 16 June 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Hoare Logic.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Hoare Logic"

1

STRUTH, GEORG. "Hoare Semigroups." Mathematical Structures in Computer Science 28, no. 6 (2017): 775–99. http://dx.doi.org/10.1017/s096012951700007x.

Full text
Abstract:
A semigroup-based setting for developing Hoare logics and refinement calculi is introduced together with procedures for translating between verification and refinement proofs. A new Hoare logic for multirelations and two minimalist generic verification and refinement components, implemented in an interactive theorem prover, are presented as applications that benefit from this generalisation.
APA, Harvard, Vancouver, ISO, and other styles
2

Unruh, Dominique. "Quantum relational Hoare logic." Proceedings of the ACM on Programming Languages 3, POPL (2019): 1–31. http://dx.doi.org/10.1145/3290346.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

de Boer, Frank S., and Hans-Dieter A. Hiep. "Completeness and Complexity of Reasoning about Call-by-Value in Hoare Logic." ACM Transactions on Programming Languages and Systems 43, no. 4 (2021): 1–35. http://dx.doi.org/10.1145/3477143.

Full text
Abstract:
We provide a sound and relatively complete Hoare logic for reasoning about partial correctness of recursive procedures in presence of local variables and the call-by-value parameter mechanism and in which the correctness proofs support contracts and are linear in the length of the program. We argue that in spite of the fact that Hoare logics for recursive procedures were intensively studied, no such logic has been proposed in the literature.
APA, Harvard, Vancouver, ISO, and other styles
4

Bergstra, J. A., and C. A. Middelburg. "Using Hoare Logic in a Process Algebra Setting." Fundamenta Informaticae 179, no. 4 (2021): 321–44. http://dx.doi.org/10.3233/fi-2021-2026.

Full text
Abstract:
This paper concerns the relation between process algebra and Hoare logic. We investigate the question whether and how a Hoare logic can be used for reasoning about how data change in the course of a process when reasoning equationally about that process. We introduce an extension of ACP (Algebra of Communicating Processes) with features that are relevant to processes in which data are involved, present a Hoare logic for the processes considered in this process algebra, and discuss the use of this Hoare logic as a complement to pure equational reasoning with the equational axioms of the process algebra.
APA, Harvard, Vancouver, ISO, and other styles
5

Bernot, G., J. P. Comet, Z. Khalis, A. Richard, and O. Roux. "A genetically modified Hoare logic." Theoretical Computer Science 765 (April 2019): 145–57. http://dx.doi.org/10.1016/j.tcs.2018.02.003.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

He, Pei, LiShan Kang, Colin G. Johnson, and Shi Ying. "Hoare logic-based genetic programming." Science China Information Sciences 54, no. 3 (2011): 623–37. http://dx.doi.org/10.1007/s11432-011-4200-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kleymann, Thomas. "Hoare Logic and Auxiliary Variables." Formal Aspects of Computing 11, no. 5 (1999): 541–66. http://dx.doi.org/10.1007/s001650050057.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Feng, Yuan, and Mingsheng Ying. "Quantum Hoare Logic with Classical Variables." ACM Transactions on Quantum Computing 2, no. 4 (2021): 1–43. http://dx.doi.org/10.1145/3456877.

Full text
Abstract:
Hoare logic provides a syntax-oriented method to reason about program correctness and has been proven effective in the verification of classical and probabilistic programs. Existing proposals for quantum Hoare logic either lack completeness or support only quantum variables, thus limiting their capability in practical use. In this article, we propose a quantum Hoare logic for a simple while language that involves both classical and quantum variables. Its soundness and relative completeness are proven for both partial and total correctness of quantum programs written in the language. Remarkably, with novel definitions of classical-quantum states and corresponding assertions, the logic system is quite simple and similar to the traditional Hoare logic for classical programs. Furthermore, to simplify reasoning in real applications, auxiliary proof rules are provided that support standard logical operation in the classical part of assertions and super-operator application in the quantum part. Finally, a series of practical quantum algorithms, in particular the whole algorithm of Shor’s factorisation, are formally verified to show the effectiveness of the logic.
APA, Harvard, Vancouver, ISO, and other styles
9

Knijnenburg, Peter, and Frank Nordemann. "Partial hyperdoctrines: categorical models for partial function logic and Hoare logic." Mathematical Structures in Computer Science 4, no. 2 (1994): 117–46. http://dx.doi.org/10.1017/s0960129500000414.

Full text
Abstract:
In this paper we provide a categorical interpretation of the first-order Hoare logic of a small programming language by giving a weakest precondition semantics for the language. To this end, we extend the well-known notion of a (first-order) hyperdoctrine to include partial maps. The most important new aspect of the resulting partial (first-order) hyperdoctrine is a different notion of morphism between the fibres. We also use this partial hyperdoctrine to give a model for Beeson's Partial Function Logic such that (a version of) his axiomatization is complete with respect to this model. This shows the usefulness of the notion, independent of its intended use as a model for Hoare logic.
APA, Harvard, Vancouver, ISO, and other styles
10

Kim, Jinwoo, Loris D'Antoni, and Thomas Reps. "Unrealizability Logic." Proceedings of the ACM on Programming Languages 7, POPL (2023): 659–88. http://dx.doi.org/10.1145/3571216.

Full text
Abstract:
We consider the problem of establishing that a program-synthesis problem is unrealizable (i.e., has no solution in a given search space of programs). Prior work on unrealizability has developed some automatic techniques to establish that a problem is unrealizable; however, these techniques are all black-box , meaning that they conceal the reasoning behind why a synthesis problem is unrealizable. In this paper, we present a Hoare-style reasoning system, called unrealizability logic for establishing that a program-synthesis problem is unrealizable. To the best of our knowledge, unrealizability logic is the first proof system for overapproximating the execution of an infinite set of imperative programs. The logic provides a general, logical system for building checkable proofs about unrealizability. Similar to how Hoare logic distills the fundamental concepts behind algorithms and tools to prove the correctness of programs, unrealizability logic distills into a single logical system the fundamental concepts that were hidden within prior tools capable of establishing that a program-synthesis problem is unrealizable.
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Hoare Logic"

1

Mathiesen, Erik Arne. "Abstract hoare logic." Thesis, Queen Mary, University of London, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.497518.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Liu, Yongmei. "Hoare logic for GOLOG programs." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0027/MQ50349.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

IMPERIAL, JULIANA CARPES. "TECHNIQUES FOR THE USE OF HOARE LOGIC IN PCC." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2003. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=4428@1.

Full text
Abstract:
COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>Atualmente, a maioria dos programas para computadores é obtida através da WEB. Como muitas vezes a procedência são fontes desconhecidas, é preciso se certificar de que o código se comporta como o esperado. A solução ideal seria verificar o código contra uma especificação de políticas de segurança ,contudo, isso pode consumir muito tempo.Uma outra alternativa é fazer com que o próprio código prove ser seguro. O conceito de proof-carryng code (PCC)é baseado nessa idéia : um programa carrega consigo uma prova de sua conformidade com certas políticas de segurança. Ou seja ,ele carrega uma prova a respeito de propriedades do próprio código. Portanto, os mesmos métodos froamsi usados para a verificação de programs podem se utilizados para esta tecnolgia. Considerando este fato,neste trabalho é estudado como cálculo de Hoare, em método formal para realizar a verificação de programas, aplicado a códigos-fonte escritos em uma linguagem de programação imperativa, pode ser útil á tecnica de PCC. Conseqüentemente, são pesquisados métodos para a geração de provas de correção de programas utilizando o método citado, para tornar possível a geração de provas de segurança para PCC utilizando o cálculo de Hoare.<br>Nowdays most computer programs are obtained from the WEB. Since their source is usually unknown, it is necessary to be sure that the code of the program behaves as expected.The ideal solution would be verify the code against a specification of safety policies.However, this can take too much time.Another approach is making the code itself prove that it is safe. The concept os proof-carryng code (PCC) is based on this idea: a program carries a proof of its conformity with certain safety policies. That is , it carries a proof cencerning properties related to the code itself. Therefore, the same formal methods employed in formal verification of programs can be used in this tecnology. Due to this fact, in this work it is studied how Hoare logic applied to source codes written in an imperative programming language, which is a formal methods are researched to generate proofs of program correctness using the method explained, so that it can be possible to generate PCC safety programs with Hoare logic.
APA, Harvard, Vancouver, ISO, and other styles
4

Kleymann, Thomas. "Hoare logic and VDM : machine-checked soundness and completeness proofs." Thesis, University of Edinburgh, 1998. http://hdl.handle.net/1842/387.

Full text
Abstract:
Investigating soundness and completeness of verification calculi for imperative programming languages is a challenging task. Many incorrect results have been published in the past. We take advantage of the computer-aided proof tool LEGO to interactively establish soundness and completeness of both Hoare Logic and the operation decomposition rules of the Vienna Development Method (VDM) with respect to operational semantics. We deal with parameterless recursive procedures and local variables in the context of total correctness. As a case study, we use LEGO to verify the correctness of Quicksort in Hoare Logic. As our main contribution, we illuminate the rôle of auxiliary variables in Hoare Logic. They are required to relate the value of program variables in the final state with the value of program variables in the initial state. In our formalisation, we reflect their purpose by interpreting assertions as relations on states and a domain of auxiliary variables. Furthermore, we propose a new structural rule for adjusting auxiliary variables when strengthening preconditions and weakening postconditions. This rule is stronger than all previously suggested structural rules, including rules of adaptation. With the new treatment, we are able to show that, contrary to common belief, Hoare Logic subsumes VDM in that every derivation in VDM can be naturally embedded in Hoare Logic. Moreover, we establish completeness results uniformly as corollaries of Most General Formula theorems which remove the need to reason about arbitrary assertions.
APA, Harvard, Vancouver, ISO, and other styles
5

Brenas, Jon Haël. "Hoare-like verification of graph transformation." Thesis, Université Grenoble Alpes (ComUE), 2016. http://www.theses.fr/2016GREAM066/document.

Full text
Abstract:
En informatique comme dans de multiples autres domaines, les graphes peuvent être trouvés partout. Ils sont utilisés pour représenter des données dans des domaines allant de la chimie à l'architecture, en tant que structures abstraites ou que modèles des données et de leurs évolutions. Dans tous ces domaines, il est prévisible que les graphes évoluent au cours du temps suite à des réactions chimiques, une mise à jour des connaissance ou l'exécution d'un programme. Être capable de traiter ces transformations est une tâche particulièrement importante et difficile. Dans ce travail, notre objectif est d'étudier la vérification de telles transformations de graphes, c'est à dire comment prouver qu'une transformation de graphes est correcte. La correction d'une transformation est plus précisément définie comme la correction d'une spécification pour cette transformation contenant en plus une précondition et une postcondition. Nous avons décidé d'utiliser un calcul à la Hoare générant une plus faible précondition pour une postcondition et une transformation. Si cette plus faible précondition est impliquée par la précondition, la spécification est correcte. Nous avons choisi une approche plus algorithmique pour les transformation de graphes utilisant des actions atomiques. Nous définissons deux moyens de construire des transformations de graphes: en utilisant un langage impératif ou en utilisant des systèmes de règles de réécriture. Le principal ingrédient est la logique qui est choisie pour représenter la précondition, la postcondition et les possibles conditions internes. Pour que la logique puisse interagir avec le calcul, nous demandons que le problème de décision soit décidable, qu'elle soit fermée par substitutions et qu'elle soit capable d'exprimer l'existence ou l'absence d'un sous-graphe affecté par la transformation. Le résultat central de ce travail est l'identification et l'explication de ces conditions<br>In computer science as well as multiple other fields, graphs have become ubiquitous. They are used to represent data in domains ranging from chemistry to architecture, as abstract structures or as models of the data or its evolution. In all these domains, graphs are expected to evolve over time due to chemical reactions, update of the knowledge or programs. Being able to deal with such transformations is an extremely important and difficult task. In this work, our aim is to study the verification of such graph transformation, that is how to prove that a graph transformation is correct. Correctness of a graph transformation is more precisely defines as correctness of a specification for the transformation containing additionally a precondition and a postcondition. We decided to use a Hoare-like calculus generating the weakest precondition for a postcondition and a transformation. If this weakest precondition is implied by the actual precondition, the specification is correct. We chose a more algorithmic approach to graph transformation by using atomic actions.We chose to define two ways to build graph transformations: using an imperative programming language and using rule-base rewriting systems. The main ingredient of the verification of graph transformation is the logic that is chosen to represent the precondition, the postcondition and the possible conditions internal to the transformation. So that the logic can interact with the calculus, we require that the decision problem be decidable, that the logic be closed under the substitutions introduced by the Hoare-like calculus and that it has to be able to express the existence and absence of a match for the transformation. The core result of this work is the identification and explanation of these conditions
APA, Harvard, Vancouver, ISO, and other styles
6

Oheimb, David von. "Analyzing Java in Isabelle-HOL formalization, type safety and Hoare logic /." [S.l. : s.n.], 2001. http://deposit.ddb.de/cgi-bin/dokserv?idn=962067091.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Magill, Stephen. "Instrumentation Analysis: An Automated Method for Producing Numeric Abstractions of Heap-Manipulating Programs." Research Showcase @ CMU, 2010. http://repository.cmu.edu/dissertations/73.

Full text
Abstract:
A number of questions regarding programs involving heap-based data structures can be phrased as questions about numeric properties of those structures. A data structure traversal might terminate if the length of some path is eventually zero or a function to remove n elements from a collection may only be safe if the collection has size at least n. In this thesis, we develop proof methods for reasoning about the connection between heap-manipulating programs and numeric programs. In addition, we develop an automatic method for producing numeric abstractions of heap-manipulating programs. These numeric abstractions are expressed as simple imperative programs over integer variables and have the feature that if a property holds of the numeric program, then it also holds of the original, heap-manipulating program. This is true for both safety and liveness. The abstraction procedure makes use of a shape analysis based on separation logic and has support for user-defined inductive data structures. We also discuss a number of applications of this technique. Numeric abstractions, once obtained, can be analyzed with a variety of existing verification tools. Termination provers can be used to reason about termination of the numeric abstraction, and thus termination of the original program. Safety checkers can be used to reason about assertion safety. And bound inference tools can be used to obtain bounds on the values of program variables. With small changes to the program source, bounds analysis also allows the computation of symbolic bounds on memory use and computational complexity.
APA, Harvard, Vancouver, ISO, and other styles
8

Davy, Guillaume. "Génération de codes et d'annotations prouvables d'algorithmes de points intérieurs à destination de systèmes embarqués critiques." Thesis, Toulouse, ISAE, 2018. http://www.theses.fr/2018ESAE0034/document.

Full text
Abstract:
Dans l'industrie, l'utilisation de l'optimisation est omniprésente. Elle consiste à calculer la meilleure solution tout en satisfaisant un certain nombre de contraintes. Cependant, ce calcul est complexe, long et pas toujours fiable. C'est pourquoi cette tâche est longtemps restée cantonnée aux étapes de conception, ce qui laissait le temps de faire les calculs puis de vérifier que la solution était correcte et si besoin refaire les calculs. Ces dernières années, grâce à la puissance toujours grandissante des ordinateurs, l'industrie a commencé à intégrer des calculs d'optimisation au cœur des systèmes. C'est-à-dire que des calculs d'optimisation sont effectués en permanence au sein du système, parfois des dizaines de fois par seconde. Par conséquent, il est impossible de s'assurer a posteriori de la correction d'une solution ou de relancer un calcul. C'est pourquoi il est primordial de vérifier que le programme d'optimisation est parfaitement correct et exempt de bogue.L'objectif de cette thèse a été de développer outils et méthodes pour répondre à ce besoin.Pour ce faire, nous avons utilisé la théorie de la preuve formelle qui consiste à considérer un programme comme un objet mathématique. Cet objet prend des informations en entrée et produit un résultat. On peut alors, sous certaines conditions sur les entrées, prouver que le résultat satisfait nos exigences. Notre travail a consisté à choisir un programme d'optimisation puis à prouver formellement que le résultat de ce programme est correct<br>In the industry, the use of optimization is ubiquitous. Optimization consists of calculating the best solution subject to a number of constraints. However, this calculation is complex,long and not always reliable. This is why this task has long been confined to the design stages,which allowed time to do the computation and then check that the solution is correct and if necessary redo the computation. In recent years, thanks to the ever-increasing power of computers, the industry has begun to integrate optimization computation at the heart of the systems. That is to say that optimization computation is carried out continuously within the system, sometimes dozens of times per second. Therefore, it is impossible to check a posteriori the solution or restart a calculation. That is why it is important to check that the program optimization is perfectly correct and bug-free. The objective of this thesis was to develop tools and methods to meet this need. To do this we have used the theory of formal proof that is to consider a program as a mathematical object. This object takes input data and produces a result. We can then, under certain conditions on the inputs, prove that the result meets our requirements. Our job was to choose an optimization program and formally prove that the result of this program is correct
APA, Harvard, Vancouver, ISO, and other styles
9

Tan, Jiaqi. "Prescriptive Safety-Checks through Automated Proofs for Control-Flow Integrity." Research Showcase @ CMU, 2016. http://repository.cmu.edu/dissertations/715.

Full text
Abstract:
Embedded software today is pervasive: they can be found everywhere, from coffee makers and medical devices, to cars and aircraft. Embedded software today is also open and connected to the Internet, exposing them to external attacks that can cause its Control-Flow Integrity (CFI) to be violated. Control-Flow Integrity is an important safety property of software, which ensures that the behavior of the software is not inadvertently changed. The violation of CFI in software can cause unintended behaviors, and can even lead to catastrophic incidents in safety-critical systems. This dissertation develops a two-part approach for CFI: (i) prescribing source-code safetychecks, that prevent the root-causes of CFI, that programmers can insert themselves, and (ii) formally proving CFI for the machine-code of programs with source-code safety-checks. First, our prescribed safety-checks, when applied, prevent the root-causes of CFI, thereby enabling software to recover from CFI violations in a customizable way. In addition, our prescribed safety-checks are visible to programmers, empowering them to ensure that the behavior of their software is not inadvertently changed by the prescribed safety-checks. However, programmer-inserted safety-checks may be incomplete. Thus, current techniques for proving CFI, which assume that safety-checks are complete, may not work. Second, this dissertation develops a logic approach that automates formal proofs of CFI for the machine-code of software containing both source-code CFI safety-checks and system calls. We extend an existing trustworthy Hoare logic with new proof rules, proof tactics, and a novel proof-search algorithm, which exploit the principle of local reasoning for safety properties to automatically generate CFI proofs for the machine-code of programs compiled with our prescribed source-code safety-checks. To the best of our knowledge, our approach to CFI is the first to combine programmer-visible source-code enforcement mechanisms for CFI–enabling programmers to customize them and observe that their software is not inadvertently changed–with machine-code proofs of CFI that can be automated, and that does not require a trusted or verified compiler to ensure its proven properties hold in machine-code. We evaluate our CFI approach on realistic embedded software. We evaluate our approach on the MiBench and WCET benchmarks, implementations of common file utilities, and programs interfacing with hardware inputs and outputs on the Raspberry Pi single-board-computer. The variety of our target programs, and our ability to support useful features such as file and hardware inputs and outputs, demonstrate the wide applicability of our approach.
APA, Harvard, Vancouver, ISO, and other styles
10

Behaegel, Jonathan. "Modèles hybrides de réseaux de régulation : étude du couplage des cycles cellulaire et circadien." Thesis, Université Côte d'Azur (ComUE), 2018. http://www.theses.fr/2018AZUR4071/document.

Full text
Abstract:
La modélisation de systèmes biologiques est devenue indispensable pour comprendre les phénomènes complexes et émergents issus d'influences partiellement connues, et pour envisager de contrôler un système altéré dans le but de restaurer un comportement physiologique. Tout modèle, quel que soit son paradigme sous-jacent, fait intervenir des paramètres gouvernant sa dynamique mais les mesures expérimentales ne permettent généralement pas de les identifier et cela reste l'un des problèmes majeurs de la modélisation. Cette thèse propose une méthode automatique d'identification des paramètres dynamiques de systèmes biologiques dans un cadre de modélisation hybride. Le cadre hybride choisi découpe l'espace des phases selon l'activité des entités biologiques, et associe à chacun de ces sous-espaces une vitesse d'évolution de chacun des composants. Nous proposons une logique de Hoare en temps continu ainsi qu'un calcul de plus faible précondition qui, à partir d'observations expérimentales qualitatives et chronométriques, construit les contraintes minimales sur les paramètres du modèle pour qu’il soit compatible avec les observations. Ce calcul mène à un problème de satisfaction de contraintes sur les réels et nous montrons que celui-ci peut être résolu par le solveur AbSolute.Le prototype Holmes BioNet développé au cours de cette thèse peut non seulement automatiser le processus d'identification des valeurs des paramètres à partir des observations expérimentales, mais aussi simuler l'évolution du modèle obtenu afin de le comparer avec les traces expérimentales. Nous utilisons ce prototype pour modéliser le couplage des cycles cellulaire et circadien<br>Modelling biological systems has become instrumental to understand complex and emerging phenomena resulting from partially known influences, and to consider controlling an altered system in order to restore a physiological behaviour. Any model, independent of the underlying paradigm, involves parameters governing its dynamics. However, experimental measurements generally do not allow their identification and this remains one of the major problems of modelling. This PhD proposes an automatic method for identifying the dynamic parameters of biological systems in a hybrid modelling framework. The chosen hybrid framework splits the phase space according to the activity of the biological entities, and associates to each of these subspaces a celerity for each of the components. We introduce a continuous time Hoare logic as well as its weakest precondition calculus which, from qualitative and chronometrical experimental observations, constructs the minimum constraints on the model parameters making it compatible with the observations. This calculus leads to a Constraint Satisfaction Problem on real numbers and we show that it can be solved by the AbSolute solver.The Holmes BioNet prototype developed during this PhD can not only automate the parameter identification process from experimental data, but also simulate the evolution of the obtained model in order to compare it with experimental traces. We use this prototype to model the coupling of the cellular and circadian cycles
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Hoare Logic"

1

Liu, Yongmei. Hoare logic for GOLOG programs. University of Toronto, Dept. of Computer Science, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Broy, Manfred. Logic of Programming and Calculi of Discrete Design: International Summer School directed by F.L. Bauer, M. Broy, E.W. Dijkstra, C.A.R. Hoare. Springer Berlin Heidelberg, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Dijkstra, Edsger Wybe. Logic of Programming and Calculi of Discrete Design: International Summer School Directed by F. L. Bauer, M. Broy, E. W. Dijkstra, C. A. R. Hoare. Springer, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Hoare Logic"

1

Nipkow, Tobias, and Gerwin Klein. "Hoare Logic." In Concrete Semantics. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-10542-0_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Monin, Jean-François, and Michael G. Hinchey. "Hoare Logic." In Understanding Formal Methods. Springer London, 2003. http://dx.doi.org/10.1007/978-1-4471-0043-0_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Almeida, José Bacelar, Maria João Frade, Jorge Sousa Pinto, and Simão Melo de Sousa. "Hoare Logic." In Rigorous Software Development. Springer London, 2011. http://dx.doi.org/10.1007/978-0-85729-018-2_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

de Vries, Edsko, and Vasileios Koutavas. "Reverse Hoare Logic." In Software Engineering and Formal Methods. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24690-6_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bloom, Stephen L., and Zoltán Ésik. "Floyd-Hoare Logic." In Iteration Theories. Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/978-3-642-78034-9_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Zhan, Naijun, Shuling Wang, and Hengjun Zhao. "Hybrid Hoare Logic." In Formal Verification of Simulink/Stateflow Diagrams. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-47016-0_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Martin, Ursula, Erik A. Mathiesen, and Paulo Oliva. "Hoare Logic in the Abstract." In Computer Science Logic. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11874683_33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Franssen, Michael. "Hoare Logic with Explicit Contexts." In Applied Logic Series. Springer Netherlands, 2003. http://dx.doi.org/10.1007/978-94-017-0253-9_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Roşu, Grigore, and Andrei Ştefănescu. "From Hoare Logic to Matching Logic Reachability." In FM 2012: Formal Methods. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32759-9_32.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Shankar, Natarajan. "Formalizing Hoare Logic in PVS." In Engineering Trustworthy Software Systems. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-02928-9_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Hoare Logic"

1

Zhou, Li, Nengkun Yu, and Mingsheng Ying. "An applied quantum Hoare logic." In PLDI '19: 40th ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM, 2019. http://dx.doi.org/10.1145/3314221.3314584.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Barthe, Gilles, Marco Gaboardi, Emilio Jesus Gallego Arias, Justin Hsu, Cesar Kunz, and Pierre-Yves Strub. "Proving Differential Privacy in Hoare Logic." In 2014 IEEE 27th Computer Security Foundations Symposium (CSF). IEEE, 2014. http://dx.doi.org/10.1109/csf.2014.36.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Unruh, Dominique. "Quantum Hoare Logic with Ghost Variables." In 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2019. http://dx.doi.org/10.1109/lics.2019.8785779.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Luo, Chenguang, Shengchao Qin, and Zongyan Qiu. "Verifying BPEL-Like Programs with Hoare Logic." In 2008 2nd IEEE/IFIP International Symposium on Theoretical Aspects of Software Engineering (TASE). IEEE, 2008. http://dx.doi.org/10.1109/tase.2008.41.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Chen, Zilin. "A Hoare logic style refinement types formalisation." In TyDe '22: 7th ACM SIGPLAN International Workshop on Type-Driven Development. ACM, 2022. http://dx.doi.org/10.1145/3546196.3550162.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Nagasamudram, Ramana, and David A. Naumann. "Alignment Completeness for Relational Hoare Logics." In 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2021. http://dx.doi.org/10.1109/lics52264.2021.9470690.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Qiao, Rui, Jinzhao Wu, and Xinyan Gao. "Probabilistic Modal Kleene Algebra and Hoare-Style Logic." In 2008 Fourth International Conference on Natural Computation. IEEE, 2008. http://dx.doi.org/10.1109/icnc.2008.174.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Sousa, Marcelo, and Isil Dillig. "Cartesian hoare logic for verifying k-safety properties." In PLDI '16: ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM, 2016. http://dx.doi.org/10.1145/2908080.2908092.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Zou, Liang, Naijun Zhany, Shuling Wang, Martin Franzle, and Shengchao Qin. "Verifying Simulink diagrams via a Hybrid Hoare Logic Prover." In 2013 International  Conference on Embedded  Software (EMSOFT). IEEE, 2013. http://dx.doi.org/10.1109/emsoft.2013.6658587.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Arusoaie, Andrei. "Engineering Hoare Logic-Based Program Verification in K Framework." In 2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). IEEE, 2013. http://dx.doi.org/10.1109/synasc.2013.31.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Hoare Logic"

1

Hamid, Nadeem A., and Zhong Shao. Interfacing Hoare Logic and Type Systems for Foundational Proof-Carrying Code. Defense Technical Information Center, 2005. http://dx.doi.org/10.21236/ada436479.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography