The use of Large Language Models (LLMs) for code generation has gained significant attention in recent years. Existing methods often aim to improve the quality of generated code by incorporating additional contextual ...
详细信息
Recent vision-language models (VLMs) face significant challenges in test-time adaptation to novel domains. While cache-based methods show promise by leveraging historical information, they struggle with both caching u...
详细信息
This paper presents the fundamentals of reversible flowcharts. Reversible flowcharts are intended to naturally represent the structure and control flow of reversible (imperative) programming languages in a simple comp...
详细信息
This paper presents the fundamentals of reversible flowcharts. Reversible flowcharts are intended to naturally represent the structure and control flow of reversible (imperative) programming languages in a simple computation model in the same way classical flowcharts do for conventional languages. Although reversible flowcharts are superficially similar to classical flowcharts, there are crucial differences: atomic steps are limited to locally invertible operations, and join points require an explicit orthogonalizing conditional expression. Despite these constraints, we show that reversible flowcharts are both expressive and robust: reversible flowcharts can simulate irreversible ones by adapting reversibilization techniques to the flowchart model. Thus, reversible flowcharts are r-Turing-complete, meaning that they can compute exactly all injective computable functions. Furthermore, structured reversible flowcharts are as expressive as unstructured ones, as shown by a reversible version of the classic structured Program Theorem. We illustrate how reversible flowcharts can be concretized with two example programming languages, complete with syntax and semantics: a low-level unstructured language and a high-level structured language. We introduce concrete tools such as program inverters and translators for both languages, which follow the structure suggested by the flowchart model. To further illustrate the different concepts and tools brought together in this paper, we present two major worked examples: a reversible permutation-to-code algorithm attributed to Dijkstra, and a simulation scheme for reversible Turing machines. By exhibiting a wide range of uses, we hope that the proposed reversible flowcharts can serve as a springboard for further theoretical research in reversible computing. (C) 2015 Elsevier B.V. All rights reserved.
The emphasis of data organisation on the specification, design and implementation of large systems raises the question whether data abstraction may be applied to programming languages designed before the widespread us...
详细信息
The emphasis of data organisation on the specification, design and implementation of large systems raises the question whether data abstraction may be applied to programming languages designed before the widespread use of such techniques. The data abstraction facilities available in FORTRAN 77 are considered, and it is shown that encapsulation is possible for simple data structures. An abstract array data structure is pecified and further refined to allow the definition of iterators. An example of this structure is implemented in FORTRAN 77. The introduction of a series of abstractions is thus made possible, which facilitates structured development and efficient maintenance.
The development of a notation that supports key software structure concepts and design principles, is discussed. The notation should let designers represent modules, interfaces, hidden information, concurrency, messag...
详细信息
The development of a notation that supports key software structure concepts and design principles, is discussed. The notation should let designers represent modules, interfaces, hidden information, concurrency, message passing, invocation of operations and overall program structure in a comprehensive way. The authors examine three categories of approach to architectural design: object-oriented design, functional decomposition, and data structure design. They present their design notation, called object-oriented structured design (OOSD) which achieves the above-stated goal. They discuss classes in OOSD, its handling of asynchronous processes, and its design methods and rules. Automated support for OOSD is considered
作者：
Ying, MingshengFeng, YuanUniv Technol Sydney
Fac Engn & Informat Technol Ctr Quantum Computat & Intelligent Syst Sydney NSW 2007 Australia Tsinghua Univ
Dept Comp Sci & Technol Tsinghua Natl Lab Informat Sci & Technol State Key Lab Intelligent Technol & Syst Beijing 100084 Peoples R China
Several high-level quantum programming languages have been proposed in the previous research. In this paper, we define a low-level flowchart language for quantum programming, which can be used in implementation of hig...
详细信息
Several high-level quantum programming languages have been proposed in the previous research. In this paper, we define a low-level flowchart language for quantum programming, which can be used in implementation of high-level quantum languages and in design of quantum compilers. The formal semantics of the flowchart language is given, and the notion of correctness for programs written in this language is introduced. A structured quantum programming theorem is presented, which provides a technique of translating quantum flowchart programs into programs written in a high-level language, namely, a quantum extension of the while-language.
The robust stability problem of linear discrete singular time-delay systems with structured (elemental) parameter uncertainties is investigated. Under the assumptions that the nominal discrete singular time-delay syst...
详细信息
The robust stability problem of linear discrete singular time-delay systems with structured (elemental) parameter uncertainties is investigated. Under the assumptions that the nominal discrete singular time-delay system is regular, impulse-free and asymptotically stable, some new sufficient conditions are proposed to preserve the assumed properties when structured (elemental) parameter uncertainties are added into the nominal discrete singular time-delay system. Further new sufficient conditions are also proposed for guaranteeing that the linear discrete singular time-delay system with both structured (elemental) and unstructured (norm-bounded) parameter uncertainties has the properties of regularity, impulse-immunity and asymptotic stability. Four examples are given to demonstrate the applicability of the proposed sufficient conditions.
With the development of the finite element method, FEM, increasing complex structures are being studied and the number of simultaneous equations to be processed is considerable. For many such complex structures, CPU-t...
详细信息
With the development of the finite element method, FEM, increasing complex structures are being studied and the number of simultaneous equations to be processed is considerable. For many such complex structures, CPU-time, memory storage and data preparation can be reduced by means of multi-level substructuring. Multi-level substructuring and its implementation in computer software are the subject of this paper. With the program developed by authors, any-level of substructuring problem can be conveniently solved.
The Separation Principle, considered by the authors a new programming paradigm, is a simple and natural way of constructing programs. Its intuitive nature and ease of use make it easy to implement many different softw...
详细信息
The Separation Principle, considered by the authors a new programming paradigm, is a simple and natural way of constructing programs. Its intuitive nature and ease of use make it easy to implement many different software designs. By expressing data-sharing, parameter-passing, and scope issues in simple, canonical drawings, the Separation Principle makes it easy to understand the full range of relationships between data and instructions. A preliminary study shows that this paradigm improves programs' understandability.
暂无评论