Results 51 to 60 of about 270,225 (234)

Axiomatizing Weak Ready Simulation Semantics over BCCSP [PDF]

, 2011
Ready simulation has proven to be one of the most significant semantics in process theory. It is at the heart of a number of general results that pave the way to a comprehensive understanding of the spectrum of process semantics. Since its original definition by Bloom, Istrail and Meyer in 1995, several authors have proposed generalizations of ready ...
Luca Aceto, David de Frutos Escrig, Carlos Gregorio-Rodríguez, Anna Ingolfsdottir   +3 more
openaire   +1 more source

C-programs Verification on Basis of Mixed Axiomatic Semantics

Моделирование и анализ информационных систем, 2010
The mixed axiomatic semantics of a C-kernel language is described. This language is the kernel of a representative C language subset which is callexl C-light. Such semantics allows to simplify the verification conditions in many cases.
I. S. Anureev, I. V. Maryasov, V. A. Nepomniaschy   +2 more
doaj  

A wide-spectrum language for verification of programs on weak memory models

, 2018
Modern processors deploy a variety of weak memory models, which for efficiency reasons may (appear to) execute instructions in an order different to that specified by the program text. The consequences of instruction reordering can be complex and subtle,
C Morgan, C Morgan, CAR Hoare, CB Jones, DJ Sorin, EW Dijkstra, IJ Hayes, J Alglave, J Alglave, M Clavel, P Sewell, R Milner, RJ Back, RJ Colvin, S Mador-Haim, S Mador-Haim, S Sarkar, Shaked Flur, SV Adve   +18 more
core   +1 more source

Gestalt Shifts in the Liar Or Why KT4M Is the Logic of Semantic Modalities [PDF]

, 2017
: This chapter offers a revenge-free solution to the liar paradox (at the centre of which is the notion of Gestalt shift) and presents a formal representation of truth in, or for, a natural language like English, which proposes to show both why -- and ...
Bobzien, Susanne
core   +1 more source

Equivalence of the schemes of programs based on the algebraic approach to setting the semantics of programming languages

Российский технологический журнал, 2022
Objectives. The paper deals with the equivalence of program schemes. According to A.A. Lyapunov and Yu.I. Yanov, the founders of this theory, a program scheme is understood as a program model wherein abstraction from contensive values of operators and ...
Y. P. Korablin
doaj   +1 more source

Attribute Annotations and Their Use in C Program Deductive Verification

Моделирование и анализ информационных систем, 2011
In this paper a new kind of annotations, called attribute annotations, and the methodology for their application in a deductive program verification are proposed.
M. M. Atuchin, I. S. Anureev
doaj  

Analytical Theology: Deductive Proof of the Theorem of UnDecidability (In A Logically Formalized Axiomatic Theory Sigma) Of Formula [Dx] Representing (In A Relevant Theistic Interpretation) the Statement of God Existence

Дискурс Пи, 2020
The investigation aim - precise formulating and solving the problem of provability or improvability of statement of existence of God, and also of provability or improvability of negation of this statement in a formal axiomatic system of philosophical ...
Lobovikov V.O.
doaj   +1 more source

Some Logics in the Vicinity of Interpretability Logics

Bulletin of the Section of Logic, 2023
In this paper we shall define semantically some families of propositional modal logics related to the interpretability logic \(\mathbf{IL}\). We will introduce the logics \(\mathbf{BIL}\) and \(\mathbf{BIL}^{+}\) in the propositional language with a ...
Sergio A. Celani
doaj   +1 more source

Semantics of a Typed Algebraic Lambda-Calculus

, 2010
Algebraic lambda-calculi have been studied in various ways, but their semantics remain mostly untouched. In this paper we propose a semantic analysis of a general simply-typed lambda-calculus endowed with a structure of vector space.
Andrzej Filinski, André van Tonder, Benjamin C. Pierce, Benoît Valiron, Elham Kashefi, Eugenio Moggi, Fr'ed'eric Blanqui, Franco Barbanera, Gordon D. Plotkin, Gregory M. Kelly, Henk P. Barendregt, Jean-Yves Girard, Joachim Lambek, Lionel Vaux, Pablo Arrighi, Pablo Arrighi, Peter Selinger, Prakash Panangaden, S. Barry Cooper, Thomas Ehrhard, Val Breazu-Tannen   +20 more
core   +2 more sources

Can we repudiate ontology altogether?

Noûs, EarlyView.
Abstract Ontological nihilists repudiate ontology altogether, maintaining that ontological structure is an unnecessary addition to our theorizing. Recent defenses of the view involve a sophisticated combination of highly expressive but ontologically innocent languages combined with a metaphysics of features—non‐objectual, complete but modifiable states
Christopher J. Masterman
wiley   +1 more source