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

15th acm-IEEE International conference on Formal Methods and Models for System design (MEMOCODE)

作者： Grosch, Franz-Josef Robert Bosch GmbH Gerlingen Germany

ISBN: (纸本)9781450350938

Product development at companies such as Bosch requires systems engineering for digital hardware and mechatronic components as well as software engineering for resource-constrained real-time applications cooperating with distributed server applications. While many of the involved engineering disciplines greatly benefit from model-based approaches and from advances in software infrastructures, deeply embedded software still is written in C since the seventies and runs on platforms designed in the nineties (e.g. OSEK). Simulation tools like Simulink or Modelica are used to test discrete code against continuous plant models or to generate code for certain aspects, but they do not really provide modern implementation technologies to address software architecture and qualities or to make embedded programming "attractive" for software *** regard synchronous languages as suitable to solve many of the issues in the integration (causality) and synchronisation (clocks) of time-triggered and event-triggered embedded functions that exhibit their behaviour over time steps and are coordinated according to their mode-switching in a structured synchronous control flow. Searching for an imperative synchronous language (with deterministic concurrent composition, and synchronous control flow), equipped with features for encapsulation and composition (objects, packages, separate compilation) and supporting programming parallel tasks deployed to separate cores (clock refinement and deterministic inter-task communication), we ended up in designing our own language, suitable for resource-constrained, real-time applications running on multi-core *** will explain the main requirements and features of this language, how they integrate with the principles of a synchronous language, how they can be applied to typical everyday problems in embedded development, and how such locally synchronous services may integrate in a globally asynchronous service architecture.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Static Analysis for Probabilistic Programs: Inferring Whole Program Properties from Finitely Many Paths 13

Static Analysis for Probabilistic Programs: Inferring Whole ...

引用

acm sigplan conference on programming language design and implementation

作者： Sriram Sankaranarayanan Aleksandar Chakarov Sumit Gulwani University of Colorado Microsoft Research

ISBN: (纸本)9781450320146

We propose an approach for the static analysis of probabilistic programs that sense, manipulate, and control based on uncertain data. Examples include programs used in risk analysis, medical decision making and cyber-physical systems. Correctness properties of such programs take the form of queries that seek the probabilities of assertions over program variables. We present a static analysis approach that provides guaranteed interval bounds on the values (assertion probabilities) of such queries. First, we observe that for probabilistic programs, it is possible to conclude facts about the behavior of the entire program by choosing a finite, adequate set of its paths. We provide strategies for choosing such a set of paths and verifying its adequacy. The queries are evaluated over each path by a combination of symbolic execution and probabilistic volume-bound computations. Each path yields interval bounds that can be summed up with a "coverage" bound to yield an interval that encloses the probability of assertion for the program as a whole. We demonstrate promising results on a suite of benchmarks from many different sources including robotic manipulators and medical decision making programs.

关键词： Probabilistic programming Program Verification Volume Bounding Symbolic Execution Monte-Carlo Sampling

来源：评论

学校读者我要写书评

暂无评论

IMAGE a language for the interactive manipulation of a graphics environment

IMAGE a language for the interactive manipulation of a graph...

引用

2nd International conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1975

作者： O'Brien, C.D. Bown, H.G. Communications Research Centre Department of Communications Government of Canada Canada

This paper addresses itself to the problems involved in programming an interactive computer graphics display. A list of graphical programming facilities considered necessary for an interactive graphic programming language is presented. An examination of several application programs, written in a variety of existing languages, revealed that many of these facilities are usually lacking. This paper presents the design of a new interactive graphics language 'IMAGE', developed specifically to satisfy the above criteria. The language places particular emphasis on providing a graphics application programmer the ability to program graphical interaction. The 'IMAGE' language utilizes the better features of several current graphic languages and combines these features with a unique interaction control structure. This OBJECT / ACTION control structure, the display picture description syntax and the hardware independent handling of input devices are the main features of the language, providing excellent graphical input response and drawing facilities. The device independent input / output structure permits the implementation of a portable language syntax, since there are no references to display hardware devices. All display references are performed through a virtual terminal. This paper contains a detailed description of the main features of the language and these features are illustrated in an example 'IMAGE' program.

关键词： Display devices

来源：评论

学校读者我要写书评

暂无评论

design considerations for microprogramming languages 74

Design considerations for microprogramming languages

引用

1974 National Computer conference, AFIPS 1974

作者： Lloyd, Gregory R. Van Dam, Andries Brown University ProvidenceRI United States

ISBN: (纸本)9781450379205

Historically, microprograms have been developed using tools which are appropriate to logic designers (block diagrams, register transfer languages), or systems programmers (microcode assemblers). With the growth of user microprogramming, and the increased demands placed upon computer manufacturers for firmware support, improved tools and techniques have been suggested. In particular, microprogram compilers, i.e., compilers which translate high level source statements into sequences of microprogram control words, have been proposed and implemented. The larger issue to be faced is the nebulous task of supporting the needs of a community which includes: Manufacturers developing one particular computer (target machine) using microprogramming as a design and implementation technique. Manufacturers developing a computersystem, integrating hardware, operating systems, and programming language support, utilizing microprogramming to tie system functions together. Users developing their own target machines tailored to applications such as computer graphics, signal processing, or interpretation of higher level languages. Users or manufacturers who utilize hardware which is microprogrammable to directly solve one or more specific problems, without formally defining a target machine (i.e., simply programming the hardware, or host machine). © acm-conference. All rights reserved.

关键词： Microprogramming

来源：评论

学校读者我要写书评

暂无评论

Automatic inversion generates divide-and-conquer parallel programs

引用

acm sigplan NOTICES 2007年第6期42卷 146-155页

作者： Morita, Kazutaka Morihata, Akimasa Matsuzaki, Kiminori Hu, Zhenjiang Takeichi, Masato Univ Tokyo Grad Sch Informat Sci & Technol Tokyo Japan

Divide-and-conquer algorithms are suitable for modern parallel machines, tending to have large amounts of inherent parallelism and working well with caches and deep memory hierarchies. Among others, list homomorphisms are a class of recursive functions on lists, which match very well with the divide-and-conquer paradigm. However, direct programming with list homomorphisms is a challenge for many programmers. In this paper, we propose and implement a novel system that can automatically derive cost-optimal list homomorphisms from a pair of sequential programs, based on the third homomorphism theorem. Our idea is to reduce extraction of list homomorphisms to derivation of weak right inverses. We show that a weak right inverse always exists and can be automatically generated from a wide class of sequential programs. We demonstrate our system with several nontrivial examples, including the maximum prefix sum problem, the prefix sum computation, the maximum segment sum problem, and the line-of-sight problem. The experimental results show practical efficiency of our automatic parallelization algorithm and good speedups of the generated parallel programs.

关键词： algorithms design languages divide-and-conquer parallelism inversion program transformation third homomorphism theorem

来源：评论

学校读者我要写书评

暂无评论

iTasks: Executable specifications of interactive work flow systems for the web

引用

acm sigplan NOTICES 2007年第9期42卷 141-152页

作者： Plasmeijer, Rinus Achten, Peter Koopman, Pieter Radboud Univ Nijmegen Inst Comp & Informat Sci Software Technol Dept NL-6525 ED Nijmegen Netherlands

In this paper we introduce the iTask system: a set of combinators to specify work flows in a pure functional language at a very high level of abstraction. Work flow systems are automated systems in which tasks are coordinated that have to be executed by humans and computers. The combinators that we propose support work flow patterns commonly found in commercial work flow systems. Compared with most of these commercial systems, the iTask system offers several advantages: tasks are statically typed, tasks can be higher order, the combinators are fully compositional, dynamic and recursive work flows can be specified, and last but not least, the specification is used to generate an executable web-based multi-user work flow application. With the iTask system, useful work flows can be defined which cannot be expressed in other systems: work can be interrupted and subsequently directed to other workers for further processing. The implementation is special as well. It is based on the Clean iData toolkit which makes it possible to create fully dynamic, interactive, thin client web applications. Thanks to the generic programming techniques used in the iData toolkit, the programming effort is reduced significantly: state handling, form rendering, user interaction, and storage management is handled automatically. The iTask system allows a task to be regarded as a special kind of persistent redex being reduced by the application user via task completion. The combinators control the order in which these redexes are made available to the application user. The system rewrites the persistent task redexes in a similar way as functions are rewritten in lazy functional languages.

关键词： design languages clean iData iTask

来源：评论

学校读者我要写书评

暂无评论

Quantitative Network Monitoring with NetQRE 17

Quantitative Network Monitoring with NetQRE

引用

conference of the acm-Special-Interest-Group-on-Data-Communication (SIGCOMM)

作者： Yuan, Yifei Lin, Dong Mishra, Ankit Marwaha, Sajal Alur, Rajeev Loo, Boon Thau Univ Penn Philadelphia PA 19104 USA LinkedIn Inc Mountain View CA USA

ISBN: (纸本)9781450346535

In network management today, dynamic updates are required for traffic engineering and for timely response to security threats. Decisions for such updates are based on monitoring network traffic to compute numerical quantities based on a variety of network and application-level performance metrics. Today's state-of-the-art tools lack programming abstractions that capture application or session-layer semantics, and thus require network operators to specify and reason about complex state machines and interactions across layers. To address this limitation, we present the design and implementation of NetQRE, a high-level declarative toolkit that aims to simplify the specification and implementation of such quantitative network policies. NetQRE integrates regular-expression-like pattern matching at flow-level as well as application-level payloads with aggregation operations such as sum and average counts. We describe a compiler for NetQRE that automatically generates an efficient implementation with low memory footprint. Our evaluation results demonstrate that NetQRE allows natural specification of a wide range of quantitative network tasks ranging from detecting security attacks to enforcing application-layer network management policies. NetQRE results in high performance that is comparable with optimized manually-written low-level code and is significantly more efficient than alternative solutions, and can provide timely enforcement of network policies that require quantitative network monitoring.

关键词： NetQRE network monitoring language quantitative regular expression

来源：评论

学校读者我要写书评

暂无评论

1st International conference on Scientific Computing in Object-Oriented Parallel Environments, ISCOPE 1997

1st International Conference on Scientific Computing in Obje...

引用

1st International conference on Scientific Computing in Object-Oriented Parallel Environments, ISCOPE 1997

ISBN: (纸本)354063827X

The proceedings contain 36 papers. The special focus in this conference is on Scientific Computing in Object-Oriented Parallel Environments. The topics include: Run-time support for multi-tier programming of block-structured applications on SMP clusters;automatic run-time code generation in C++;a comparison of performance-enhancing strategies for parallel numerical object-oriented frameworks;design and performance improvement of a real-world, object-oriented C++ solver with STL;evaluating high level parallel programming support for irregular applications in ICC++;processing sparse vectors during compile time in C++;the design and evolution of the MPI-2 C++ interface;efficient extensible synchronization in sather;towards a parallel C++ programming language based on commodity object-oriented technologies;a compile-time meta-level architecture supporting class specific optimization;an object-oriented approach to the implementation of a high-level data parallel language;a framework for parallel adaptive finite element methods and its template based implementation in CC++;parallel array class implementation using C++ STL adaptors;a multithreaded java framework for solving linear elliptic partial differential equations in 3D;automatic binding of native scientific libraries to java;the java parallel environment;an architecture in java for mobile computation;the extensible java preprocessor kit and a tiny data-parallel java;numerical solution of PDEs on parallel computers utilizing sequential simulators;a parallel CFD 3-dimensional code;an object-oriented framework for solving partial differential equations;optimization of data-parallel field expressions in the POOMA framework and MC++ and a transport physics framework.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Incrementalization across object abstraction

引用

acm sigplan NOTICES 2005年第10期40卷 473-486页

作者： Liu, YA Stoller, SD Gorbovitski, M Rothamel, T Liu, YE SUNY Stony Brook Dept Comp Sci Stony Brook NY 11794 USA Univ Manitoba Dept Comp Sci Winnipeg MB R3T 2N2 Canada

Object abstraction supports the separation of what operations are provided by systems and components from how the operations are implemented, and is essential in enabling the construction of complex systems from components. Unfortunately, clear and modular implementations have poor performance when expensive query operations are repeated, while efficient implementations that incrementally maintain these query results are much more difficult to develop and to understand, because the code blows up significantly, and is no longer clear or modular. This paper describes a powerful and systematic method that first allows the "what" of each component to be specified in a clear and modular fashion and implemented straightforwardly in an object-oriented language;then analyzes the queries and updates, across object abstraction, in the straightforward implementation: and finally derives the sophisticated and efficient "how;, of each component by incrementally maintaining the results of repeated expensive queries with respect to updates to their parameters. Our implementation and experimental results for example applications in query optimization, role-based access control, etc. demonstrate tire effectiveness and benefit of the method.

关键词： design languages performance abstraction design program transformation incrementalization invariants program analysis program optimization object-oriented

来源：评论

学校读者我要写书评

暂无评论

Pattern matching for design concept localization

Pattern matching for design concept localization

引用

2nd Working conference on Reverse Engineering

作者： KONTOGIANNIS, K DEMORI, R BERNSTEIN, M GALLER, M MERLO, E MCGILL UNIV SCH COMP SCIMONTREALPQ H3A 2A7CANADA

ISBN: (纸本)0818671114

The effective synergy of a number of different techniques is the key to the successful development of an efficient Reverse Engineering environment. Compiler technology, pattern matching techniques, visualization tools, and software repositories play an important role for the identification of procedural, data, and abstract-data-type related concepts in the source code. This paper describes a number of techniques used for the development of a distributed reverse engineering environment. design recovery is investigated through code-to-code and abstract-descriptions-to-code pattern matching techniques used to locate code that may implement a particular plan or algorithm. The code-to-code matching uses dynamic programming techniques to locate similar code fragments and is targeted for large software systems (1M LOC). Patterns are specified either as source code or as a sequence of abstract statements written in an concept language developed for this purpose. Markov models are used to compute similarity measures between an abstract description and a code fragment in terms of the probability that a given abstract statement can generate a given code fragment. The abstract-description-to-code matcher is under implementation and early experiments show it is a promising technique.

关键词： Software engineering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：