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

15th International Conference on Computational Science and Its Applications (ICCSA)

作者： El-Zawawy, Mohamed A. Al Imam Mohammad Ibn Saud Islamic Univ IMSIU Coll Comp & Informat Sci Riyadh Saudi Arabia Cairo Univ Fac Sci Dept Math Giza 12613 Egypt

ISBN: (纸本)9783319214139;9783319214122

Parallel programming can be realized as a main tool to improve performance. A main model for programming parallel machines is the single instruction multiple data (SIMD) model of parallelism. This paper presents an axiomatic semantics for SIMD programs. This semantics is useful for designating and attesting partial correctness properties for SIMD programs and is a generalization of the separation's logical system (designed for sequential programs). The second contribution of this paper is an operational framework to conventionally define the semantics of SIMD programs. This framework has two sets of inference rules;for running a program on a single machine and for running a program on many machines concurrently. A detailed correctness proof for the presented logical system is presented using the proposed operational semantics. Also the paper presents a detailed example of a specification derivation in the proposed logical system.

关键词： Concurrent separation logic (CSL) program logic program verification Concurrency Soundness Distributed programs Semantics of programming languages Operational semantics

来源：评论

学校读者我要写书评

暂无评论

Poster Abstract: BUFS: Towards Bottom-Up Foundational Security for Software in the Internet-of-Things 1

Poster Abstract: BUFS: Towards Bottom-Up Foundational Securi...

引用

1st IEEE/ACM Symposium on Edge Computing (SEC)

作者： Tan, Jiaqi Gandhi, Rajeev Narasimhan, Priya Carnegie Mellon Univ Dept Elect & Comp Engn Pittsburgh PA 15213 USA

ISBN: (纸本)9781509033225

The Internet-of-Things (IoT) is a rapidly growing phenomenon. While IoT-enabled objects can provide rich features that can improve users' lives, security failures can lead to severe consequences, particularly in safety-critical domains such as medical devices and automobiles. In this poster abstract, we propose BUFS, a bottom-up and foundational approach for verifying the security of the software stack in an IoT system, to provide guarantees for how the software is secure. BUFS is a secure-by-construction approach that verifies that IoT software is secure in a bottom-up and foundational way. The BUFS approach provides tools for aiding and automating parts of the software development and verification process for programmers, and is intended for safety-critical domains, where high-assurance is required. © 2016 IEEE.

关键词： Internet-of-Things program logic Software security Software verification

来源：评论

学校读者我要写书评

暂无评论

The importance of program evaluation: How can it be applied to diverse genetics education settings?

引用

Journal of Genetic Counseling 2008年第2期17卷 170-179页

作者： Metcalfe, Sylvia A. Aitken, MaryAnne Gaff, Clara L. Genetics Education and Health Research Murdoch Childrens Research Institute Royal Children's Hospital Parkville VIC 3052 Flemington Road Australia Department of Paediatrics University of Melbourne Melbourne VIC Australia Genetic Health Services Victoria Melbourne VIC Australia

The role of a genetic counselor often entails providing education to patient, community and/or health professional groups. While counseling supervision assists genetic counselors to be reflective about their clinical work and to enhance clinical skills, evaluation is a rather analogous process in the provision of education. program evaluation of education activities can be applied to provide information about the needs of the target group (needs assessment), the delivery of the program (process evaluation) as well as determining the extent to which the education activity has met its intended aims (summative evaluation). Evaluation assists the educator to assess the impact of their program and provides an evidence base about genetics education. Although program evaluation can be a complex activity, the tools are ones that can be used by individuals to evaluate single or simple education activities. The components of evaluation are discussed with reference to genetic counseling practice and three very different examples of actual evaluations are provided to illustrate the diversity of evaluation strategy and programs to which it can be applied. © 2008 National Society of Genetic Counselors, Inc.

关键词： Community genetics education Genetic counselors Genetics education Health professional genetics education Needs assessment program evaluation program logic

来源：评论

学校读者我要写书评

暂无评论

logical equivalence for subtyping object and recursive types

Logical equivalence for subtyping object and recursive types

引用

9th Italian Conference on Theoretical Computer Science (ICTCS 2005)

作者： 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

来源：评论

学校读者我要写书评

暂无评论

Automated Software Verification of Hyperliveness 30th

Automated Software Verification of Hyperliveness

引用

30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS) Held as Part of the 27th European Joint Conferences on Theory and Practice of Software (ETAPS)

作者： Beutner, Raven CISPA Helmholtz Ctr Informat Secur Saarbrucken Germany

ISBN: (纸本)9783031572487;9783031572494

Hyperproperties relate multiple executions of a program and are commonly used to specify security and information-flow policies. Most existing work has focused on the verification of k-safety properties, i.e., properties that state that all k-tuples of execution traces satisfy a given property. In this paper, we study the automated verification of richer properties that combine universal and existential quantification over executions. Concretely, we consider for all(k)there exists(l) properties, which state that for all k executions, there exist l executions that, together, satisfy a property. This captures important non-k-safety requirements, including hyperliveness properties such as generalized non-interference, opacity, refinement, and robustness. We design an automated constraint-based algorithm for the verification of for all(k)there exists(l) properties. Our algorithm leverages a sound-and-complete program logic and a (parameterized) strongest postcondition computation. We implement our algorithm in a tool called ForEx and report on encouraging experimental results.

关键词： Hyperproperties program logic Hoare logic Symbolic Execution Constraint-based Verification Predicate Transformer Refinement Strongest Postcondition Underapproximation.

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

PCFIRE: Towards Provable Preventative Control-Flow Integrity Enforcement for Realistic Embedded Software 13

PCFIRE: Towards Provable Preventative Control-Flow Integrity...

引用

16th International Conference on Embedded Software (EMSOFT)

作者： Tan, Jiaqi Tay, Hui Jun Drolia, Utsav Gandhi, Rajeev Narasimhan, Priya Carnegie Mellon Univ Dept ECE Pittsburgh PA 15213 USA

ISBN: (纸本)9781450344852

Control-Flow Integrity (CFI) is an important safety property of software, particularly in embedded and safety-critical systems, where CFI violations have led to patient deaths and can render cars remotely controllable by attackers. Previous techniques for CFI may reduce the robustness of embedded and safety-critical systems, as they handle CFI violations by stopping programs. In this work, we present PCFIRE, a preventative approach to CFI that prevents the root-causes of CFI violations to allow recovery, and enables programmers to specify robust recovery actions by providing CFI via source-code safety-checks. PCFIRE's CFI can be formally proved automatically, and supports realistic features of embedded software such as hardware and I/O access. We showcase PCFIRE by providing, and automatically proving, CFI for: benchmark programs, text utilities containing I/O, and embedded programs with sensor inputs and hardware outputs on the Raspberry Pi single-board computer.

关键词： Control-Flow Integrity program logic Proof Assistant Interactive Theorem Proving ARM Executables HOL

来源：评论

学校读者我要写书评

暂无评论

Compositional Certified Resource Bounds 15

Compositional Certified Resource Bounds

引用

36th ACM SIGPLAN Conference on programming Language Design and Implementation

作者： Carbonneaux, Quentin Hoffmann, Jan Shao, Zhong Yale Univ New Haven CT 06520 USA

ISBN: (纸本)9781450334686

This paper presents a new approach for automatically deriving worst-case resource bounds for C programs. The described technique combines ideas from amortized analysis and abstract interpretation in a unified framework to address four challenges for state-of-the-art techniques: compositionality, user interaction, generation of proof certificates, and scalability. Compositionality is achieved by incorporating the potential method of amortized analysis. It enables the derivation of global whole-program bounds with local derivation rules by naturally tracking size changes of variables in sequenced loops and function calls. The resource consumption of functions is described abstractly and a function call can be analyzed without access to the function body. User interaction is supported with a new mechanism that clearly separates qualitative and quantitative verification. A user can guide the analysis to derive complex non-linear bounds by using auxiliary variables and assertions. The assertions are separately proved using established qualitative techniques such as abstract interpretation or Hoare logic. Proof certificates are automatically generated from the local derivation rules. A soundness proof of the derivation system with respect to a formal cost semantics guarantees the validity of the certificates. Scalability is attained by an efficient reduction of bound inference to a linear optimization problem that can be solved by off-the-shelf LP solvers. The analysis framework is implemented in the publicly-available tool (CB)-B-4. An experimental evaluation demonstrates the advantages of the new technique with a comparison of (CB)-B-4 with existing tools on challenging micro benchmarks and the analysis of more than 2900 lines of C code from the cBench benchmark suite.

关键词： Verification Reliability Quantitative Verification Resource Bound Analysis Static Analysis Amortized Analysis LP Solving program logic

来源：评论

学校读者我要写书评

暂无评论

Healthiness from Duality 16

Healthiness from Duality

引用

31st Annual ACM-IEEE Symposium on logic in Computer Science (LICS)

作者： Hino, Wataru Kobayashi, Hiroki Hasuo, Ichiro Jacobs, Bart Univ Tokyo Tokyo 1138654 Japan Radboud Univ Nijmegen NL-6525 ED Nijmegen Netherlands

ISBN: (纸本)9781450343916

Healthiness is a good old question in program logics that dates back to Dijkstra. It asks for an intrinsic characterization of those predicate transformers which arise as the (backward) interpretation of a certain class of programs. There are several results known for healthiness conditions: for deterministic programs, nondeterministic ones, probabilistic ones, etc. Building upon our previous works on so-called state-and-effect triangles, we contribute a unified categorical framework for investigating healthiness conditions. This framework is based on a dual adjunction induced by a dualizing object and on our notion of relative Eilenberg-Moore algebra. The latter notion seems interesting in its own right in the context of monads, Lawvere theories and enriched categories.

关键词： program logic category theory duality

来源：评论

学校读者我要写书评

暂无评论

A Calculus of Chaos in Stochastic Compilation Engineering in the Cause of Mathematics 3rd

A Calculus of Chaos in Stochastic Compilation Engineering in...

引用

3rd World Congress on Formal Methods (FM)

作者： Breuer, Peter T. Pickin, Simon J. Hecusys LLC Atlanta GA 31126 USA Univ Complutense Madrid Madrid Spain

ISBN: (纸本)9783030549961;9783030549978

An unexpected outcome from an open project to develop a 'chaotic' compiler for ANSI C is described here: a trace information entropy calculus for stochastically compiled programs. A stochastic compiler produces randomly different object codes every time it is applied to the same source code. This calculus quantifies the entropy introduced into run-time program traces by a compiler that aims for the maximal possible entropy, furnishing a definition and proof of security for encrypted computing (Turing-complete computation in which data remains in encrypted form throughout), where the status was formerly unknown.

关键词： Computer security Encrypted computing program logic

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：