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

Separation Logic semantics for Communicating Processes

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2008年第C期212卷 3-25页

作者： Hoare, Tony O'Hearn, Peter Microsoft Res Cambridge England Queen Mary Univ London London England

This paper explores a unification of the ideas of Concurrent Separation Logic with those of Communicating Sequential Processes. It extends separation logic by an operator for separation in time as well as separation in space. It extends CSP in the direction of the pi-calculus: dynamic change of alphabet is achieved by communication of channel names. Separation is exploited to ensure that each channel still has only two ends. For purposes of exploration, the model is the simplest possible, confined to traces without refusals. The treatment is sufficiently general to facilitate extensions by standard techniques for sharing multiplexed channels and heap state.

关键词： semantics of programming languages Concurrency Separation Logic Communicating Sequential Processes

来源：评论

学校读者我要写书评

暂无评论

Extending the C/C++ Memory Model with Inline Assembly

引用

PROCEEDINGS OF THE ACM ON programming languages-PACMPL 2024年第OOPSLA期8卷 1081-1107页

作者： DE Vilhena, Paulo Emilio Lahav, Ori Vafeiadis, Viktor Raad, Azalea Imperial Coll London London England Tel Aviv Univ Tel Aviv Israel MPI SWS Saarbrucken Germany

Programs written in C/C++ often include inline assembly: a snippet of architecture-specific assembly code used to access low-level functionalities that are impossible or expensive to simulate in the source language. Although inline assembly is widely used, its semantics has not yet been formally studied. In this paper, we overcome this deficiency by investigating the effect of inline assembly on the consistency semantics of C/C++ programs. We propose the first memory model of the C ++ programming Language with support for inline assembly for Intel's x86 including non-temporal stores and store fences. We argue that previous provably correct compiler optimizations and correct compiler mappings should remain correct under such an extended model and we prove that this requirement is met by our proposed model.

关键词： Concurrency Weak Memory Models semantics of programming languages

来源：评论

学校读者我要写书评

暂无评论

CERTAIN PROBLEMS OF THEORY OF STRUCTURED PROGRAMS SCHEMES

引用

INFORMATION PROCESSING LETTERS 1978年第6期7卷 256-260页

作者： GLUSHKOV, VM TSEYTLIN, GE YUSHCHENKO, EL Institute of Cybernetics Ukrainian Academy of Sciences 252207 Kiev 207 USSR

来源：评论

学校读者我要写书评

暂无评论

A high-level modular definition of the semantics of C#

引用

THEORETICAL COMPUTER SCIENCE 2005年第2-3期336卷 235-284页

作者： Börger, E Fruja, NG Gervasi, V Stärk, RF ETH Dept Comp Sci CH-8092 Zurich Switzerland Univ Pisa Dipartimento Informat I-56127 Pisa Italy

We propose a structured mathematical definition of the semantics of C programs to provide a platform-independent interpreter view of the language for the Q programmer, which can also be used for a precise analysis of the ECMA standard of the language and as a reference model for teaching. The definition takes care to reflect directly and faithfully-as much as possible without becoming inconsistent or incomplete-the descriptions in the Q standard to become comparable with the corresponding models for Java in Stark et al. (Java and Java Virtual Machine-Definition, Verification, Validation, Springer, Berlin, 2001) and to provide for implementors the possibility to check their basic design decisions against an accurate high-level model. The model sheds light on some of the dark corners of Q and on some critical differences between the ECMA standard and the implementations of the language. Crown Copyright (c) 2004 Published by Elsevier B.V. All rights reserved.

关键词： semantics of programming languages abstract state machines C# Java NET

来源：评论

学校读者我要写书评

暂无评论

Knowledge-based asynchronous programming

引用

FUNDAMENTA INFORMATICAE 2004年第2-3期63卷 259-281页

作者： de Haan, HW Hesselink, WH de Lavalette, GRR Univ Groningen Dept Math & Comp Sci NL-9700 AV Groningen Netherlands

A knowledge-based program is a high-level description of the behaviour of agents in terms of knowledge that an agent must have before (s)he may perform an action. The definition of the semantics of knowledge-based programs is problematic, since it involves a vicious circle;the knowledge of an agent is defined in terms of the possible behaviours of the program, while the possible behaviours are determined by the actions which depend on knowledge. We define the semantics of knowledge-based programs via an iteration approach generalizing the well-known fixpoint construction. We propose a specific iteration as the semantics of a knowledge-based program, and justify our choice by a number of examples, including the Unexpected Hanging Paradox.

关键词： knowledge-based programming semantics of programming languages concurrent programming asynchronicity unexpected hanging paradox

来源：评论

学校读者我要写书评

暂无评论

Formal specification and verification of the C# thread model

引用

THEORETICAL COMPUTER SCIENCE 2005年第3期343卷 482-508页

作者： Stärk, RF ETH Dept Comp Sci CH-8092 Zurich Switzerland

We present a high-level Abstract State Machine (ASM) model of C# threads and the NET memory model. We focus on purely managed, fully portable threading features of C#. The sequential model interleaves the computation steps of the currently running threads and is suitable for uniprocessors. The parallel model addresses problems of true concurrency on multi-processor systems. The models provide a sound basis for the development of multi-threaded applications in C#. The thread and memory models complete the abstract operational semantics of C# in [Borger et al. Theoret. Comput. Sci., to appear]. The main invariants of the thread model concerning locks, monitors and mutual exclusion are formally verified in the AsmTP system, an interactive proof assistant based on ASM logic. (c) 2005 Elsevier B.V. All rights reserved.

关键词： semantics of programming languages abstract state machines threads memory consistency models C# NET

来源：评论

学校读者我要写书评

暂无评论

Frequent Statement and De-reference Elimination for Distributed Programs

Frequent Statement and De-reference Elimination for Distribu...

引用

13th 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

ISBN: (纸本)9783642396465

This paper introduces a new approach for the analysis of frequent statement and de-reference elimination for distributed programs run on parallel machines equipped with hierarchical memories. The address space of the language studied in the paper is globally partitioned. This language allows programmers to define data layout and threads which can write to and read from other thread memories. Simply structured type systems are the tools of the techniques presented in this paper which presents three type systems. The first type system defines for program points of a given distributed program sets of calculated (ready) statements and memory accesses. The second type system uses an enriched version of types of the first type system and determines which of the specified statements and memory accesses are used later in the program. The third type system uses the information gather so far to eliminate unnecessary statement computations and memory accesses (the analysis of frequent statement and de-reference elimination). Two advantages of our work over related work are the following. The hierarchical style of concurrent parallel computers is similar to the memory model used in this paper. In our approach, each analysis result is assigned a type derivation (serves as a correctness proof).

关键词： Ready statement and memory access analysis semi-expectation analysis frequent statement and de-reference elimination analysis certified code distributed programs semantics of programming languages operational semantics type systems

来源：评论

学校读者我要写书评

暂无评论

semantics-based generation of verification conditions by program specialization 15

Semantics-based generation of verification conditions by pro...

引用

17th International Symposium on Principles and Practice of Declarative programming (PPDP)

作者： De Angelis, E. Fioravanti, F. Pettorossi, A. Proietti, M. Univ G dAnnunzio DEC Chieti Italy Univ Roma Tor Vergata DICII Rome Italy CNR IASI Rome Italy

ISBN: (纸本)9781450335164

We present a method for automatically generating verification conditions for a class of imperative programs and safety properties. Our method is parametric with respect to the semantics of the imperative programming language, as it specializes, by using unfold/fold transformation rules, a Horn clause interpreter that encodes that semantics. We define a multi-step operational semantics for a fragment of the C language and compare the verification conditions obtained by using this semantics with those obtained by using a more traditional small-step semantics. The flexibility of the approach is further demonstrated by showing that it is possible to easily take into account alternative operational semantics definitions for modeling new language features. Finally, we provide an experimental evaluation of the method by generating verification conditions using the multi-step and the small-step semantics for a few hundreds of programs taken from various publicly available benchmarks, and by checking the satisfiability of these verification conditions by using state-of-the-art Horn clause solvers. These experiments show that automated verification of programs from a formal definition of the operational semantics is indeed feasible in practice.

关键词： Software model checking program verification program specialization semantics of programming languages verification conditions constraint logic programming Horn clauses

来源：评论

学校读者我要写书评

暂无评论

Confluence and semantics of Constraint Simplification Rules

引用

Constraints 1999年第2期4卷 133-165页

作者： Abdennadher, Slim Frühwirth, Thom Meuss, Holger Computer Science Department Ludwig-Maximilians-University D-80538 Munich Oettingenstrasse 67 Germany Ctr. for Info. and Lang. Processing Ludwig-Maximilians-University D-80538 Munich Oettingenstrasse 67 Germany

Constraint Simplification Rules (CSR) is a subset of the Constraint Handling Rules (CHR) language. CHR is a powerful special-purpose declarative programming language for writing constraint solvers. The CSR subset of CHR forms essentially a committed-choice language consisting of guarded rules with multiple heads that replace constraints by simpler ones until they are solved. This paper gives declarative and operational semantics as well as soundness and completeness results for CSR programs. We also introduce a notion of confluence for CSR programs. Confluence is an essential syntactical property of any constraint solver. It ensures that the solver will always compute the same result for a given set of constraints independent of which rules are applied. It also means that it does not matter for the result in which order the constraints arrive at the constraint solver. We give a decidable, sufficient and necessary syntactic condition for confluence of terminating CSR programs. Moreover, as shown in this paper, confluence of a program implies consistency of its logical meaning (under a mild restriction).

关键词： Committed-choice languages Confluence Constraint reasoning Determinism Program analysis semantics of programming languages

来源：评论

学校读者我要写书评

暂无评论

Towards Substructural Property-Based Testing 1

引用

31st International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR)

作者： Mantovani, Marco Momigliano, Alberto Univ Milan Dipartimento Informat Milan Italy

ISBN: (数字)9783030988692

ISBN: (纸本)9783030988692;9783030988685

We propose to extend property-based testing to substructural logics to overcome the current lack of reasoning tools in the field. We take the first step by implementing a property-based testing system for specifications written in the linear logic programming language Lolli. We employ the foundational proof certificates architecture to model various data generation strategies. We validate our approach by encoding a model of a simple imperative programming language and its compilation and by testing its meta-theory via mutation analysis.

关键词： Linear logic Property-based testing Focusing semantics of programming languages

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：