56,531 research outputs found
Evaluation of the Community Leadership Project 2.0
Social Policy Research Associates (SPR), the contracted evaluator for CLP, began work partway through the first phase of CLP and has continued its role for CLP 2.0. SPR's overall goals for the evaluation are to: (1) inform improvements in CLP 2.0 implementation; (2) share lessons with the philanthropic field on effective capacity-building strategies for small organizations working in low-income communities and communities of color; and (3) assess the impact of CLP 2.0 on community grantees. This report focuses specifically on the launching of CLP 2.0 and on community grantees' characteristics and capacity levels at baseline
A non-CLP-compact product space whose finite subproducts are CLP-compact
We construct a family of Hausdorff spaces such that every finite product of
spaces in the family (possibly with repetitions) is CLP-compact, while the
product of all spaces in the family is non-CLP-compact. Our example will yield
a single Hausdorff space such that every finite power of is
CLP-compact, while no infinite power of is CLP-compact. This answers a
question of Stepr\={a}ns and \v{S}ostak.Comment: 8 page
Test Data Generation of Bytecode by CLP Partial Evaluation
We employ existing partial evaluation (PE) techniques developed for Constraint Logic Programming (CLP) in order to automatically generate test-case generators for glass-box testing of bytecode. Our approach consists of two independent CLP PE phases. (1) First, the bytecode is transformed into an equivalent (decompiled) CLP program. This is already a well studied transformation which can be done either by using an ad-hoc decompiler or by specialising a bytecode interpreter by means of existing PE techniques. (2) A second PE is performed in order to supervise the generation of test-cases by execution of the CLP decompiled program. Interestingly, we employ control strategies previously defined in the context of CLP PE in order to capture coverage criteria for glass-box testing of bytecode. A unique feature of our approach is that, this second PE phase allows generating not only test-cases but also test-case generators. To the best of our knowledge, this is the first time that (CLP) PE techniques are applied for test-case generation as well as to generate test-case generators
Recommended from our members
Accumulation of rare coding variants in genes implicated in risk of human cleft lip with or without cleft palate.
Cleft lip with/without cleft palate (CLP) is a common craniofacial malformation with complex etiologies, reflecting both genetic and environmental factors. Most of the suspected genetic risk for CLP has yet to be identified. To further classify risk loci and estimate the contribution of rare variants, we sequenced the exons in 49 candidate genes in 323 CLP cases and 211 nonmalformed controls. Our findings indicated that rare, protein-altering variants displayed markedly higher burdens in CLP cases at relevant loci. First, putative loss-of-function mutations (nonsense, frameshift) were significantly enriched among cases: 13 of 323 cases (~4%) harbored such alleles within these 49 genes, versus one such change in controls (p = 0.01). Second, in gene-level analyses, the burden of rare alleles showed greater case-association for several genes previously implicated in cleft risk. For example, BHMT displayed a 10-fold increase in protein-altering variants in CLP cases (p = .03), including multiple case occurrences of a rare frameshift mutation (K400 fs). Other loci with greater rare, coding allele burdens in cases were in signaling pathways relevant to craniofacial development (WNT9B, BMP4, BMPR1B) as well as the methionine cycle (MTRR). We conclude that rare coding variants may confer risk for isolated CLP
WWW Programming using computational logic systems (and the PiLLoW/Ciao library)
We discuss from a practical point of view a number of issues involved in writing Internet and WWW applications using LP/CLP systems. We describe Pd_l_oW, a public-domain
Internet and WWW programming library for LP/CLP systems which we argüe significantly simplifies the process of writing such applications. Pd_l_oW provides facilities for generating HTML structured documents, producing HTML forms, writing form handlers, accessing and parsing WWW documents, and accessing code posted at HTTP addresses. We also describe the architecture of some application classes, using a high-level model of client-server interaction, active modules. We then propose an architecture for automatic LP/CLP code downloading for local execution, using generic browsers. Finally, we also provide an overview
of related work on the topic. The PiLLoW library has been developed in the context of the &- Prolog and CIAO systems, but it has been adapted to a number of popular LP/CLP systems, supporting most of its functionality
A practical approach to the global analysis of CLP programs
This paper presents and illustrates with an example a practical approach to the dataflow analysis of programs written in constraint logic programming (CLP) languages using abstract interpretation. It is first argued that,
from the framework point of view, it sufnces to propose relatively simple extensions of traditional analysis methods which have already been proved useful and practical and for which efncient fixpoint algorithms have been
developed. This is shown by proposing a simple but quite general extensión of Bruynooghe's traditional framework to the analysis of CLP programs. In this extensión constraints are viewed not as "suspended goals" but rather as new information in the store, following the traditional view of CLP. Using this approach, and as an example of its use, a complete, constraint system independent, abstract analysis is presented for approximating definiteness information. The analysis is in fact of quite general applicability. It has been implemented and used in the analysis of CLP(R) and Prolog-III applications. Results from the implementation of this analysis are also presented
The Ciao clp(FD) library. A modular CLP extension for Prolog
We present a new free library for Constraint Logic Programming over Finite Domains, included with the Ciao Prolog system. The library is entirely written in Prolog, leveraging on Ciao's module system and code transformation capabilities in order to achieve a highly modular design without compromising performance. We describe the interface,
implementation, and design rationale of each modular component. The library meets several design goals: a high level of modularity, allowing the individual components to be replaced by different versions; highefficiency, being competitive with other TT> implementations; a glass-box
approach, so the user can specify new constraints at different levels; and a Prolog implementation, in order to ease the integration with Ciao's code analysis components. The core is built upon two small libraries which implement integer ranges and closures. On top of that, a finite domain
variable datatype is defined, taking care of constraint reexecution depending on range changes. These three libraries form what we call the TT> kernel of the library. This TT> kernel is used in turn to implement several higher-level finite domain constraints, specified using indexicals. Together with a labeling module this layer forms what we name the TT> solver. A final level integrates the CLP (J7©) paradigm with our TT> solver. This is achieved using attributed variables and a compiler from
the CLP (J7©) language to the set of constraints provided by the solver. It should be noted that the user of the library is encouraged to work in any of those levels as seen convenient: from writing a new range module to enriching the set of TT> constraints by writing new indexicals
- …