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

3rd Imperial College Computing Student Workshop, ICCSW 2013

作者： Van Gijzel, Bas Functional Programming Laboratory School of Computer Science University of Nottingham United Kingdom

ISBN: (纸本)9783939897637

The structured approach to argumentation has seen a surge of models, introducing a multitude of ways to deal with the formalisation of arguments. However, while the development of the mathematical models have flourished, the actual implementations and development of methods for implementation of these models have been lagging behind. This paper attempts to alleviate this problem by providing methods that simplify implementation, i.e. we demonstrate how the functional programming language Haskell can naturally express mathematical definitions and sketch how a theorem prover can verify this implementation. Furthermore, we provide methods to streamline the documenting of code, showing how literate programming allows the implementer to write formal definition, implementation and documentation in one file. All code has been made publicly available and reusable.

关键词： Functional programming

来源：评论

学校读者我要写书评

暂无评论

Ambient-oriented programming

Ambient-oriented programming

引用

OOPSLA'05 - 20th Annual ACM Conference on Object-Oriented programming, Systems, Languages, and Applications

作者： Dedecker, Jessie Van Cutsem, Tom Mostinckx, Stijn D'Hondt, Theo De Meuter, Wolfgang Programming Technology Laboratory Department of Computer Science Vrije Universiteit Brussel Belgium

A new field in distributed computing, called Ambient In-telligence, has emerged as a consequence of the increasing availability of wireless devices and the mobile networks they induce. Developing software for such mobile networks is extremely hard in conventional programming languages because the network is dynamically defined. This hardware phenomenon leads us to postulate a suite of characteristics of future Ambient-Oriented programming languages. A simple re ective programming language kernel, called AmbientTalk, that meets these characteristics is subsequently presented. The power of the re ective kernel is illustrated by using it to conceive a collection of high level tentative ambient-oriented programming language features. © 2005 ACM.

关键词： Wireless networks

来源：评论

学校读者我要写书评

暂无评论

AmbientOriented programming in AmbientTalk: Combining mobile hardware with simplicity and expressiveness

AmbientOriented Programming in AmbientTalk: Combining mobile...

引用

OOPSLA'05 - 20th Annual ACM Conference on Object-Oriented programming, Systems, Languages, and Applications

作者： Dedecker, Jessie Cutsem, Tom Van Mostinckx, Stijn De Meuter, Wolfgang D Hond, Theo Programming Technology Laboratory Department of Computer Science Vrije Universiteit Brussel Belgium

A new field in distributed computing, called Ambient Intelligence, has emerged as a consequence of the increasing availability of wireless devices and the mobile networks they induce. Developing software for such mobile networks is extremely hard in conventional programming languages because the network is dynamically defined. We demonstrate a new distributed programming language named AmbientTalk, a research vehicle to experiment with expressive high-level language constructs for Ambient-Oriented programming. © 2005 ACM.

关键词： High level languages

来源：评论

学校读者我要写书评

暂无评论

Towards modular compilers for effects 12th

Towards modular compilers for effects

引用

12th International Symposium on Trends in Functional programming, TFP 2011

作者： Day, Laurence E. Hutton, Graham Functional Programming Laboratory School of Computer Science University of Nottingham United Kingdom

ISBN: (纸本)9783642320361

Compilers are traditionally factorised into a number of separate phases, such as parsing, type checking, code generation, etc. However, there is another potential factorisation that has received comparatively little attention: the treatment of separate language features, such as mutable state, input/output, exceptions, concurrency and so forth. In this article we focus on the problem of modular compilation, in which the aim is to develop compilers for separate language features independently, which can then be combined as required. We summarise our progress to date, issues that have arisen, and further work. © Springer-Verlag Berlin Heidelberg 2012.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

Haskell gets argumentative

Haskell gets argumentative

引用

13th Symposium on Trends in Functional programming, TFP 2012

作者： Van Gijzel, Bas Nilsson, Henrik Functional Programming Laboratory School of Computer Science University of Nottingham United Kingdom

ISBN: (纸本)9783642404467

Argumentation theory is an interdisciplinary field studying how conclusions can be reached through logical reasoning. The notion of argument is completely general, including for example legal arguments, scientific arguments, and political arguments. Computational argumentation theory is studied in the context of artificial intelligence, and a number of computational argumentation frameworks have been put forward to date. However, there is a lack of concrete, high level realisations of these frameworks, which hampers research and applications at a number of levels. We hypothesise that the lack of suitable domain-specific languages in which to formalise argumentation frameworks is a contributing factor. In this paper, we present a formalisation of a particular computational argumentation framework, Carneades, as a case study with a view to investigate the extent to which functional languages are useful as a means to realising computational argumentation frameworks and reason about them. © 2013 Springer-Verlag.

关键词： Functional programming

来源：评论

学校读者我要写书评

暂无评论

OBTAINING EXACT INTERPOLATION MULTIVARIATE POLYNOMIAL BY APPROXIMATION

引用

Journal of Systems Science & Complexity 2011年第4期24卷 803-815页

作者： Yong FENG Xiaolin QIN Jingzhong ZHANG Xun YUAN Laboratory of Computer Reasoning and Trustworthy Computation University of Electronic b'cience and 'l~ech-nology of China Chengdu 611731 China. Laboratory for Automated Reasoning and Programming Chengdu Institute of Computer Applications ChineseAcademy of Sciences Chengdu 610041 China Graduate University of Chinese Academy of Sciences Beijing100049 China. Laborutory of Computer Reasoning and 7Yustworthy Computation University of Electronic Science and Tech-nology of China Chengdu 611731 China. Laboratory for Automated Reasoning and Programming Chengdu Institute of Computer Applications ChineseAcademy of Sciences Chengdu 610041 China.

In some fields such as Mathematics Mechanization, automated reasoning and Trustworthy Computing, etc., exact results are needed. Symbolic computations are used to obtain the exact results. Symbolic computations are of high complexity. In order to improve the situation, exact interpolating methods are often proposed for the exact results and approximate interpolating methods for the ap- proximate ones. In this paper, the authors study how to obtain exact interpolation polynomial with rational coefficients by approximate interpolating methods.

关键词： Continued fraction multivariate interpolation numerical approximate computation symbolic-numerical computation Vandermonde determinant.

来源：评论

学校读者我要写书评

暂无评论

Mixed-level embedding and JIT compilation for an iteratively staged DSL

Mixed-level embedding and JIT compilation for an iteratively...

引用

Lecture Notes in computer Science

作者： Giorgidze, George Nilsson, Henrik Functional Programming Laboratory School of Computer Science University of Nottingham United Kingdom

ISBN: (纸本)9783642207747

This paper explores how to implement an iteratively staged domain-specific language (DSL) by embedding into a functional language. The domain is modelling and simulation of physical systems where models are expressed in terms of non-causal differential-algebraic equations;i.e., sets of constraints solved through numerical simulation. What distinguishes our language is that the equational constraints are first class entities allowing for an evolving model structure characterised by repeated generation of updated constraints. Hence iteratively staged. Our DSL can thus be seen as a combined functional and constraint programming language, albeit a two-level one, with the functional language chiefly serving as a meta language. However, the two levels do interact throughout the simulation. The embedding strategy we pursue is a mixture of deep and shallow, with the deep embedding enabling just-in-time (JIT) compilation of the constraints as they are generated for efficiency, while the shallow embedding is used for the remainder for maximum leverage of the host language. The paper is organised around a specific DSL, but our implementation strategy should be applicable for iteratively staged languages in general. Our DSL itself is further a novel variation of a declarative constraint programming language. © 2011 Springer-Verlag.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

computer system modelling: A test bed for new software technologies 74

Computer system modelling: A test bed for new software techn...

引用

7th Conference on Winter Simulation, WSC 1974

作者： Willis, Ronald R. Hughes Aircraft Company Software Technology Section Computer Programming Laboratory United States

This paper discusses a technique in computer system simulation that uses models as effective tools for the study of new software technologies. This model development technique, called representative modelling, and its relationship with real-time program development are surveyed. The significant correlation between these two development processes in addition to reduced costs substantiate the effectiveness of using simulation models for the evaluation of new techniques in software development. An experiment to verify this hypothesis was conducted in which a model was developed using the methods of Top Down Development. This experiment not only indicated that models could be effective development analysis tools, but that computer system simulation is a natural environment for the use of these new software technologies. © 1974 E-flow IEEE. All rights reserved.

关键词： Software testing

来源：评论

学校读者我要写书评

暂无评论

Byzantine Failures and Security: Arbitrary is not (always) Random 33

Byzantine Failures and Security: Arbitrary is not (always) R...

引用

33. Jahrestagung der Gesellschaft fur Informatik, Schwerpunkt "Sicherheit -Schutz und Zuverlassigkeit", INFORMATIK 2003 - Mit Sicherheit Informatik, INFORMATIK 2003 - 33rd Annual Conference of the German Informatics Society. Focus "Security - Protection and Reliability", INFORMATIK 2003 - With Security Informatics, INFORMATIK 2003

作者： Gärtner, Felix C. School of Computer and Communication Sciences Distributed Programming Laboratory LausanneCH-1015 Switzerland

ISBN: (纸本)3885793652

The Byzantine failure model allows arbitrary behavior of a certain fractionof network nodes in a distributed system. It was introduced to model and analyze the effects of very severe hardware faults in aircraft control systems. Lately, the Byzantine failure model has been used in the area of network security where Byzantine-tolerance is equated with resilience against malicious attackers. We discuss two reasons why one should be careful in doing so. Firstly, Byzantinetolerance is not concerned with secrecy and so special means have to be employed if secrecy is a desired system property. Secondly, in contrast to the domain of hardware faults, in a security setting it is difficult to compute the assumption coverage of the Byzantine failure model, i.e., the probability that the failure assumption holds in practice. To address this latter point we develop a methodology which allows to estimate the reliability of a Byzantine-tolerant solution exposed to attackers of different strengths. © 2003 Gesellschaft fur Informatik (GI). All rights reserved.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

A general and flexible access-control system for the web 11

A general and flexible access-control system for the web

引用

11th USENIX Security Symposium

作者： Bauer, Lujo Schneider, Michael A. Felten, Edward W. Secure Internet Programming Laboratory Department of Computer Science Princeton University United States

ISBN: (纸本)1931971005

We describe the design, implementation, and performance of a new system for access control on the web. To achieve greater flexibility in forming access-control policies – in particular, to allow better interoperability across administrative boundaries – we base our system on the ideas of proof-carrying authorization (PCA). We extend PCA with the notion of goals and sessions, and add a module system to the proof language. Our access-control system makes it possible to locate and use pieces of the security policy that have been distributed across arbitrary hosts. We provide a mechanism which allows pieces of the security policy to be hidden from unauthorized clients. Our system is implemented as modules that extend a standard web server and web browser to use proof-carrying authorization to control access to web pages. The web browser generates proofs mechanically by iteratively fetching proof components until a proof can be constructed. We provide for iterative authorization, by which a server can require a browser to prove a series of challenges. Our implementation includes a series of optimizations, such as speculative proving, and modularizing and caching proofs, and demonstrates that the goals of generality, flexibility, and interoperability are compatible with reasonable performance. © 2002 by The USENIX Association All Rights Reserved.

关键词： Authorization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：