scholarly journals The Effects of Adding Reachability Predicates in Quantifier-Free Separation Logic

2021 ◽  
Vol 22 (2) ◽  
pp. 1-56
Author(s):  
Stéphane Demri ◽  
Etienne Lozes ◽  
Alessio Mansutti

The list segment predicate ls used in separation logic for verifying programs with pointers is well suited to express properties on singly-linked lists. We study the effects of adding ls to the full quantifier-free separation logic with the separating conjunction and implication, which is motivated by the recent design of new fragments in which all these ingredients are used indifferently and verification tools start to handle the magic wand connective. This is a very natural extension that has not been studied so far. We show that the restriction without the separating implication can be solved in polynomial space by using an appropriate abstraction for memory states, whereas the full extension is shown undecidable by reduction from first-order separation logic. Many variants of the logic and fragments are also investigated from the computational point of view when ls is added, providing numerous results about adding reachability predicates to quantifier-free separation logic.

1998 ◽  
Vol 10 (04) ◽  
pp. 467-497
Author(s):  
Amine M. El Gradechi

We investigate the notion of super-unitarity from a functional analytic point of view. For this purpose we consider examples of explicit realizations of a certain type of irreducible representations of low rank orthosymplectic Lie superalgebras which are super-unitary by construction. These are the so-called superholomorphic discrete series representations of osp (1/2,ℝ) and osp (2/2,ℝ) which we recently constructed using a ℤ2–graded extension of the orbit method. It turns out here that super-unitarity of these representations is a consequence of the self-adjointness of two pairs of anticommuting operators which act in the Hilbert sum of two Hilbert spaces each of which carrying a holomorphic discrete series representation of su (1,1) such that the difference of the respective lowest weights is [Formula: see text]. At an intermediate stage, we show that the generators of the considered orthosymplectic Lie superalgebras can be realized either as matrix-valued first order differential operators or as first order differential superoperators. Even though the former realization is less convenient than the latter from the computational point of view, it has the advantage of avoiding the use of anticommuting Grassmann variables, and is moreover important for our analysis of super-unitarity. The latter emphasizes the fundamental role played by the atypical (or degenerate) superholomorphic discrete series representations of osp (2/2,ℝ) for the super-unitarity of the other representations considered in this work, and shows that the anticommuting (unbounded) self-adjoint operators mentioned above anticommute in a proper sense, thus connecting our work with the analysis of supersymmetric quantum mechanics.


Author(s):  
William Mansky ◽  
Wolf Honoré ◽  
Andrew W. Appel

AbstractSeparation logic is a useful tool for proving the correctness of programs that manipulate memory, especially when the model of memory includes higher-order state: Step-indexing, predicates in the heap, and higher-order ghost state have been used to reason about function pointers, data structure invariants, and complex concurrency patterns. On the other hand, the behavior of system features (e.g., operating systems) and the external world (e.g., communication between components) is usually specified using first-order formalisms. In principle, the soundness theorem of a separation logic is its interface with first-order theorems, but the soundness theorem may implicitly make assumptions about how other components are specified, limiting its use. In this paper, we show how to extend the higher-order separation logic of the Verified Software Toolchain to interface with a first-order verified operating system, in this case CertiKOS, that mediates its interaction with the outside world. The resulting system allows us to prove the correctness of C programs in separation logic based on the semantics of system calls implemented in CertiKOS. It also demonstrates that the combination of interaction trees + CompCert memories serves well as a lingua franca to interface and compose two quite different styles of program verification.


2020 ◽  
Vol 25 (1) ◽  
pp. 106-126
Author(s):  
P. Padmaja ◽  
P. Aparna ◽  
R.S.R. Gorla

AbstractIn this paper, we present an initial value technique for solving self-adjoint singularly perturbed linear boundary value problems. The original problem is reduced to its normal form and the reduced problem is converted to first order initial value problems. This replacement is significant from the computational point of view. The classical fourth order Runge-Kutta method is used to solve these initial value problems. This approach to solve singularly perturbed boundary-value problems is numerically very appealing. To demonstrate the applicability of this method, we have applied it on several linear examples with left-end boundary layer and right-end layer. From the numerical results, the method seems accurate and solutions to problems with extremely thin boundary layers are obtained.


1991 ◽  
Vol 23 (68) ◽  
pp. 7-86
Author(s):  
Francisco Rodríguez Consuegra

Introduction. This paper is principally a critical exposition of the celebrated article by Benacerraf, indicating briefly íts antecedents, emphasizing its accomplishments, problems and basic insufficiencies, followed by an evaluation of the main criticisms to which Benacerraf's article has been subjected, as well as a study of the historical framework in which a new global criticism is meaningful. The paperends with the examination of a possible connection with the structuralist philosophy of mathematics, which is in part inspired by the work of Benacerraf. Mathematical reduction according to Benacerraf (sections 2 and 3). It is here shown that the fundamental "objective" antecedents to Benacerraf's work are Quine, along with Parsons, and the nominalism of Goddard; and sorne important differences are also pointed out. Discussed is Benacerraf's rejection of the identification of numbers and objects, and its substitution by progressions in the framework of the typically Quinean argument of set polymorphism, as well as his difficult theory of identity, all of which without a clearly relativist ontological contexto His reduction of numbers to positions in a progression is situated in the now old debate between the cardinal and the ordinal, and is a step in the direction of the nascent structuralism, although it lacks sufficient justification. Some criticisms [sections 4 and 5). An evaluative study is made of the criticisms that seem to me most accurate, or the most revealing of underlying problems. Reviewed are the most relevant among such criticisms in the literature: Steiner, Resnik, Maddy, Wright, and Hale along with others of the enormous quantity of articles discussing this topic that have appeared over the last twenty years, Common lines are traced out, and some possible defenses of Benaeerraf are indicated, although again the weaknesses of his position are pointed out, weaknesses stemming from its unresolved problems (the historieal framework, the ill-defined ontology, the nascent structuralism, etc.). Essential criticisms (section 6). Beginning with the problem of counting, the axis of Benaeerraf's work, an historical excursion is presented, in which it is shown that the problem pointed out above (cardinal versus ordinal) can be seen as the center of the indicated difficulties. The theory of Dedekind-Peano is compared with that of Cantor, and the epistemological and constructive advantages of the latter are noted. It is shown how positions very similar to Benacerraf's were already held by Cassirer and Weyl (without mentioning Berkeley!); meanwhile, the Cantorian approach of Couturat and RusseU is shown to be superior, at least from the point of view of a global coneeption. Finally, the eonneetion between eonstructions and polymorphism---a problem shared by logic, mathematics and physics---is pointed out. The structuralist tendency and platonism (section 7). The antecedents of the structuralism of Resnik and Shapiro are traced to Benacerraf himself ---and the historical trace is further extended back to the ordinalists, Bourbaki and Quine--- in the hope of shedding light on the basic problem: the supposed antithesis between terms and relations (already familiar in Bradley and Russell). Further, I suggest and examine a parallelism with the relativism of mathematical entities such as this appears after the limitations of (at least first order) axiomatization. The paper ends making a connection of the subject with the theory of categories, which, surprisingly, still has not been eonsidered by the strueturalist, despite the fact that it is quite clearly a natural extension of the structuralist point of view. [Traducción de Raúl Orayen y Mark Rollins]


Author(s):  
Andrew W. Appel ◽  
Robert Dockins ◽  
Aquinas Hobor ◽  
Lennart Beringer ◽  
Josiah Dodds ◽  
...  

Author(s):  
V. Castano ◽  
W. Krakow

In non-UHV microscope environments atomic surface structure has been observed for flat-on for various orientations of Au thin films and edge-on for columns of atoms in small particles. The problem of oxidation of surfaces has only recently been reported from the point of view of high resolution microscopy revealing surface reconstructions for the Ag2O system. A natural extension of these initial oxidation studies is to explore other materials areas which are technologically more significant such as that of Cu2O, which will now be described.


2020 ◽  
Vol 7 (2) ◽  
pp. 34-41
Author(s):  
VLADIMIR NIKONOV ◽  
◽  
ANTON ZOBOV ◽  

The construction and selection of a suitable bijective function, that is, substitution, is now becoming an important applied task, particularly for building block encryption systems. Many articles have suggested using different approaches to determining the quality of substitution, but most of them are highly computationally complex. The solution of this problem will significantly expand the range of methods for constructing and analyzing scheme in information protection systems. The purpose of research is to find easily measurable characteristics of substitutions, allowing to evaluate their quality, and also measures of the proximity of a particular substitutions to a random one, or its distance from it. For this purpose, several characteristics were proposed in this work: difference and polynomial, and their mathematical expectation was found, as well as variance for the difference characteristic. This allows us to make a conclusion about its quality by comparing the result of calculating the characteristic for a particular substitution with the calculated mathematical expectation. From a computational point of view, the thesises of the article are of exceptional interest due to the simplicity of the algorithm for quantifying the quality of bijective function substitutions. By its nature, the operation of calculating the difference characteristic carries out a simple summation of integer terms in a fixed and small range. Such an operation, both in the modern and in the prospective element base, is embedded in the logic of a wide range of functional elements, especially when implementing computational actions in the optical range, or on other carriers related to the field of nanotechnology.


2001 ◽  
Vol 7 (4) ◽  
pp. 441-484 ◽  
Author(s):  
José Ferreirós

AbstractThis paper aims to outline an analysis and interpretation of the process that led to First-Order Logic and its consolidation as a core system of modern logic. We begin with an historical overview of landmarks along the road to modern logic, and proceed to a philosophical discussion casting doubt on the possibility of a purely rational justification of the actual delimitation of First-Order Logic. On this basis, we advance the thesis that a certain historical tradition was essential to the emergence of modern logic; this traditional context is analyzed as consisting in some guiding principles and, particularly, a set of exemplars (i.e., paradigmatic instances). Then, we proceed to interpret the historical course of development reviewed in section 1, which can broadly be described as a two-phased movement of expansion and then restriction of the scope of logical theory. We shall try to pinpoint ambivalencies in the process, and the main motives for subsequent changes. Among the latter, one may emphasize the spirit of modern axiomatics, the situation of foundational insecurity in the 1920s, the resulting desire to find systems well-behaved from a proof-theoretical point of view, and the metatheoretical results of the 1930s. Not surprisingly, the mathematical and, more specifically, the foundational context in which First-Order Logic matured will be seen to have played a primary role in its shaping.Mathematical logic is what logic, through twenty-five centuries and a few transformations, has become today. (Jean van Heijenoort)


1975 ◽  
Vol 53 (23) ◽  
pp. 2590-2592
Author(s):  
J. Cejpek ◽  
J. Dobeš

The reaction processes in which a one-step transition is forbidden are analyzed from the point of view of the first order perturbation theory. The interference between two competing two-step reaction paths is found to be always constructive. A qualitative explanation of the experimentally observed reaction intensities is presented.


Sign in / Sign up

Export Citation Format

Share Document