Filters








19,909 Hits in 5.4 sec

Generating Test Cases for Code Generators by Unfolding Graph Transformation Systems [chapter]

Paolo Baldan, Barbara König, Ingo Stürmer
2004 Lecture Notes in Computer Science  
This is done by formalising the behaviour of a code generator by means of graph transformation rules and exploiting unfolding-based techniques.  ...  This paper proposes a technique for systematically deriving suitable test cases for code generators, involving the interaction of chosen sets of rules.  ...  Acknowledgements: We would like to thank the anonymous referees for their helpful comments. We are also grateful to Andrea Corradini for comments on an earlier version of this paper.  ... 
doi:10.1007/978-3-540-30203-2_15 fatcat:fkiz5g2pebduzetj364is3dbda

Augur 2 — A New Version of a Tool for the Analysis of Graph Transformation Systems

Barbara König, Vitali Kozioura
2008 Electronical Notes in Theoretical Computer Science  
It is based on Augur 1, a tool which can analyze graph transformation systems by approximating them by Petri nets.  ...  The main reason for the new development was to create an open, flexible and extensible verification environment.  ...  started to extend the tool in order to use it for the purpose of test case generation [11] .  ... 
doi:10.1016/j.entcs.2008.04.042 fatcat:sqtqei53dzdtjmvzyzw5fboh5y

An Unfolding-Based Loop Optimization Technique [chapter]

Litong Song, Krishna Kavi, Ron Cytron
2003 Lecture Notes in Computer Science  
As a case in point, we show how some loop-dependent code can be transformed into loop-invariant code by transforming the loops.  ...  In many cases, even "badly-structured" loops may be transformed into well structured loops.  ...  Loop quasi invariant code motion is an extension of loop invariant code motion, which hoists invariant code to outside of loops by unfolding loops for a small number of iterations.  ... 
doi:10.1007/978-3-540-39920-9_9 fatcat:wbw4drfnqngfnd5ykfgbtywbp4

Optimizing Program Size Using Multi-result Supercompilation

Dimitur Nikolaev Krustev
2020 Electronic Proceedings in Theoretical Computer Science  
We consider an approach for controlling result size, based on a combination of multi-result supercompilation and a specific generalization strategy, which avoids code duplication.  ...  Supercompilation is a powerful program transformation technique with numerous interesting applications.  ...  Acknowledgments The author would like to thank the four anonymous reviewers for the helpful suggestions on improving the presentation of this article.  ... 
doi:10.4204/eptcs.320.9 fatcat:il4q4fgurfdirblsykfbu4r7dq

Controlling the Size of Supercompiled Programs using Multi-result Supercompilation [article]

Dimitur Krustev
2020 arXiv   pre-print
We consider an approach for controlling result size, based on a combination of multi-result supercompilation and a specific generalization strategy, which avoids code duplication.  ...  Supercompilation is a powerful program transformation technique with numerous interesting applications.  ...  Acknowledgments The author would like to thank the four anonymous reviewers for the helpful suggestions on improving the presentation of this article.  ... 
arXiv:2006.02204v1 fatcat:opajqq22t5darkoxqe23o3ucia

Automated Assistance for Search-Based Refactoring Using Unfolding of Graph Transformation Systems [chapter]

Fawad Qayum
2010 Lecture Notes in Computer Science  
CONTENTS iii 2.5.1 GXL (Graph eXchange Language  ...  In addition, I would like to thank many other members of the Department i of Computer Science at the University of Leicester for their help, and for creating a friendly and welcoming environment for work  ...  I am extremely grateful to University of Malakand for funding this research under Overseas Faculty Development Programme by the Higher Ed-  ... 
doi:10.1007/978-3-642-15928-2_34 fatcat:dkwpg3ylnbdwtadpklbvrfogum

Abstract specialization and its applications

Germán Puebla, Manuel Hermenegildo
2003 SIGPLAN notices  
Among them, one of the best known techniques is partial evaluation, often referred to simply as program specialization, which optimizes programs by specializing them for (partially) known input data.  ...  The concept of abstract specialization is at the heart of the specialization system in CiaoPP, the Ciao system preprocessor.  ...  Vaucheret for his implementation of the eterms domain.  ... 
doi:10.1145/966049.777393 fatcat:tch5jmjdgzdfzjk4zhdnv64lpy

Abstract specialization and its applications

Germán Puebla, Manuel Hermenegildo
2003 Proceedings of the 2003 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation - PEPM '03  
Among them, one of the best known techniques is partial evaluation, often referred to simply as program specialization, which optimizes programs by specializing them for (partially) known input data.  ...  The concept of abstract specialization is at the heart of the specialization system in CiaoPP, the Ciao system preprocessor.  ...  Vaucheret for his implementation of the eterms domain.  ... 
doi:10.1145/777388.777393 dblp:conf/pepm/PueblaH03 fatcat:6co23cr6m5fapinlf2wnyv73fy

The SOAMIG Process Model in Industrial Applications

C. Zillmann, A. Winter, A. Herget, W. Teppe, M. Theurer, A. Fuhr, T. Horn, V. Riediger, U. Erdmenger, U. Kaiser, D. Uhlig, Y. Zimmermann
2011 2011 15th European Conference on Software Maintenance and Reengineering  
The process is applied in two industrial software migration projects addressing architecture and code migration.  ...  The SOAMIG Project aims at a general migration process model with an emphasis on transformationbased conversion.  ...  For stand-alonesystems, test cases are derived by recording messages from the legacy and replaying them to the target system.  ... 
doi:10.1109/csmr.2011.48 dblp:conf/csmr/ZillmannWHTTFHREKUZ11 fatcat:ec7vccs6offlxnouvdr635tgmm

Worst-Case Execution Time Analysis of Predicated Architectures

Florian Brandner, Amine Naji, Marc Herbstritt
2017 Worst-Case Execution Time Analysis  
We thus explore a preprocessing step that explicitly unfolds the control-flow graph, which allows us to apply standard analyses that are themselves not aware of predication.  ...  Predicated memory accesses, for instance, may or may not have an impact on the processor's cache and thus need to be considered by the cache analysis.  ...  Finally, patmos-specific code transformations are available to generate single-path programs [8] .  ... 
doi:10.4230/oasics.wcet.2017.6 dblp:conf/wcet/BrandnerN17 fatcat:jm2njv7b7zdjfoshidhpm2s7f4

Optimal code size reduction for software-pipelined and unfolded loops

Qingfeng Zhuge, Bin Xiao, Zili Shao, Edwin H.-M. Sha, Chantana Chantrapornchai
2002 Proceedings of the 15th international symposium on System Synthesis - ISSS '02  
For most DSP systems with limited memory resources, code size becomes one of the most critical concerns for the highperformance applications.  ...  We propose a code size reduction framework to achieve the optimal code size of software-pipelined and unfolded loops by using conditional registers.  ...  In the following theorems, DFG Ö is generated by unfolding the original DFG , and then retiming the unfolded graph; DFG Ö is generated by directly retiming the original DFG , and then unfolding it. we  ... 
doi:10.1145/581199.581232 fatcat:rawexlc46regfpjxevwz7dpyvy

Program structures: Some new characterisations

N.E. Fenton, R.W. Whitty
1991 Journal of computer and system sciences (Print)  
This allows us to characterise those programs which can be re-structured by node splitting, where structuredness is defined in terms of any "subgraph-closed" set of irreducible flowgraphs.  ...  A more crucial line of further research is to study more closely the relationship between unfolding and general program transformations which preserve sets of instructions and tests.  ...  Hence the folded S-graphs are those which can be transformed into S-graphs by a finite sequence of applications of this unfolding operation.  ... 
doi:10.1016/0022-0000(91)90025-z fatcat:zy3y6ivmxbfo3jvnojtwn7k2xq

ViBERT: Visual Behavior Regression Testing

Chunying Zhao, Chunying Zhao
2020 Journal of Visual Language and Computing  
A B S T R A C T Regression testing is a type of software testing that aims at identifying faults caused by code changes.  ...  Using dynamic analysis, behavioral regression testing (BERT) is one of the techniques proposed to solve the problem by re-executing test cases that target the affected area.  ...  Figure 2 2 shows the JUnit test cases for testing the method Money.equals(). Figure 2 : 2 Test cases in Money for Money.equals().  ... 
doi:10.18293/jvlc2020-n2-010 fatcat:iidfotil7zbrbjilx6mxcxjkrq

A general approach for expressing infeasibility in implicit path enumeration technique

Pascal Raymond
2014 Proceedings of the 14th International Conference on Embedded Software - EMSOFT '14  
The goal of this paper is to go further than ad hoc reasoning by proposing a general method for translating infeasibility in terms of numerical constraints.  ...  Moreover the paper aims at exploring the limits of the method, and thus, it does not try to enhance the result using additional methods (e.g., graph transformation).  ...  The general solution is to define a mix of case-by-case analysis and pure ILP.  ... 
doi:10.1145/2656045.2656046 dblp:conf/emsoft/Raymond14 fatcat:3qcizqmyovaxpahxaftpdbmd6m

Timing optimization via nest-loop pipelining considering code size

Qingfeng Zhuge, Chun Jason Xue, Meikang Qiu, Jingtong Hu, Edwin H.-M. Sha
2008 Microprocessors and microsystems  
Embedded systems have strict timing and code size requirements.  ...  The average code size is reduced by 69.5% compared with that generated by the MD retiming technique.  ...  Acknowledgement This work is partially supported by TI University Program, NSF EIA-0103709, Texas ARP 009741-0028-2001, NSF CCR-0309461, NSF IIS-0513669, and Microsoft, USA.  ... 
doi:10.1016/j.micpro.2008.02.002 fatcat:enzzpxns5rdq7bpr326j6finnq
« Previous Showing results 1 — 15 out of 19,909 results