2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing最新文献_第3页

Analyzing WMSOL Definable Properties on Sum-Like Weighted Labeled Trees 类和加权标记树上WMSOL可定义属性分析

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.57

E. Ravve

{"title":"Analyzing WMSOL Definable Properties on Sum-Like Weighted Labeled Trees","authors":"E. Ravve","doi":"10.1109/SYNASC.2014.57","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.57","url":null,"abstract":"Modern software and hardware designs are mostly hierarchical. Moreover, while the design specification is defined up-down, the design implementation and verification are done down-up. In such a case, as a rule, coverage properties for simulation-based verification are defined inconsistently for different stages of the design flow. The fact leads to the well known explosion of bug rate, when we pass from the lower design stage to the upper one. In this paper, we propose a new approach that allows propagation of quantitative properties from the upper stage of the design flow to the lower ones and their incremental computation on the components. The approach may be applied to any design, modeled as a Finite State Machine (FSM) or other formalisms, which eventually lead to weighted labeled trees. We use Weighted Monadic-Second Order Logic (WMSOL) to describe the desired families of quantitative properties and sum-like weighted labeled trees to describe the decomposition of the behaviour of the FSM. The last notion is based on a generalization of disjoint unions of structures with additional links between the components. Our approach shows how computation of a quantitative property, definable as a WMSOL formula on the upper stage of the design may be reduced for certain cost to incremental computations of effectively derivable WMSOL-definable properties on the components. We provide several examples of families of such properties and discuss different aspects, related to the applicability of our approach. The approach is new and provides a uniform theoretical basis for analyzing WMSOL-definable properties on hierarchical structures.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130680470","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Open Stack and Cloud Stack: Open Source Solutions for Building Public and Private Clouds 开放堆栈和云堆栈:用于构建公共和私有云的开源解决方案

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.64

A. Barkat, A. D. Santos, Thi Thao Nguyen Ho

引用次数: 15

Hierarchical Reasoning in Local Theory Extensions and Applications 层次推理在局部理论中的推广与应用

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.13

Viorica Sofronie-Stokkermans

引用次数: 2

Optimal Homotopy Asymptotic Method for Viscous Boundary Layer Flow in Unbounded Domain 无界区域粘性边界层流动的最优同伦渐近方法

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.22

R. Ene, V. Marinca, R. Negrea

引用次数: 4

Register Caching for Stencil Computations on GPUs 在gpu上进行模板计算的寄存器缓存

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.70

Thomas L. Falch, A. Elster

引用次数: 14

How Good Is Genetic Programming at Predicting Changes and Defects? 遗传程序在预测变化和缺陷方面有多好?

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.78

C. Marinescu

引用次数: 16

On the Computation of the Hansen Coefficients 关于Hansen系数的计算

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.24

Petru Calin Bazavan, Lucian Barbulescu, P. Cefola

{"title":"On the Computation of the Hansen Coefficients","authors":"Petru Calin Bazavan, Lucian Barbulescu, P. Cefola","doi":"10.1109/SYNASC.2014.24","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.24","url":null,"abstract":"The Hansen coefficients are one of the most important tools in the analytical or semi-analytical methods of celestial mechanics. The problem of efficient computation was investigated in detail in many papers, but this subject is still open and to date there are not standard algorithms to generate the Hansen coefficients with accuracy and good computation time. Although the analytical expressions are known through their accuracy, the formulation by recurrent relations was preferred due to their stability and applicability in the case when a large number of the Hansen coefficients are needed. In this paper we turn our attention to the polynomial approximations and we present a method to generate the polynomials associated to the Hansen coefficients and their derivatives in the particular case used in expression of disturbing function due to central-body. Using the recurrent formulas corresponding to this particular case, we define difference equations and, by their iteration, we generate the polynomials. By computational tests, we compare our polynomial approximations for the Hansen coefficients and their derivatives with the recurrent solutions in order to prove the non-regression of the accuracy and the gain in computation time.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126842860","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

NSGA-II: Implementation and Performance Metrics Extraction for CPU and GPU NSGA-II: CPU和GPU的实现和性能指标提取

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.72

Florina Roxana Padurariu, C. Marinescu

引用次数: 1

Early Prediction of the Cost of HPC Application Execution in the Cloud HPC应用程序在云中执行成本的早期预测

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.61

M. Rak, Mauro Turtur, Umberto Villano

引用次数: 4

A Streamlined Difference Ring Theory: Indefinite Nested Sums, the Alternating Sign, and the Parameterized Telescoping Problem 流线型差分环理论:不定嵌套和、交替符号和参数化伸缩问题

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.12

Carsten Schneider

引用次数: 22