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

International Symposium on Theoretical Aspects of Software Engineering (TASE)

作者： He, Mengda Qin, Shengchao Ferreira, Joao F. Teesside Univ Sch Comp Media & Arts Middlesbrough Cleveland England Shenzhen Univ Shenzhen Peoples R China Univ Lisbon INESC ID IST Lisbon Portugal

ISBN: (纸本)9781538673058

By accepting order weakening for memory operations, the C11 memory model allows C/C++ programs to take advantage of modern hardware architectures, where weak/relaxed memory models are now the norm. However, the weakened C11 memory model introduces many complex and counterintuitive behaviours, rendering it more difficult for people to understand or reason about concurrent C11 programs. Several program logics (RSL, GPS, FSL, GPS+) have been proposed over the last few years to support formal reasoning for C11 programs, but each of them deals with only a specific subset of C11 programs, mainly due to the high complexity of the weakened memory model. Notably none of these program logics supports the reasoning of release-sequences - a highly flexible synchronisation mechanism in C11. Very recently, Doko and Vafeiadis propose a way in their FSL++ logic to reason about C11 programs using release-sequences, but their solution is restricted to those scenarios where only atomic update operations are between the release head and the receiver. In this paper we propose a new program logic that offers full support for reasoning about C11 programs using release-sequences. Our proposed logic is built on top of our previous program logic GPS+, but with much finer control over the resource transmission by introducing restricted-shareable assertions and an enhanced protocol system. We also illustrate our approach by verifying release-sequence programs that existing logics would not be able to.

关键词： weak memory C11 memory model release-sequence program logic

来源：评论

学校读者我要写书评

暂无评论

A program logic for Concurrent Objects under Fair Scheduling 16

A Program Logic for Concurrent Objects under Fair Scheduling

引用

43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of programming Languages (POPL)

作者： Liang, Hongjin Feng, Xinyu Univ Sci & Technol China Sch Comp Sci & Technol Beijing Peoples R China Univ Sci & Technol China Suzhou Inst Adv Study Beijing Peoples R China

ISBN: (纸本)9781450335492

Existing work on verifying concurrent objects is mostly concerned with safety only, e.g., partial correctness or linearizability. Although there has been recent work verifying lock-freedom of non-blocking objects, much less efforts are focused on deadlock-freedom and starvation-freedom, progress properties of blocking objects. These properties are more challenging to verify than lock-freedom because they allow the progress of one thread to depend on the progress of another, assuming fair scheduling. We propose LiLi, a new rely-guarantee style program logic for verifying linearizability and progress together for concurrent objects under fair scheduling. The rely-guarantee style logic unifies thread modular reasoning about both starvation-freedom and deadlock freedom in one framework. It also establishes progress-aware abstraction for concurrent objects, which can be applied when verifying safety and liveness of client code. We have successfully applied the logic to verify starvation-freedom or deadlock-freedom of representative algorithms such as ticket locks, queue locks, lock-coupling lists, optimistic lists and lazy lists.

关键词： Theory Verification Concurrency Progress program logic Rely-Guarantee Reasoning Refinement

来源：评论

学校读者我要写书评

暂无评论

From policy to practice: A program logic approach to describing the implementation of early intervention services for children with physical disability

引用

EVALUATION AND program PLANNING 2011年第1期34卷 60-68页

作者： Ziviani, Jenny Darlington, Yvonne Feeney, Rachel Head, Brian Univ Queensland Div Occupat Therapy Brisbane Qld 4072 Australia Univ Queensland Sch Social Work & Human Serv Brisbane Qld 4072 Australia Univ Queensland Social Sci Res Inst Brisbane Qld 4072 Australia

The benefits of providing early intervention services (including multidisciplinary therapy and family support) for children with physical disabilities and their families are widely acknowledged. Evidence, however, of their efficacy is not well documented. Furthermore, many studies fail to adequately describe the programs being evaluated and how these programs have been implemented by service provider organisations. From a policy perspective, evaluators need to be mindful of contextual variations in program implementation when examining initiatives and determining their efficacy. In this paper we discuss how implementation of a cross-organisational early intervention initiative policy for children with physical disabilities was enacted by three different service providers. In the present study, program logic was employed to identify and explore these variations in implementation. While each individual agency provided services and identified outcomes that were consistent with policy objectives, program delivery varied considerably across service providers. (C) 2010 Elsevier Ltd. All rights reserved.

关键词： program logic Policy implementation Early intervention

来源：评论

学校读者我要写书评

暂无评论

program logic for higher-order probabilistic programs in Isabelle/HOL

引用

SCIENCE OF COMPUTER programMING 2023年第1期230卷

作者： Hirata, Michikazu Minamide, Yasuhiko Sato, Tetsuya Tokyo Inst Technol Sch Comp Meguro ku 2-12-1 Tokyo 1528550 Japan

The verification framework PPV (Probabilistic program Verification) verifies functional probabilistic programs supporting higher-order functions, continuous distributions, and conditional inference. PPV is based on the theory of quasi-Borel spaces which is introduced to give a semantics of higher-order probabilistic programming languages with continuous distributions. In this paper, we formalize a theory of quasi-Borel spaces and a core part of PPV in Isabelle/HOL. We first construct a probability monad on quasi-Borel spaces based on the Giry monad in the Isabelle/HOL library. Our formalization of PPV is extended so that integrability of functions can be discussed formally. Finally, we prove integrability and convergence of the Monte Carlo approximation in our mechanized PPV.& COPY;2023 Elsevier B.V. All rights reserved.

关键词： Higher-order probabilistic programming language program logic Formal verification Quasi -Borel spaces Isabelle HOL

来源：评论

学校读者我要写书评

暂无评论

Ibm :: 360 :: Os :: Plm 1966-67 :: Y28-6605-2 Introduction to Control program logic Plm Sep66

引用

2016年

[Auto Generated] 13 15 Control Flow to a Processing program 16 Returning Control to a Processing program. 16 Supervisor-Assisted Linkages 16 INPUT/OUTPUT CONTROL .. 18 Processing Input/Output Operations 18 Opening a Data Control Block. 19 Executing an Input/Output Operation 20 Starting an Input/Output Operation 20 Terminating an Input/Output Operation. 21 GLOSSARY 23 APPENDIX A: SVC ROUTINES. 25 INDEX. 29 FIGURES Figure 1. Loading of the Control program 7 Figure 2. Divisions of Main storage for

关键词： access method control control program cpu cpu control data data set interruption interruption handler introduction logic logic manual processing processing program program program logic routine routines sep66 supervisor svc svc interruption svc routine y28-6605-2

来源：评论

学校读者我要写书评

暂无评论

Ibm :: 360 :: Os :: R17 Nov68 :: Plm :: Gy28-6605-4 Introduction to Control program logic Rel17 Plm Nov68

引用

2016年

[Auto Generated] other Interruptions 18 Control Flow to a processing program 20 Returning Control to a Processing program 20 Supervisor-Assisted Linkages 20 INPUT/OUTPUT CONTROL 22 Processing Input/Output Operations 22 Opening a Data Control Block 23 Executing an Input/Output Operation 24 Starting an Input/Output Operation 24 Terminating an Input/Output Operation 25 GLOSSARY . . . . . . . 27 APPENDIX A: SVC ROUTINES . 29 INDEX . . . . . . . . . . . 33 Figures Figure 1. Loading of the Control Pro

关键词： access method control control program cpu cpu control data gy28-6605-4 interruption introduction job step logic logic manual macro instruction nov68 processing processing program program program logic rel17 routine routines supervisor svc svc interruption svc routine

来源：评论

学校读者我要写书评

暂无评论

A program logic for Reasoning About C11 programs With Release-Sequences

引用

IEEE ACCESS 2020年 8卷 173874-173903页

作者： He, Mengda Qin, Shengchao Xu, Zhiwu Teesside Univ Sch Comp Engn & Digital Technol Middlesbrough TS1 3BX Cleveland England Shenzhen Univ Coll Comp Sci & Software Engn Shenzhen 518060 Peoples R China

With the popularity of weak/relaxed memory models widely used in modern hardware architectures, the C11 standard introduced a language level weak memory model, A.K.A the C11 memory model, that allows C/C++ programs to exploit the optimisation provided by the hardware platform in memory ordering and gain benefits in efficiency. On the other hand, with the weakened memory ordering allowed, more program behaviours are introduced, among which some are counterintuitive and make it even more challenging for programmers to understand or to formally reason about C11 multithread programs. To support the formal verification of the C11 weak memory programs, several program logics, e.g. RSL, GPS, FSL, and GPS+, have been developed during the last few years. However, due to the complexity of the weakened memory model, some intricate C11 features still cannot be handled in these logics. A notable example is the lack of supporting to the reasoning about a highly flexible C11 synchronisation mechanism, the release-sequence. Recently, the FSL++ logic proposed by Doko and Vafeiadis moves one step forward to address this problem, but FSL++ only considers the scenarios with atomic update operations in a release-sequence. In this article, we propose a new program logic, GPS++, that supports the reasoning about C11 programs with fully featured release-sequences. We also introduce fractional read permissions to GPS++, which are essential to the reasoning about a large number of real-world concurrent programs. GPS++ is a successor of our previous program logic GPS+, but it comes with much finer control over the resource transmission with the newly introduced restricted-shareable assertions and an enhanced protocol system. A more sophisticated resource model is devised to support the soundness proof of our new program logic. We also demonstrate GPS++ in action by verifying C11 programs with release-sequences that could not be handled by existing program logics.

关键词： Cognition Synchronization Hardware Global Positioning System Instruction sets Load modeling Radio frequency program logic formal semantics program verification C11 weak memory model release-sequence

来源：评论

学校读者我要写书评

暂无评论

A Correctness and Incorrectness program logic

引用

JOURNAL OF THE ACM 2023年第2期70卷 15-15页

作者： Bruni, Roberto Giacobazzi, Roberto Gori, Roberta Ranzato, Francesco Univ Pisa Pisa Italy Univ Verona Verona Italy Univ Padua Padua Italy

interpretation is a well-known and extensively used method to extract over-approximate program invariants by a sound program analysis algorithm. Soundness means that no program errors are lost and it is, in principle, guaranteed by construction. Completeness means that the abstract interpreter reports no false alarms for all possible inputs, but this is extremely rare because it needs a very precise analysis. We introduce a weaker notion of completeness, called local completeness, which requires that no false alarms are produced only relatively to some fixed program inputs. Based on this idea, we introduce a program logic, called Local Completeness logic for an abstract domain A, for proving both the correctness and incorrectness of program specifications. Our proof system, which is parameterized by an abstract domain A, combines over- and under-approximating reasoning. In a provable triple proves(A) [p] c [q], c is a program, q is an under-approximation of the strongest post-condition of c on input p such that their abstractions in A coincide. This means that q is never too coarse, namely, under some mild assumptions, the abstract interpretation of c does not yield false alarms for the input p iff q has no alarm. Therefore, proving proves(A) [p] c [q] not only ensures that all the alarms raised in q are true ones, but also that if q does not raise alarms, then c is correct. We also prove that if A is the straightforward abstraction making all program properties equivalent, then our program logic coincides with O'Hearn's incorrectness logic, while for any other abstraction, contrary to the case of incorrectness logic, our logic can also establish program correctness.

关键词： Abstract interpretation abstract domain program analysis program verification program logic local completeness best correct approximation incorrectness logic

来源：评论

学校读者我要写书评

暂无评论

A program logic for fresh name generation

引用

SCIENCE OF COMPUTER programMING 2022年 223卷

作者： Eliott, Harold Pancho Berger, Martin Univ Sussex Dept Informat Brighton E Sussex England Huawei 2012 Labs Turing Core London England

We present a program logic for Pitts and Stark???s v-calculus, an extension of the call-byvalue simply-typed A-calculus with a mechanism for the generation of fresh names. Names can be compared for equality and inequality, producing programs with subtle observable properties. Hidden names produced by interactions between generation and abstraction are captured logically with a second-order quantifier over type contexts. We illustrate usage of the logic through reasoning about well-known difficult cases from the literature. ?? 2022 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://***/licenses/by-nc-nd/4.0/).

关键词： programming language Lambda -calculus Fresh name generation program logic program verification

来源：评论

学校读者我要写书评

暂无评论

A program logic FOR VERIFYING SECURE ROUTING PROTOCOLS

引用

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

作者： Chen, Chen Jia, Limin Xu, Hao Luo, Cheng Zhou, Wenchao Loo, Boon Thau Univ Penn Philadelphia PA 19104 USA Carnegie Mellon Univ Pittsburgh PA 15213 USA Georgetown Univ Washington DC 20057 USA

The Internet, as it stands today, is highly vulnerable to at tacks. However, little has been done to understand and verify the formal security guarantees of proposed secure inter-domain routing protocols, such as Secure BGP (S-BGP). In this paper, we develop a sound pro gram logic for SANDLog-a declarative specification language for secure routing protocols-for verifying properties of these protocols. We prove invariant properties of SANDLog programs that run in an adversarial environment. As a step towards automated verification, we implement a verification condition generator (VCGen) to automatically extract proof obligations. VCGen is integrated into a compiler for SANDLog that can generate executable protocol implementations;and thus, both verification and empirical evaluation of secure routing protocols can be carried out in this unified framework. To validate our framework, we (1) encoded several proposed secure routing mechanisms in SANDLog, (2) verified variants of path authenticity properties by manually discharging the generated verification conditions in Coq, and (3) generated executable code based on SANDLog specification and ran the code in simulation.

关键词： Declarative networking program logic Routing protocols

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：