scholarly journals A relational logic for higher-order programs

2017 ◽  
Vol 1 (ICFP) ◽  
pp. 1-29 ◽  
Author(s):  
Alejandro Aguirre ◽  
Gilles Barthe ◽  
Marco Gaboardi ◽  
Deepak Garg ◽  
Pierre-Yves Strub
Keyword(s):  
Higher Order ◽  
Relational Logic

scholarly journals Higher-order probabilistic adversarial computations: categorical semantics and program logics

2021 ◽  
Vol 5 (ICFP) ◽  
pp. 1-30
Author(s):  
Alejandro Aguirre ◽  
Gilles Barthe ◽  
Marco Gaboardi ◽  
Deepak Garg ◽  
Shin-ya Katsumata ◽  
...  
Keyword(s):  
Higher Order ◽  
General Notion ◽  
Memory Footprint ◽  
Resource Policy ◽  
Expected Values ◽  
Error Probabilities ◽  
The Cost ◽  
Relational Logic ◽  
Categorical Semantics ◽  
Develop Program

Adversarial computations are a widely studied class of computations where resource-bounded probabilistic adversaries have access to oracles, i.e., probabilistic procedures with private state. These computations arise routinely in several domains, including security, privacy and machine learning. In this paper, we develop program logics for reasoning about adversarial computations in a higher-order setting. Our logics are built on top of a simply typed λ-calculus extended with a graded monad for probabilities and state. The grading is used to model and restrict the memory footprint and the cost (in terms of oracle calls) of computations. Under this view, an adversary is a higher-order expression that expects as arguments the code of its oracles. We develop unary program logics for reasoning about error probabilities and expected values, and a relational logic for reasoning about coupling-based properties. All logics feature rules for adversarial computations, and yield guarantees that are valid for all adversaries that satisfy a fixed resource policy. We prove the soundness of the logics in the category of quasi-Borel spaces, using a general notion of graded predicate liftings, and we use logical relations over graded predicate liftings to establish the soundness of proof rules for adversaries. We illustrate the working of our logics with simple but illustrative examples.

scholarly journals A relational logic for higher-order programs

2019 ◽  
Vol 29 ◽  
Author(s):  
ALEJANDRO AGUIRRE ◽  
GILLES BARTHE ◽  
MARCO GABOARDI ◽  
DEEPAK GARG ◽  
PIERRE-YVES STRUB
Keyword(s):  
Program Verification ◽  
Type Systems ◽  
Higher Order ◽  
Order Logic ◽  
Relative Cost ◽  
Higher Order Logic ◽  
Relational Properties ◽  
Refinement Types ◽  
Transitivity Rule ◽  
Relational Logic

AbstractRelational program verification is a variant of program verification where one can reason about two programs and as a special case about two executions of a single program on different inputs. Relational program verification can be used for reasoning about a broad range of properties, including equivalence and refinement, and specialized notions such as continuity, information flow security, or relative cost. In a higher-order setting, relational program verification can be achieved using relational refinement type systems, a form of refinement types where assertions have a relational interpretation. Relational refinement type systems excel at relating structurally equivalent terms but provide limited support for relating terms with very different structures. We present a logic, called relational higher-order logic (RHOL), for proving relational properties of a simply typed λ-calculus with inductive types and recursive definitions. RHOL retains the type-directed flavor of relational refinement type systems but achieves greater expressivity through rules which simultaneously reason about the two terms as well as rules which only contemplate one of the two terms. We show that RHOL has strong foundations, by proving an equivalence with higher-order logic, and leverage this equivalence to derive key meta-theoretical properties: subject reduction, admissibility of a transitivity rule, and set-theoretical soundness. Moreover, we define sound embeddings for several existing relational type systems such as relational refinement types and type systems for dependency analysis and relative cost, and we verify examples that were out of reach of prior work.

scholarly journals ReLoC Reloaded: A Mechanized Relational Logic for Fine-Grained Concurrency and Logical Atomicity

2021 ◽  
Vol Volume 17, Issue 3 ◽  
Author(s):  
Dan Frumin ◽  
Robbert Krebbers ◽  
Lars Birkedal
Keyword(s):  
Symbolic Execution ◽  
Higher Order ◽  
Separation Logic ◽  
Structural Rules ◽  
Fine Grained ◽  
The Core ◽  
Proof Rules ◽  
Interactive Proofs ◽  
Relational Logic ◽  
Order State

We present a new version of ReLoC: a relational separation logic for proving refinements of programs with higher-order state, fine-grained concurrency, polymorphism and recursive types. The core of ReLoC is its refinement judgment $e \precsim e' : \tau$, which states that a program $e$ refines a program $e'$ at type $\tau$. ReLoC provides type-directed structural rules and symbolic execution rules in separation-logic style for manipulating the judgment, whereas in prior work on refinements for languages with higher-order state and concurrency, such proofs were carried out by unfolding the judgment into its definition in the model. ReLoC's abstract proof rules make it simpler to carry out refinement proofs, and enable us to generalize the notion of logically atomic specifications to the relational case, which we call logically atomic relational specifications. We build ReLoC on top of the Iris framework for separation logic in Coq, allowing us to leverage features of Iris to prove soundness of ReLoC, and to carry out refinement proofs in ReLoC. We implement tactics for interactive proofs in ReLoC, allowing us to mechanize several case studies in Coq, and thereby demonstrate the practicality of ReLoC. ReLoC Reloaded extends ReLoC (LICS'18) with various technical improvements, a new Coq mechanization, and support for Iris's prophecy variables. The latter allows us to carry out refinement proofs that involve reasoning about the program's future. We also expand ReLoC's notion of logically atomic relational specifications with a new flavor based on the HOCAP pattern by Svendsen et al.

Dual systems for all: Higher-order, role-based relational reasoning as a uniquely derived feature of human cognition

2019 ◽  
Vol 42 ◽  
Author(s):  
Daniel J. Povinelli ◽  
Gabrielle C. Glorioso ◽  
Shannon L. Kuznar ◽  
Mateja Pavlic
Keyword(s):  
Temporal Reasoning ◽  
Higher Order ◽  
Important Case ◽  
Human Cognition ◽  
Relational Reasoning ◽  
Dual Systems ◽  
First Order ◽  
Reasoning System ◽  
Role Based

Abstract Hoerl and McCormack demonstrate that although animals possess a sophisticated temporal updating system, there is no evidence that they also possess a temporal reasoning system. This important case study is directly related to the broader claim that although animals are manifestly capable of first-order (perceptually-based) relational reasoning, they lack the capacity for higher-order, role-based relational reasoning. We argue this distinction applies to all domains of cognition.

Quantitative EPMA of nitrogen : A tricky element in the electron-probe microanalyzer

1992 ◽  
Vol 50 (2) ◽  
pp. 1622-1623
Author(s):  
G.F. Bastin ◽  
H.J.M. Heijligers
Keyword(s):  
Background Subtraction ◽  
Electron Probe ◽  
Detection System ◽  
Higher Order ◽  
Light Elements ◽  
Strong Suppression ◽  
Electron Probe Microanalyzer ◽  
Quantitative Epma ◽  
Peak Count ◽  
Lead Stearate

Among the ultra-light elements B, C, N, and O nitrogen is the most difficult element to deal with in the electron probe microanalyzer. This is mainly caused by the severe absorption that N-Kα radiation suffers in carbon which is abundantly present in the detection system (lead-stearate crystal, carbonaceous counter window). As a result the peak-to-background ratios for N-Kα measured with a conventional lead-stearate crystal can attain values well below unity in many binary nitrides . An additional complication can be caused by the presence of interfering higher-order reflections from the metal partner in the nitride specimen; notorious examples are elements such as Zr and Nb. In nitrides containing these elements is is virtually impossible to carry out an accurate background subtraction which becomes increasingly important with lower and lower peak-to-background ratios. The use of a synthetic multilayer crystal such as W/Si (2d-spacing 59.8 Å) can bring significant improvements in terms of both higher peak count rates as well as a strong suppression of higher-order reflections.

Effects of Higher-Order Laue Zone reflections on structure images

1993 ◽  
Vol 51 ◽  
pp. 450-451
Author(s):  
H. S. Kim ◽  
S. S. Sheinin
Keyword(s):  
Wave Vector ◽  
Theoretical Calculations ◽  
Reciprocal Lattice ◽  
Image Plane ◽  
Bloch Wave ◽  
Dynamical Theory ◽  
Higher Order ◽  
Lattice Image ◽  
Lattice Vector ◽  
Image Position

The importance of image simulation in interpreting experimental lattice images is well established. Normally, in carrying out the required theoretical calculations, only zero order Laue zone reflections are taken into account. In this paper we assess the conditions for which this procedure is valid and indicate circumstances in which higher order Laue zone reflections may be important. Our work is based on an analysis of the requirements for obtaining structure images i.e. images directly related to the projected potential. In the considerations to follow, the Bloch wave formulation of the dynamical theory has been used.The intensity in a lattice image can be obtained from the total wave function at the image plane is given by: where ϕg(z) is the diffracted beam amplitide given by In these equations,the z direction is perpendicular to the entrance surface, g is a reciprocal lattice vector, the Cg(i) are Fourier coefficients in the expression for a Bloch wave, b(i), X(i) is the Bloch wave excitation coefficient, ϒ(i)=k(i)-K, k(i) is a Bloch wave vector, K is the electron wave vector after correction for the mean inner potential of the crystal, T(q) and D(q) are the transfer function and damping function respectively, q is a scattering vector and the summation is over i=l,N where N is the number of beams taken into account.

Challenging the Multidimensional Conception of Perceived Person-Environment Fit

2020 ◽  
pp. 1-9
Author(s):  
Julian M. Etzel ◽  
Gabriel Nagy
Keyword(s):  
Higher Education ◽  
University Students ◽  
Educational Outcomes ◽  
Factor Model ◽  
Higher Order ◽  
Substantial Proportion ◽  
Unique Variance ◽  
First Order ◽  
Person Environment Fit ◽  
Order Factor

Abstract. In the current study, we examined the viability of a multidimensional conception of perceived person-environment (P-E) fit in higher education. We introduce an optimized 12-item measure that distinguishes between four content dimensions of perceived P-E fit: interest-contents (I-C) fit, needs-supplies (N-S) fit, demands-abilities (D-A) fit, and values-culture (V-C) fit. The central aim of our study was to examine whether the relationships between different P-E fit dimensions and educational outcomes can be accounted for by a higher-order factor that captures the shared features of the four fit dimensions. Relying on a large sample of university students in Germany, we found that students distinguish between the proposed fit dimensions. The respective first-order factors shared a substantial proportion of variance and conformed to a higher-order factor model. Using a newly developed factor extension procedure, we found that the relationships between the first-order factors and most outcomes were not fully accounted for by the higher-order factor. Rather, with the exception of V-C fit, all specific P-E fit factors that represent the first-order factors’ unique variance showed reliable and theoretically plausible relationships with different outcomes. These findings support the viability of a multidimensional conceptualization of P-E fit and the validity of our adapted instrument.

Speeded Paper-Pencil Sustained Attention and Mental Speed Tests

2008 ◽  
Vol 29 (4) ◽  
pp. 205-216 ◽  
Author(s):  
Stefan Krumm ◽  
Lothar Schmidt-Atzert ◽  
Kurt Michalczyk ◽  
Vanessa Danthiir
Keyword(s):  
Sustained Attention ◽  
Time Pressure ◽  
Factor Model ◽  
Higher Order ◽  
Future Research ◽  
Perceptual Speed ◽  
Speed Factor ◽  
Close Relationship ◽  
Task Processing ◽  
Order Factor

Mental speed (MS) and sustained attention (SA) are theoretically distinct constructs. However, tests of MS are very similar to SA tests that use time pressure as an impeding condition. The performance in such tasks largely relies on the participants’ speed of task processing (i.e., how quickly and correctly one can perform the simple cognitive tasks). The present study examined whether SA and MS are empirically the same or different constructs. To this end, 24 paper-pencil and computerized tests were administered to 199 students. SA turned out to be highly related to MS task classes: substitution and perceptual speed. Furthermore, SA showed a very close relationship with the paper-pencil MS factor. The correlation between SA and computerized speed was considerably lower but still high. In a higher-order general speed factor model, SA had the highest loading on the higher-order factor; the higher-order factor explained 88% of SA variance. It is argued that SA (as operationalized with tests using time pressure as an impeding condition) and MS cannot be differentiated, at the level of broad constructs. Implications for neuropsychological assessment and future research are discussed.

Sign in / Sign up

Export Citation Format

Share Document