检索结果-内蒙古大学图书馆

program logic of a mental health outreach service for socially anxious youth

EVALUATION AND program PLANNING 2023年 97卷 102250页

作者： Benstead, M. L. Stones, J. Gibson, G. Moody, L. J. Little, K. Toumbourou, J. W. Deakin Univ Ctr Social & Early Emot Dev Sch Psychol 1 Gheringhap St Geelong 3220 Australia Headspace Geelong 105 Yarra St Geelong 3220 Australia Barwon Child Youth & Family 222 Malop St Geelong 3220 Australia Deakin Univ Sch Med Waurn Ponds 3216 Australia Deakin Univ Sch Psychol 221 Burwood Hwy Burwood Vic 3125 Australia

Youth mental health is a major concern both in Australia and internationally. Identifying at-risk young people is a core service priority. This report describes a "Youth Social Inclusion program" developed in Australia to assist young people identified as having social difficulties that prevent them linking into formal mental health services. This report describes the Australian service context and uses the "program explication" methodology to document: the program activities, therapeutic processes, and underpinning evidence for the benefits of this service. program explication is a consulting method designed to assist services to identify and review implicit program logic assumptions against evaluation literature. We demonstrate the application of this method in exploring the assumptions and evidence for the Youth Social Inclusion program, targeting outreach to socially anxious young people in Australia. The Youth Social Inclusion program involved seven logically consistent activities. Our literature search revealed moderate evidence for the expected benefits of the activities. This practice-based design drew on several theoretical perspectives. Given that the program logic has been established, we outline a proposal for further evaluation.

关键词： Youth Mental health Outreach Social anxiety program logic

来源：评论

学校读者我要写书评

暂无评论

Partners in Recovery: an early phase evaluation of an Australian mental health initiative using program logic and thematic analysis

引用

BMC HEALTH SERVICES RESEARCH 2019年第1期19卷 524-524页

作者： Trankle, Steven A. Reath, Jennifer Western Sydney Univ Dept Gen Practice Sch Med Campbelltown CampusBldg 30-3-18Locked Bag 1797 Penrith NSW 2751 Australia

BackgroundMental illness is a leading cause of illness and disability and around 75% of people suffering mental illness do not have access to adequate care. In Australia, nearly half the population experiences mental illness at some point in their life. The Australian Government developed a National program called Partners in Recovery (PIR) to support those with severe and persistent mental illness. The program was implemented through 48 consortia across Australia. One of these was led by the Nepean Blue Mountains Medicare Local who adapted the program according to its specific local *** conducted an early evaluation of the PIR program in Nepean Blue Mountains (NBMPIR) using a program logic model (PLM) to frame the evaluation and complemented this with an additional thematic analysis. Participants (n=73) included clients and carers, program management and staff of the Consortium and other partners and agencies, and clinical, allied health, and other service providers. Our PLM utilised multiple data sources that included document review, open and closed survey questions, and semi-structured interviews. Quantitative data received a descriptive analysis and qualitative data was analysed both in alignment with the PLM framework and *** aligned our results to PLM domains of inputs, activities, outputs, outcomes and impacts. The NBMPIR consortium implemented a recovery approach and provided greater access to services by enhancing healthcare provider partnerships. Our thematic analysis further described five key themes of collaboration;communication;functioning of PIR;structural/organisational challenges;and understanding of PIR approaches. Facilitators and barriers to the NBMPIR program centred on the alignment of vision and purpose;building an efficient system;getting the message out and sharing information;understanding roles and support and training of staff;building capacity and systems change;addressing service gaps;and engaging ***

关键词： Partners in Recovery Mental health program logic Mixed methods Australia

来源：评论

学校读者我要写书评

暂无评论

Hyper Hoare logic: (Dis-)Proving program Hyperproperties

引用

PROCEEDINGS OF THE ACM ON programMING LANGUAGES-PACMPL 2024年第PLDI期8卷 1485-1509页

作者： Dardinier, Thibault Muller, Peter Swiss Fed Inst Technol Dept Comp Sci Zurich Switzerland

Hoare logics are proof systems that allow one to formally establish properties of computer programs. Traditional Hoare logics prove properties of individual program executions (such as functional correctness). Hoare logic has been generalized to prove also properties of multiple executions of a program (so-called hyperproperties, such as determinism or non-interference). These program logics prove the absence of (bad combinations of) executions. On the other hand, program logics similar to Hoare logic have been proposed to disprove program properties (e.g., Incorrectness logic), by proving the existence of (bad combinations of) executions. All of these logics have in common that they specify program properties using assertions over a fixed number of states, for instance, a single pre- and post-state for functional properties or pairs of pre- and post-states for non-interference. In this paper, we present Hyper Hoare logic, a generalization of Hoare logic that lifts assertions to properties of arbitrary sets of states. The resulting logic is simple yet expressive: its judgments can express arbitrary program hyperproperties, a particular class of hyperproperties over the set of terminating executions of a program (including properties of individual program executions). By allowing assertions to reason about sets of states, Hyper Hoare logic can reason about both the absence and the existence of (combinations of) executions, and, thereby, supports both proving and disproving program (hyper-)properties within the same logic, including (hyper-)properties that no existing Hoare logic can express. We prove that Hyper Hoare logic is sound and complete, and demonstrate that it captures important proof principles naturally. All our technical results have been proved in Isabelle/HOL.

关键词： Hyperproperties program logic Incorrectness logic Non-Interference

来源：评论

学校读者我要写书评

暂无评论

On Extending Incorrectness logic with Backwards Reasoning

引用

PROCEEDINGS OF THE ACM ON programMING LANGUAGES-PACMPL 2025年第POPL期9卷 391-415页

作者： Verbeek, Freek Sefat, Md Syadus Fu, Zhoulai Ravindran, Binoy Open Univ Netherlands Heerlen Netherlands Virginia Tech Blacksburg VA USA SUNY Stony Brook Stony Brook NY USA

This paper studies an extension of O'Hearn's incorrectness logic (IL) that allows backwards reasoning. IL in its current form does not generically permit backwards reasoning. We show that this can be mitigated by extending IL with underspecification. The resulting logic combines underspecification (the result, or postcondition, only needs to formulate constraints over relevant variables) with underapproximation (it allows to focus on fewer than all the paths). We prove soundness of the proof system, as well as completeness for a defined subset of presumptions. We discuss proof strategies that allow one to derive a presumption from a given result. Notably, we show that the existing concept of loop summaries - closed-form symbolic representations that summarize the effects of executing an entire loop at once - is highly useful. The logic, the proof system and all theorems have been formalized in the Isabelle/HOL theorem prover.

关键词： incorrectness logic backwards reasoning program logic

来源：评论

学校读者我要写书评

暂无评论

Dynamic logic with non-rigid functions - A basis for object-oriented program verification

引用

3rd International Joint Conference on Automated Reasoning

作者： Beckert, Bernhard Platzer, Andre Univ Koblenz Landau Dept Comp Sci Koblenz Germany Carl von Ossietzky Univ Oldenburg Dept Comp Sci D-2900 Oldenburg Germany

ISBN: (纸本)3540371877

We introduce a dynamic logic that is enriched by non-rigid functions, i.e., functions that may change their value from state to state (during program execution), and we present a (relatively) complete sequent calculus for this logic. In conjunction with dynamically typed object enumerators, non-rigid functions allow to embed notions of object-orientation in dynamic logic, thereby forming a basis for verification of object-oriented programs. A semantical generalisation of substitutions, called state update, which we add to the logic, constitutes the central technical device for dealing with object aliasing during function modification. With these few extensions, our dynamic logic captures the essential aspects of the complex verification system KeY and, hence, constitutes a foundation for object-oriented verification with the principles of reasoning that underly the successful KeY case studies.

关键词： dynamic logic sequent calculus program logic software verification logical foundations of programming languages object-orientation

来源：评论

学校读者我要写书评

暂无评论

Application of logic models in a large scientific research program

引用

EVALUATION AND program PLANNING 2011年第3期34卷 174-184页

作者： O'Keefe, Christine M. Head, Richard J. CSIRO Preventat Hlth Natl Res Flagship CSIRO Math Informat & Stat Canberra ACT 2601 Australia CSIRO Preventat Hlth Natl Res Flagship Adelaide SA 5001 Australia

It is the purpose of this article to discuss the development and application of a logic model in the context of a large scientific research program within the Commonwealth Scientific and Industrial Research Organisation (CSIRO). CSIRO is Australia's national science agency and is a publicly funded part of Australia's innovation system. It conducts mission-driven scientific research focussed on delivering results with relevance and impact for Australia, where impact is defined and measured in economic, environmental and social terms at the national level. The Australian Government has recently signalled an increasing emphasis on performance assessment and evaluation, which in the CSIRO context implies an increasing emphasis on ensuring and demonstrating the impact of its research programs. CSIRO continues to develop and improve its approaches to impact planning and evaluation, including conducting a trial of a program logic approach in the CSIRO Preventative Health National Research Flagship. During the trial, improvements were observed in clarity of the research goals and path to impact, as well as in alignment of science and support function activities with national challenge goals. Further benefits were observed in terms of communication of the goals and expected impact of CSIRO's research programs both within CSIRO and externally. The key lesson learned was that significant value was achieved through the process itself, as well as the outcome. Recommendations based on the CSIRO trial may be of interest to managers of scientific research considering developing similar logic models for their research projects. The CSIRO experience has shown that there are significant benefits to be gained, especially if the project participants have a major role in the process of developing the logic model. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： program theory program logic logic model Scientific research program planning

来源：评论

学校读者我要写书评

暂无评论

The Nextgen Modality: A Modality for Non-Frame-Preserving Updates in Separation logic 25

The Nextgen Modality: A Modality for Non-Frame-Preserving Up...

引用

14th Conference on Certified programs and Proofs

作者： Vindum, Simon Friis Georges, Aina Linn Birkedal, Lars Aarhus Univ Dept Comp Sci Aarhus Denmark Aarhus Univ Aarhus Denmark

ISBN: (纸本)9798400713477

As separation logic is a logic of resources, the way in which resources can soundly change and be updated is a fundamental aspect. Such changes have typically been restricted to certain local or frame-preserving updates. However, recently we have seen separation logics where the restriction to frame-preserving updates seems to be a hindrance towards achieving the ideal program reasoning rules. In this, paper we propose a novel nextgen modality that enables reasoning across generations where each generational change can update resources in ways that are non-local and non-frame-preserving. We implement the idea as an extension to the Iris base logic, which enriches Iris with an entirely new capability: the ability to make non-frame-preserving updates to ghost state. We show that two existing Iris modalities are special cases of the nextgen modality. Our "extension" can thus also be seen as a generalization and simplification of the Iris base logic. To demonstrate the utility of the nextgen modality we use it to construct a separation logic for a programming language with explicit stack allocation and with a return operation that clears entire stack frames. The nextgen modality is used to great effect in the reasoning rule for return, where a modular and practical reasoning rule is otherwise out of reach. This is the first separation logic for a high-level programming language with stack allocation. We sketch ideas for future work in other domains where we think the nextgen modality can be useful.

关键词： separation logic Iris Coq program logic modality

来源：评论

学校读者我要写书评

暂无评论

program logicS FOR HOMOGENEOUS GENERATIVE RUN-TIME META-programMING

引用

logicAL METHODS IN COMPUTER SCIENCE 2015年第1期11卷

作者： Berger, Martin Tratt, Laurence Univ Sussex Dept Informat Brighton BN1 9QJ E Sussex England Kings Coll London Dept Informat Software Dev Team London WC2R 2LS England

This paper provides the first program logic for homogeneous generative run-time meta-programming using a variant of MiniML(e)(square) by Davies and Pfenning as its underlying on language. We show the applicability of our approach by reasoning about example meta-programs from the literature. We also demonstrate that our logics are relatively complete in the sense of Cook, enable the inductive derivation of characteristic formulae, and exactly capture the observational properties induced by the operational semantics.

关键词： program logic Specification Verification Meta-programming Types Observational Completeness Descriptive Completeness Relative Completeness Characteristic Formula

来源：评论

学校读者我要写书评

暂无评论

program logics Based on Algebras with the Composition of Predicate Complement 9

Program Logics Based on Algebras with the Composition of Pre...

引用

9th International Conference on Advanced Computer Information Technologies (ACIT)

作者： Nikitchenko, Mykola Shkilniak, Oksana Shkilniak, Stepan Taras Shevchenko Natl Univ Kyiv Dept Theory & Technol Programming Kiev Ukraine Taras Shevchenko Natl Univ Kyiv Dept Informat Syst Kiev Ukraine

ISBN: (纸本)9781728104492

The formalism of program logics is the main instrument for software verification. Many such logics reflecting different properties of software systems were proposed. Floyd-Hoare logic and its variants are popular for program verification. But this logic is oriented on total pre- and post-conditions (predicates) and becomes unsound in the case of partial predicates. In our previous works we considered different methods to extend Floyd-Hoare logic for partial predicates. One of the methods involves program algebras with the composition of predicate complement. Introduction of this composition permits to modify rules of the logic making them sound, but the obtained logic becomes more complicated because it involves undefinedness conditions. In this paper we continue our research of such logics. We introduce special consequence relation and prove the soundness and completeness theorems for the case of logic of propositional level with the composition of predicate complement.

关键词： software verification program logic Floyd-Hoare logic partial predicate soundness and completeness theorems

来源：评论

学校读者我要写书评

暂无评论

Calculational Design of [In]Correctness Transformational program logics by Abstract Interpretation

引用

PROCEEDINGS OF THE ACM ON programMING LANGUAGES-PACMPL 2024年第POPL期8卷 175-208页

作者： Cousot, Patrick NYU New York NY 10003 USA

We study transformational program logics for correctness and incorrectness that we extend to explicitly handle both termination and nontermination. We show that the logics are abstract interpretations of the right image transformer for a natural relational semantics covering both finite and infinite executions. This understanding of logics as abstractions of a semantics facilitates their comparisons through their respective abstractions of the semantics (rather that the much more difficult comparison through their formal proof systems). More importantly, the formalization provides a calculational method for constructively designing the sound and complete formal proof system by abstraction of the semantics. As an example, we extend Hoare logic to cover all possible behaviors of nondeterministic programs and design a new precondition (in)correctness logic.

关键词： program logic transformer semantics correctness incorrectness termination nontermination abstract interpretation

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：