Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming

AbstractAn extension of the inductive assertion method allowing one to prove the partial correctness of an attribute grammar w.r.t. a specification is presented. It is complete in an abstract sense. It is also shown that the semantics of systems of recursive imperative procedures or of recursive applicative procedures computed with call-by-value or call-by-name can be expressed by an attribute grammar associating attributes with the nodes of the so-called trees of calls. Hence the proof methods for the partial correctness of attribute grammars can be applied to these recursive procedures. We show also how the proof method can be applied in logic programming

Abstract verification and debugging of constraint logic programs

The technique of Abstract Interpretation [13] has allowed the development of sophisticated program analyses which are provably correct and practical. The semantic approximations produced by such analyses have been traditionally applied to optimization during program compilation. However, recently, novel and promising applications of semantic approximations have been proposed in the more general context of program verification and debugging [3],[10],[7]

Using global analysis, partial specifications, and an extensible assertion language for program validation and debugging

We discuss a framework for the application of abstract interpretation as an aid during program development, rather than in the more traditional application of program optimization. Program validation and detection of errors is first performed statically by comparing (partial) specifications written in terms of assertions against information obtained from (global) static analysis of the program. The results of this process are expressed in the user assertion language. Assertions (or parts of assertions) which cannot be checked statically are translated into run-time tests. The framework allows the use of assertions to be optional. It also allows using very general properties in assertions, beyond the predefined set understandable by the static analyzer and including properties defined by user programs. We also report briefly on an implementation of the framework. The resulting tool generates and checks assertions for Prolog, CLP(R), and CHIP/CLP(fd) programs, and integrates compile-time and run-time checking in a uniform way. The tool allows using properties such as types, modes, non-failure, determinacy, and computational cost, and can treat modules separately, performing incremental analysis

Context-sensitive multivariant assertion checking in modular programs

We propose a modular, assertion-based system for verification and debugging of large logic programs, together with several interesting models for checking assertions statically in modular programs, each with different characteristics and representing different trade-offs. Our proposal is a modular and multivariant extensión of our previously proposed abstract assertion checking model and we also report on its implementation in the CiaoPP system. In our approach, the specification of the program, given by a set of assertions, may be partial, instead of the complete specification required by raditional verification systems. Also, the system can deal with properties which cannot always be determined at compile-time. As a result, the proposed system needs to work with safe approximations: all assertions proved correct are guaranteed to be valid and all errors actual errors. The use of modular, context-sensitive static analyzers also allows us to introduce a new distinction between assertions checked in a particular context or checked in general

On completeness of logic programs

Program correctness (in imperative and functional programming) splits in logic programming into correctness and completeness. Completeness means that a program produces all the answers required by its specification. Little work has been devoted to reasoning about completeness. This paper presents a few sufficient conditions for completeness of definite programs. We also study preserving completeness under some cases of pruning of SLD-trees (e.g. due to using the cut). We treat logic programming as a declarative paradigm, abstracting from any operational semantics as far as possible. We argue that the proposed methods are simple enough to be applied, possibly at an informal level, in practical Prolog programming. We point out importance of approximate specifications.Comment: 20 page

GABAergic Neuron Deficit As An Idiopathic Generalized Epilepsy Mechanism: The Role Of BRD2 Haploinsufficiency In Juvenile Myoclonic Epilepsy

Idiopathic generalized epilepsy (IGE) syndromes represent about 30% of all epilepsies. They have strong, but elusive, genetic components and sex-specific seizure expression. Multiple linkage and population association studies have connected the bromodomain-containing gene BRD2 to forms of IGE. In mice, a null mutation at the homologous Brd2 locus results in embryonic lethality while heterozygous Brd2+/− mice are viable and overtly normal. However, using the flurothyl model, we now show, that compared to the Brd2+/+ littermates, Brd2+/− males have a decreased clonic, and females a decreased tonic-clonic, seizure threshold. Additionally, long-term EEG/video recordings captured spontaneous seizures in three out of five recorded Brd2+/− female mice. Anatomical analysis of specific regions of the brain further revealed significant differences in Brd2+/− vs +/+ mice. Specifically, there were decreases in the numbers of GABAergic (parvalbumin- or GAD67-immunopositive) neurons along the basal ganglia pathway, i.e., in the neocortex and striatum of Brd2+/− mice, compared to Brd2+/+ mice. There were also fewer GABAergic neurons in the substantia nigra reticulata (SNR), yet there was a minor, possibly compensatory increase in the GABA producing enzyme GAD67 in these SNR cells. Further, GAD67 expression in the superior colliculus and ventral medial thalamic nucleus, the main SNR outputs, was significantly decreased in Brd2+/− mice, further supporting GABA downregulation. Our data show that the non-channel-encoding, developmentally critical Brd2 gene is associated with i) sex-specific increases in seizure susceptibility, ii) the development of spontaneous seizures, and iii) seizure-related anatomical changes in the GABA system, supporting BRD2's involvement in human IGE