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

2nd International Conference on Software Engineering Advances - ICSEA 2007

作者： Moebius, Nina Haneberg, Dominik Reif, Wolfgang Schellhorn, Gerhard Institute of Computer Science University Augsburg Department of Software Engineering and Programming Languages 86135 Augsburg Germany

ISBN: (纸本)0769529372

Developing security-critical applications is very difficult and the past has shown that many applications turned out to be erroneous after years of usage. For this reason it is desirable to have a sound methodology for developing security-critical E-Commerce applications. We present an approach to model these applications with the unified modeling language (UML) [1] extended by a UML profile to tailor our models to security applications. Our intent is to (semi-) automatically generate a formal specification suitable for verification as well as an implementation from the model. Therefore we offer a development method seamlessly integrating semi-formal and formal methods as well as the implementation. This is a significant advantage compared to other approaches not dealing with all aspects from abstract models down to code. Based on this approach we can prove security properties on the abstract protocol level as well as the correctness of the protocol implementation in Java with respect to the formal model using the refinement approach. In this paper we concentrate on the modeling with UML and some details regarding the transformation of this model into the formal specification. We illustrate our approach on an electronic payment system called Mondex [10]. Mondex has become famous for being the target of the first ITSEC evaluation of the highest level E6 which requires formal specification and verification. © 2007 IEEE.

关键词： Unified Modeling Language

来源：评论

学校读者我要写书评

暂无评论

A Lifetime Optimal Algorithm for Speculative PRE

引用

ACM Transactions on Architecture and Code Optimization 2006年第2期3卷 115-155页

作者： Xue, Jingling Cai, Qiong University of New South Wales Programming Languages and Compilers Group School of Computer Science and Engineering Sydney NSW 2052 Australia

A lifetime optimal algorithm, called MC-PRE, is presented for the first time that performs speculative PRE based on edge profiles. In addition to being computationally optimal in the sense that the total number of dynamic computations for an expression in the transformed code is minimized, MC-PRE is also lifetime optimal since the lifetimes of introduced temporaries are also minimized. The key in achieving lifetime optimality lies not only in finding a unique minimum cut on a transformed graph of a given CFG, but also in performing a data-flow analysis directly on the CFG to avoid making unnecessary code insertions and deletions. The lifetime optimal results are rigorously proved. We evaluate our algorithm in GCC against three previously published PRE algorithms, namely,MC-PREcomp (Qiong and Xue’s computationally optimal version of MC-PRE), LCM (Knoop, R¨ uthing, and Steffen’s lifetime optimal algorithm for performing nonspeculative classic PRE), and CMP-PRE (Bodik, Gupta, and Soffa’s PRE algorithm based on code-motion preventing (CMP) regions, which is speculative but not computationally optimal). We report and analyze our experimental results, obtained from both actual program execution and instrumentation, for all 22 C, C++ and FORTRAN 77 benchmarks from SPECcpu2000 on an Itanium 2 computer system. Our results show that MC-PRE (or MC-PREcomp) is capable of eliminating more partial redundancies than both LCM and CMP-PRE (especially in functions with complex control flow), and, in addition, MC-PRE inserts temporaries with shorter lifetimes than MC-PREcomp. Each of both benefits has contributed to the performance improvements in benchmark programs at the costs of only small compile-time and code-size increases in some benchmarks. © 2006, ACM. All rights reserved.

关键词： Algorithms Classic PRE Computational optimality Data-flow analysis Experimentation Languages Lifetime optimality Partial redundancy elimination Performance Speculative PRE

来源：评论

学校读者我要写书评

暂无评论

A stochastic approach to the probability of failure on demand (PFD) with regard to the standard IEC 61508

A stochastic approach to the probability of failure on deman...

引用

11th International Probabilistic Safety Assessment and Management Conference and the Annual European Safety and Reliability Conference 2012, PSAM11 ESREL 2012

作者： Wacker, H.D. Ugljesa, E. Boercsoek, J. Department of Computer Architecture and System Programming Faculty of Electrical Engineering /Computer Science University Kassel Wilhelmshöher Allee 71 Germany

ISBN: (纸本)9781622764365

Let there be given a safety related electronic system suffering from random failures or errors. The standard IEC 61508 contains simplified equations for the probability of failure on demand PFDavg for special system architectures, mostly without proof. In various publications PFDavg is defined by several different equations, e.g. as a Laplacian probability, as an integral mean, or by means of the average failure rate of the system. The aim of the paper is to determine PFDavgby stochastic methods and to bring together the different definitions. A formula for PFDavg is given that is valid for most universal electronic systems. The equivalence of 2 different definitions of PFDavgis shown. The special case of a koon-System is investigated, and the resulting equations improve those known so far. The basic idea is to randomize the time to failure, the down time of the system, as well as the repair time, and then, by means of the Stieltjes-Integral, determine the mean or average time as the expectation of the respective random variable.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

New approach to predict warranty costs using a new bivariate reliability prediction model 32nd

New approach to predict warranty costs using a new bivariate...

引用

32nd European Safety and Reliability Conference, ESREL 2022

作者： Krini, Abderrahim Börcsök, Josef Engineering of Reliability and Quality Robert Bosch GmbH Germany Computer and System Programming University of Kassel Germany

ISBN: (纸本)9789811851834

An important marketing strategy of automotive manufacturers is to promote high-quality products by extending warranty periods, which inevitably generates additional costs. In general, different loads on a control unit cause a failure. Therefore, a failure can be traced back to the loads experienced. In reliability theory, the operating time t is commonly used as a reference value for describing the load acting on a system, since the electronic control units (ECUs) are only under current and voltage for the duration t and are therefore only loaded during this time. However, obtaining a suitable database is difficult. The failure data of ECUs collected during the warranty period from the supplier in the event of complaints can be regarded as complete and therefore represent a suitable database for determining reliability parameters. The warranty data are time-censored and reflect the field behaviour of the ECUs during the warranty period. As a rule, when collecting the data, the duration (production and complaint date) of the ECUs in the field is recorded in addition to the cause of failure. With a new multivariate prediction model that uses this data to forecast the expected ECU failures and knowledge of the costs of a warranty case, the expected additional costs of a warranty extension can be calculated. © 2022 ESREL2022 Organizers. Published by Research Publishing, Singapore.

关键词： Automotive industry

来源：评论

学校读者我要写书评

暂无评论

Projections for strictness analysis 3rd

引用

3rd International Conference on Functional programming Languages and computer Architecture, 1987

作者： Wadler, Philip Hughes, R.J.M. Programming Research Group Oxford University United Kingdom Programming Methodology Group Chalmers University Göteborg Sweden Department of Computer Science University of Glasgow United Kingdom

ISBN: (纸本)9783540183174

Contexts have been proposed as a means of performing strictness analysis on non-flat domains. Roughly speaking, a context describes how much a sub-expression will be evaluated by the surrounding program. This paper shows how contexts can be represented using the notion of projection from domain theory. This is clearer than the previous explanation of contexts in terms of continuations. In addition, this paper describes finite domains of contexts over the non-flat list domain. This means that recursive context equations can be solved using standard fixpoint techniques, instead of the algebraic manipulation previously used. © 1987, Springer-Verlag.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Using shared arrays in message-driven parallel programs

Using shared arrays in message-driven parallel programs

引用

25th IEEE International Parallel and Distributed Processing Symposium, Workshops and Phd Forum, IPDPSW 2011

作者： Miller, Phil Becker, Aaron Kalé, Laxmikant Parallel Programming Laboratory Department of Computer Science University of Illinois Urbana-Champaign United States

ISBN: (纸本)9780769543857

This paper describes a safe and efficient combination of the object-based message-driven execution and shared array parallel programming models. In particular, we demonstrate how this combination engenders the composition of loosely coupled parallel modules safely accessing a common shared array. That loose coupling enables both better flexibility in parallel execution and greater ease of implementing multi-physics simulations. As a case study, we describe how the parallelization of a new method for molecular dynamics simulation benefits from both of these advantages. We also describe a system of typed handle objects that embed some of the determinacy constraints of the Multiphase Shared Array programming model in the C type system, to catch some violations at compile time. The combined programming model communicates in terms of these handles as a natural means of detecting and preventing errors. © 2011 IEEE.

关键词： Molecular dynamics

来源：评论

学校读者我要写书评

暂无评论

Double-averaged Turbulence Characteristics Over Hemispherical Rough Bed 1

引用

26th International Conference on Hydraulics, Water Resources and Coastal Engineering, HYDRO 2021

作者： Shounda, Jaynata Barman, Krishnendu Department of Applied Mathematics With Oceanology and Computer Programming Vidyasagar University West Bengal Midnapore721102 India

ISBN: (数字)9789811991516

ISBN: (纸本)9789811991509

This study characterized the double-averaged (time and space) turbulence parameters and local flow distributions through the experimental measurement over fully submerged artificially made hemispherical rough bed. Three different directional components of velocity data were collected by 3D micro-acoustic Doppler velocimeter (ADV) with a Reynolds number 62000. The changes of spatially averaged mean velocity profiles into specific flow layers on this rough bed were discussed corresponding with the smooth bed data. In the bottom wall region, double-averaged negative velocity components indicate the flow separation and strong recirculation zone. However, results from the double-averaged turbulent-kinetic-energy (TKE) flux and form-induced TKE flux were shown the upward and downward TKE transport throughout the flow depth. Also, TKE budgets terms turbulence production, diffusion and dissipation attain their peaks at the interfacial sub-layer of this rough bed flow. The production and dissipation rates of TKE have reached their maximum points at just above the lower extremity of form-induced sub-layer and within the interfacial sub-layer, respectively. The interfacial sub-layer has been treated as the losing zone of TKE pressure energy distribution and the zone of turbulence spreading. Moreover, the lower boundary of form-induced sub-layer shows as the energy access region. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Turbulence

来源：评论

学校读者我要写书评

暂无评论

Grid resource management using lottery scheduling 11

Grid resource management using lottery scheduling

引用

Proceedings of the 12th International Conference on computer Systems and Technologies

作者： Borovska, Plamenka Aleksieva-Petrova, Adelina Gancheva, Veska Beshkov, Stefan Department of Computer Systems Technical University of Sofia Bulgaria Department of Programming and Computer Technologies Technical University of Sofia Bulgaria Experian Bulgaria Bulgaria

ISBN: (纸本)9781450309172

The GRID infrastructure provides an aggregation of a wide variety of distributed resources for solving large-scale data intensive problems in various fields. The aim of this paper is to propose a method for grid resource management based on lottery scheduling. The lottery scheduling algorithm is implemented as an extension of GridSim simulator that integrates an additional strategy for planning and resource management. © 2011 ACM.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Specification, implementation, and verification of Domain Specific Languages: A logic programming-based approach

引用

Lecture Notes in computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2002年 2407卷 211-239页

作者： Gupta, Gopal Pontelli, Enrico Applied Logic Programming Languages and Systems Lab. Department of Computer Science University of Texas at Dallas Richardson TX 95083 United States Laboratory for Logic Databases and Advanced Programming Department of Computer Science New Mexico State University Las Cruces NM 88003 United States

ISBN: (纸本)3540439595

Domain Specific Languages (DSLs) are high level languages designed for solving problems in a particular domain, and have been suggested as means for developing reliable software systems. We present a (constraint) logic programming-based framework for specification, efficient implementation, and automatic verification of domain specific languages (DSLs). Our framework is based on using Horn logic (or pure Prolog), and eventually constraints, to specify denotational semantics of domain specific languages. Both the syntax as well as the semantic specification of the DSL in question are directly executable in our framework: the specification itself serves as an interpreter for the DSL. More efficient implementations of this DSL-a compiler-can be automatically derived via partial evaluation. Additionally, the executable specification can be used for automatic or semi-automatic verification of programs written in the DSL as well as for automatically obtaining traditional debuggers and profilers. The ability to verify DSL programs is a distinct advantage of our approach. In this paper we give a general outline of our approach, and illustrate it with practical examples. © 2002 Springer-Verlag Berlin Heidelberg.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Tense in formal language syntax and cooperating sequential processes

引用

Kybernetes 1975年第2期4卷 49-55页

作者： Rine, D. Computer Science (Programming Languages) West Virginia University Morgantown W. Va. 26506 United States

There are few places in the literature on formal language syntax where tense is efficiently treated as part of the syntactical structure. In both natural languages and programming languages, cybernetically speaking, one encounters the fundamental concept of “verb phrase”. For information processing the COBOL programmer can construct the extended general form of verb commands containing tense as follows: [formula ometed]. The syntactical grammar with tense is introduced. Then, one obtains a formal language and system which makes formal conversation about same-resource oriented sequential processes truly cooperating sequential processes, time-events being fundamental in the study of these processes. © 1975, MCB UP Limited

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：