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

Mathematical structure model for word-based program

KNOWLEDGE-BASED SYSTEMS 2003年第7-8期16卷 399-411页

作者： Arai, O Fujita, H Iwate Prefectural Univ Fac Software & Informat Sci Takizawa Iwate 0200193 Japan CATENA Co Tokyo Japan

The new software world is progressing steadily forward but is not yet within range of where it needs to be. This paper presents a mathematical ground for the Lyee methodology, which has already produced several achievements in industry. This method enables us not to attention the sequential order of program execution. By introducing the concept of a state, it is possible to prove the program structure. The construction of such a program structure allows programmers to focus on conditions and formulae that calculate the value. Through this model, a system divided for catching correct requirements quickly is integrated, and its optimal program with minimum repetitions can be generated by rearranging words into the right order. (C) 2003 Published by Elsevier B.V.

关键词： program control structures system construction methodology intuition-based logic

来源：评论

学校读者我要写书评

暂无评论

program analysis too loopy? Set the loops aside

引用

IET SOFTWARE 2013年第3期7卷 131-149页

作者： Larson, Eric Seattle Univ Seattle WA 98122 USA

Among the many obstacles to efficient and sound program analysis, loops may be the most prevalent. In program analyses that traverse paths, loops introduce a variable, possibly infinite and number of paths. This study assesses the potential of a program analysis technique that analyses loops separately and replaces the loop with a summary, similar to how many analyses use summaries for interprocedural analysis. This study is conducted by comparing the path counts when loops are analysed separately to a baseline path count where loops are traversed at most once. Although the number of paths is decreased in many cases, the magnitude of the decrease is typically not sufficient for long, complex functions. In addition, loops are classified by the task they perform, analysed using the number of paths as an estimate of their complexity and further inspected for programming elements that may make loop analysis more difficult. Of the 2869 loops used in this study, 84% of the loops have fewer than ten paths and only 1.3% have more than 10 000 paths. Nearly 60% of the loops traverse arrays or strings and roughly half of the loops contain a function call.

关键词： program control structures program diagnostics program analysis technique interprocedural analysis baseline path count complex functions programming elements loop analysis loop traverse arrays loop traverse strings function call program control structures program diagnostics program analysis technique interprocedural analysis baseline path count complex functions programming elements loop analysis loop traverse arrays loop traverse strings function call

来源：评论

学校读者我要写书评

暂无评论

Using cornpiler-generated approximate critical path information to prioritise instructions for value prediction

引用

IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES 2004年第5期151卷 321-331页

作者： Zhao, Q Lilja, DJ Sun Microsyst Inc Menlo Pk CA USA Univ Minnesota Dept Elect & Comp Engn Minneapolis MN 55455 USA Univ Minnesota Minnesota Supercomp Inst Minneapolis MN 55455 USA

One of the potential difficulties in developing cost-effective value prediction mechanisms is determining which instructions should be selected for prediction when the hardware resources are limited. The authors examine a compiler algorithm that statically assigns priorities to instructions using approximate critical path information to identify the best candidates for value prediction. This static priority information is encoded into the instructions and subsequently used by the hardware to choose the most critical instructions at run-time for value prediction. The algorithm is implemented in the GCC compiler and performance potential is evaluated using an extended version of the SimpleScalar processor simulator. Our results with the SPEC95 and SPEC2000 benchmark programs show that this approximate algorithm can effectively capture the critical path information to consistently improve the performance of a processor with a hybrid value predictor compared to using no information about the criticality of instructions. Furthermore, it is shown that using only four priority levels encoded into two instruction bits is sufficient to capture enough priority information to effectively use the value prediction hardware.

关键词： hybrid value predictor compiler generators compiler-generated critical path information Compilers, interpreters and other processors static priority assignment Parallel architecture program control structures SPEC95 benchmark instruction sets GCC compiler instruction prioritisation SimpleScalar processor simulator SPEC2000 benchmark approximate critical path information Performance evaluation and testing parallel architectures performance evaluation value prediction

来源：评论

学校读者我要写书评

暂无评论

The expressive power of higher-order types or, life without CONS

引用

JOURNAL OF FUNCTIONAL programMING 2001年第1期11卷 55-94页

作者： Jones, ND Univ Copenhagen DIKU DK-1168 Copenhagen Denmark

Compare first-order functional programs with higher-order programs allowing functions as function parameters. Can the the first program class solve fewer problems than the second? The answer is no: both classes are Turing complete, meaning that they can compute all partial recursive functions. In particular, higher-order values may be first-order simulated by use of the list constructor 'cons' to build function closures. This paper uses complexity theory to prove some expressivity results about small programming languages that are less than Turing complete. Complexity classes of decision problems are used to characterize the expressive power of functional programming language features. An example: second-order programs are more powerful than first-order. since a function f of type [Boo1]-> Boo1 is computable by a cons-free first-order functional program if and only if f is in PTIME, whereas f is computable by a cons-free second-order program if and only if f is in EXPTIME. Exact characterizations are given for those problems of type [Boo1]-> Boo1 solvable by programs with several combinations of operations on data: presence or absence of constructors;the order of data values: 0, 1. or higher;and program control structures: general recursion, tail recursion, primitive recursion.

关键词： program control structures Functional programming higher-order complexity classes FIRST ORDER economic offence functional parameter Turing life instruction type Complexity theory If and only if Recursion program control

来源：评论

学校读者我要写书评

暂无评论

Recurses!

引用

COMPUTING IN SCIENCE & ENGINEERING 2003年第3期5卷 76-81页

作者： Noble, JV Univ Virginia Charlottesville VA 22903 USA

THIS COLUMN IS ABOUT RECURSION: FUNCTIONS, SUBROUTINES, AND EVEN WHOLECOMPUTER LANGUAGES DEFINED IN TERMS OF THEMSELVES. RECURSION IS A DIRECT and elegant way totranslate certain mathematical relations into programs, and it's a great technique for discoveringefficient algorithms. Given its utility, you might wonder why people seldom use it. Here are justsome of the reasons why: 1. Not all computer languages permit recursion (although most do today).Recursion seems arcane to scientifiprogrammers of my generation who grew up with Fortran, whichforbade it. (Fortunately, Fortran 90 and later versions have remedied this.2. Not all languagesthat permit recursion make it easy, especially for nontextbook examples (as I recently learned whentranslating some algorithms to C). 3. Although useful, recursion is never essential: by theorem, arecursive algorithm can always be re-expressed nonre-cursively. 4. Recursive programs are generallybelieved to execute slower or to use more memory than their nonrecursive equivalents. Poor exampleshave reinforced this negative impression; ditto for languages that implement recursioninefficiently.

关键词： program control structures

来源：评论

学校读者我要写书评

暂无评论

On characterizations of the basic feasible functionals, Part I

引用

JOURNAL OF FUNCTIONAL programMING 2001年第1期11卷 117-153页

作者： Irwin, RJ Royer, JS Kapron, BM Syracuse Univ Dept Elect Engn & Comp Sci Syracuse NY 13244 USA Univ Victoria Dept Comp Sci Victoria BC V8W 3P6 Canada

We introduce a typed programming formalism, type-2 inflationary tiered loop programs or ITLP2, that characterizes the type-2 basic feasible functionals. ITLP2 is based on Bellantoni and Cook's (1992) and Leivant's (1995) type-theoretic characterization of polynomial-time, and turns out to be closely related to Kapron and Cook's (1991;1996) machine-based characterization of the type-2 basic feasible functionals.

关键词： program control structures Basic language Restaurants and catering FUNCTIONALS

来源：评论

学校读者我要写书评

暂无评论

Speculative parallelization

引用

COMPUTER 2006年第12期39卷 126-128页

作者： Gonzalez-Escribano, Arturo Llanos, Diego R. Univ Valladolid Dept Informat E-47002 Valladolid Spain

The most promising technique for automatically parallelizing loops when the system cannot determine dependences at compile time is speculative parallelization. Also called thread-level speculation, this technique assumes optimistically that the system can execute all iterations of a given loop in parallel. A hardware or software monitor divides the iterations into blocks and assigns them to different threads, one per processor, with no prior dependence analysis. If the system discovers a dependence violation at runtime, it stops the incorrectly computed work and restarts it with correct values. Of course, the more parallel the loop, the more benefits this technique delivers. To better understand how speculative parallelization works, it is necessary to distinguish between private and shared variables. Informally speaking, private variables are those that the program always modifies in each iteration before using them. On the other hand, values stored in shared variables are used in different iterations.

关键词： System Monitoring Multi Threading Parallelising Compilers program control structures Runtime Dependence Violation Discovery Speculative Parallelization Automatic Loop Parallelization program Compiler Thread Level Speculation Hardware Monitor Software Monitor program Dependence Analysis Hardware Monitoring Runtime Performance Loss Concurrent Computing Speculative Parallelization How Things Work

来源：评论

学校读者我要写书评

暂无评论

Recovering the Memory Behavior of Executable programs

Recovering the Memory Behavior of Executable Programs

引用

10th IEEE Working Conference on Source Code Analysis and Manipulation (SCAM)

作者： Ketterlin, Alain Clauss, Philippe INRIA CAMUS Team Rocquencourt France Univ Strasbourg Strasbourg France

ISBN: (纸本)9780769541785

This paper deals with the binary analysis of executable programs, with the goal of understanding how they access memory. It explains how to statically build a formal model of all memory accesses. Starting with a control-flow graph of each procedure, well-known techniques are used to structure this graph into a hierarchy of loops in all cases. The paper shows that much more information can be extracted by performing a complete data-flow analysis over machine registers after the program has been put in static single assignment (SSA) form. By using the SSA form, registers used in addressing memory can be symbolically expressed in terms of other, previously set registers. By including the loop structures in the analysis, loop indices and trip counts can also often be expressed symbolically. The whole process produces a formal model made of loops where memory accesses are linear expressions of loop counters and registers. The paper provides a quantitative evaluation of the results when applied to several dozens of SPEC benchmark programs. Because static analysis is often incomplete, the paper ends by describing a lightweight instrumentation strategy that collects at run time enough information to complete the program's symbolic description.

关键词： binary analysis binary analysis control flow graph data flow analysis data flow analysis executable program formal model lightweight instrumentation strategy linear expression loop counter loop structure machine registers memory access memory accesses memory recovey modeling profiling program control structures program symbolic description quantitative evaluation static analysis static single assignment static single assignment form storage allocation storage management

来源：评论

学校读者我要写书评

暂无评论

Automatic Verification of Loop Invariants

Automatic Verification of Loop Invariants

引用

International Conference on Software Maintenance

作者： Ponsini, Olivier Collavizza, Helene Fedele, Carine Michel, Claude Rueher, Michel Univ Nice Sophia Antipolis I3S CNRS F-06903 Sophia Antipolis France

ISBN: (纸本)9781424486298

Loop invariants play a major role in program verification. Though various techniques have been applied to automatic loop invariants generation, most interesting ones often generate only candidate invariants. Thus, a key issue to take advantage of these invariants in a verification process is to check that these candidate loop invariants are actual invariants. This paper introduces a new technique based on constraint programming for automatic verification of inductive loop invariants. This approach is efficient to detect spurious invariants and is also able to verify valid invariants under boundedness restrictions. First experiments on classical benchmarks are very promising.

关键词： automatic loop invariants generation automatic verification constraint handling constraint programming inductive loop invariants program control structures program verification program verification

来源：评论

学校读者我要写书评

暂无评论

Automatic Cluster Parallelization and Minimizing Communication via Selective Data Replication

Automatic Cluster Parallelization and Minimizing Communicati...

引用

IEEE High Performance Extreme Computing Conference (HPEC)

作者： Tavarageri, Sanket Meister, Benoit Baskaran, Muthu Pradelle, Benoit Henretty, Tom Konstantinidis, Athanasios Johnson, Ann Lethin, Richard Reservoir Labs 632 Broadway New York NY 10012 USA

ISBN: (纸本)9781467392860

The technology scaling has initiated two distinct trends that are likely to continue into future: first, the increased parallelism in hardware and second, the increasing performance and energy cost of communication relative to computation. Both of the above trends call for development of compiler and runtime systems to automatically parallelize programs and reduce communication in parallel computations to achieve the desired high performance in an energy-efficient fashion. In this paper, we propose the design of an integrated compiler and runtime system that auto-parallelizes loop-nests to clusters and, a novel communication avoidance method that reduces data movement between processors. Communication minimization is achieved via data replication: data is replicated so that a larger share of the whole data set may be mapped to a processor and hence, non-local memory accesses reduced. Experiments on a number of benchmarks show the effectiveness of the approach.

关键词： data handling parallel programming parallelising compilers power aware computing program control structures storage management automatic cluster parallelization automatic program parallelization communication avoidance method communication minimization compiler energy efficiency hardware parallelism loop-nest autoparallelization nonlocal memory access parallel computation processor data movement runtime system selective data replication technology scaling Arrays Benchmark testing Complexity theory Memory management Minimization program processors Runtime

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：