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

Advancing the decadal plan for the science of nutrition: Progressing a framework for implementation

NUTRITION & DIETETICS 2024年第2期81卷 133-148页

作者： Truby, Helen Allman-Farinelli, Margaret Beck, Eleanor J. Beckett, Emma L. Bondonno, Catherine Dordevic, Aimee L. Livingstone, Katherine M. Willcox, Jane Wilkinson, Shelley A. Univ Queensland Brisbane Australia Univ Sydney Sydney Australia Univ New South Wales Sydney Australia FoodiQ Global Sydney Australia Edith Cowan Univ Joondalup Australia Monash Univ Melbourne Australia Deakin Univ Melbourne Australia Royal Womens Hosp Parkville Australia Mater Hlth Brisbane Australia Univ Sydney Fac Med & Hlth Charles Perkins Ctr Susan Wakil Sch Nursing & Midwifery Sydney NSW 2006 Australia

Aims: In 2019, the Australian Academy of Science in collaboration with the nutrition community published the decadal plan for the science of nutrition. This article aims to review progress towards each of its pillar goals (societal determinants, nutrition mechanisms, precision and personalised nutrition, and education and training) and two enabling platforms (a national data capability and a trusted voice for nutrition science), prioritise actions, and conceptualise program logic implementation models. This process also brought together public health nutrition researchers to reflect on societal determinants of health, and advise how the next 5 years of the decadal plan could reflect contemporary issues. Methods: Two engagement events, in 2023, brought together experienced and mid- and early-career nutrition professionals for co-creation of implementation logic models. Results: One hundred and nine early and mid-career professionals were involved. A revised model for the decadal plan pillars emerged from synthesis of all logic models. This new model integrated the precision and personalised nutrition pillar with nutrition mechanisms pillar. These combined pillars build towards the national data capability enabling platform and created new cross-cutting themes for education and training. The need arose for greater focus on respectful engagement with Aboriginal and Torres Strait Islander communities and sustained effort to build cross-disciplinary collaboration to realise the plan's societal determinants goals. A new alliance for nutrition science is proposed to become a unified advocacy voice and build trust in nutrition professionals. Conclusions: A programmatic approach provides a road map for implementing the decadal plan for the final 5 years.

关键词： decadal plan implementation nutrition science program logic

来源：评论

学校读者我要写书评

暂无评论

TLC: Temporal logic of Distributed Components

引用

PROCEEDINGS OF THE ACM ON programMING LANGUAGES-PACMPL 2020年第ICFP期4卷 1–30页

作者： Griffin, Jeremiah Lesani, Mohsen Shadab, Narges Yin, Xizhe Univ Calif Riverside Riverside CA 92521 USA

Distributed systems are critical to reliable and scalable computing;however, they are complicated in nature and prone to bugs. To manage this complexity, network middleware has been traditionally built in layered stacks of components. We present a novel approach to compositional verification of distributed stacks to verify each component based on only the specification of lower components. We present TLC (Temporal logic of Components), a novel temporal program logic that offers intuitive inference rules for verification of both safety and liveness properties of functional implementations of distributed components. To support compositional reasoning, we define a novel transformation on the assertion language that lowers the specification of a component to be used as a subcomponent. We prove the soundness of TLC and the lowering transformation with respect to a novel operational semantics for stacks of composed components in partially synchronous networks. We successfully apply TLC to compose and verify a stack of fundamental distributed components.

关键词： Distributed Protocols Temporal logic program logic Composition Operational Semantics

来源：评论

学校读者我要写书评

暂无评论

A model for the development of genetics education programs for health professionals

引用

GENETICS IN MEDICINE 2007年第7期9卷 451-457页

作者： Gaff, Clara L. Aitken, MaryAnne Flouris, Anna Metcalfe, Sylvia A. Cardiff Univ Inst Med Genet Cardiff CF14 4XN S Glam Wales Genet Hlth Serv Victoria Parkville Vic Australia Murdoch Childrens Res Inst Parkville Vic Australia Univ Melbourne Dept Paediat Parkville Vic 3052 Australia

Purpose: The need for education programs to facilitate the integration of genetics into health practice is well recognized. The inclusion of education as an aspect of genetics policy and the establishment of national bodies for genetics education extend program development beyond ad hoc programs conducted by individual practitioners. A framework for the development of an effective program is required that has a strong theoretic basis and incorporates rigorous evaluation. Methods: Relevant aspects of three theories that can inform genetics education programs are described: program logic modeling, adult learning theory, and evaluation theory. These are drawn on to develop a framework for the development and implementation of genetics education programs for health professionals and concurrent evaluation. Results: The utility of the framework is demonstrated in the development and implementation of '' The Genetics File '' program, a multifaceted program for general practitioners, comprising an enduring print resource and interactive workshop. The evaluation strategy developed is also documented. Conclusions: program logic, adult learning theory, and evaluation theory together provide a useful and relevant theoretic framework for the development of genetics education programs for health professionals.

关键词： genetics education family physicians health personnel professional education program logic program evaluation

来源：评论

学校读者我要写书评

暂无评论

Spirea: A Mechanized Concurrent Separation logic for Weak Persistent Memory

引用

PROCEEDINGS OF THE ACM ON programMING LANGUAGES-PACMPL 2023年第OOPSLA期7卷 632–657页

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

Weak persistent memory (a.k.a. non-volatile memory) is an emerging technology that offers fast byte-addressable durable main memory. A wealth of algorithms and libraries has been developed to explore this exciting technology. As noted by others, this has led to a significant verification gap. Towards closing this gap, we present Spirea, the first concurrent separation logic for verification of programs under a weak persistent memory model. Spirea is based on the Iris and Perennial verification frameworks, and by combining features from these logics with novel techniques it supports high-level modular reasoning about crash-safe and thread-safe programs and libraries. Spirea is fully mechanized in the Coq proof assistant and allows for interactive development of proofs with the Iris Proof Mode. We use Spirea to verify several challenging examples with modular specifications. We show how our logic can verify thread-safety and crash-safety of non-blocking durable data structures with null-recovery, in particular the Treiber stack and the Michael-Scott queue adapted to persistent memory. This is the first time durable data structures have been verified with a program logic.

关键词： weak memory persistent memory non-volatile memory persistency program verification program logic Iris

来源：评论

学校读者我要写书评

暂无评论

A Stone-type Duality Theorem for Separation logic Via its Underlying Bunched logics

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2018年 336卷 101-118页

作者： Docherty, Simon Pym, David UCL Dept Comp Sci London England

Stone-type duality theorems, which relate algebraic and relational/topological models, are important tools in logic because - in addition to elegant abstraction - they strengthen soundness and completeness to a categorical equivalence, yielding a framework through which both algebraic and topological methods can be brought to bear on a logic. We give a systematic treatment of Stone-type duality theorems for the structures that interpret bunched logics, starting with the weakest systems, recovering the familiar Boolean BI, and concluding with Separation logic. Our results encompass all the known existing algebraic approaches to Separation logic and prove them sound with respect to the standard store-heap semantics. We additionally recover soundness and completeness theorems of the specific truth-functional models of these logics as presented in the literature. This approach synthesises a variety of techniques from modal, substructural and categorical logic and contextualises the 'resource semantics' interpretation underpinning Separation logic amongst them. As a consequence, theory from those fields - as well as algebraic and topological methods - can be applied to both Separation logic and the systems of bunched logics it is built upon. Conversely, the notion of indexed resource frame (generalizing the standard model of Separation logic) and its associated completeness proof can easily be adapted to other non-classical predicate logics.

关键词： Separation logic bunched logic substructural logic program logic categorical logic algebraic logic representation Stone duality complex systems hyperdoctrine relational semantics topological semantics completeness

来源：评论

学校读者我要写书评

暂无评论

Optimisation Validation

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2007年第3期176卷 37-59页

作者： Aspinall, David Beringer, Lennart Momigliano, Alberto Univ Edinburgh Sch Informat LFCS Edinburgh Midlothian Scotland Ludwig Maximilians Univ Munchen Inst Informat Munich Germany Univ Milan DSI Milan Italy

We introduce the idea of optimisation validation, which is to formally establish that an instance of an optimising transformation indeed improves with respect to some resource measure. This is related to, but in contrast with, translation validation, which aims to establish that a particular instance of a transformation undertaken by an optimising compiler is semantics preserving. Our main setting is a program logic for a subset of Java bytecode, which is sound and complete for a resource-annotated operational semantics. The latter employs resource algebras for measuring dynamic costs such as time, space and more elaborate examples. We describe examples of optimisation validation that we have formally verified in Isabelle/HOL using the logic. We also introduce a type and effect system for measuring static costs such as code size, which is proved consistent with the operational semantics.

关键词： Compiler Optimisation Translation Validation program logic Java Virtual Machine Language Cost Modelling Resource Algebras Lightweight Verification

来源：评论

学校读者我要写书评

暂无评论

logical equivalence for subtyping object and recursive types

引用

THEORY OF COMPUTING SYSTEMS 2008年第3期42卷 306-348页

作者： van Bakel, Steffen de'Liguoro, Ugo Univ Turin Dipartimento Informat I-10149 Turin Italy Univ London Imperial Coll Sci Technol & Med Dept Comp London SW7 2BZ England

Subtyping in first order object calculi is studied with respect to the logical semantics obtained by identifying terms that satisfy the same set of predicates, as formalised through an assignment system. It is shown that equality in the full first order zeta-calculus is modelled by this notion, which in turn is included in a Morris-style contextual equivalence.

关键词： object calculi type theory program logic

来源：评论

学校读者我要写书评

暂无评论

Intentional Practice as a Method to Reduce the Implementation Gap Between Science and Practice in the Delivery of Trauma-Informed Residential Care

引用

RESIDENTIAL TREATMENT FOR CHILDREN & YOUTH 2020年第1期37卷 20-45页

作者： Raymond, Ivan Life Buoyancy Inst POB 3 Adelaide SA 5154 Australia

Children and young people with backgrounds of trauma, and supported in residential programs (group care, residential treatment, wilderness therapy, and outdoor behavioral healthcare), require interventions underpinned by trauma-informed science. While there is much optimism that trauma-informed services are being integrated into residential care settings, there is evidence of a science to practice gap in how these components are implemented across real-world settings. The purpose of the paper is to introduce 'intentional practice' and growth-focused logic modeling (Life Buoyancy Model;LBM) as a possible method to strengthen the delivery of trauma-informed services at the program level. The paper provides an overview of the modeling and describes how the approach seeks to reduce the science to practice gap in the implementation of trauma-informed service delivery. To aid this process, five core intervention components are proposed to provide a more nuanced understanding of how trauma-informed practice can be implemented. Key considerations are offered for residential care program leaders and program developers to design, refine or review the delivery of locally contextualized program models.

关键词： Intentional practice trauma-informed practice implementation science program logic therapeutic residential care

来源：评论

学校读者我要写书评

暂无评论

Syntactic Control of Interference for Separation logic 12

Syntactic Control of Interference for Separation Logic

引用

39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of programming Languages

作者： Reddy, Uday S. Reynolds, John C. Univ Birmingham Birmingham B15 2TT W Midlands England Carnegie Mellon Univ Pittsburgh PA 15213 USA

ISBN: (纸本)9781450310833

Separation logic has witnessed tremendous success in recent years in reasoning about programs that deal with heap storage. Its success owes to the fundamental principle that one should keep separate areas of the heap storage separate in program reasoning. However, the way Separation logic deals with program variables continues to be based on traditional Hoare logic without taking any benefit of the separation principle. This has led to unwieldy proof rules suffering from lack of clarity as well as questions surrounding their soundness. In this paper, we extend the separation idea to the treatment of variables in Separation logic, especially Concurrent Separation logic, using the system of Syntactic Control of Interference proposed by Reynolds in 1978. We extend the original system with permission algebras, making it more powerful and able to deal with the issues of concurrent programs. The result is a streamined presentation of Concurrent Separation logic, whose rules are memorable and soundness obvious. We also include a discussion of how the new rules impact the semantics and devise static analysis techniques to infer the required permissions automatically.

关键词： program logic Concurrency Denotational Semantics Type Systems Separation logic Syntactic Control of Interference Conditional Critical Regions Fractional Permissions Static Analysis

来源：评论

学校读者我要写书评

暂无评论

A logic of programs with Interface-confined Code 28

A Logic of Programs with Interface-confined Code

引用

IEEE 28th Computer Security Foundations Symposium CSF

作者： Jia, Limin Sen, Shayak Garg, Deepak Datta, Anupam Carnegie Mellon Univ ECE Pittsburgh PA 15213 USA Carnegie Mellon Univ INI Pittsburgh PA 15213 USA Carnegie Mellon Univ CSD Pittsburgh PA 15213 USA Max Planck Inst Software Syst Kaiserslautern Germany

ISBN: (纸本)9781467375382

Interface-confinement is a common mechanism that secures untrusted code by executing it inside a sandbox. The sandbox limits (confines) the code's interaction with key system resources to a restricted set of interfaces. This practice is seen in web browsers, hypervisors, and other security-critical systems. Motivated by these systems, we present a program logic, called System M, for modeling and proving safety properties of systems that execute adversary-supplied code via interface-confinement. In addition to using computation types to specify effects of computations, System M includes a novel invariant type to specify the properties of interface-confined code. The interpretation of invariant type includes terms whose effects satisfy an invariant. We construct a step-indexed model built over traces and prove the soundness of System M relative to the model. System M is the first program logic that allows proofs of safety for programs that execute adversary-supplied code without forcing the adversarial code to be available for deep static analysis. System M can be used to model and verify protocols as well as system designs. We demonstrate the reasoning principles of System M by verifying the state integrity property of the design of Memoir, a previously proposed trusted computing system.

关键词： adversary-supplied code interface confinement program logic safety properties

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：