Flow diagrams, turing machines and languages with only two formation rules

Böhm, Corrado; Jacopini, G.

doi:10.1145/355592.365646

Cited by 659 publications

(201 citation statements)

References 5 publications

Supporting

Mentioning

184

Contrasting

Unclassified

Order By: Relevance

“…A Control Flow Graph is said to be Structured [16] if the corresponding program can be written using only simple condition branches (if) and single exit loop (while without break) without any jump to arbitrary position (goto). The Control Flow Graph of Figure 1, which is shown in Figure 2, is structured.…”

Section: Preliminariesmentioning

confidence: 99%

Exploiting vectorization in high level synthesis of nested irregular loops

Lattuada

Ferrandi

2017

Journal of Systems Architecture

View full text Add to dashboard Cite

Synthesis of DoAll loops is a key aspect of High Level Synthesis since they allow to easily exploit the potential parallelism provided by programmable devices. This type of parallelism can be implemented in several ways: by duplicating the implementation of body loop, by exploiting loop pipelining or by applying vectorization.In this paper a methodology for the synthesis of nested irregular DoAll loops based on outer vectorization is proposed. The methodology transforms the intermediate representation of the DoAll loop to introduce vectorization and it can be easily integrated in existing state of the art High Level Synthesis flows since does not require any modification in the rest of the flow. Vectorization is not limited to perfectly nested countable loops: conditional constructs and loops with variable number of iterations are supported. Experimental results on parallel benchmarks show that the generated parallel accelerators have significant speed-up with limited penalties in terms of resource usage and frequency decrement.

show abstract

Section: Preliminariesmentioning

confidence: 99%

Exploiting vectorization in high level synthesis of nested irregular loops

Lattuada

Ferrandi

2017

Journal of Systems Architecture

View full text Add to dashboard Cite

show abstract

“…NQCBaby is not a complete language because our purpose is not making children become good programmers rather giving them the opportunity to solve problems by using the basic yet complete structures of algorithmics, as from Jacopini-Bhöm theorem (Bohm, 1996). In this section we focus on the rationale of NQCBaby gradual introduction to schoolchildren and sketch its enrichments from children at prewriting level using NQCBaby0 to NQCBaby6 level, usually for the last grade of primary school or first grades of the secondary school.…”

Section: One Programming Language For Different Robotsmentioning

confidence: 99%

Programming Robots in Primary Schools Deserves a Renewed Attention

Demo

2008

Emerging Technologies and Information Systems for the Knowledge Society

View full text Add to dashboard Cite

How to use computers in primary schools is often discussed among those i nvolved in education. In our project we introduce robot programming in order to give both children and teachers the opportunity of concretely approaching the basics of informatics as a science while performing activities concerning the standard curricula subjects. Fundamental components of our proposal are: a) the use of different types of small autonomous robots as computer systems children develop programs for, b) programming with a textual, Logolike language in order to avoid problems due to the language in use during first programming activities, c) a cross-disciplinary didactical methodology where each robot activity is a learning environment nurturing as its principal concern concepts from traditional primary school subjects, such as mathematics, physics, geography, music. Also grammar and linguistic abilities are concerned because the programming language introduction is harmonized with pupils learning of their native language writing. The choice of rather using a textual language is also for having the same representation for programming the robot and for the written natural language; d) a community of practice teachers can count on, so that they do not hesitate experimenting, after an introduction to robots, because they are guaranteed of pedagogical and quick technical helps. During the current 2007/2008 school year the project involved five primary schools, three kindergarten and four secondary, first level, schools for about 50 classes using various robots. Here different aspects of the experience are sketched.

show abstract

“…Most structuring algorithms have concentrated on the removal of goto statements from control flow graphs at the expense of introduction of new boolean variables [8,29,22,28,6,13], code replication [17,27,29], the use of multilevel exits [7,24], or the use of a set of high-level structures not available in commonly used languages [25]. None of these methods are applicable to a decompiler because: the introduction of new boolean variables modifies the semantics of the underlying program, as these variables did not form part of the original program; code replication modifies the structure of the program, as code that was written only once gets replicated one or more times; and the use of multilevel exits or high-level structures that are not available in most languages restricts the generality of the method and the number of languages in which the structured version of the program can be written in.…”

Section: Previous Workmentioning

confidence: 99%

Structuring decompiled graphs

Cifuentes

1996

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.A structuring algorithm for arbitrary control flow graphs is presented. Graphs are structured into functional, semantical and structural equivalent graphs, without code replication or introduction of new variables. The algorithm makes use of a set of generic high-level language structures that includes different types of loops and conditionals. Gotos are used only when the graph cannot be structured with the structures in the generic set. This algorithm is adequate for the control flow analysis required when decompiling programs, given that a pure binary program does not contain information on the high-level structures used by the initial high-level language program (i.e. before compilation). The algorithm has been implemented as part of the dcc decompiler, an i80286 decompiler of DOS binary programs, and has proved successful in its aim of structuring decompiled graphs.

show abstract

Flow diagrams, turing machines and languages with only two formation rules

Cited by 659 publications

References 5 publications

Exploiting vectorization in high level synthesis of nested irregular loops

Exploiting vectorization in high level synthesis of nested irregular loops

Programming Robots in Primary Schools Deserves a Renewed Attention

Structuring decompiled graphs

Contact Info

Product

Resources

About