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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

164 篇 会议
12 篇 期刊文献
11 册 图书

馆藏范围

187 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

122 篇 工学
- 109 篇 计算机科学与技术...
- 78 篇 软件工程
- 10 篇 电气工程
- 6 篇 电子科学与技术（可...
- 5 篇 信息与通信工程
- 5 篇 控制科学与工程
- 2 篇 化学工程与技术
- 1 篇 力学（可授工学、理...
- 1 篇 机械工程
- 1 篇 材料科学与工程（可...
- 1 篇 冶金工程
- 1 篇 土木工程
- 1 篇 轻工技术与工程
- 1 篇 农业工程
- 1 篇 环境科学与工程（可...
- 1 篇 生物工程
- 1 篇 安全科学与工程
37 篇 理学
- 28 篇 数学
- 8 篇 物理学
- 3 篇 化学
- 2 篇 生物学
- 1 篇 系统科学
- 1 篇 统计学（可授理学、...
7 篇 管理学
- 4 篇 管理科学与工程(可...
- 3 篇 图书情报与档案管...
- 1 篇 工商管理
2 篇 医学
- 2 篇 基础医学(可授医学...
1 篇 农学
- 1 篇 作物学

主题

36 篇 logic programmin...
13 篇 functional progr...
9 篇 logic
9 篇 programming lang...
8 篇 mathematical log...
8 篇 logics and meani...
7 篇 software enginee...
7 篇 artificial intel...
6 篇 computer science
5 篇 programming tech...
5 篇 probabilistic lo...
5 篇 clocks
4 篇 fuzzy logic
4 篇 parallel process...
4 篇 formal logic
4 篇 programming
4 篇 semantics
4 篇 logic devices
4 篇 hardware
4 篇 haskell

机构

2 篇 ruleml inc on
2 篇 nasa ames resear...
2 篇 institut für inf...
2 篇 iohk edinburgh m...
2 篇 fraunhofer fokus...
2 篇 iohk ottawa on
2 篇 univ edinburgh e...
2 篇 department of co...
2 篇 fub inst comp sc...
2 篇 iohk mannheim
2 篇 dpto. de sistema...
2 篇 iohk england
2 篇 tech univ dresde...
2 篇 corp semant web ...
2 篇 iohk utrecht
2 篇 iohk glasgow lan...
2 篇 new mexico state...
2 篇 cau kiel inst in...
2 篇 chalmers univ te...
1 篇 univ tokyo grad ...

作者

5 篇 hanus michael
3 篇 pontelli enrico
3 篇 antoy sergio
2 篇 chakravarty manu...
2 篇 mow douglas a.
2 篇 braßel bernd
2 篇 saad emad
2 篇 current k.wayne
2 篇 mackenzie kennet...
2 篇 paschke adrian
2 篇 vinogradova poli...
2 篇 mueller jann
2 篇 herbert kuchen
2 篇 nilsson henrik
2 篇 jones michael pe...
2 篇 guild n.c.f.
2 篇 baldwin j.f.
2 篇 wadler philip
2 篇 meseguer jose
2 篇 melkonian oresti...

语言

179 篇 英文
5 篇 其他
3 篇 中文

检索条件"任意字段=9th International Symposium on Functional and Logic Programming"

共 187 条记录，以下是11-20 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

9th international symposium on Leveraging Applications of Formal Methods, Verification and Validation, ISoLA 2020

9th International Symposium on Leveraging Applications of Fo...

引用

9th international symposium on Leveraging Applications of Formal Methods, Verification and Validation, ISoLA 2020

ISBN: (纸本)9783030614669

the proceedings contain 93 papers. the special focus in this conference is on Leveraging Applications of Formal Methods, Verification and Validation. the topics include: Bitcoin Covenants Unchained;designing a Demonstrator of Formal Methods for Railways Infrastructure Managers;specifying Framing Conditions for Smart Contracts;making Tezos Smart Contracts More Reliable with Coq;UTxO- vs Account-Based Smart Contract Blockchain programming Paradigms;Native Custom Tokens in the Extended UTXO Model;UTXOma : UTXO with Multi-asset Support;towards Configurable and Efficient Runtime Verification of Blockchain Based Smart Contracts at the Virtual Machine Level;introduction;reliable Smart Contracts;compiling Quantitative Type theory to Michelson for Compile-Time Verification and Run-time Efficiency in Juvix;efficient Static Analysis of Marlowe Contracts;accurate Smart Contract Verification through Direct Modelling;smart Derivatives: On-Chain Forwards for Digital Assets;the Good, the Bad and the Ugly: Pitfalls and Best Practices in Automated Sound Static Analysis of Ethereum Smart Contracts;automated Verification of Embedded Control Software: Track Introduction;a Model-Based Approach to the Design, Verification and Deployment of Railway Interlocking System;guess What I’m Doing!: Rendering Formal Verification Methods Ripe for the Era of Interacting Intelligent Systems;on the Industrial Application of Critical Software Verification with VerCors;a Concept of Scenario Space Exploration with Criticality Coverage Guarantees: Extended Abstract;functional Verification of Smart Contracts via Strong Data Integrity;towards Automated Service-Oriented Verification of Embedded Control Software Modeled in Simulink;verifying Safety Properties of Robotic Plans Operating in Real-World Environments via logic-Based Environment Modeling;formally Proving Compositionality in Industrial Systems with Informal Specifications.

关键词：

来源：评论

学校读者我要写书评

暂无评论

FSCAFI: A Core Calculus for Collective Adaptive Systems programming 9th

FSCAFI: A Core Calculus for Collective Adaptive Systems Prog...

引用

9th international symposium on Leveraging Applications of Formal Methods, Verification and Validation

作者： Casadei, Roberto Viroli, Mirko Audrito, Giorgio Damiani, Ferruccio Alma Mater Studiorum Univ Bologna Cesena Italy Univ Torino Turin Italy

ISBN: (纸本)9783030614690;9783030614706

A recently proposed approach to the rigorous engineering of collective adaptive systems is the aggregate computing paradigm, which operationalises the idea of expressing collective adaptive behaviour by a global perspective as a functional composition of dynamic computational fields (i.e., structures mapping a collection of individual devices of a collective to computational values over time). In this paper, we present FSCAFI, a core language that captures the essence of exploiting field computations in mainstream functional languages, and which is based on a semantic model for field computations leveraging the novel notion of "computation against a neighbour". Such a construct models expressions whose evaluation depends on the same evaluation that occurred on a neighbour, thus abstracting communication actions and, crucially, enabling deep and straightforward integration in the Scala programming language, by the SCAFI incarnation. We cover syntax and informal semantics of FScaFi, provide examples of collective adaptive behaviour development in SCAFI, and delineate future work.

关键词： Adaptive systems

来源：评论

学校读者我要写书评

暂无评论

Guaranteeing Type Consistency in Collective Adaptive Systems 9th

Guaranteeing Type Consistency in Collective Adaptive Systems

引用

9th international symposium on Leveraging Applications of Formal Methods, Verification and Validation

作者： Schuermann, Jonas Tegeler, Tim Steffen, Bernhard TU Dortmund Univ Chair Programming Syst Dortmund Germany

ISBN: (纸本)9783030614690;9783030614706

Collective adaptive systems whose entities are loosely coupled by their exchange of complex data structures became a very common architecture for distributed web-based systems. As HTTP-based APIs transfer data as plain text, this exchange is very error prone: API changes and malicious data modifications may remain unnoticed. GraphQL addresses this concern at the server side with strong typing but leaves the clients untouched. In this paper we present an approach to align the type schemas provided by GraphQL and type definitions at the client side on three levels during the systems' life cycles: At generation time by verifying queries against the GraphQL schema, at compile time by leveraging TypeScript's type system, and at run time by using decoders to validate payloads. Key to our solution are a functional, type-safe domain-specific language for the definition of GraphQL queries and a corresponding generator implementation providing the GraphQL queries and TypeScript artefacts. Together they ensure that clients become aware of and are able to react to changes of the (evolving) GraphQL schema, a precondition for maintaining the consistency of the overall collective adaptive system. We will illustrate our approach along a popular Github-based, collaborative development scenario.

关键词： Domain-Specific Language GraphQL Type Safety TypeScript Web Service

来源：评论

学校读者我要写书评

暂无评论

How to Win First-Order Safety Games 21st

How to Win First-Order Safety Games

引用

21st international Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI) part of the 47th ACM SIGPLAN symposium on Principles of programming Languages (POPL)

作者： Seidl, Helmut Mueller, Christian Finkbeiner, Bernd Tech Univ Munich Munich Germany Saarland Univ Saarbrucken Germany

ISBN: (纸本)9783030393229;9783030393212

First-order (FO) transition systems have recently attracted attention for the verification of parametric systems such as network protocols, software-defined networks or multi-agent workflows like conference management systems. functional correctness or noninterference of these systems have conveniently been formulated as safety or hypersafety properties, respectively. In this article, we take the step from verification to synthesis-tackling the question whether it is possible to automatically synthesize predicates to enforce safety or hypersafety properties like noninterference. For that, we generalize FO transition systems to FO safety games. For FO games with monadic predicates only, we provide a complete classification into decidable and undecidable cases. For games with non-monadic predicates, we concentrate on universal first-order invariants, since these are sufficient to express a large class of properties-for example noninterference. We identify a non-trivial subclass where invariants can be proven inductive and FO winning strategies be effectively constructed. We also show how the extraction of weakest FO winning strategies can be reduced to SO quantifier elimination itself. We demonstrate the usefulness of our approach by automatically synthesizing nontrivial FO specifications of messages in a leader election protocol as well as for paper assignment in a conference management system to exclude unappreciated disclosure of reports.

关键词： First order safety games Universal invariants First Order logic Second order quantifier elimination

来源：评论

学校读者我要写书评

暂无评论

UTXOma: UTXO with Multi-asset Support 9th

UTXOma: UTXO with Multi-asset Support

引用

9th international symposium on Leveraging Applications of Formal Methods, Verification and Validation

作者： Chakravarty, Manuel M. T. Chapman, James MacKenzie, Kenneth Melkonian, Orestis Mueller, Jann Jones, Michael Peyton Vinogradova, Polina Wadler, Philip Zahnentferner, Joachim IOHK Utrecht Netherlands IOHK Glasgow Lanark Scotland IOHK Edinburgh Midlothian Scotland IOHK Mannheim Germany IOHK London England IOHK Ottawa ON Canada Univ Edinburgh Edinburgh Midlothian Scotland Wan Chai Hong Kong Peoples R China

ISBN: (纸本)9783030614669;9783030614676

A prominent use case of Ethereum smart contracts is the creation of a wide range of user-defined tokens or assets by way of smart contracts. User-defined assets are non-native on Ethereum;i.e., they are not directly supported by the ledger, but require repetitive custom code. this makes them unnecessarily inefficient, expensive, and complex. It also makes them insecure as numerous incidents on Ethereum have demonstrated. Even without stateful smart contracts, the lack of perfect fungibility of Bitcoin assets allows for implementing user-defined tokens as layer-two solutions, which also adds an additional layer of complexity. In this paper, we explore an alternative design based on Bitcoin-style UTXO ledgers. Instead of introducing general scripting capabilities together with the associated security risks, we propose an extension of the UTXO model, where we replace the accounting structure of a single cryptocurrency with a new structure that manages an unbounded number of user-defined, native tokens, which we call token bundles. Token creation is controlled by forging policy scripts that, just like Bitcoin validator scripts, use a small domain-specific language with bounded computational expressiveness, thus favouring Bitcoin's security and computational austerity. the resulting approach is lightweight, i.e., custom asset creation and transfer is cheap, and it avoids use of any global state in the form of an asset registry or similar. the proposed UTXOma model and the semantics of the scripting language have been formalised in the Agda proof assistant.

关键词： Blockchain UTXO Native tokens functional programming

来源：评论

学校读者我要写书评

暂无评论

Native Custom Tokens in the Extended UTXO Model 9th

Native Custom Tokens in the Extended UTXO Model

引用

9th international symposium on Leveraging Applications of Formal Methods, Verification and Validation

作者： Chakravarty, Manuel M. T. Chapman, James MacKenzie, Kenneth Melkonian, Orestis Mueller, Jann Jones, Michael Peyton Vinogradova, Polina Wadler, Philip IOHK Utrecht Netherlands IOHK Glasgow Lanark Scotland IOHK Edinburgh Midlothian Scotland IOHK Mannheim Germany IOHK London England IOHK Ottawa ON Canada Univ Edinburgh Edinburgh Midlothian Scotland

ISBN: (纸本)9783030614669;9783030614676

User-defined tokens-both fungible ERC-20 and non-fungible ERC-721 tokens-are central to the majority of contracts deployed on Ethereum. User-defined tokens are non-native on Ethereum;i.e., they are not directly supported by the ledger, but require custom code. this makes them unnecessarily inefficient, expensive, and complex. the Extended UTXO Model (EUTXO) [5] has been introduced as a generalisation of Bitcoin-style UTXO ledgers, allowing support of more expressive smart contracts, approaching the functionality available to contracts on Ethereum. Specifically, a bisimulation argument established a formal relationship between the EUTXO ledger and a general form of state machines. Nevertheless, transaction outputs in the EUTXO model lock integral quantities of a single native cryptocurrency only, just like Bitcoin. In this paper, we study a generalisation of the EUTXO ledger model with native user-defined tokens. Following the approach proposed in a companion paper [4] for the simpler case of plain Bitcoin-style UTXO ledgers, we generalise transaction outputs to lock not merely coins of a single cryptocurrency, but entire token bundles, including custom tokens whose forging is controlled by forging policy scripts. We show that this leads to a rich ledger model that supports a broad range of interesting use cases. Our main technical contribution is a formalisation of the multi-asset EUTXO ledger in Agda, which we use to establish that the ledger with custom tokens is strictly more expressive than the original EUTXO ledger. In particular, we state and prove a transfer result for inductive and temporal properties from state machines to the multi-asset EUTXO ledger, which was out of scope for the single-currency EUTXO ledger. In practical terms, the resulting system is the basis for the smart contract system of the Cardano blockchain.

关键词： Blockchain UTXO Tokens functional programming State machines Bisimulation

来源：评论

学校读者我要写书评

暂无评论

Scala 2018 - Proceedings of the 9th ACM SIGPLAN international symposium on Scala, co-located with ICFP 2018

Scala 2018 - Proceedings of the 9th ACM SIGPLAN Internationa...

引用

9th ACM SIGPLAN international symposium on Scala, Scala 2018, Part of the ACM SIGPLAN international Conference on functional programming, ICFP 2018

ISBN: (纸本)9781450358361

the proceedings contain 9 papers. the topics discussed include: a domain-specific language for microservices;parser combinators for context-free path querying;garnishing parsec with parsley;path dependent types with path-equality;kDOT: scaling DOT with mutation and constructors;truly abstract interfaces for algebraic data types: the extractor typing problem;interflow: interprocedural flow-sensitive type inference and method duplication;and extending scala with records: design, implementation, and evaluation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Verified Memoization and Dynamic programming 9th

Verified Memoization and Dynamic Programming

引用

9th international Conference on Interactive theorem Proving (ITP) Held as Part of the Federated logic Conference (FloC)

作者： Wimmer, Simon Hu, Shuwei Nipkow, Tobias Tech Univ Munich Fak Informat Munich Germany

ISBN: (纸本)9783319948218;9783319948201

We present a lightweight framework in Isabelle/HOL for the automatic verified (functional or imperative) memoization of recursive functions. Our tool constructs a memoized version of the recursive function and proves a correspondence theorem between the two functions. A number of simple techniques allow us to achieve bottom-up computation and space-efficient memoization. the framework's utility is demonstrated on a number of representative dynamic programming problems.

关键词： Recursive functions

来源：评论

学校读者我要写书评

暂无评论

Combining Static and Dynamic Contract Checking for Curry 27th

Combining Static and Dynamic Contract Checking for Curry

引用

27th international symposium on logic-Based Program Synthesis and Transformation (LOPSTR)

作者： Hanus, Michael CAU Kiel Inst Informat D-24098 Kiel Germany

ISBN: (纸本)9783319944609;9783319944593

Static type systems are usually not sufficient to express all requirements on function calls. Hence, contracts with pre-and postconditions can be used to express more complex constraints on operations. Contracts can be checked at run time to ensure that operations are only invoked with reasonable arguments and return intended results. Although such dynamic contract checking provides more reliable program execution, it requires execution time and could lead to program crashes that might be detected with more advanced methods at compile time. To improve this situation for declarative languages, we present an approach to combine static and dynamic contract checking for the functional logic language Curry. Based on a formal model of contract checking for functional logic programming, we propose an automatic method to verify contracts at compile time. If a contract is successfully verified, dynamic checking of it can be omitted. this method decreases execution time without degrading reliable program execution. In the best case, when all contracts are statically verified, it provides trust in the software since crashes due to contract violations cannot occur during program execution.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

DECOM: A framework to support evolution of IoT services 18

DECOM: A framework to support evolution of IoT services

引用

9th international symposium on Information and Communication Technology (SoICT)

作者： Huu Tam Tran Jahl, Alexander Geihs, Kurt Kuppili, Ramaprasad Xuan thang Nguyen thi thanh Binh Huynh Univ Kassel Distributed Syst Grp Kassel Germany Univ Hanoi Fac Informat Technol Hanoi Vietnam Hanoi Univ Sci & Technol Hanoi Vietnam

ISBN: (纸本)9781450365390

In the heterogeneous and dynamic Internet of things (IoT), applications and services are frequently subject to change for various reasons such as maintaining their functionality, reliability, availability, and performance. Detecting and communicating these changes are still performed manually by responsible developers and administrators. Such a mechanism will not be adequate anymore in the future of large-scale IoT environments. therefore, we present a comprehensive framework named DECOM for automatic detection and communication of service changes. Here, we assume that capabilities and interfaces of IoT devices are described and provided through REST services. To be able to detect syntactic as well as semantic changes, we transform an extended version of the interface description into a logic program and apply a sequence of analysis steps to detect changes. the feasibility and applicability of the framework are demonstrated in an IoT application scenario.

关键词： Service Evolution Answer Set programming Change Detection Internet of things Service Co-evolution

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共19页 << < 1 2 3 4 5 6 7 8 9 10 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：