4,141 research outputs found

    Embracing Rural First-Generation College Student Scholar Identity: Wading Waist Deep in Unfamiliar Waters

    Get PDF
    First-generation college students do not persist to degree completion at the same rate as their continuing generation peers. There is a wide range of research focusing on the challenges and opportunities that first-generation college students experience, ranging from pre-matriculation factors, the transition period to college, and throughout the undergraduate years. The achievement gap, in terms of persistence to degree, has been a consistent focus of research as first-generation students routinely do not earn college degrees at the same rate as their continuing generation peers. This research takes a holistic approach to understanding the first-generation college student experience that does not solely focus on achievement gaps. This project focused on the journey of students from Eastern Kentucky to the flagship institution of the commonwealth. The purpose of this study was to identify what authorizes this group of first-generation college students to embrace their emerging scholar identity. This project utilized semi-structured interviews with 12 currently enrolled students from Eastern Kentucky that were enrolled at the University of Kentucky at the time of interview. Data were sorted and clarified using the process of thematic analysis (TA). Elements such as process awareness, comfort engaging with professors and other key stakeholders, as well as discussions why certain resources were utilized or not were considerations brought forth by the students

    A Refinement Calculus for Logic Programs

    Get PDF
    Existing refinement calculi provide frameworks for the stepwise development of imperative programs from specifications. This paper presents a refinement calculus for deriving logic programs. The calculus contains a wide-spectrum logic programming language, including executable constructs such as sequential conjunction, disjunction, and existential quantification, as well as specification constructs such as general predicates, assumptions and universal quantification. A declarative semantics is defined for this wide-spectrum language based on executions. Executions are partial functions from states to states, where a state is represented as a set of bindings. The semantics is used to define the meaning of programs and specifications, including parameters and recursion. To complete the calculus, a notion of correctness-preserving refinement over programs in the wide-spectrum language is defined and refinement laws for developing programs are introduced. The refinement calculus is illustrated using example derivations and prototype tool support is discussed.Comment: 36 pages, 3 figures. To be published in Theory and Practice of Logic Programming (TPLP

    A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency

    Full text link
    This research started with an algebra for reasoning about rely/guarantee concurrency for a shared memory model. The approach taken led to a more abstract algebra of atomic steps, in which atomic steps synchronise (rather than interleave) when composed in parallel. The algebra of rely/guarantee concurrency then becomes an instantiation of the more abstract algebra. Many of the core properties needed for rely/guarantee reasoning can be shown to hold in the abstract algebra where their proofs are simpler and hence allow a higher degree of automation. The algebra has been encoded in Isabelle/HOL to provide a basis for tool support for program verification. In rely/guarantee concurrency, programs are specified to guarantee certain behaviours until assumptions about the behaviour of their environment are violated. When assumptions are violated, program behaviour is unconstrained (aborting), and guarantees need no longer hold. To support these guarantees a second synchronous operator, weak conjunction, was introduced: both processes in a weak conjunction must agree to take each atomic step, unless one aborts in which case the whole aborts. In developing the laws for parallel and weak conjunction we found many properties were shared by the operators and that the proofs of many laws were essentially the same. This insight led to the idea of generalising synchronisation to an abstract operator with only the axioms that are shared by the parallel and weak conjunction operator, so that those two operators can be viewed as instantiations of the abstract synchronisation operator. The main differences between parallel and weak conjunction are how they combine individual atomic steps; that is left open in the axioms for the abstract operator.Comment: Extended version of a Formal Methods 2016 paper, "An algebra of synchronous atomic steps
    • …
    corecore