Log in

Relevant bibliographies by topics / Hoare Order

Contents

Journal articles
Dissertations / Theses
Book chapters
Conference papers

Academic literature on the topic 'Hoare Order'

Author: Grafiati

Published: 4 June 2021

Last updated: 15 February 2022

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 Order.'

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 Order"

1

NANEVSKI, ALEKSANDAR, GREG MORRISETT, and LARS BIRKEDAL. "Hoare type theory, polymorphism and separation." Journal of Functional Programming 18, no. 5-6 (2008): 865–911. http://dx.doi.org/10.1017/s0956796808006953.

Full text

Abstract:

AbstractWe consider the problem of reconciling a dependently typed functional language with imperative features such as mutable higher-order state, pointer aliasing, and nontermination. We propose Hoare type theory (HTT), which incorporates Hoare-style specifications into types, making it possible to statically track and enforce correct use of side effects.The main feature of HTT is the Hoare type {P}x:A{Q} specifying computations with preconditionPand postconditionQthat return a result of typeA. Hoare types can be nested, combined with other types, and abstracted, leading to a smooth integration with higher-order functions and type polymorphism.We further show that in the presence of type polymorphism, it becomes possible to interpret the Hoare types in the “small footprint” manner, as advocated by separation logic, whereby specifications tightly describe the state required by the computation.We establish that HTT is sound and compositional, in the sense that separate verifications of individual program components suffice to ensure the correctness of the composite program.

APA, Harvard, Vancouver, ISO, and other styles

2

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

3

Jaszczak, Adrian. "General Theory and Tools for Proving Algorithms in Nominative Data Systems." Formalized Mathematics 28, no. 4 (2020): 269–78. http://dx.doi.org/10.2478/forma-2020-0024.

Full text

Abstract:

Summary In this paper we introduce some new definitions for sequences of operations and extract general theorems about properties of iterative algorithms encoded in nominative data language [20] in the Mizar system [3], [1] in order to simplify the process of proving algorithms in the future. This paper continues verification of algorithms [10], [13], [12], [14] written in terms of simple-named complex-valued nominative data [6], [8], [18], [11], [15], [16]. The validity of the algorithm is presented in terms of semantic Floyd-Hoare triples over such data [9]. Proofs of the correctness are based on an inference system for an extended Floyd-Hoare logic [2], [4] with partial pre- and postconditions [17], [19], [7], [5].

APA, Harvard, Vancouver, ISO, and other styles

4

BORGSTRÖM, JOHANNES, ANDREW D. GORDON, and RICCARDO PUCELLA. "Roles, stacks, histories: A triple for Hoare." Journal of Functional Programming 21, no. 2 (2010): 159–207. http://dx.doi.org/10.1017/s0956796810000134.

Full text

Abstract:

AbstractBehavioral type and effect systems regulate properties such as adherence to object and communication protocols, dynamic security policies, avoidance of race conditions, and many others. Typically, each system is based on some specific syntax of constraints, and is checked with anad hocsolver. Instead, we advocate types refined with first-order logic formulas as a basis for behavioral type systems, and general purpose automated theorem provers as an effective means of checking programs. To illustrate this approach, we define a triple of security-related type systems: for role-based access control, for stack inspection, and for history-based access control. The three are all instances of a refined state monad. Our semantics allows a precise comparison of the similarities and differences of these mechanisms. In our examples, the benefit of behavioral type-checking is to rule out the possibility of unexpected security exceptions, a common problem with code-based access control.

APA, Harvard, Vancouver, ISO, and other styles

5

DEN HARTOG, J. I., and E. P. DE VINK. "VERIFYING PROBABILISTIC PROGRAMS USING A HOARE LIKE LOGIC." International Journal of Foundations of Computer Science 13, no. 03 (2002): 315–40. http://dx.doi.org/10.1142/s012905410200114x.

Full text

Abstract:

Probability, be it inherent or explicitly introduced, has become an important issue in the verification of programs. In this paper we study a formalism which allows reasoning about programs which can act probabilistically. To describe probabilistic programs, a basic programming language with an operator for probabilistic choice is introduced and a denotational semantics is given for this language. To specify propertics of probabilistic programs, standard first order logic predicates are insufficient, so a notion of probabilistic predicates is introduced. A Hoare-style proof system to check properties of probabilistic programs is given. The proof system for a sublanguage is shown to be sound and complete; the properties that can be derived are exactly the valid properties. Finally some typical examples illustrate the use of the probabilistic predicates and the proof system.

APA, Harvard, Vancouver, ISO, and other styles

6

Turon, Aaron, Derek Dreyer, and Lars Birkedal. "Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency." ACM SIGPLAN Notices 48, no. 9 (2013): 377–90. http://dx.doi.org/10.1145/2544174.2500600.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Lyons, W. B., S. W. Tyler, R. A. Wharton, D. M. McKnight, and B. H. Vaughn. "A Late Holocene desiccation of Lake Hoare and Lake Fryxell, McMurdo Dry Valleys, Antarctica." Antarctic Science 10, no. 3 (1998): 247–56. http://dx.doi.org/10.1017/s0954102098000340.

Full text

Abstract:

Stable isotope data from waters of lakes in the McMurdo Dry Valleys (MDV) of southern Victoria Land, Antarctica are presented in order to establish the climatic history of this region over the past two millennia. New data from Lake Fryxell and Lake Hoare in Toylor Valley, along with previously published data from Lake Vanda, Wright Valley and Lake Bonney, Taylor Valley are used to infer the recent climatic history of MDV. Lakes Vanda, Fryxell and Bonney appear to have lost their ice covers and evaporated to small, hypersaline ponds by 1000 to ~1200 yr BP. Lake Hoare either desiccated or did not exist prior to 1200 yr BP. These data indicate a major lowering of lake level prior to ~1000 yr BP, followed by a warmer and/or more humid climate since then.

APA, Harvard, Vancouver, ISO, and other styles

8

Neumann, Klaus, W. Berry Lyons, and David J. Des Marais. "Inorganic carbon-isotope distribution and budget in the Lake Hoare and Lake Fryxell basins, Taylor Valley, Antarctica." Annals of Glaciology 27 (1998): 685–89. http://dx.doi.org/10.3189/1998aog27-1-685-689.

Full text

Abstract:

One of the unusual features of Lakes Fryxell and Hnare in Taylor Valley, southern Victoria Land, Antarctica, is their perennial ice cover. This ice cover limits gas exchange between the atmosphere and the lake water, and causesa very stable stratification of the lakes. We analyzed a series of water samples from profiles of these lakes and their tributaries for δ13C of the dissolved inorganic carbon (DIC) in order to qualify the carbon flux from the streams into the lakes, and to investigate the carbon cycling with in the lakes. Isotopic values in the uppermost waters (δ13C = +l.3‰ to 5.3‰ in Lake Hoare, +0.4‰ to +3.0‰ in Lake Fryxell) are close to the carbon-isotope values encountered in the streams feeding Lake Fryxell, but distinctively heavier than in streams feeding Lake Hoare (δ13C= — 2.3%n to 1.4%). These ratios are much heavier than ratios found in the moat that forms around the lakes injanuary February (δC = -10.1%). in the oxic photic zones of the lakes, photosynthesis clearly influences the isotopic composition, with layers of high productivity having enriched carbon-isotope signatures δ13C= +2.7‰ to +6.1‰). in both lakes, the isotopic values become lighter with depth, reaching minima of 3.2‰ and 4.0% in Lakes Fryxell and Hoare, respectively. These minima are caused by the microbial remineralization of isotopically light organic carbon. We present DIC flux calculations that help to interpret the isotopic distribution. For example, in Lake Hoare the higher utilization of CO2aq, and a substantially smaller inflow of CO2 from streams cause the heavier observed isotopic ratios. Differences in the hydrology and stream morphologies of the tributaries also greatly influence the carbon budgets of the basins.

APA, Harvard, Vancouver, ISO, and other styles

9

Levy, Joseph S., Andrew G. Fountain, Michael N. Gooseff, et al. "Water track modification of soil ecosystems in the Lake Hoare basin, Taylor Valley, Antarctica." Antarctic Science 26, no. 2 (2013): 153–62. http://dx.doi.org/10.1017/s095410201300045x.

Full text

Abstract:

AbstractWater tracks are zones of high soil moisture that route shallow groundwater down-slope, through the active layer and above the ice table. A water track in Taylor Valley, McMurdo Dry Valleys, was analysed for surface hydrogeological, geochemical, and biological characteristics in order to test the hypothesis that water tracks provide spatial structure to Antarctic soil ecosystems by changing the physical conditions in the soil environment within the water tracks from those outside the water tracks. The presence of the water track significantly affected the distribution of biotic and abiotic ecosystem parameters: increasing soil moisture, soil salinity, and soil organic matter within the water track relative to soils outside the water track, and reducing soil phosphate, soil pH, and the population of nematodes and other invertebrates in water track soils relative to off track soils. These results suggest that water tracks are distinct and extreme ecological zones in Taylor Valley that provide long-range (kilometre to multi- kilometre) structure to Antarctic hillslope ecosystems through physical control on soil moisture and solute content. Contrary to expectations, these high soil-moisture sites are not hotspots for faunal biological activity because high soil salinity makes them suitable habitats for only the most halo-tolerant organisms.

APA, Harvard, Vancouver, ISO, and other styles

10

YANG, XIAOXIAO, ZHENHUA DUAN, and QIAN MA. "Axiomatic semantics of projection temporal logic programs." Mathematical Structures in Computer Science 20, no. 5 (2010): 865–914. http://dx.doi.org/10.1017/s0960129510000241.

Full text

Abstract:

In this paper, we investigate the axiomatic semantics of the projection temporal logic programming language MSVL. To this end, we employ Propositional Projection Temporal Logic (PPTL) as an assertion language to specify the desired properties. We give a set of state axioms and state inference rules. In order to deduce a program over an interval, we also formalise a set of rules in terms of a Hoare logic-like triple. These rules enable us to deduce a program into its normal form and from the current state to the next one. They also enable us to verify properties over intervals. In this way, an axiom system for proving the correctness of MSVL programs is established. The axiom system is proved to be sound and relatively complete with respect to an operational model of MSVL, and give an example showing how the axiom system works. Finally, we employ a recently developed prototype verifier based on PVS as an example of semi-automatic verification using MSVL.

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Hoare Order"

1

Punnam, Pradeep Kumar. "RELATIONAL MODEL FOR PROGRAM SEMANTICS." Kent State University / OhioLINK, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=kent1226606883.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

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.

Full text

Abstract:

Formal verification of programs can be done with the aid of an interactive theorem prover. The program to be verified is represented in an intermediate language representation inside the interactive theorem prover, after which statements and their proofs can be constructed. This is a process that can be automated to a high degree. This thesis presents a proof procedure to efficiently generate a theorem stating the weakest precondition for a program to terminate successfully in a state upon which a certain postcondition is placed. Specifically, the Poly/ML implementation of the SML metalanguage is used to generate a theorem in the HOL4 interactive theorem prover regarding the properties of a program written in BIR, an abstract intermediate representation of machine code used in the PROSPER project.<br>Bevis 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.

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Hoare Order"

1

Reus, Bernhard, and Thomas Streicher. "About Hoare Logics for Higher-Order Store." In Automata, Languages and Programming. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11523468_108.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Tiuryn, Jerzy. "Hoare Logic: From First-Order to Propositional Formalism." In Proof and System-Reliability. Springer Netherlands, 2002. http://dx.doi.org/10.1007/978-94-010-0413-8_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Rauch, Christoph, Sergey Goncharov, and Lutz Schröder. "Generic Hoare Logic for Order-Enriched Effects with Exceptions." In Recent Trends in Algebraic Development Techniques. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-72044-9_14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Charlton, Nathaniel. "Hoare Logic for Higher Order Store Using Simple Semantics." In Logic, Language, Information and Computation. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-20920-8_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Schwinghammer, Jan, Lars Birkedal, Bernhard Reus, and Hongseok Yang. "Nested Hoare Triples and Frame Rules for Higher-Order Store." In Computer Science Logic. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04027-6_32.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Hinton, David A. "Adapting to Life Without the Legions." In Gold and Gilt, Pots and Pins. Oxford University Press, 2005. http://dx.doi.org/10.1093/oso/9780199264537.003.0006.

Full text

Abstract:

If gold and silver are a measure of wealth, late Roman Britain was very rich. Hoards of coins, jewellery, and plate buried in the late fourth and early fifth centuries show that their owners’ lifestyle was coming to an end as central imperial authority broke down, troops were withdrawn from the island, villas fell into disuse, and towns lost their markets and trade. Raiders threatened by land and sea: Irish from the west, Pictish from the north, Frisian, Saxon, and others from the east; and as civic order broke down, the likelihood of robbery by people living south of Hadrian’s Wall grew worse. The hoards’ owners were right to worry, and their subsequent failure to retrieve their valuables must testify to many personal catastrophes. Hoards containing dishes, bowls, and spoons as well as coins and jewellery have been found on the east side of Roman Britain from Canterbury, Kent, in the south to Whorlton, Yorkshire, in the north. Further west, coin-hoards are quite plentiful, although none has any plate. Some contain jewellery, like one found in 1843 at Amesbury, Wiltshire, that included three silver finger-rings; in the same area, another hoard with eight gold coins and one of silver was found in 1990, apparently concealed in a pot around the year 405, to judge from the date of the latest coin. But as with plate so with jewellery, the contrast with the east is still considerable; Thetford, Norfolk, has gold finger-rings as well as ornamental chains, bracelets, and a buckle; Hoxne, Suffolk, has gold bracelets, and again chains, these with elaborate mounts. Some of the craftsmanship shown in these pieces is of a high order, that only well-off patrons could have afforded. The plate suggests displays of tableware by a society that set great store on being able to offer lavish feasts and entertainment. These late Roman treasures may be giving a slightly false impression of Britain’s prosperity. Silver was probably extracted from the same native deposits that yielded lead, so would have been more available than in most parts of the Empire. Some may also have entered Britain from Ireland, where evidence of Roman intervention is accumulating.

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Hoare Order"

1

Goncharov, Sergey, and Lutz Schroder. "A Relatively Complete Generic Hoare Logic for Order-Enriched Effects." In 2013 Twenty-Eighth Annual IEEE/ACM Symposium on Logic in Computer Science (LICS 2013). IEEE, 2013. http://dx.doi.org/10.1109/lics.2013.33.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Turon, Aaron, Derek Dreyer, and Lars Birkedal. "Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency." In ICFP'13: ACM SIGPLAN International Conference on Functional Programming. ACM, 2013. http://dx.doi.org/10.1145/2500365.2500600.

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!