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

A CAUSAL OPERATIONAL semantics OF ACTION REFINEMENT

INFORMATION AND COMPUTATION 1995年第1期122卷 97-119页

作者： DEGANO, P GORRIERI, R UNIV BOLOGNA DIPARTIMENTO MATEMAT I-40127 BOLOGNA ITALY

A TCSP-like concurrent language is extended with an operator for action refinement which plays a role similar to that of procedure-call for sequential languages. The language is given a denotational semantics that fully expresses causality in terms of Causal Trees. These are Synchronization Trees where each are has a richer labelling containing, besides an action name, also the set of backward pointers to those arcs ''causing'' the present action, An operational semantics reflecting causality is also defined in SOS style by a causal transition system, the unfoldings of which are causal trees. The denotational and operational semantics agree up to causal bisimulation, which is proved to be a congruence for ail the operators of the calculus;notably, for the refinement operator. Also, a complete set of axioms is provided that characterizes the congruence classes of causal bisimulation for finite agents. The main result of the paper is an operational semantics firmly based on a view of action refinement as purely semantic substitution. Therefore, its operational definition provides a ''parallel copy rule,'' i.e., the concurrent analogous of the classic ''copy rule'' for sequential languages. (C) 1995 Academic Press, Inc.

关键词： Event structures Bisimulation Concurrency Trees semantics Concurrency Action Refining congruences axioms trees programming language semantics semiotics language

来源：评论

学校读者我要写书评

暂无评论

Constraint logic programming with dynamic scheduling: A semantics based on closure operators

引用

INFORMATION AND COMPUTATION 1997年第1期137卷 41-67页

作者： Falaschi, M Gabbrielli, M Marriott, K Palamidessi, C UNIV UDINE DIPARTIMENTO MATEMAT & INFORMATI-33100 UDINEITALY MONASH UNIV DEPT COMP SCICLAYTONVIC 3168AUSTRALIA UNIV GENOA DISII-16146 GENOAITALY

The first logic programming languages, such as Prolog, used a fixed left-to-right atom scheduling rule. Recent logic programming languages, however, provide more flexible scheduling in which there is a default computation rule such as left-to-right but in which some calls are dynamically ''delayed'' until their arguments are sufficiently instantiated to allow the call to run efficiently. Such languages include constraint logic programming languages, since most implementations of these languages delay constraints which are ''too hard.'' From the semantic point of view, the fact that an atom must be delayed under certain conditions, causes the standard semantics of (constraint) logic programming to be no longer adequate to capture the meaning of a program. In our paper we attack this problem and we develop a denotational semantics for constraint logic programming with dynamic scheduling. The key idea is that the denotation of an atom or goal is a set of closure operators, where different closure operators correspond to different sequences of rule choices. (C) 1997 Academic Press.

关键词： semantics PROLOG Constraint Atoms programming language semantics Rule Logic programming language scheduling rule

来源：评论

学校读者我要写书评

暂无评论

Automated Equivalence Checking of Concurrent Quantum Systems

引用

ACM TRANSACTIONS ON COMPUTATIONAL LOGIC 2018年第4期19卷 1–32页

作者： Ardeshir-Larijani, Ebrahim Gay, Simon J. Nagarajan, Rajagopal Inst Res Fundamental Sci IPM Sch Comp Sci Farmanieh CampusLavasani St Tehran *** Iran Univ Glasgow Sch Comp Sci Glasgow G12 8QQ Lanark Scotland Middlesex Univ Fac Sci & Technol Dept Comp Sci London NW4 4BT England

The novel field of quantum computation and quantum information has gathered significant momentum in the last few years. It has the potential to radically impact the future of information technology and influence the development of modern society. The construction of practical, general purpose quantum computers has been challenging, but quantum cryptographic and communication devices have been available in the commercial marketplace for several years. Quantum networks have been built in various cities around the world and a dedicated satellite has been launched by China to provide secure quantum communication. Such new technologies demand rigorous analysis and verification before they can be trusted in safety-and security-critical applications. Experience with classical hardware and software systems has shown the difficulty of achieving robust and reliable implementations. We present CCSq, a concurrent language for describing quantum systems, and develop verification techniques for checking equivalence between CCSq processes. CCSq has well-defined operational and superoperator semantics for protocols that are functional, in the sense of computing a deterministic input-output relation for all interleavings arising from concurrency in the system. We have implemented QEC (Quantum Equivalence Checker), a tool that takes the specification and implementation of quantum protocols, described in CCSq, and automatically checks their equivalence. QEC is the first fully automatic equivalence checking tool for concurrent quantum systems. For efficiency purposes, we restrict ourselves to Clifford operators in the stabilizer formalism, but we are able to verify protocols over all input states. We have specified and verified a collection of interesting and practical quantum protocols, ranging from quantum communication and quantum cryptography to quantum error correction.

关键词： Quantum information processing process calculi programming language semantics concurrency equivalence checking

来源：评论

学校读者我要写书评

暂无评论

The adequacy of Launchbury's natural semantics for lazy evaluation

引用

JOURNAL OF FUNCTIONAL programming 2018年 28卷 e1-e1页

作者： Breitner, Joachim Univ Penn Comp & Informat Sci Philadelphia PA 19146 USA

In his seminal paper "A Natural semantics for Lazy Evaluation", John Launchbury proves his semantics correct with respect to a denotational semantics, and outlines a proof of adequacy. Previous attempts to rigorize the adequacy proof, which involves an intermediate natural semantics and an intermediate resourced denotational semantics, have failed. We devised a new, direct proof that skips the intermediate natural semantics. It is the first rigorous adequacy proof of Launchbury's semantics. We have modeled our semantics in the interactive theorem prover Isabelle and machine-checked our proofs. This does not only provide a maximum level of rigor, but also serves as a tool for further work, such as a machine-checked correctness proof of a compiler transformation.

关键词： semantics rigors ADEQUACY lazy evaluation natural programming language semantics semiotics program verification

来源：评论

学校读者我要写书评

暂无评论

Intertextual semantics: A semantics for Information Design

引用

JOURNAL OF THE AMERICAN SOCIETY FOR INFORMATION SCIENCE AND TECHNOLOGY 2009年第9期60卷 1895-1906页

作者： Marcoux, Yves Rizkallah, Elias Univ Montreal GRDS EBSI Montreal PQ H3C 3J7 Canada HEC Montreal Desjardins Ctr Studies Management Financial Serv Montreal PQ H3T 2A7 Canada

In most discussions about information and knowledge management, natural language is described as too fuzzy, ambiguous, and changing to serve as a basis for the development of large-scale tools and systems. Instead, artificial formal languages are developed and used to represent, hopefully in an unambiguous and precise way, the information or knowledge to be managed. Intertextual semantics (IS) adopts an almost exactly opposite point of view: Natural language is the foundation on which information management tools and systems should be developed, and the usefulness of artificial formalisms used in the process lies exclusively in our ability to derive natural language from them. In this article, we introduce IS, its origins, and underlying hypotheses and principles, and argue that even if its basic principles seem remote from current trends in design, IS is actually compatible with-and complementary to-those trends, especially semiotic engineering (C.S. de Souza, 2005a). We also hint at further possible application areas, such as interface and interaction design, and the design of concrete objects.

关键词： programming language semantics semantics -- Methodology SEMANTIC networks (Information theory) INFORMATION science INFORMATION resources management MANAGEMENT information systems ELECTRONIC data processing INFORMATION theory DATA mining

来源：评论

学校读者我要写书评

暂无评论

Universal Composability Is Robust Compilation

引用

ACM TRANSACTIONS ON programming languageS AND SYSTEMS 2024年第4期46卷 1-64页

作者： Patrignani, Marco Kuennemann, Robert Wahby, Riad S. Cecchetti, Ethan Univ Trento DISI Trento Italy CISPA Helmholz Ctr Informat Secur Saarbrucken Germany Carnegie Mellon Univ Pittsburgh PA USA Univ Wisconsin Madison Madison WI USA

This article discusses the relationship between two frameworks: universal composability (UC) and robust compilation (RC). In cryptography, UC is a framework for the specification and analysis of cryptographic protocols with a strong compositionality guarantee: UC protocols remain secure even when composed with other protocols. In programming language security, RC is a novel framework for determining secure compilation by proving whether compiled programs are as secure as their source-level counterparts no matter what target-level code they interact with. Presently, these disciplines are studied in isolation, though we argue that there is a deep connection between them and exploring this connection will benefit both research fields. This article formally proves the connection between UC and RC and then it explores the benefits of this connection (focussing on perfect, rather than computational UC). For this, this article first identifies which conditions must programming languages fulfil in order to possibly attain UC-like composition. Then, it proves UC of both an existing and a new commitment protocol as a corollary of the related compilers attaining RC . Finally, it mechanises these proofs in DEEPSEC, obtaining symbolic guarantees that the protocol is indeed UC. Our connection lays the groundwork towards a better and deeper understanding of both UC and RC , and the benefits we showcase from this connection provide evidence of scalable mechanised proofs for UC.

关键词： secure compilation programming language semantics universal compos- ability cryptography composition proof techniques backtranslation

来源：评论

学校读者我要写书评

暂无评论

The formalisation of ROCK & ROLL: A deductive object-oriented database system

引用

INFORMATION AND SOFTWARE TECHNOLOGY 1997年第6期39卷 379-389页

作者： Fernandes, AAA Barja, ML Paton, NW Williams, MH HERIOT WATT UNIV DEPT ELECT & COMP ENGN EDINBURGH EH14 4AS MIDLOTHIAN SCOTLAND UNIV MANCHESTER DEPT COMP SCI MANCHESTER M13 9PL LANCS ENGLAND

This paper describes the formalisation of the deductive object-oriented database system ROCK & ROLL, This is a system which integrates the deductive and object-oriented paradigms in a way that is both clean and consistent, and that has a sound theoretical foundation. The system uses a formally defined object-oriented data model as a foundation for both a logic query language and an imperative data manipulation language in such a way that impedance mismatches are minimised. This paper introduces the facilities offered by ROCK & ROLL, and indicates how their formalisation has been achieved. (C) 1997 Elsevier Science B.V.

关键词： deductive databases logic programming object-oriented databases programming language semantics

来源：评论

学校读者我要写书评

暂无评论

A symbolic analysis framework for static analysis of imperative programming languages

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2012年第6期85卷 1418-1439页

作者： Burgstaller, Bernd Scholz, Bernhard Blieberger, Johann Yonsei Univ Seoul 120749 South Korea Univ Sydney Sydney NSW 2006 Australia Vienna Univ Technol A-1040 Vienna Austria

We present a generic symbolic analysis framework for imperative programming languages. Our framework is capable of computing all valid variable bindings of a program at given program points. This information is invaluable for domain-specific static program analyses such as memory leak detection, program parallelization, and the detection of superfluous bound checks, variable aliases and task deadlocks. We employ path expression algebra to model the control flow information of programs. A homomorphism maps path expressions into the symbolic domain. At the center of the symbolic domain is a compact algebraic structure called supercontext. A supercontext contains the complete control and data flow analysis information valid at a given program point. Our approach to compute supercontexts is based purely on algebra and is fully automated. This novel representation of program semantics closes the gap between program analysis and computer algebra systems, which makes supercontexts an ideal symbolic intermediate representation for all domain-specific static program analyses. Our approach is more general than existing methods because it can derive solutions for arbitrary (even intra-loop and nested loop) nodes of reducible and irreducible control flow graphs. We prove the correctness of our symbolic analysis method. Our experimental results show that the problem sizes arising from real-world applications such as the SPEC95 benchmark suite are tractable for our symbolic analysis framework. (C) 2011 Elsevier Inc. All rights reserved.

关键词： Static program analysis Symbolic analysis Path expression algebra programming language semantics

来源：评论

学校读者我要写书评

暂无评论

Three public enemies: Cut, copy, and paste

引用

COMPUTER 2006年第7期39卷 31-+页

作者： Mann, Zoltan Adam Budapest Univ Technol & Econ Budapest Hungary

Copy-paste might seem to make life easier, but it often leads to inconsistencies. Giving users the freedom to specify semantic relationships among copied objects can help rectify this "crime."

关键词： programming language semantics software engineering text editing copy-paste code segment program debugging program editor text editing software development

来源：评论

学校读者我要写书评

暂无评论

NONDETERMINISTIC EXTENSIONS OF UNTYPED LAMBDA-CALCULUS

引用

INFORMATION AND COMPUTATION 1995年第2期122卷 149-177页

作者： DELIGUORO, U PIPERNO, A Univ Roma La Sapienza Dipartimento Sci Informaz Via Salaria 113 I 00198 Rome Italy

The main concern of this paper is the interplay between functionality and nondeterminism. We ask whether the analysis of parallelism in terms of sequentiality and nondeterminism, which is usual in the algebraic treatment of concurrency, remains correct in the presence of functional application and abstraction, We argue in favour of a distinction between nondeterminism and parallelism, due to the conjunctive nature of the former in contrast to the disjunctive character of the latter. This is the basis of our analysis of the operational and denotational semantics of the nondeterministic lambda-calculus, which is the classical calculus plus a choice operator, and of our election of bounded indeterminacy as the semantic counterpart of conjunctive nondeterminism. This leads to operational semantics based on the idea of must preorder, coming from the classical theory of solvability and from the theory of process algebras. To characterize this relation, we build a model using the inverse limit construction over nondeterministic algebras, and we prove it fully abstract using a generalization of Bohm trees. We further prove conservativity theorems for the equational theory of the model and for other theories related to nondeterministic lambda-calculus with respect to classical lambda-theories. (C) 1995 Academic Press, Inc.

关键词： Assignment semantics Model Synclitism parallelism lambda calculus programming language semantics semiotics semantics process algebra Algebra theories computability Abstraction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：