DOCSLIB.ORG

Freeing Testers from Polluting Test Objectives

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Freeing Testers from Polluting Test Objectives Freeing Testers from Polluting Test Objectives Michaël Marcozzi, Sébastien Bardin, Mike Papadakis Nikolai Kosmatov, Virgile Prevosto, Interdisciplinary Centre for Loïc Correnson Security, Reliability and Trust CEA, LIST, Software Reliability Laboratory University of Luxembourg Gif-sur-Yvette, France Luxembourg, Luxembourg fi[email protected] [email protected] ABSTRACT Problem. White-box testing criteria are purely syntactic and thus Testing is the primary approach for detecting software defects. A totally blind to the semantic of the program under analysis. As a major challenge faced by testers lies in crafting efficient test suites, consequence, many of the test objectives that they define may turn able to detect a maximum number of bugs with manageable ef- out to be in practice either fort. To do so, they rely on coverage criteria, which define some (a) infeasible: no input can satisfy them, such as dead code or precise test objectives to be covered. However, many common cri- equivalent mutants [2], or teria specify a significant number of objectives that occur to be (b) duplicate versions of other objectives: satisfied by exactly the infeasible or redundant in practice, like covering dead code or se- same inputs, such as semantically equal mutants [53], or mantically equal mutants. Such objectives are well-known to be (c) subsumed by another objective: satisfied by every input cover- harmful to the design of test suites, impacting both the efficiency ing the other objective [1, 37, 52], such as validity of a condi- and precision of testers’ effort. This work introduces a sound and tion logically implied by another one in condition coverage. scalable formal technique able to prune out a significant part of the infeasible and redundant objectives produced by a large panel of We refer to these three situations as polluting test objectives, which white-box criteria. In a nutshell, we reduce this challenging prob- are well-known to be harmful to the testing task [52, 53, 62, 63, 65] lem to proving the validity of logical assertions in the code un- for two main reasons: der test. This technique is implemented in a tool that relies on • While (early) software testing theory [66] requires all the crite- weakest-precondition calculus and SMT solving for proving the rion objectives to be covered, this seldom reflects the actual prac- assertions. The tool is built on top of the Frama-C verification plat- tice, which usually relies on test suites covering only a part of form, which we carefully tune for our specific scalability needs. them [23]. This is due to the difficulty of generating the appro- The experiments reveal that the tool can prune out up to 27% of priate test inputs, but also to infeasible test objectives. Indeed, test objectives in a program and scale to applications of 200K lines testers often cannot know whether they fail to cover them be- of code. cause their test suites are weak or because they are infeasible, possibly wasting a significant amount of their test budget try- KEYWORDS ing to satisfy them. Software Testing, White-Box Testing, Coverage Criteria, Polluting • As full objective coverage is rarely reached in practice, testers Test Objectives, Formal Methods rely on the ratio of covered objectives to measure the strength of their test suites. However, the working assumption of this prac- 1 INTRODUCTION tice is that all objectives are of equal value. Early testing research Context. Heretofore, software testing is the primary method for demonstrated that this is not true [1, 13, 17, 52], as duplication detecting software defects [2, 42, 44, 66]. It is performed by exe- and subsumption can make a large number of feasible test objec- arXiv:1708.08765v1 [cs.SE] 29 Aug 2017 cuting the programs under analysis with some inputs, in the aim tives redundant. Such coverable redundant objectives may arti- of finding some unintended (defective) behavior. As the number ficially deflate or inflate the coverage ratio. This skews the mea- of possible test inputs is typically enormous, testers do limit their surement, which may misestimate test thoroughness and fail to tests in practice to a manageable but carefully crafted set of in- evaluate correctly the remaining cost to full coverage. puts, called a test suite. To build such suites, they rely on so-called coverage criteria, also known as adequacy or test criteria, which Goal and Challenges. While detecting all polluting test objec- define the objectives of testing [2, 66]. In particular, many white- tives is undecidable [1, 52], our goal is to provide a technique capa- box criteria have been proposed so far, where the test objectives ble to identify a significant part of them. This is a challenging task are syntactic elements of the code that should be covered by run- as it requires to perform complex program analyses over large sets ning the test suite. For example, the condition coverage criterion of objectives produced by various criteria. Moreover, duplication imposes to cover all possible outcomes of the boolean conditions and subsumption should be checked for each pair of objectives, a appearing in program decisions, while the mutant coverage crite- priori putting a quadratic penalty over the necessary analyses. rion requires to differentiate the program from a set of its syntactic Although many studies have demonstrated the harmful effects variants. Testers need then to design their suite of inputs to cover of polluting objectives, to date there is no scalable technique to the corresponding test objectives, such as — for the two aforemen- discard them. Most related research works (see Tables 1, 2 and Sec- tioned cases — condition outcomes or mutants to kill. tion 8) focus on the equivalent mutant problem, i.e. the particular arXiv.org, August, 2017 Marcozzi et al. instance of infeasible test objectives for the mutant coverage cri- 1 // given three sides x,y,z of a valid triangle, computes terion. These operate either in dynamic mode, i.e. mutant classifi- 2 // its type as: 0 scalene, 1 isosceles, 2 equilateral 3 int type = 0; cation [57, 58], or in static mode, i.e. Trivial Compiler Equivalence 4 // l1: x == y && y == z; (DC) l2: x != y || y != z; (DC) (TCE) [53]. Unfortunately, the dynamic methods are unsound and 5 //l3: x==y;(CC) l4: x!=y;(CC) 6 if( x == y && y == z ){ produce many false positives [51, 58], while the static one deals 7 type = type + 1; only with strong mutation and cannot detect subsumed mutants 8 } (whereas it handles duplicates in addition to infeasible ones). The 9 // l5: x==y || y==z || x==z; (DC) l6: x!=y && y!=z && x!=z; (DC) 10 //l7:x==y;(CC) l8:x!=y;(CC) LUncov technique [8] combines two static analyses to prune out 11 // l9: x!=y && y==z && x==z; (MCC) l10: x==y && y!=z && x==z;(MCC) infeasible objectives from a panel of white-box criteria in a generic 12 if( x == y || y == z || x == z ){ way, but faces scalability issues. 13 // l11: type + 1 != type + 2; (WM) l12: type + 1 != type; (WM) 14 // l13: type + 1 != -type + 1; (WM) l14: type + 1 != 1; (WM) 15 type = type + 1; } KindofPollution Criterion 16 Sound Scale Inf. Dupl. Subs. Genericity Figure 1: Toy example of a C program with test objectives Mutant class. [58] × X X × × × TCE [53] X X X X × × • An open-source prototype tool LClean (Section 5) enacting the pro- LUncov [8] X × X × × X posed approach. It relies on an industrial-proof formal verifica- X XXXX X LClean (this work) tion platform, which we tune for the specific scalability needs of Table 1: Comparison with closest research techniques LClean, yielding a robust multi-core assertion-proving kernel. • A thorough evaluation (Sections 6 and 7) assessing Analyses Scope Acuteness (a) the scalability and detection power of LClean for three types built-in compiler TCE [53] interprocedural + of polluting objectives and four test criteria – pruning out up optimizations to 27% of the objectives in C files up to 200K lines, value analysis and LUncov [8] interprocedural ++ weakest-precondition (b) the impact of using a multi-core kernel and tailored verifica- LClean (this work) weakest-precondition local function + tion libraries on the required computation time (yielding a Table 2: Static analyses available in closest techniques speedup of approximately 45×), and (c) that, compared to the existing methods, LClean prunes out Proposal. Our intent is to provide a unified, sound and scalable so- four times more objectives than LUncov [8] in about half as lution to prune out a significant part of polluting objectives, includ- much time, it can be one order of magnitude faster than (un- ing infeasible but also duplicate and subsumed ones, while handling sound) dynamic identification of (likely) polluting objectives, a large panel of white-box criteria in a generic manner. To achieve and it detects half more duplicate objectives than TCE, while this, we propose reducing the problem of finding polluting objec- being complementary to it. tives for a wide range of criteria to the problem of proving the Potential Impact. Infeasible test objectives have been recognized validity of logical assertions inside the code under test. These as- as a main cost factor of the testing process [62, 63, 65]. By pruning sertions can then be verified using known verification techniques. out a significant number of them with LClean, testers could rein- Our approach, called LClean, is the first one that scales to pro- vest the gained cost in targeting full coverage of the remaining ob- grams composed of 200K lines of C code, while handling all types jectives. This would make testing more efficient, as most faults are of polluting test requirements. It is also generic, in the sense that found within high levels of coverage [22].
Load more

Recommended publications
  • Dominator Tree Certification and Independent Spanning Trees
    Dominator Tree Certification and Independent Spanning Trees∗ Loukas Georgiadis1 Robert E. Tarjan2 October 29, 2018 Abstract How does one verify that the output of a complicated program is correct? One can formally prove that the program is correct, but this may be beyond the power of existing methods. Alternatively one can check that the output produced for a particular input satisfies the desired input-output relation, by running a checker on the input-output pair. Then one only needs to prove the correctness of the checker. But for some problems even such a checker may be too complicated to formally verify. There is a third alternative: augment the original program to produce not only an output but also a correctness certificate, with the property that a very simple program (whose correctness is easy to prove) can use the certificate to verify that the input-output pair satisfies the desired input-output relation. We consider the following important instance of this general question: How does one verify that the dominator tree of a flow graph is correct? Existing fast algorithms for finding dominators are complicated, and even verifying the correctness of a dominator tree in the absence of additional information seems complicated. We define a correctness certificate for a dominator tree, show how to use it to easily verify the correctness of the tree, and show how to augment fast dominator-finding algorithms so that they produce a correctness certificate. We also relate the dominator certificate problem to the problem of finding independent spanning trees in a flow graph, and we develop algorithms to find such trees.
    [Show full text]
  • Maker-Breaker Total Domination Game Valentin Gledel, Michael A
    Maker-Breaker total domination game Valentin Gledel, Michael A. Henning, Vesna Iršič, Sandi Klavžar To cite this version: Valentin Gledel, Michael A. Henning, Vesna Iršič, Sandi Klavžar. Maker-Breaker total domination game. 2019. hal-02021678 HAL Id: hal-02021678 https://hal.archives-ouvertes.fr/hal-02021678 Preprint submitted on 16 Feb 2019 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Maker-Breaker total domination game Valentin Gledel a Michael A. Henning b Vesna Irˇsiˇc c;d Sandi Klavˇzar c;d;e January 31, 2019 a Univ Lyon, Universit´eLyon 1, LIRIS UMR CNRS 5205, F-69621, Lyon, France [email protected] b Department of Pure and Applied Mathematics, University of Johannesburg, Auckland Park 2006, South Africa [email protected] c Faculty of Mathematics and Physics, University of Ljubljana, Slovenia [email protected] [email protected] d Institute of Mathematics, Physics and Mechanics, Ljubljana, Slovenia e Faculty of Natural Sciences and Mathematics, University of Maribor, Slovenia Abstract Maker-Breaker total domination game in graphs is introduced as a natu- ral counterpart to the Maker-Breaker domination game recently studied by Duch^ene,Gledel, Parreau, and Renault.
    [Show full text]
  • 2- Dominator Coloring for Various Graphs in Graph Theory
    International Journal of Science and Research (IJSR) ISSN (Online): 2319-7064 Index Copernicus Value (2013): 6.14 | Impact Factor (2015): 6.391 2- Dominator Coloring for Various Graphs in Graph Theory A. Sangeetha Devi1, M. M. Shanmugapriya2 1Research Scholar, Department of Mathematics, Karpagam University, Coimbatore-21, India . 2Assistant Professor, Department of Mathematics, Karpagam University, Coimbatore-21, India Abstract: Given a graph G, the dominator coloring problem seeks a proper coloring of G with the additional property that every vertex in the graphG dominates at least 2-color class. In this paper, as an extension of Dominator coloring such that various graph using 2- dominator coloring has been discussed. Keywords: 2-Dominator Coloring, Barbell Graph, Star Graph, Banana Tree, Wheel Graph 1. Introduction of all the pendent vertices of G by „n‟ different colors. Introduce two new colors „퐶푖 „, „퐶푗 ‟alternatively to the In graph theory, coloring and dominating are two important subdividing vertices of G, C0 will dominates „퐶푖 „, „퐶푗 ‟. Also areas which have been extensively studied. The fundamental all the pendent verticies of G dominates at least two color parameter in the theory of graph coloring is the chromatic class. i.e, 1+n+2 ≤ 푛 + 3. Therefore χ푑,2 {C [ 푆1,푛 ] }≤ 푛 + number χ (G) of a graph G which is defined to be the 3 , n≥ 3. minimum number of colors required to color the vertices of G in such a way that no two adjacent vertices receive the Theorem 2.2 same color. If χ (G) = k, we say that G is k-chromatic. Let 푆 be a star graph, then χ (푆 ) =2, n 1,푛 푑,2 1,푛 .2 A dominating set S is a subset of the vertices in a graph such that every vertex in the graph either belongs to S or has a Proof: neighbor in S.
    [Show full text]
  • An Experimental Study of Dynamic Dominators∗
    An Experimental Study of Dynamic Dominators∗ Loukas Georgiadis1 Giuseppe F. Italiano2 Luigi Laura3 Federico Santaroni2 April 12, 2016 Abstract Motivated by recent applications of dominator computations, we consider the problem of dynamically maintaining the dominators of flow graphs through a sequence of insertions and deletions of edges. Our main theoretical contribution is a simple incremental algorithm that maintains the dominator tree of a flow graph with n vertices through a sequence of k edge in- sertions in O(m minfn; kg + kn) time, where m is the total number of edges after all insertions. Moreover, we can test in constant time if a vertex u dominates a vertex v, for any pair of query vertices u and v. Next, we present a new decremental algorithm to update a dominator tree through a sequence of edge deletions. Although our new decremental algorithm is not asymp- totically faster than repeated applications of a static algorithm, i.e., it runs in O(mk) time for k edge deletions, it performs well in practice. By combining our new incremental and decremen- tal algorithms we obtain a fully dynamic algorithm that maintains the dominator tree through intermixed sequence of insertions and deletions of edges. Finally, we present efficient imple- mentations of our new algorithms as well as of existing algorithms, and conduct an extensive experimental study on real-world graphs taken from a variety of application areas. 1 Introduction A flow graph G = (V; E; s) is a directed graph with a distinguished start vertex s 2 V . A vertex v is reachable in G if there is a path from s to v; v is unreachable if no such path exists.
    [Show full text]
  • Improving the Compilation Process Using Program Annotations
    POLITECNICO DI MILANO Corso di Laurea Magistrale in Ingegneria Informatica Dipartimento di Elettronica, Informazione e Bioingegneria Improving the Compilation process using Program Annotations Relatore: Prof. Giovanni Agosta Correlatore: Prof. Lenore Zuck Tesi di Laurea di: Niko Zarzani, matricola 783452 Anno Accademico 2012-2013 Alla mia famiglia Alla mia ragazza Ai miei amici Ringraziamenti Ringrazio in primis i miei relatori, Prof. Giovanni Agosta e Prof. Lenore Zuck, per la loro disponibilità, i loro preziosi consigli e il loro sostegno. Grazie per avermi seguito sia nel corso della tesi che della mia carriera universitaria. Ringrazio poi tutti coloro con cui ho avuto modo di confrontarmi durante la mia ricerca, Dr. Venkat N. Venkatakrishnan, Dr. Rigel Gjomemo, Dr. Phu H. H. Phung e Giacomo Tagliabure, che mi sono stati accanto sin dall’inizio del mio percorso di tesi. Voglio ringraziare con tutto il cuore la mia famiglia per il prezioso sup- porto in questi anni di studi e Camilla per tutto l’amore che mi ha dato anche nei momenti più critici di questo percorso. Non avrei potuto su- perare questa avventura senza voi al mio fianco. Ringrazio le mie amiche e i miei amici più cari Ilaria, Carolina, Elisa, Riccardo e Marco per la nostra speciale amicizia a distanza e tutte le risate fatte assieme. Infine tutti i miei conquilini, dai più ai meno nerd, per i bei momenti pas- sati assieme. Ricorderò per sempre questi ultimi anni come un’esperienza stupenda che avete reso memorabile. Mi mancherete tutti. Contents 1 Introduction 1 2 Background 3 2.1 Annotated Code . .3 2.2 Sources of annotated code .
    [Show full text]
  • Static Analysis for Bsplib Programs Filip Jakobsson
    Static Analysis for BSPlib Programs Filip Jakobsson To cite this version: Filip Jakobsson. Static Analysis for BSPlib Programs. Distributed, Parallel, and Cluster Computing [cs.DC]. Université d’Orléans, 2019. English. NNT : 2019ORLE2005. tel-02920363 HAL Id: tel-02920363 https://tel.archives-ouvertes.fr/tel-02920363 Submitted on 24 Aug 2020 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. UNIVERSITÉ D’ORLÉANS ÉCOLE DOCTORALE MATHÉMATIQUES, INFORMATIQUE, PHYSIQUE THÉORIQUE ET INGÉNIERIE DES SYSTÈMES LABORATOIRE D’INFORMATIQUE FONDAMENTALE D’ORLÉANS HUAWEI PARIS RESEARCH CENTER THÈSE présentée par : Filip Arvid JAKOBSSON soutenue le : 28 juin 2019 pour obtenir le grade de : Docteur de l’université d’Orléans Discipline : Informatique Static Analysis for BSPlib Programs THÈSE DIRIGÉE PAR : Frédéric LOULERGUE Professeur, University Northern Arizona et Université d’Orléans RAPPORTEURS : Denis BARTHOU Professeur, Bordeaux INP Herbert KUCHEN Professeur, WWU Münster JURY : Emmanuel CHAILLOUX Professeur, Sorbonne Université, Président Gaétan HAINS Ingénieur-Chercheur, Huawei Technologies, Encadrant Wijnand SUIJLEN Ingénieur-Chercheur, Huawei Technologies, Encadrant Wadoud BOUSDIRA Maître de conference, Université d’Orléans, Encadrante Frédéric DABROWSKI Maître de conference, Université d’Orléans, Encadrant Acknowledgments Firstly, I am grateful to the reviewers for taking the time to read this doc- ument, and their insightful and helpful remarks that have greatly helped its quality.
    [Show full text]
  • Towards Source-Level Timing Analysis of Embedded Software Using Functional Verification Methods
    Fakultat¨ fur¨ Elektrotechnik und Informationstechnik Technische Universitat¨ Munchen¨ Towards Source-Level Timing Analysis of Embedded Software Using Functional Verification Methods Martin Becker, M.Sc. Vollst¨andigerAbdruck der von der Fakult¨at f¨urElektrotechnik und Informationstechnik der Technischen Universit¨atM¨unchenzur Erlangung des akademischen Grades eines Doktor-Ingenieurs (Dr.-Ing.) genehmigten Dissertation. Vorsitzender: Prof. Dr. sc. techn. Andreas Herkersdorf Pr¨ufendeder Dissertation: 1. Prof. Dr. sc. Samarjit Chakraborty 2. Prof. Dr. Marco Caccamo 3. Prof. Dr. Daniel M¨uller-Gritschneder Die Dissertation wurde am 13.06.2019 bei der Technischen Universit¨atM¨uncheneingereicht und durch die Fakult¨atf¨urElektrotechnik und Informationstechnik am 21.04.2020 angenommen. Abstract *** Formal functional verification of source code has become more prevalent in recent years, thanks to the increasing number of mature and efficient analysis tools becoming available. Developers regularly make use of them for bug-hunting, and produce software with fewer de- fects in less time. On the other hand, the temporal behavior of software is equally important, yet rarely analyzed formally, but typically determined through profiling and dynamic testing. Although methods for formal timing analysis exist, they are separated from functional veri- fication, and difficult to use. Since the timing of a program is a product of the source code and the hardware it is running on – e.g., influenced by processor speed, caches and branch predictors – established methods of timing analysis take place at instruction level, where enough details are available for the analysis. During this process, users often have to provide instruction-level hints about the program, which is a tedious and error-prone process, and perhaps the reason why timing analysis is not as widely performed as functional verification.
    [Show full text]
  • Durham E-Theses
    Durham E-Theses Hypergraph Partitioning in the Cloud LOTFIFAR, FOAD How to cite: LOTFIFAR, FOAD (2016) Hypergraph Partitioning in the Cloud, Durham theses, Durham University. Available at Durham E-Theses Online: http://etheses.dur.ac.uk/11529/ Use policy The full-text may be used and/or reproduced, and given to third parties in any format or medium, without prior permission or charge, for personal research or study, educational, or not-for-prot purposes provided that: • a full bibliographic reference is made to the original source • a link is made to the metadata record in Durham E-Theses • the full-text is not changed in any way The full-text must not be sold in any format or medium without the formal permission of the copyright holders. Please consult the full Durham E-Theses policy for further details. Academic Support Oce, Durham University, University Oce, Old Elvet, Durham DH1 3HP e-mail: [email protected] Tel: +44 0191 334 6107 http://etheses.dur.ac.uk Hypergraph Partitioning in the Cloud Foad Lotfifar Abstract The thesis investigates the partitioning and load balancing problem which has many applications in High Performance Computing (HPC). The application to be partitioned is described with a graph or hypergraph. The latter is of greater interest as hypergraphs, compared to graphs, have a more general structure and can be used to model more complex relationships between groups of objects such as non- symmetric dependencies. Optimal graph and hypergraph partitioning is known to be NP-Hard but good polynomial time heuristic algorithms have been proposed.
    [Show full text]
  • Organization Control-Flow Graphs Dominators
    10/14/2019 Organization • Dominator relation of CFGs Dominators, – postdominator relation control-dependence • Dominator tree and SSA form • Computing dominator relation and tree – Dataflow algorithm – Lengauer and Tarjan algorithm • Control-dependence relation • SSA form 12 Control-flow graphs Dominators START • CFG is a directed graph START • Unique node START from which • In a CFG G, node a is all nodes in CFG are reachable a said to dominate node a • Unique node END reachable from b b all nodes b if every path from • Dummy edge to simplify c c discussion START END START to b contains • Path in CFG: sequence of nodes, de de possibly empty, such that a. successive nodes in sequence are connected in CFG by edge f • Dominance relation: f – If x is first node in sequence and y is last node, we will write the path g relation on nodes g as x * y – If path is non-empty (has at least – We will write a dom b one edge) we will write x + y END if a dominates b END 34 1 10/14/2019 Example Computing dominance relation • Dataflow problem: START START A B C D E F G END A START x xxxxxxx x Domain: powerset of nodes in CFG A x x x x xxx B B x x x xxx N C C Dom(N) = {N} U ∩ Dom(M) D x M ε pred(N) DE E x F xx F G x Find greatest solution. END x G Work through example on previous slide to check this. Question: what do you get if you compute least solution? END 56 Properties of dominance Example of proof • Dominance is • Let us prove that dominance is transitive.
    [Show full text]
  • Control-Flow Analysis
    Control‐Flow Analysis Chapter 8, Section 8.4 Chapter 9, Section 9.6 URL from the course web page [copyrighted material, please do not link to it or distribute it] Control‐Flow Graphs • Control‐flow graph (CFG) for a procedure/method – A node is a basic block: a single‐entry‐single‐exit sequence of three‐address instructions – An edge represents the potential flow of control from one basic block to another • Uses of a control‐flow graph – Inside a basic block: local code optimizations; done as part of the code generation phase – Across basic blocks: global code optimizations; done as part of the code optimization phase – Aspects of code generation: e.g., global register allocation 2 Control‐Flow Analysis • Part 1: Constructing a CFG • Part 2: Finding dominators and post‐dominators • Part 3: Finding loops in a CFG – What exactly is a loop?We cannot simply say “whatever CFG subgraph is generated by while, do‐while, and for statements” – need a general graph‐theoretic definition • Part 4: Static single assignment form (SSA) • Part 5: Finding control dependences – Necessary as part of constructing the program dependence graph (PDG), a popular IR for software tools for slicing, refactoring, testing, and debugging 3 Part 1: Constructing a CFG • Basic block: maximal sequence of consecutive three‐address instructions such that – The flow of control can enter only through the first instruction (i.e., no jumps into the middle of the block) – The flow of control can exit only at the last instruction • Given: the entire sequence of instructions • First, find the leaders (starting instructions of all basic blocks) – The first instruction – The target of any conditional/unconditional jump – Any instruction that immediately follows a conditional 4 or unconditional jump Constructing a CFG • Next, find the basic blocks: for each leader, its basic block contains itself and all instructions up to (but not including) the next leader 1.
    [Show full text]
  • On Dominator Colorings in Graphs
    CORE Metadata, citation and similar papers at core.ac.uk Provided by Calhoun, Institutional Archive of the Naval Postgraduate School Calhoun: The NPS Institutional Archive Faculty and Researcher Publications Faculty and Researcher Publications 2007 On dominator colorings in graphs Gera, Ralucca Graph Theory Notes N. Y. / Volume 52, 25-30 http://hdl.handle.net/10945/25542 On Dominator Colorings in Graphs Ralucca Michelle Gera Department of Applied Mathematics Naval Postgraduate School Monterey, CA 93943, USA ABSTRACT Given a graph G, the dominator coloring problem seeks a proper coloring of G with the additional property that every vertex in the graph dom- inates an entire color class. We seek to minimize the number of color classes. We study this problem on several classes of graphs, as well as finding general bounds and characterizations. We also show the relation between dominator chromatic number, chromatic number, and domina- tion number. Key Words: coloring, domination, dominator coloring. AMS Subject Classification: 05C15, 05C69. 1 Introduction and motivation A dominating set S is a subset of the vertices in a graph such that every vertex in the graph either belongs to S or has a neighbor in S. The domination number is the order of a minimum dominating set. The topic has long been of interest to researchers [1, 2]. The associated decision problem, dominating set, has been studied in the computational complexity literature [3], and so has the associated optimization problem, which is to find a dominating set of minimum cardinality. Numerous variants of this problem have been studied [1, 2, 4, 5], and here we study one more that was introduced in [6].
    [Show full text]
  • On Dominator Colorings in Graphs
    Proc. Indian Acad. Sci. (Math. Sci.) Vol. 122, No. 4, November 2012, pp. 561–571. c Indian Academy of Sciences On dominator colorings in graphs S ARUMUGAM1,2, JAY BAGGA3 and K RAJA CHANDRASEKAR1 1National Centre for Advanced Research in Discrete Mathematics (n-CARDMATH), Kalasalingam University, Anand Nagar, Krishnankoil 626126, India 2School of Electrical Engineering and Computer Science, The University of Newcastle, Newcastle, NSW 2308, Australia 3Department of Computer Science, Ball State University, Muncie, IN 47306, USA E-mail: [email protected]; [email protected]; [email protected] MS received 30 March 2011; revised 30 September 2011 Abstract. A dominator coloring of a graph G is a proper coloring of G in which every vertex dominates every vertex of at least one color class. The minimum number of colors required for a dominator coloring of G is called the dominator chromatic number of G and is denoted by χd (G). In this paper we present several results on graphs with χd (G) = χ(G) and χd (G) = γ(G) where χ(G) and γ(G) denote respectively the chromatic number and the domination number of a graph G. We also prove that if μ(G) is the Mycielskian of G,thenχd (G) + 1 ≤ χd (μ(G)) ≤ χd (G) + 2. Keywords. Dominator coloring; dominator chromatic number; chromatic number; domination number. 1. Introduction ByagraphG = (V, E), we mean a finite, undirected graph with neither loops nor multi- ple edges. The order and size of G are denoted by n =|V | and m =|E| respectively. For graph theoretic terminology we refer to Chartrand and Lesniak [4].
    [Show full text]