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

THE COMPLEXITY OF DEFAULT REASONING UNDER THE STATIONARY FIXED-POINT semantics

INFORMATION AND COMPUTATION 1995年第1期121卷 81-92页

作者： GOTTLOB, G TECH UNIV VIENNA INST INFORMAT SYSTA-1040 VIENNAAUSTRIA

Stationany default extensions have recently been introduced by Przymusinska and Przymusinsky as an interesting alternative to classical extensions in Reiter's default logic. An important property of this new approach is that the set of all stationary extensions has a unique minimal element. In this paper we investigate the computational complexity of the main reasoning tasks in propositional stationary default logic, namely, cautious and brave reasoning. We show that cautious reasoning is complete for Delta(2)(P) while brave reasoning is Sigma(2)(P)-complete. We also show that for normal default theories, the least fixed point iteration used to compute the unique minimal stationary extension is noticeably simplified. Based on this observation we show that cautious reasoning with normal defaults is complete for p(NP[log n]). This is the class of decision problems solvable in polynomial time with a logarithmic number of queries to an oracle in NP. (C) 1995 Academic Press. Inc.

关键词： Logic Circumscription Programs Reasoning Complexity Decision problem Formal logic programming language semantics nonmonotonic reasoning

来源：评论

学校读者我要写书评

暂无评论

DESIGN AND CORRECTNESS OF A COMPILER FOR A NON-PROCEDURAL language

引用

ACTA INFORMATICA 1978年第3期9卷 217-241页

作者： HOFFMANN, CM Purdue University

Design and correctness proof of a compiler for Lucid, a non-procedural proof-oriented programming language, are given. Starting with the denotational semantics of Lucid, an equivalent operational semantics is derived, and from it the design of compiling algorithms. The algorithms are proved to compile correctly a subset of the language. A discussion of the design choices and of the subset restrictions gives insight into the nature of Lucid as well as into the problem of compiling related non-procedural languages.

关键词： Subset programming language semantics accuracy class Insight language subset language compilers program verification

来源：评论

学校读者我要写书评

暂无评论

Twenty years of rewriting logic

引用

JOURNAL OF LOGIC AND ALGEBRAIC programming 2012年第7-8期81卷 721-781页

作者： Meseguer, Jose Univ Illinois Dept Comp Sci Urbana IL 61801 USA

Rewriting logic is a simple computational logic that can naturally express both concurrent computation and logical deduction with great generality. This paper provides a gentle, intuitive introduction to its main ideas, as well as a survey of the work that many researchers have carried out over the last twenty years in advancing: (i) its foundations;(ii) its semantic framework and logical framework uses;(iii) its language implementations and its formal tools;and (iv) its many applications to automated deduction, software and hardware specification and verification, security, real-time and cyber-physical systems, probabilistic systems, bioinformatics and chemical systems. (C) 2012 Elsevier Inc. All rights reserved.

关键词： Rewriting logic Concurrency Logical frameworks Temporal logics Formal specification and verification programming language semantics Networks and distributed systems Real-time systems Probabilistic systems Security Bioinformatics

来源：评论

学校读者我要写书评

暂无评论

Share the ontology in XML-based trading architectures

引用

COMMUNICATIONS OF THE ACM 1999年第3期42卷 110-111页

作者： Smith, H Poulter, K Comp Sci Corp Farnborough Hants England

Although extensible markup language ( XML) represents a major step forward in e-commerce technology, business-to-business trading partners should also recognize its limitations. XML is not a cure-all for system interoperability, but a widely accepted foundation layer on which to build. Moreover, there are differing views on how to extend or complement XML to support agent-based e-commerce. There is now a need for e-commerce participants to create a global environment providing significant interoperability between systems used by all engaged. Such an environment can be achieved through improved semantics within the Internet transactions and in networked service definitions. It will facilitate consistent behavior among participants in large trading networks or within complex virtual organizations. Consistent schema semantics will certainly enable efficient e-commerce using predefined document type definitions between fixed networks of trading partners. Participating agents have to communicate in terms of a detailed ontology of the business domain.

关键词： XML (Document markup language) ELECTRONIC commerce USER interfaces (Computer systems) SYSTEMS design VIRTUAL reality INTERNETWORKING (Telecommunication) programming language semantics

来源：评论

学校读者我要写书评

暂无评论

The W-CALCULUS: A Synchronous Framework for the Verified Modelling of Digital Signal Processing Algorithms 9

The W-CALCULUS: A Synchronous Framework for the Verified Mod...

引用

9th ACM SIGPLAN International Workshop on Functional Art, Music, Modelling, and Design (FARM)

作者： Arias, Emilio Jesus Gallego Jouvelot, Pierre Ribstein, Sylvain Desblancs, Dorian Inria Paris Equipe R2 Paris France PSL Univ MINES ParisTech Paris France Ecole Normale Super Paris Saclay Paris France

ISBN: (纸本)9781450386135

We introduce the W-CALCULUS, an extension of the call-by-value lambda-calculus with synchronous semantics, designed to be flexible enough to capture different implementation forms of Digital Signal Processing algorithms, while permitting a direct embedding into the Coq proof assistant for mechanized formal verification. In particular, we are interested in the different implementations of classical DSP algorithms such as audio filters and resonators, and their associated high-level properties such as Linear Time-invariance. We describe the syntax and denotational semantics of the W-CALCULUS, providing a Coq implementation. As a first application of the mechanized semantics, we prove that every program expressed in a restricted syntactic subset of W is linear time-invariant, by means of a characterization of the property using logical relations. This first semantics, while convenient for mechanized reasoning, is still not useful in practice as it requires re-computation of previous steps. To improve on that, we develop an imperative version of the semantics that avoids recomputation of prior stream states. We empirically evaluate the performance of the imperative semantics using a staged interpreter written in OCaml, which, for an input program in W, produces a specialized OCaml program, which is then fed to the optimizing OCaml compiler. The approach provides a convenient path from the high-level semantical description to low-level efficient code.

关键词： Digital Signal Processing programming language semantics Synchronous programming Formal Verification Linear Time-invariance

来源：评论

学校读者我要写书评

暂无评论

Rewriting logic bibliography by topic: 1990-2011

引用

JOURNAL OF LOGIC AND ALGEBRAIC programming 2012年第7-8期81卷 782-815页

作者： Marti-Oliet, Narciso Palomino, Miguel Verdejo, Alberto Univ Complutense Madrid Fac Informat Dpto Sistemas Informat & Computac E-28040 Madrid Spain

This bibliography compiles, to the best of our knowledge. all the papers on rewriting logic and its applications which have been written during the more than 20 years that have passed since the introduction of rewriting logic in 1990. The papers are classified according to five main areas: foundations, logical and semantic framework, languages, tools, and applications. (C) 2012 Elsevier Inc. All rights reserved.

来源：评论

学校读者我要写书评

暂无评论

Denotational models for programming languages: applications of Banach's Fixed Point Theorem

引用

TOPOLOGY AND ITS APPLICATIONS 1998年第1-3期85卷 35-52页

作者： de Bakker, JW de Vink, EP CWI Dept Software Technol NL-1090 GB Amsterdam Netherlands Vrije Univ Amsterdam Fac Math & Comp Sci NL-1081 HV Amsterdam Netherlands

For an abstract programming language both a linear and a branching denotational semantics are developed. The main instrument for the construction of the two models and for the semantical operators involved is the classical Banach Fixed Point Theorem. Via higher-order transformations the various semantical definitions are justified by their characterization as-necessarily unique-fixed points of contractions on a complete metric space. Additionally the Banach Theorem proves itself useful in relating the two models presented. (C) 1998 Elsevier Science B.V.

关键词： programming language semantics denotational semantics metric semantics Banach's Fixed Point Theorem linear versus branching time models

来源：评论

学校读者我要写书评

暂无评论

On a New Type of Contextual Queries and Linguistic Summaries of a Bipolar Type

On a New Type of Contextual Queries and Linguistic Summaries...

引用

IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)

作者： Zadrozny, Slawomir Kacprzyk, Janusz Dziedzic, Mateusz Polish Acad Sci Syst Res Inst Ul Newelska 6 PL-01447 Warsaw Poland Cracow Univ Technol Dept Automat Control & Informat Technol PL-31155 Krakow Poland Univ Ghent Dept Telecommun & Informat Proc B-9000 Ghent Belgium

ISBN: (纸本)9781467374286

A new type of linguistic summaries, so-called contextual linguistic summaries, are further developed. The point of departure are contextual bipolar queries which play the same role for a new type of summaries as flexible fuzzy queries do with respect to the classical linguistic summaries. The bipolar queries employed are of a special type, following the required/desired semantics formalized using the "and possibly" operator and a recently introduced "or, if impossible" operator. The latter is inspired by the work of Lietard et al. on another bipolarity related operator "or else". The "or, if impossible" operator is its non truth functional counterpart, interpreted in the same vein as the "and possibly" operator employed and studied in our previous work. In the paper we extend the concept of contextual linguistic summaries using this new operator and study its basic properties as well as some more general properties of this class of summaries.

关键词： computational linguistics programming language semantics query processing and possibly operator bipolar type linguistic summaries bipolarity related operator contextual bipolar queries contextual linguistic summaries flexible fuzzy queries or else operator or if impossible operator semantics Data mining Databases Electronic mail Natural languages Pragmatics Remuneration semantics

来源：评论

学校读者我要写书评

暂无评论

GSOS Formalized in Coq

GSOS Formalized in Coq

引用

7th International Symposium on Theoretical Aspects of Software Engineering (TASE)

作者： Madlener, Ken Smetsers, Sjaak Radboud Univ Nijmegen Inst Comp & Informat Sci iCIS NL-6525 ED Nijmegen Netherlands

ISBN: (纸本)9780769550534

Structural operational semantics provides a well-known framework to describe the semantics of programming languages, lending itself to formalization in theorem provers. The formalization of syntactic SOS rule formats, which enforce some form of well-behavedness, has so far received less attention. GSOS is a rule format that enjoys the property that the operational semantics and denotational semantics, both derived from the same set of GSOS rules, are consistent. The present paper formalizes the underlying theory in the theorem prover COQ, and proves the consistency property, also known as the adequacy theorem. The inspiration for our work has been drawn from the field of bialgebraic semantics.

关键词： algebra programming language semantics theorem proving

来源：评论

学校读者我要写书评

暂无评论

Oblivious program execution and path-sensitive non-interference

Oblivious program execution and path-sensitive non-interfere...

引用

IEEE 26th Computer Security Foundations Symposium

作者： Planul, Jeremy Mitchell, John C. Stanford Univ Stanford CA 94305 USA

ISBN: (纸本)9780769550312

Various cryptographic constructions allow an un-trusted cloud server to compute over encrypted data, without decrypting the data. However, this prevents the cloud server from branching according to encrypted values. We study the constraints imposed by this important scenario by formulating and solving an equivalent information-flow problem, based on assuming an adversary could observe the control path. We develop a type system that prevents control-path information leaks, prove soundness, and compare with traditional implicit information-flow. Because simply preventing programs that leak information severely restricts the language, we define alternate (and easily implemented) semantics that execute multiple paths and combine the results using data operations. This produces a termination problem which we address with a more refined type system that characterizes a useful class of obliviously executable programs. We prove fundamental results about this language, semantics, and type system and conclude by comparing with traditional timing-based information-flow.

关键词： cloud computing cryptography program verification programming language semantics type theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：