Filters








215,159 Hits in 5.8 sec

Software Testing Strategy Approach on Source Code Applying Conditional Coverage Method

Jaya Srivastaval, Twinkle Dwivedi
2015 International Journal of Software Engineering & Applications  
Test case data is generated automatically using genetic algorithm are optimized and outperforms the test cases generated by random testing.  ...  Hence test case generation may be treated as an optimization problem In this paper we have used genetic algorithm to optimize the test case that are generated applying conditional coverage on source code  ...  ACKNOWLEDGMENT We are thankful to the faculty of Computer Science and Engineering, Shri Ramswaroop Memorial University for the motivation and continuous support time to time.  ... 
doi:10.5121/ijsea.2015.6303 fatcat:balwtbsm35hl7ltkqgmhnvmcuu

Automated Test Path Generation using Genetic Algorithm

Niveth Vijay K, Vipin Kumar K S
2017 International Journal of Engineering Research and  
In this paper, we propose an new fitness function for basis test path generation using Genetic algorithm.  ...  Basis path testing or structured testing is a white box method which analyses the control flow graph to find the set of linear independent path.  ...  Fig. 2 shows the types of structural testing. Control flow graphs or program graphs that represent the control flow of programs are widely used in the analysis of software.  ... 
doi:10.17577/ijertv6is070262 fatcat:tqkx6murr5ap3maoapwx5qp5sq

Relating Real-Time Backpropagation and Backpropagation-Through-Time: An Application of Flow Graph Interreciprocity

Françoise Beaufays, Eric A. Wan
1994 Neural Computation  
Transposing this flow graph, we get a new graph, which cor- responds to the BPTT algorithm for the controller—-plant structure (see Fig. 5b).  ...  Wan Aw7 (k) Figure 2: Flow graph associated with the real-time backpropagation algorithm. Let us now build a new flow graph by transposing the flow graph of Figure 2.  ... 
doi:10.1162/neco.1994.6.2.296 fatcat:ajbomhdp4jbgvg6ipganyaxme4

Flow Graph Representation

A. Orailoglu, D.D. Gajski
1986 23rd ACM/IEEE Design Automation Conference  
CONTROL-FLOW STRUCTURE The control flow graph consists of several node types ( Fig. 4 ).  ...  The algorithm needs to represent correctly possible multiple control flow nodes within each branch of the Diverge node in the control flow graph.  ... 
doi:10.1109/dac.1986.1586135 fatcat:dnojcahbdfelnbmalpcqvatpmi

Simple Generation of Static Single-Assignment Form [chapter]

John Aycock, Nigel Horspool
2000 Lecture Notes in Computer Science  
In this paper we present a new, simple method for converting to SSA form, which produces correct solutions for nonreducible control-flow graphs, and produces minimal solutions for reducible ones.  ...  Our timing results show that, despite its simplicity, our algorithm is competitive with more established techniques.  ...  The IFIP Working Group 2.4 made a number of helpful comments; in particular, Bob Morgan suggested applying our algorithm for re-minimization. The anonymous referees made many helpful comments.  ... 
doi:10.1007/3-540-46423-9_8 fatcat:zdgr47ydsfgl3fynf6diuzzwve

Page 2139 of Mathematical Reviews Vol. , Issue 85e [page]

1985 Mathematical Reviews  
Authors’ summary: “Many complex systems involving concur- rency are composed of two parts: a control structure and a data processing structure.  ...  We are concerned with the problem of spec- ifying the input-output behavior of control structures.  ... 

Single-pass generation of static single-assignment form for structured languages

Marc M. Brandis, Hanspeter Mössenböck
1994 ACM Transactions on Programming Languages and Systems  
Algorithms are known that generate SSA form from programs with an arbitrary flow of control. These algorithms need several passes.  ...  We show that it is possible to generate SSA form in a single pass (even during parsing) if the program contains only structured control flow (i.e., no gotos).  ...  ACKNOWLEDGEMENTS We would like to thank Robert Griesemer and Josef Templ for their valuable comments on earlier versions of this paper as well as the anonymous referees for their many helpful suggestions  ... 
doi:10.1145/197320.197331 fatcat:lxpi2r2omvduldkvwzcjvi2wvi

The combining DAG: a technique for parallel data flow analysis

R. Kramer, R. Gupta, M.L. Soffa
1994 IEEE Transactions on Parallel and Distributed Systems  
The technique first changes cyclic structures in a control flow graph to acyclic structures and then builds a combining directed acyclic graph (DAG) that represents the paths through the control flow graph  ...  Although converting a sequential data flow algorithm to a parallel algorithm can present some opportunities for computing data flow in parallel, more parallelism can be exposed by the development of new  ...  In this paper, we present a new technique for computing parallel data flow that is applicable to structured control flow graphs and solves rapid data flow problems [9], [lo] .  ... 
doi:10.1109/71.298205 fatcat:q3cxj6r7fzap3aadgakkevmfie

LISA: A LINEAR STRUCTURED SYSTEM ANALYSIS PROGRAM

S. Martinez-Martinez, T. Mader, T. Boukhobza, F. Hamelin
2007 IFAC Proceedings Volumes  
More precisely, the program LISA contains programmed algorithms which allow us to study the most recent results in the analysis of the structured systems.  ...  LISA is a flexible and portable program which has been developed to analyse structural properties of large scale linear and bilinear structured systems.  ...  SaTool uses mainly the bipartite graph to represent structured systems. In this article, a new tool for the analysis of structured linear and bilinear systems is presented.  ... 
doi:10.3182/20071017-3-br-2923.00091 fatcat:tvbunw5abrexjdajc6n7zd5qju

Applying Graph Reduction Techniques for Identifying Structural Conflicts in Process Models [chapter]

Wasim Sadiq, Maria E. Orlowska
1999 Lecture Notes in Computer Science  
We present a visual verification approach and algorithm that employs a set of graph reduction rules to identify structural conflicts in process models for a generic workflow modeling language.  ...  Using a generic process modeling language for workflows, we show how a control flow specification may contain certain structural conflicts that could compromise its correct execution.  ...  The main contribution of the paper is a new technique for identifying structural conflicts in process models.  ... 
doi:10.1007/3-540-48738-7_15 fatcat:wzpimb5p7vf7zixdcti5jopa2q

Embedded Parallel Systems Based on Dynamic Look-Ahead Reconfiguration in Redundant Communication Resources

E. Laskowski, M. Tudruj
2006 9th EUROMICRO Conference on Digital System Design (DSD'06)  
Automatic program structuring for the assumed system architecture is proposed based on the analysis of parallel program graphs.  ...  The program execution time is evaluated by simulated program graph execution with reconfiguration control modeled as an extension of the program graph.  ...  Parallel program representation In the paper we use the Branching Task Graph (BTG), a new representation of data and control flow in parallel programs.  ... 
doi:10.1109/dsd.2006.48 dblp:conf/dsd/LaskowskiT06 fatcat:binkdso4abez5di4wuwu2egvp4

All Structured Programs Have Small Tree Width and Good Register Allocation

Mikkel Thorup
1998 Information and Computation  
The interference graph of a flow graph G is the intersection graph of some connected subgraphs of G.  ...  Thus, for every structured program, we can do register allocation efficiently within a factor 4 from optimality, regardless of how many registers are needed.  ...  algorithms are generalizations of those in [28] for series parallel control-flow graphs.  ... 
doi:10.1006/inco.1997.2697 fatcat:l4gl7z57obf4xiylcqe2yheeuq

Using hammock graphs to structure programs

Fubo Zhang, E.H. D'Hollander
2004 IEEE Transactions on Software Engineering  
A simple and effective technique is presented to convert unstructured branches into hammock graph control structures.  ...  However, unstructured branch statements, such as jumps and goto's, render the control flow analysis difficult, time-consuming, and result in poor code generation.  ...  If all control graphs of a control flow graph are structured, i.e., are hammocks, then the contro flow graph is called complete hammock and the program is well-structured.  ... 
doi:10.1109/tse.2004.1274043 fatcat:trxvzmdcpjcy7ndklattocnn2i

The program structure tree

Richard Johnson, David Pearson, Keshav Pingali
1994 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation - PLDI '94  
We give a linear-time algorithm for finding SESE regions and for building the PST of arbitrary control flow graphs (including irreducible ones).  ...  In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flow graph.  ...  Acknowledgments: We would like to thank Bob Tarjan for his extensive comments on an earlier version of this paper, and for bringing his work with Jacobo Valdes to our attention.  ... 
doi:10.1145/178243.178258 dblp:conf/pldi/JohnsonPP94 fatcat:wfd767osa5hclmrmssfratsmne

The program structure tree

Richard Johnson, David Pearson, Keshav Pingali
1994 SIGPLAN notices  
We give a linear-time algorithm for finding SESE regions and for building the PST of arbitrary control flow graphs (including irreducible ones).  ...  In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flow graph.  ...  Acknowledgments: We would like to thank Bob Tarjan for his extensive comments on an earlier version of this paper, and for bringing his work with Jacobo Valdes to our attention.  ... 
doi:10.1145/773473.178258 fatcat:eeufk7xqljhdpisqvudfeleb7i
« Previous Showing results 1 — 15 out of 215,159 results