Relevant bibliographies by topics / Conditional correctness

Contents

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

Academic literature on the topic 'Conditional correctness'

Author: Grafiati
Published: 7 June 2025
Last updated: 16 July 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 'Conditional correctness.'

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 "Conditional correctness"

1

Hasanoglu, Kaplan. "Against the conditional correctness of scepticism." South African Journal of Philosophy 35, no. 1 (2016): 82–91. http://dx.doi.org/10.1080/02580136.2015.1128241.

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

SRIVASTAVA, JAIDEEP, JAU-HWANG WANG, KUO WEI HWANG, and WEI TEK TSAI. "A TRANSACTION MODEL FOR PARALLEL RULE EXECUTION PART I: MODEL AND ALGORITHMS." International Journal on Artificial Intelligence Tools 02, no. 03 (1993): 395–429. http://dx.doi.org/10.1142/s0218213093000205.

Full text
Abstract:
This paper introduces a transaction model for parallel production systems, where rules can be fired in a completely asynchronous parallel manner. A model is developed to describe two properties of a serial production system execution, namely, conditional dependence (a rule firing removes another from the conflict set) and prioritization (by the conflict resolution mechanism). These are used as the basis to define the correctness criteria for parallel production execution, namely, conditional serializability, prioritized serializability, and prioritized conditional serializability. A graph model is used to represent production system execution which provides a means of expressing correctness as graph acyclicity, which in turn is used as a basis to develop practical schedulers that manage the concurrent asynchronous production execution and ensure correctness. Two practical schedulers, namely, conditional strict two-phase locking and priority queue scheduler are developed for conditional serializability and prioritized serializability, respectively. They are combined for prioritized conditional serializability.
APA, Harvard, Vancouver, ISO, and other styles
3

Fayazov, K. S., and Y. K. Khudayberganov. "Nonlocal boundary value problem for a nonhomogeneous parabolic type equation with two degenerate lines." Uzbek Mathematical Journal 68, no. 3 (2024): 53–65. http://dx.doi.org/10.29229/uzmj.2024-3-6.

Full text
Abstract:
This work is devoted to the study of the conditional correctness of the nonlocal boundary value problem for a nonhomogeneous parabolic type equation with two degenerate lines. In this article we investigated well-posed of the problem depending of coefficients in conditions for a problem. In the case of ill-posed, based on the idea of A.N. Tikhonov, the conditional correctness of the problem are proved, namely, the theorems of uniqueness and conditional stability on the set of correctness are proved. For all cases we get a priori estimate of the solution we used the logarithmic convexity method and the results of the spectral problem considered by S.G. Pyatkov
APA, Harvard, Vancouver, ISO, and other styles
4

Xudong Luo and Chengqi Zhang. "Proof of the correctness of EMYCIN sequential propagation under conditional independence assumptions." IEEE Transactions on Knowledge and Data Engineering 11, no. 2 (1999): 355–59. http://dx.doi.org/10.1109/69.761668.

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

Fayazov, K. S., and I. O. Khazhiev. "Conditional correctness of boundary-value problem for a composite fourth-order differential equation." Russian Mathematics 59, no. 4 (2015): 54–62. http://dx.doi.org/10.3103/s1066369x15040088.

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

Valiña, Mª Dolores, Gloria Seoane, Mª José Ferraces, and Montserrat Martín. "The Importance of Pragmatic Aspects in Conditional Reasoning." Spanish Journal of Psychology 2 (May 1999): 20–31. http://dx.doi.org/10.1017/s1138741600005424.

Full text
Abstract:
The importance of pragmatic aspects in conditional reasoning was assessed in the performance of 54 subjects (26 female and 28 male; mean age 17.6 years) on 48 conditional inference problems, using a 3 × 2 × 4 design, with repeated measurements. The independent variables were probability of empirical frequency in the real world, type of conditional rule, and scenario availability. Number of correct responses and subjects' certainty about the correctness of their responses were the dependent variables. The results showed: a) the scenario availability is not sufficient in itself to explain differences in performance, but it does affect the subjects' degree of confidence in their conclusions; b) there is an interaction between probability of empirical frequency in the real world and type of conditional rule on correct performance. The results were contrasted with the predictions made by the mental models theory and its revised version proposed by Evans (1993). These findings support the semantic theories of conditional reasoning.
APA, Harvard, Vancouver, ISO, and other styles
7

TU, PHAN HUY, TRAN CAO SON, and CHITTA BARAL. "Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programming." Theory and Practice of Logic Programming 7, no. 4 (2007): 377–450. http://dx.doi.org/10.1017/s1471068406002948.

Full text
Abstract:
AbstractWe extend the 0-approximation of sensing actions and incomplete information in Son and Baral (2001) to action theories with static causal laws and prove its soundness with respect to the possible world semantics. We also show that the conditional planning problem with respect to this approximation isNP-complete. We then present an answer set programming based conditional planner, called ASCP, that is capable of generating both conformant plans and conditional plans in the presence of sensing actions, incomplete information about the initial state, and static causal laws. We prove the correctness of our implementation and argue that our planner is sound and complete with respect to the proposed approximation. Finally, we present experimental results comparing ASCP to other planners.
APA, Harvard, Vancouver, ISO, and other styles
8

Cheng, Yongkang, Shaoli Huang, Xuelin Chen, Jifeng Ning, and Mingming Gong. "DIDiffGes: Decoupled Semi-Implicit Diffusion Models for Real-time Gesture Generation from Speech." Proceedings of the AAAI Conference on Artificial Intelligence 39, no. 3 (2025): 2464–72. https://doi.org/10.1609/aaai.v39i3.32248.

Full text
Abstract:
Diffusion models have demonstrated remarkable synthesis quality and diversity in generating co-speech gestures. However, the computationally intensive sampling steps associated with diffusion models hinder their practicality in real-world applications. Hence, we present DIDiffGes, for a Decoupled Semi-Implicit Diffusion model-based framework, that can synthesize high-quality, expressive gestures from speech using only a few sampling steps. Our approach leverages Generative Adversarial Networks (GANs) to enable large-step sampling for diffusion model. We decouple gesture data into body and hands distributions and further decompose them into marginal and conditional distributions. GANs model the marginal distribution implicitly, while L2 reconstruction loss learns the conditional distributions exciplictly. This strategy enhances GAN training stability and ensures expressiveness of generated full-body gestures. Our framework also learns to denoise root noise conditioned on local body representation, guaranteeing stability and realism. DIDiffGes can generate gestures from speech with just 10 sampling steps, without compromising quality and expressiveness, reducing the number of sampling steps by a factor of 100 compared to existing methods. Our user study reveals that our method outperforms state-of-the-art approaches in human likeness, appropriateness, and style correctness.
APA, Harvard, Vancouver, ISO, and other styles
9

Li, John M., Amal Ahmed, and Steven Holtzen. "Lilac: A Modal Separation Logic for Conditional Probability." Proceedings of the ACM on Programming Languages 7, PLDI (2023): 148–71. http://dx.doi.org/10.1145/3591226.

Full text
Abstract:
We present Lilac, a separation logic for reasoning about probabilistic programs where separating conjunction captures probabilistic independence. Inspired by an analogy with mutable state where sampling corresponds to dynamic allocation, we show how probability spaces over a fixed, ambient sample space appear to be the natural analogue of heap fragments, and present a new combining operation on them such that probability spaces behave like heaps and measurability of random variables behaves like ownership. This combining operation forms the basis for our model of separation, and produces a logic with many pleasant properties. In particular, Lilac has a frame rule identical to the ordinary one, and naturally accommodates advanced features like continuous random variables and reasoning about quantitative properties of programs. Then we propose a new modality based on disintegration theory for reasoning about conditional probability. We show how the resulting modal logic validates examples from prior work, and give a formal verification of an intricate weighted sampling algorithm whose correctness depends crucially on conditional independence structure.
APA, Harvard, Vancouver, ISO, and other styles
10

Zhang, Huazong, Sumin Yang, Rundong Zhao, and Qiming Liu. "Finite-time flocking with collision-avoiding problem of a modified Cucker-Smale model." Mathematical Biosciences and Engineering 19, no. 10 (2022): 10332–43. http://dx.doi.org/10.3934/mbe.2022483.

Full text
Abstract:
<abstract><p>To achieve collision-avoiding flocking in finite time, a modified Cucker-Smale model with general inter-driving force is proposed. First, it is proved that the system can achieve conditional collision-avoiding flocking in finite time by imposing appropriate restrictions on the initial states. Moreover, a special case of the inter-driving force is demonstrated. Last, the correctness of the results is verified through numerical simulations.</p></abstract>
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Conditional correctness"

1

MANSOURI, NAZANIN. "AUTOMATED CORRECTNESS CONDITION GENERATION FOR FORMAL VERIFICATION OF SYNTHESIZED RTL DESIGNS." University of Cincinnati / OhioLINK, 2001. http://rave.ohiolink.edu/etdc/view?acc_num=ucin982064542.

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

Flick, Nils Erik [Verfasser], Annegret [Akademischer Betreuer] Habel, and Barbara [Akademischer Betreuer] König. "Proving correctness of graph programs relative to recursively nested conditions / Nils Erik Flick ; Annegret Habel, Barbara König." Oldenburg : BIS der Universität Oldenburg, 2016. http://d-nb.info/112248190X/34.

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

Lepine, Samuel. "Une Défense du sentimentalisme : émotions, motivations et valeurs." Thesis, Lyon, 2016. http://www.theses.fr/2016LYSE3075.

Full text
Abstract:
Ce travail propose une présentation et une défense du "sentimentalisme", c’est-à-dire de la théorie philosophique selon laquelle les émotions constituent notre principal accès aux valeurs, et la source de nos jugements évaluatifs. Après avoir brièvement retracé les origines historiques de ce courant (Shaftesbury, Hutcheson, Hume, et Adam Smith), j’examine la littérature psychologique et philosophique actuelle portant sur les émotions. Je propose une définition de la fonction des émotions, en soutenant que ce sont des "attitudes" corporelles et cognitives dotées d’une intentionnalité évaluative. Elles nous permettent ainsi d’apprécier la valeur des objets en fonction de leur pertinence pour nos états motivationnels, tels que nos désirs ou nos sentiments. Je procède ensuite à une analyse des conséquences épistémologiques et métaphysiques que l’on peut dériver de cette thèse. Je montre que les émotions sont susceptibles de jouer un rôle crucial dans notre connaissance des valeurs, en étudiant le débat relatif aux "conditions de correction" des émotions. Je propose de distinguer ici deux caractérisations des conditions de correction qui ne sont généralement pas explicitées dans les débats actuels, que j’appelle la conception "indépendantiste" et la conception "motivationnelle". J’argumente en faveur de la deuxième approche, et je défends la thèse selon laquelle les émotions constituent un accès fiable aux valeurs, lorsqu’elles sont basées sur des motivations qui sont elles-mêmes correctes ou appropriées. Selon cette approche, les valeurs doivent être comprises comme des propriétés réelles et relationnelles. Je m’intéresse enfin plus particulièrement au rôle que les émotions sont susceptibles de jouer dans les jugements moraux. Après avoir écarté les théories innéistes au sujet de la morale, je soutiens que les émotions sont des conditions nécessaires au développement de la moralité<br>This dissertation is both a presentation and a defense of "sentimentalism", the philosophical theory according to which emotions constitute our main access to values, and the source of our evaluative judgments. After considering briefly the historical origins of this philosophical approach (Shaftesbury, Hutcheson, Hume, and Adam Smith), I review the current psychological and philosophical literature about emotions. I define the function of emotions, arguing that they are bodily and cognitive "attitudes" that possess an evaluative intentionality. They allow us to appraise the value of objects according to their relevance for our motivational states, like our desires or sentiments. I proceed then to an analysis of the epistemological and metaphysical consequences that we can draw from this thesis. I show that emotions are likely to play a crucial role in our knowledge of values, focusing on the debate about the "correctness conditions" of emotions. I propose a distinction between two characterizations of correctness conditions, which are generally not explicit in the literature, and which I name the "independence" approach and the "motivational" approach. I argue in favor of the latter and I defend the thesis that emotions constitute a reliable access to values, when they are based on motivations that are themselves correct or appropriate. According to this view, values should be conceived as real and relational properties. Finally, I consider the role which emotions may play in our moral judgments in particular. After having rejected nativist accounts of our moral competence, I claim that emotions are necessary conditions to the development of our moral life
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Conditional correctness"

1

Dillinger, Georges. Le politiquement correct: D'un christianisme calciné à un individualisme déchaîné. Publication G.D., 1998.

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

Stephen, Richer, and Weir Lorna 1952-, eds. Beyond political correctness: Toward the inclusive university. University of Toronto Press, 1995.

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

Borisov, G. Demokratii︠a︡ dli︠a︡ belykh: Svoboda bez ravenstva i bratstva. I︠A︡uza-press, 2010.

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

Anton, Christine. Beyond political correctness: Remapping German sensibilities in the 21st century. Rodopi, 2010.

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

Cohn, Robert Greer. The promise and the snake. Lantern Editions, 2001.

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

Veller, M. Velikii poslednii shans. Izd-vo "AST", 2006.

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

Martin, Martin S. America la răscruce: Un dialog transatlantic. Humanitas, 2017.

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

Kahn, Jean-François. Dernières salves: Supplément au Dictionnaire incorrect et à l'abécédaire mal-pensant. Plon, 2009.

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

Elder, Larry. The ten things you can't say in America. St. Martin's Griffin, 2001.

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

Levchenko, Boris. Criteria for testing hypotheses about uniformity. Application manual. INFRA-M Academic Publishing LLC., 2020. http://dx.doi.org/10.12737/986695.

Full text
Abstract:
The guide discusses the use of statistical criteria focused on the testing of hypotheses about uniformity of laws, which belong to the analyzed sample, of the homogeneous medium (about equality of the mathematical expectations), about the homogeneity of variance (equality of variances of compared samples). The disadvantages and advantages of various criteria are indicated, and the application of criteria in conditions of violation of standard assumptions is considered. Tables containing percentage points and statistical distribution models necessary for the correct application of the criteria are provided.&#x0D; &#x0D; This publication describes a broader set of criteria. Constructed models of marginal distributions of statistics for some sample criteria of law uniformity are proposed. Following the recommendations will ensure the correctness and validity of statistical conclusions when analyzing data. It is intended for specialists who are more or less faced with the issues of statistical data analysis, processing the results of experiments, and using statistical methods to analyze various aspects and trends of the surrounding reality. It will be useful for engineers, researchers, specialists in various fields (doctors, biologists, sociologists, economists, etc.), University teachers, graduate students and students.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Conditional correctness"

1

Parthasarathy, Gaurav, Peter Müller, and Alexander J. Summers. "Formally Validating a Practical Verification Condition Generator." In Computer Aided Verification. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81688-9_33.

Full text
Abstract:
AbstractA program verifier produces reliable results only if both the logic used to justify the program’s correctness is sound, and the implementation of the program verifier is itself correct. Whereas it is common to formally prove soundness of the logic, the implementation of a verifier typically remains unverified. Bugs in verifier implementations may compromise the trustworthiness of successful verification results. Since program verifiers used in practice are complex, evolving software systems, it is generally not feasible to formally verify their implementation.In this paper, we present an alternative approach: we validate successful runs of the widely-used Boogie verifier by producing a certificate which proves correctness of the obtained verification result. Boogie performs a complex series of program translations before ultimately generating a verification condition whose validity should imply the correctness of the input program. We show how to certify three of Boogie’s core transformation phases: the elimination of cyclic control flow paths, the (SSA-like) replacement of assignments by assumptions using fresh variables (passification), and the final generation of verification conditions. Similar translations are employed by other verifiers. Our implementation produces certificates in Isabelle, based on a novel formalisation of the Boogie language.
APA, Harvard, Vancouver, ISO, and other styles
2

Radke, Hendrik. "Correctness of Graph Programs Relative to HR + Conditions." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15928-2_35.

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

Rubner, Andrew. "Peacocke on the Structure of Content and Correctness Conditions." In Logic, Epistemology, and the Unity of Science. Springer International Publishing, 2024. http://dx.doi.org/10.1007/978-3-031-52231-4_23.

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

Homeier, Peter V., and David F. Martin. "Mechanical verification of total correctness through diversion verification conditions." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0055137.

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

Ozdemir, Alex, Riad S. Wahby, Fraser Brown, and Clark Barrett. "Bounded Verification for Finite-Field-Blasting." In Computer Aided Verification. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-37709-9_8.

Full text
Abstract:
AbstractZero Knowledge Proofs (ZKPs) are cryptographic protocols by which a prover convinces a verifier of the truth of a statement without revealing any other information. Typically, statements are expressed in a high-level language and then compiled to a low-level representation on which the ZKP operates. Thus, a bug in a ZKP compiler can compromise the statement that the ZK proof is supposed to establish. This paper takes a step towards ZKP compiler correctness by partially verifying a field-blasting compiler pass, a pass that translates Boolean and bit-vector logic into equivalent operations in a finite field. First, we define correctness for field-blasters and ZKP compilers more generally. Next, we describe the specific field-blaster using a set of encoding rules and define verification conditions for individual rules. Finally, we connect the rules and the correctness definition by showing that if our verification conditions hold, the field-blaster is correct. We have implemented our approach in the CirC ZKP compiler and have proved bounded versions of the corresponding verification conditions. We show that our partially verified field-blaster does not hurt the performance of the compiler or its output; we also report on four bugs uncovered during verification.
APA, Harvard, Vancouver, ISO, and other styles
6

Ambal, Guillaume, Ori Lahav, and Azalea Raad. "Sufficient Conditions for Robustness of RDMA Programs." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-91118-7_3.

Full text
Abstract:
Abstract Remote Direct Memory Access (RDMA) is a modern technology enabling high-performance inter-node communication. Despite its widespread adoption, theoretical understanding of permissible behaviours remains limited, as RDMA follows a very weak memory model. This paper addresses the challenge of establishing sufficient conditions for RDMA robustness. We introduce a set of straightforward criteria that, when met, guarantee sequential consistency and mitigate potential issues arising from weak memory behaviours in RDMA applications. Notably, when restricted to a tree topology, these conditions become even more relaxed, significantly reducing the need for synchronisation primitives. This work provides developers with practical guidelines to ensure the reliability and correctness of their RDMA-based systems.
APA, Harvard, Vancouver, ISO, and other styles
7

Liu, Mingyang, Fu Song, and Taolue Chen. "Automated Verification of Correctness for Masked Arithmetic Programs." In Computer Aided Verification. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-37709-9_13.

Full text
Abstract:
AbstractMasking is a widely-used effective countermeasure against power side-channel attacks for implementing cryptographic algorithms. Surprisingly, few formal verification techniques have addressed a fundamental question, i.e., whether the masked program and the original (unmasked) cryptographic algorithm are functional equivalent. In this paper, we study this problem for masked arithmetic programs over Galois fields of characteristic 2. We propose an automated approach based on term rewriting, aided by random testing and SMT solving. The overall approach is sound, and complete under certain conditions which do meet in practice. We implement the approach as a new tool and carry out extensive experiments on various benchmarks. The results confirm the effectiveness, efficiency and scalability of our approach. Almost all the benchmarks can be proved for the first time by the term rewriting system solely. In particular, detects a new flaw in a masked implementation published in EUROCRYPT 2017.
APA, Harvard, Vancouver, ISO, and other styles
8

Ekici, Burak, Arjun Viswanathan, Yoni Zohar, Cesare Tinelli, and Clark Barrett. "Formal Verification of Bit-Vector Invertibility Conditions in Coq." In Frontiers of Combining Systems. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-43369-6_3.

Full text
Abstract:
AbstractWe prove the correctness of invertibility conditions for the theory of fixed-width bit-vectors—used to solve quantified bit-vector formulas in the Satisfiability Modulo Theories (SMT) solver cvc5— in the Coq proof assistant. Previous work proved many of these in a completely automatic fashion for arbitrary bit-width; however, some were only proved for bit-widths up to 65, even though they are being used to solve formulas over larger bit-widths. In this paper we describe the process of proving a representative subset of these invertibility conditions in Coq. In particular, we describe the library for bit-vectors in Coq, our extensions to it, and proofs of the invertibility conditions.
APA, Harvard, Vancouver, ISO, and other styles
9

Stefanesco, Léo, Azalea Raad, and Viktor Vafeiadis. "Specifying and Verifying Persistent Libraries." In Programming Languages and Systems. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-57267-8_8.

Full text
Abstract:
AbstractWe present a general framework for specifying and verifying persistent libraries, that is, libraries of data structures that provide some persistency guarantees upon a failure of the machine they are executing on. Our framework enables modular reasoning about the correctness of individual libraries (horizontal and vertical compositionality) and is general enough to encompass all existing persistent library specifications ranging from hardware architectural specifications to correctness conditions such as durable linearizability. As case studies, we specify the and libraries, verify their implementations over "Image missing", and use them to build higher-level durably linearizable libraries, all within our framework. We also specify and verify a persistent transaction library that highlights some of the technical challenges which are specific to persistent memory compared to weak memory and how they are handled by our framework.
APA, Harvard, Vancouver, ISO, and other styles
10

Zatey, Alexander. "An Information Rate of Key Predistribution Schemes with Mutually Complementary Correctness Conditions." In Contemporary Complex Systems and Their Dependability. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-91446-6_52.

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

Conference papers on the topic "Conditional correctness"

1

Koren, Erik, Roy Johnsen, Dong Wang, et al. "Can Electrochemical Charging Replace Hydrogen Gas Charging During Hydrogen Embrittlement Testing?" In CONFERENCE 2024. AMPP, 2024. https://doi.org/10.5006/c2024-20712.

Full text
Abstract:
Abstract This paper presents the output from a study with the aim to correlate hydrogen gas charging and electrochemical charging for a X65 pipeline steel. The hydrogen uptake and diffusivity were evaluated via the permeation technique by employing both hydrogen gas charging and electrochemical charging. The effective diffusion coefficient, Deff, was determined by partial transients. The sub-surface hydrogen concentration, C0R, was then employed to determine the equivalent hydrogen pressure, pH2eq, of electrochemical charging conditions. In parallel, a permeation cell consisting of two membranes with thickness 6 mm welded together with a narrow gap in between was built. This unit was exposed to equal cathodic polarization conditions as the electrochemical permeation cell. The equilibrium pressure in the gap was measured and compared to the calculated hydrogen pressure from the gas permeation test with good correlation. Finally, an initial evaluation through toughness tests with the same X65 material executed in i) hydrogen gas and ii) electrolytic charging at equivalent hydrogen concentrations, gave promising results concerning the correctness of the correlation between the two hydrogen sources.
APA, Harvard, Vancouver, ISO, and other styles
2

Wuxi, Bi, Xu Chengwei, Xue Zhiyuan, Chen Hongyuan, and Liu Lingli. "Minimizing Grounding Resistance of Cathodic Protection Anode Bed with Finite Element Method." In CORROSION 2014. NACE International, 2014. https://doi.org/10.5006/c2014-3859.

Full text
Abstract:
Abstract Cathodic protection (CP) anode bed grounding resistance calculating formulae, given by CP standards, are reviewed firstly. Underground assumptions and limitations of these grounding calculating formulae are analyzed, which means formula method may encounter problems when designing anode beds in high soil resistivity area. Based on finite element analysis (FEA) method, a new grounding resistance calculation method is suggested, which is can be treated as more suitable and flexible for anode bed grounding resistance calculation in high soil resistivity condition. The main steps of FEA method, geometric model building, meshing, boundary condition and solver setting, and grounding resistance calculating according to Ohmic law, are clearly presented. In order to introduce the FEA method in detail, a realistic anode bed design program for Northwestern China area, where soil resistivity is always very high, is demonstrated. Based field soil resistivity survey data by Wenner 4-pin method, the candidate anode bed site, named Station A, is regarded as optimal site, and Barnes’ soil layer analysis method is used to predict soil resistivity distribution in depth direction. Both formula method and FEA method are used to calculate grounding resistance. The following comparison results show that formulae from COR-GS-023, GB21448-2008, РД 153-39.4-039-99 standards and FEA method give out almost the same grounding resistance results under the assumption of uniform soil resistivity, which also, from another angle, verifies the correctness of FEA method. But for FEA method, designers can include realistic soil resistivity distribution function and any anode rod layout plan in calculation model. So, FEA method can be treated as a more flexible tool to calculate CP anode bed grounding resistance.
APA, Harvard, Vancouver, ISO, and other styles
3

Ziarek, Zbigniew Jan. "DESIGNING GEOEDUCATIONAL TOOLS FOR GEOTOURISM NEEDS � A CASE STUDY OF THE OUTER FLYSCH CARPATHIANS." In 24th SGEM International Multidisciplinary Scientific GeoConference 24. STEF92 Technology, 2024. https://doi.org/10.5593/sgem2024/1.1/s01.06.

Full text
Abstract:
A geoeducational tools are innovative solutions used to popularize knowledge in the field of Earth Sciences and the promotion of geotourism. These methods enhance the appreciation of geodiversity, raising awareness about cognitive and aesthetic values. By adopting this approach, there is a commitment to geoheritage protection for future generations. The efficacy of geoeducational instruments relates on a knowledge of geological processes and their outcomes, coupled with adept geointerpretation. During the geointerpretative phase it is important to maintain correctness and reliable explanation of the most significant elements, while ensuring a comprehensible transfer of knowledge. The primary beneficiaries are geotourists and tourists interested in the genesis of inanimate natural objects. The purpose of the presented geoeducational tools is a simplified visualization of the key stages of the basin-tectonic history of the Carpathian Flysch Belt, starting from the processes of sediments deposition (Outer Carpathian flysch), to the formation processes of regional tectonic units (Outer Carpathian nappes) during the Alpine orogenesis. The designed tools are based on the concept of process geology, in which: (a) based on the factual description of the outcome (rock or geological structure), (b) the geological process is interpreted, and as a result, (c) a general model of environmental conditions consistent with the observations and interpretation is constructed � �from detail to general�. The presented models aim to visualize geological processes and exhibit their results in a clear and comprehensible way. In the process of modeling it is crucial to maintain a level of realism that allows for the creation of the most naturalistic depiction of the environment and the circumstances under which the analyzed process and its results could occur. The implementation of the projects allowed to determine the main attributes of the geoeducational tools: repeatability of the experiments, their clarity, expressiveness, spectacularity, and realism. Thanks to them, the recipient is able to learn and understand processes related to the deposition of clastic sediments that predominantly build the Flysch Carpathians and then formation of their nappes (accretionary prisms) as a result of orogenic fold-and-thrust movements. The finished products (films) may arouse the interest of museums and be applied to exhibitions.
APA, Harvard, Vancouver, ISO, and other styles
4

Long, Ting, Li'ang Yin, Yi Chang, Wei Xia, and Yong Yu. "Simulating Question-answering Correctness with a Conditional Diffusion." In WWW '25: The ACM Web Conference 2025. ACM, 2025. https://doi.org/10.1145/3696410.3714508.

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

Sadowski, Caitlin, and Jaeheon Yi. "User evaluation of correctness conditions." In Evaluation and Usability of Programming Languages and Tools. ACM Press, 2010. http://dx.doi.org/10.1145/1937117.1937119.

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

Alhabardi, Fahad, Bogdan Lazar, and Anton Setzer. "Verifying Correctness of Smart Contracts with Conditionals." In 2022 IEEE 1st Global Emerging Technology Blockchain Forum: Blockchain & Beyond (iGETblockchain). IEEE, 2022. http://dx.doi.org/10.1109/igetblockchain56591.2022.10087054.

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

Peterson, Christina, Pierre LaBorde, and Damian Dechev. "CCSpec: A Correctness Condition Specification Tool." In 2019 IEEE/ACM 27th International Conference on Program Comprehension (ICPC). IEEE, 2019. http://dx.doi.org/10.1109/icpc.2019.00041.

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

Lynch, Nancy, Barbara Blaustein, and Michael Siegel. "Correctness conditions for highly available replicated databases." In the fifth annual ACM symposium. ACM Press, 1986. http://dx.doi.org/10.1145/10590.10592.

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

Attiya, Hagit, and Roy Friedman. "A correctness condition for high-performance multiprocessors (extended abstract)." In the twenty-fourth annual ACM symposium. ACM Press, 1992. http://dx.doi.org/10.1145/129712.129778.

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

Sergey, Ilya, Aleksandar Nanevski, Anindya Banerjee, and Germán Andrés Delbianco. "Hoare-style specifications as correctness conditions for non-linearizable concurrent objects." In SPLASH '16: Conference on Systems, Programming, Languages, and Applications: Software for Humanity. ACM, 2016. http://dx.doi.org/10.1145/2983990.2983999.

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

Reports on the topic "Conditional correctness"

1

Horrocks, Ian, and Ulrike Sattler. Optimised Reasoning for SHIQ. Aachen University of Technology, 2001. http://dx.doi.org/10.25368/2022.118.

Full text
Abstract:
The tableau algorithm implemented in the FaCT knowledge representation system decides satisfiability and subsumption in SHIQ, a very expressive description logic providing, e.g., inverse and transitive roles, number restrictions, and general axioms. Intuitively, the algorithm searches for a tree-shaped abstraction of a model. To ensure termination of this algorithm without comprimising correctness, it stops expanding paths in the search tree using a so-called 'double-blocking' condition.
APA, Harvard, Vancouver, ISO, and other styles
2

Kuropiatnyk, D. I. Actuality of the problem of parametric identification of a mathematical model. [б. в.], 2018. http://dx.doi.org/10.31812/123456789/2885.

Full text
Abstract:
The purpose of the article is to study the possibilities of increasing the efficiency of a mathematical model by identifying the parameters of an object. A key factor for parametrization can be called the consideration of properties of the values of the model at a specific time point, which allows a deeper analysis of data dependencies and correlation between them. However, such a technique does not always work, because in advance it is impossible to predict that the parameters can be substantially optimized. In addition, it is necessary to take into account the fact that minimization reduces the values of parameters without taking into account their real physical properties. The correctness of the final values will be based on dynamically selected parameters, which allows you to modify the terms of use of the system in real time. In the development process, the values of experimentally obtained data with the model are compared, which allows you to understand the accuracy of minimization. When choosing the most relevant parameters, various minimization functions are used, which provides an opportunity to cover a wide range of theoretical initial situations. Verification of the correctness of the decision is carried out with the help of a quality function, which can identify the accuracy and correctness of the optimized parameters. It is possible to choose different types of functional quality, depending on the characteristics of the initial data. The presence of such tools during parametrization allows for varied analysis of the model, testing it on various algorithms, data volumes and conditions of guaranteed convergence of functional methods.
APA, Harvard, Vancouver, ISO, and other styles
3

Horrocks, Ian, and Stephan Tobies. Optimisation of Terminological Reasoning. Aachen University of Technology, 1999. http://dx.doi.org/10.25368/2022.99.

Full text
Abstract:
An extended abstract of this report was submitted to the Seventh International Conference on Principles of Knowledge Representation and Reasoning (KR2000). When reasoning in description, modal or temporal logics it is often useful to consider axioms representing universal truths in the domain of discourse. Reasoning with respect to an arbitrary set of axioms is hard, even for relatively inexpressive logics, and it is essential to deal with such axioms in an efficient manner if implemented systems are to be effective in real applications. This is particularly relevant to Description Logics, where subsumption reasoning with respect to a terminology is a fundamental problem. Two optimisation techniques that have proved to be particularly effective in dealing with terminologies are lazy unfolding and absorption. In this paper we seek to improve our theoretical understanding of these important techniques. We define a formal framework that allows the techniques to be precisely described, establish conditions under which they can be safely applied, and prove that, provided these conditions are respected, subsumption testing algorithms will still function correctly. These results are used to show that the procedures used in the FaCT system are correct and, moreover, to show how effiency an be significantly improved, while still retaining the guarantee of correctness, by relaxing the safety conditions for absorption.
APA, Harvard, Vancouver, ISO, and other styles
4

Baader, Franz, and Rafael Peñaloza. Blocking and Pinpointing in Forest Tableaux. Technische Universität Dresden, 2008. http://dx.doi.org/10.25368/2022.165.

Full text
Abstract:
Axiom pinpointing has been introduced in description logics (DLs) to help the used understand the reasons why consequences hold by computing minimal subsets of the knowledge base that have the consequence in consideration. Several pinpointing algorithms have been described as extensions of the standard tableau-based reasoning algorithms for deciding consequences from DL knowledge bases. Although these extensions are based on similar ideas, they are all introduced for a particular tableau-based algorithm for a particular DL, using specific traits of them. In the past, we have developed a general approach for extending tableau-based algorithms into pinpointing algorithms. In this paper we explore some issues of termination of general tableaux and their pinpointing extensions. We also define a subclass of tableaux that allows the use of so-called blocking conditions, which stop the execution of the algorithm once a pattern is found, and adapt the pinpointing extensions accordingly, guaranteeing its correctness and termination.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Conditional correctness' for particular source types:
Journal articles Books
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