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

35th IEEE-Computer-Society Workshop on Security and Privacy (SP)

作者： Bogk, Andreas Schoepl, Marco HERE Berlin Germany Humboldt Univ Inst Informat Berlin Germany

ISBN: (纸本)9781479951031

Parsers for complex data formats generally present a big attack surface for input-driven exploitation. In practice, this has been especially true for implementations of the PDF data format, as witnessed by dozens of known vulnerabilities exploited in many real world attacks, with the Acrobat Reader implementation being the main target. In this report, we describe our attempts to use Coq, a theorem prover based on a functional programming language making use of dependent types and the Curry-Howard isomorphism, to implement a formally verified PDF parser. We ended up implementing a subset of the PDF format and proving termination of the combinator-based parser. Noteworthy results include a dependent type representing a list of strictly monotonically decreasing length of remaining symbols to parse, which allowed us to show termination of parser combinators. Also, difficulties showing termination of parsing some features of the PDF format readily translated into denial of service attacks against existing PDF parsers-we came up with a single PDF file that made all the existing PDF implementations we could test enter an endless loop.

关键词： document handling functional programming grammars security of data theorem proving Acrobat Reader implementation Coq Curry-Howard isomorphism PDF data format combinator-based parser complex data formats denial of service attacks formally verified PDF parser functional programming language input-driven exploitation parser combinators protocol design theorem prover Indexes Portable document format Privacy Security Software Syntactics Writing Portable document format functional programming language PDF gene electronic document handling Parser syntax Data Security theorem proving functional programming DoS attack Writing Privacy Parsing computer software data formats

来源：评论

学校读者我要写书评

暂无评论

The Problem with Data 14

The Problem with Data

引用

IEEE/ACM 7th International Conference on Utility and Cloud Computing (UCC)

作者： Fritsch, Joerg Walker, Coral Cardiff Univ Sch Comp Sci & Informat Cardiff CF24 3AA S Glam Wales

ISBN: (纸本)9781479978816

Utility Computing requires levels of efficacy and abstraction that are not matched by modern computing clouds. In this paper we argue that the lack of harmonization of data and computation is holding back computing clouds from evolving further into utility clouds. Data gravity is perceived as gravity pull associated with data volume. Data of large volume develop large gravity that pulls computation to it, which contrasts with the computation-centered principle of current computing clouds, where computational resources are centralized and fixed. Based on previous research, eight principles are identified to suggest an infrastructure for a future data-driven utility computing platform. The paper also argues that tuple spaces and functional programming languages together would be a powerful combination to meet the requirements for this next-generation computing utility.

关键词： functional languages functional programming utility programs centralized-fixed computational resources computation-centered principle data computation data gravity data harmonization data volume data-driven utility computing platform functional programming languages gravity pull next-generation computing utility tuple spaces Cloud computing Computational modeling Data models Distributed databases Fabrics Gravity programming functional programming Utility routines distributed databases Gravity data models Cloud Computing Computational modeling Textile fabrics fabric programming Utility computing functional programming language Clouds

来源：评论

学校读者我要写书评

暂无评论

Loop Program Mapping and Compact Code Generation for Programmable Hardware Accelerators

Loop Program Mapping and Compact Code Generation for Program...

引用

IEEE International Conference on Application-specific Systems, Architectures and Processors

作者： Srinivas Boppu Frank Hannig Jürgen Teich Hardware/Software Co-Design Department of Computer Science University of Erlangen-Nuremberg Germany

ISBN: (纸本)9781479904945

We present a novel design methodology for the mapping of nested loops onto programmable hardware accelerators. Key features of our approach are: (1) Design entry in form of a functional programming language and loop parallelization in the polyhedron model, (2) the underlying accelerator architectures consist of lightweight, tightly-coupled, and programmable processor arrays, which can exploit both loop-level parallelism and instruction-level parallelism, (3) support of zero-overhead looping not only for inner most loops but also for arbitrarily nested loops. We implemented the proposed methodology in a prototype design tool and evaluated selected benchmarks by comparing our code generator with the Trimaran compilation framework. As the results show, our approach can reduce the size of the generated processor codes up to 64 % while at the same time achieving a significant higher throughput.

关键词： mapping Loop Program Mapping Compact Code Generation MAPPING(MATHEMATICAL) Code generation hardware accelerator Loops Accelerator architectures PROGRAMMABLE ARRAY PROCESSORS functional programming language mapping instruction-level parallelism Contraceptive Coil NESTED LOOPS

来源：评论

学校读者我要写书评

暂无评论

Assertion Based Verification Using PSL-like Properties In Haskell

Assertion Based Verification Using PSL-like Properties In Ha...

引用

IEEE International Symposium on Design and Diagnostics of Electronic Circuits & Systems

作者： B. N. Uchevler Kjetil Svarstad Norwegian University of Science and Technology

ISBN: (纸本)9781467361354

With the increasing complexity of designs, the verification costs grow considerably. Using Assertion Based Verification with assertions implemented on real hardware, can speed up the verification process. Property Specification language is one of the common standards for describing formal properties and specifications of a design. We implemented a subset of PSL operations in Haskell in this work. A functional programming language like Haskell can appear as an advantageous choice for formal verification and high-level descriptions. We use the implemented PSL operators to set up different synthesizable PSL properties. The implemented PSL operators are tested on an FPGA for an AMBA AHB-based system which is also implemented in Haskell.

关键词： functional programming Verification Formal verification Specifications Field programmable gate arrays functional programming language

来源：评论

学校读者我要写书评

暂无评论

Deterministic Parallel programming with Haskell

引用

COMPUTING IN SCIENCE & ENGINEERING 2012年第6期14卷 36-42页

作者： Coutts, Duncan Loh, Andres Well-Typed LLP Well-Typed LLP

Haskell is a modern, functional programming language with an interesting story to tell about parallelism: rather than using concurrent threads and locks, Haskell offers a variety of libraries that enable concise, high-level parallel programs with results that are guaranteed to be deterministic (independent of the number of cores and the scheduling being used).

关键词： Parallel programming functional languages functional programming Haskell Code Deterministic Parallel programming functional programming language High Level Parallel Programs Parallel Processing Concurrent Computing Parallel programming Poisson Equations Message Systems Computer languages programming Scientific Computing High Performance Code Haskell Applicative functional programming Concurrent programming

来源：评论

学校读者我要写书评

暂无评论

Parallelization of Termination Checker for Term Rewriting System

Parallelization of Termination Checker for Term Rewriting Sy...

引用

IEEE International Conference on Systems, Man, and Cybernetics

作者： Rui Ding Haruhiko Sato Masahito Kurihara Graduate School of Information Science and Technology Hokkaido University

ISBN: (纸本)9781467317139

An inductive theorem is an equation over terms which holds on recursively-defined data structure. In the field of formal verification of information system, inductive theorem proving plays an important role. Rewriting induction(RI) is a method for inductive theorem proving proposed by Reddy. Multi-context rewriting induction with termination checker (MRIt) proposed by Sato is a variant of RI which tries to find a suitable context for induction automatically. However, MRIt should perform a large amount of termination checking of term rewriting systems which is becoming efficiency bottleneck. In this paper, we propose a method of parallelizing the termination checker used in MRIt based on the lexicographic path order method to improve its efficiency. For implementation, we used the functional programming language Erlang. We discuss the efficiency of our implementation based on the experiments.

关键词： Term Rewriting Systems Termination Parallelization rewriting systems parallelization checker functional programming language theorem proving stopping Formal verification Computer based information systems remedial investigation

来源：评论

学校读者我要写书评

暂无评论

Higher-Order Model Checking: From Theory to Practice

Higher-Order Model Checking: From Theory to Practice

引用

26th Annual IEEE Symposium on Logic in Computer Science (LICS)

作者： Kobayashi, Naoki Tohoku Univ Sendai Miyagi 980 Japan

ISBN: (纸本)9780769544120

The model checking of higher-order recursion schemes (higher-order model checking for short) has been actively studied in the last decade, and has seen significant progress in both theory and practice. From a practical perspective, higher-order model checking provides a foundation for software model checkers for functional programming languages such as ML and Haskell. This short article aims to provide an overview of the recent progress in higher-order model checking and discuss future directions.

关键词： Model checking higher-order theories functional programming language Computer programming languages functional programming

来源：评论

学校读者我要写书评

暂无评论

Erlang

引用

COMMUNICATIONS OF THE ACM 2010年第9期53卷 68-75页

作者： Armstrong, Joe Ericsson Business Unit Networks Stockholm Sweden

The article presents information on Erlang, a computer programming language available under an open-source license. It is described as a concurrent language which works well for multicore computers. Erlang was developed at the Ericsson telecommunications firm with an emphasis on fault-tolerance, and is said to use a non-defensive programming style which deals with crashes by passing only complete and self-contained messages from machine to machine. This method is described as scaling well, since it allows components to crash without affecting the overall system.

关键词： message passing Multi-core processors programming Computers shared memory Erlang functional programming language program language

来源：评论

学校读者我要写书评

暂无评论

Robin Milner, a Craftsman of Tools for the Mind

Robin Milner, a Craftsman of Tools for the Mind

引用

25th Annual IEEE Symposium on Logic in Computer Science (LICS 2010)

作者： Plotkin, Gordon D. Univ Edinburgh Sch Informat Lab Fdn Comp Sci Edinburgh Midlothian Scotland

The paper discusses about the programming language ML (or Metalanguage) as a language for manipulating formal systems. It has also had much influence on the further development of functional programming languages.

ISBN: (纸本)9780769541143

关键词： ML language formal system manipulation functional programming language meta language programming languages

来源：评论

学校读者我要写书评

暂无评论

functional Parallel programming Environment For Multicore Computers and Clusters

Functional Parallel Programming Environment For Multicore Co...

引用

2007年国际电子商务、工程及科学领域的分布式计算和应...

作者： S.E. Bazhanov V.P. Kutepov M.M. Vorontsov Applied Mathematics Department Moscow Power Engineering Institute （Technical University） ul. Krasnokazarmennaya 14 Moscow 111250 Russia

In the paper, a functional parallel programming system for clusters and multicore computers is discussed. It includes a language of parallel programming, program development tools, and tools for controlling parallel execution on the computer system. Central part of the system is original parallel compositional functional programming language FPTL （functional Parallel Typified language）.

关键词： Parallel programming Cluster Multicore Computer functional programming language Parallel Software Tools.

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：