54 results on '"Harman, Mark"'
Search Results
2. Kafka and the Muirs.
- Author
-
Harman, Mark
- Subjects
- *
LITERARY criticism , *TRANSLATING & interpreting - Published
- 2023
3. Model validation using mutated training labels: An exploratory study.
- Author
-
Zhang, Jie M., Harman, Mark, Guedj, Benjamin, Barr, Earl T., and Shawe-Taylor, John
- Subjects
- *
MODEL validation , *SUPERVISED learning , *MACHINE learning , *INTUITION - Abstract
We introduce an exploratory study on Mutation Validation (MV), a model validation method using mutated training labels for supervised learning. MV mutates training data labels, retrains the model against the mutated data, and then uses the metamorphic relation that captures the consequent training performance changes to assess model fit. It does not use a validation set or test set. The intuition underpinning MV is that overfitting models tend to fit noise in the training data. MV does not aim to replace out-of-sample validation. Instead, we provide the first exploratory study on the possibility of using MV as a complement of out-of-sample validation. We explore 8 different learning algorithms, 18 datasets, and 5 types of hyperparameter tuning tasks. Our results demonstrate that MV complements well cross-validation and test accuracy in model selection and hyperparameter tuning tasks. MV deserves more attention from developers when simplicity, sustainaiblity, security (e.g., defending training data attack), and interpretability of the built models are required. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
4. The Oracle Problem in Software Testing: A Survey.
- Author
-
Barr, Earl T., Harman, Mark, McMinn, Phil, Shahbaz, Muzammil, and Yoo, Shin
- Subjects
- *
COMPUTER software testing , *EXECUTION traces (Computer program testing) , *ORACLE software , *MUTATION testing of computer software , *DEBUGGING - Abstract
Testing involves examining the behaviour of a system in order to discover potential faults. Given an input for a system, the challenge of distinguishing the corresponding desired, correct behaviour from potentially incorrect behavior is called the “test oracle problem”. Test oracle automation is important to remove a current bottleneck that inhibits greater overall test automation. Without test oracle automation, the human has to determine whether observed behaviour is correct. The literature on test oracles has introduced techniques for oracle automation, including modelling, specifications, contract-driven development and metamorphic testing. When none of these is completely adequate, the final source of test oracle information remains the human, who may be aware of informal specifications, expectations, norms and domain specific information that provide informal oracle guidance. All forms of test oracles, even the humble human, involve challenges of reducing cost and increasing benefit. This paper provides a comprehensive survey of current approaches to the test oracle problem and an analysis of trends in this important area of software testing research and practice. [ABSTRACT FROM PUBLISHER]
- Published
- 2015
- Full Text
- View/download PDF
5. Search-Based Software Engineering: Trends, Techniques and Applications.
- Author
-
HARMAN, MARK, MANSOURI, S. AFSHIN, and YUANYUAN ZHANG
- Subjects
- *
COMPUTER-aided software engineering , *MATHEMATICAL optimization , *COMPUTER surveys , *AUTOMATED library acquisitions systems , *COMPUTER algorithms , *COMPUTER software , *COMPUTER architecture , *COMPUTER software development - Abstract
In the past five years there has been a dramatic increase in work on Search-Based Software Engineering (SBSE), an approach to Software Engineering (SE) in which Search-Based Optimization (SBO) algorithms are used to address problems in SE. SBSE has been applied to problems throughout the SE lifecycle, from requirements and project planning to maintenance and reengineering. The approach is attractive because it offers a suite of adaptive automated and semiautomated solutions in situations typified by large complex problem spaces with multiple competing and conflicting objectives. This article1 provides a review and classification of literature on SBSE. The work identifies research trends and relationships between the techniques applied and the applications to which they have been applied and highlights gaps in the literature and avenues for further research. [ABSTRACT FROM AUTHOR]
- Published
- 2012
- Full Text
- View/download PDF
6. A Theoretical and Empirical Study of Search-Based Testing: Local, Global, and Hybrid Search.
- Author
-
Harman, Mark and McMinn, Phil
- Subjects
- *
ALGORITHMS , *COMBINATORIAL optimization , *SOFTWARE engineering , *COMPUTER software development , *ARTIFICIAL intelligence - Abstract
Search-based optimization techniques have been applied to structural software test data generation since 1992, with a recent upsurge in interest and activity within this area. However, despite the large number of recent studies on the applicability of different search-based optimization approaches, there has been very little theoretical analysis of the types of testing problem for which these techniques are well suited. There are also few empirical studies that present results for larger programs. This paper presents a theoretical exploration of the most widely studied approach, the global search technique embodied by Genetic Algorithms. It also presents results from a large empirical study that compares the behavior of both global and local search-based optimization on realworld programs. The results of this study reveal that cases exist of test data generation problem that suit each algorithm, thereby suggesting that a hybrid global-local search (a Memetic Algorithm) may be appropriate. The paper presents a Memetic Algorithm along with further empirical results studying its performance. [ABSTRACT FROM AUTHOR]
- Published
- 2010
- Full Text
- View/download PDF
7. A search based approach to fairness analysis in requirement assignments to aid negotiation, mediation and decision making.
- Author
-
Finkelstein, Anthony, Harman, Mark, Mansouri, S. Afshin, Jian Ren, and Yuanyuan Zhang
- Subjects
- *
CUSTOMER relations , *ALGORITHMS , *CONFLICT management , *DECISION making , *DATA - Abstract
This paper uses a multi-objective optimisation approach to support investigation of the trade-offs in various notions of fairness between multiple customers. Results are presented to validate the approach using two real-world data sets and also using data sets created specifically to stress test the approach. Simple graphical techniques are used to visualize the solution space. The paper also reports on experiments to determine the most suitable algorithm for this problem, comparing the results of the NSGA-II algorithms, a widely used multi objective evolutionary algorithm, and the Two-Archive evolutionary algorithm, a recently proposed alternative. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
8. Dependence Clusters in Source Code.
- Author
-
HARMAN, MARK, BINKLEY, DAVID, GALLAGHER, KEITH, GOLD, NICOLAS, and KRINKE, JENS
- Subjects
- *
SOURCE code , *C (Computer program language) , *REVERSE engineering , *SOFTWARE maintenance , *TECHNICAL specifications , *COMPUTER software - Abstract
A dependence cluster is a set of program statements, all of which are mutually inter-dependent. This article reports a large scale empirical study of dependence clusters in C program source code. The study reveals that large dependence clusters are surprisingly commonplace. Most of the 45 programs studied have clusters of dependence that consume more than 10% of the whole program. Some even have clusters consuming 80% or more. The widespread existence of clusters has implications for source code analyses such as program comprehension, software maintenance, software testing, reverse engineering, reuse, and parallelization. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
9. The Role of Translation in German Studies.
- Author
-
Harman, Mark and Alter, Nora
- Subjects
- *
TRANSLATING & interpreting , *CURRICULUM , *SCHOLARLY method , *STUDENTS , *CULTURAL studies , *FOREIGN language education , *LITERATURE studies , *COMPOSITION (Language arts) , *WRITTEN communication - Abstract
The article discusses the importance of integrating translation into curricula and scholarship. In literature courses, paying attention to translation can help direct students to the aesthetic properties of literary works and combat what various perceive as a drift towards illiteracy in an age of visual overstimulation. The translation of primary texts in the field of cultural studies could help integrate the study of language, literature, and culture. Moreover, it is noted that careful use of translation in upper-level language courses can not only help foster an awareness of the stylistic features of German but also hone writing skills in English.
- Published
- 2008
- Full Text
- View/download PDF
10. Empirical Study of Optimization Techniques for Massive Slicing.
- Author
-
Binkley, David, Harman, Mark, and Krinke, Jens
- Subjects
- *
GRAPHIC methods , *MATHEMATICAL optimization , *EMPIRICAL research , *COST effectiveness , *COST analysis , *MANUFACTURING processes , *VIRTUAL storage (Computer science) , *SORTING (Electronic computers) , *ELECTRONIC data processing - Abstract
This article presents results from a study of techniques that improve the performance of graph-based interprocedural slicing of the System Dependence Graph (SDG). This is useful in "massive slicing" where slices are required for many or all of the possible set of slicing criteria. Several different techniques are considered, including forming strongly connected components, topological sorting, and removing transitive edges. Data collected from a test bed of just over 1,000,000 lines of code are presented. This data illustrates the impact on computation time of the techniques. Together, the best combination produces a 71% reduction in run-time (and a 64% reduction in memory usage). The complete set of techniques also illustrates the point at which faster computation is not viable due to prohibitive preprocessing costs. [ABSTRACT FROM AUTHOR]
- Published
- 2008
- Full Text
- View/download PDF
11. A non-standard semantics for program slicing and dependence analysis
- Author
-
Danicic, Sebastian, Harman, Mark, Howroyd, John, and Ouarbya, Lahcen
- Subjects
- *
PROGRAMMING language semantics , *ALGORITHMS , *ELECTRONIC data processing , *COMPUTER programming , *COMPUTER software - Abstract
Abstract: We introduce a new non-strict semantics for a simple while language. We demonstrate that this semantics allows us to give a denotational definition of variable dependence and neededness, which is consistent with program slicing. Unlike other semantics used in variable dependence, our semantics is substitutive. We prove that our semantics is preserved by traditional slicing algorithms. [Copyright &y& Elsevier]
- Published
- 2007
- Full Text
- View/download PDF
12. Search Algorithms for Regression Test Case Prioritization.
- Author
-
Zheng Li, Harman, Mark, and Hierons, Robert M.
- Subjects
- *
SOFTWARE engineering , *COMPUTER software , *REGRESSION analysis , *COMPUTER algorithms , *GENETIC algorithms , *COMBINATORIAL optimization - Abstract
Regression testing is an expensive, but important, process. Unfortunately, there may be insufficient resources to allow for the reexecution of all test cases during regression testing. In this situation, test case prioritization techniques aim to improve the effectiveness of regression testing by ordering the test cases so that the most beneficial are executed first. Previous work on regression test case prioritization has focused on Greedy Algorithms. However. it is known that these algorithms may produce suboptimal results because they may construct results that denote only local minima within the search space. By contrast, metaheuristic and evolutionary search algorithms aim to avoid such problems. This paper presents results from an empirical study of the application of several greedy, metaheuristic, and evolutionary search algorithms to six programs, ranging from 374 to 11,148 lines of code for three choices of fitness metric. The paper addresses the problems of choice of fitness metric, characterization of landscape modality, and determination of the most suitable search technique to apply. The empirical results replicate previous results concerning Greedy Algorithms. They shed light on the nature of the regression testing search space, indicating that it is multimodal. The results also show that Genetic Algorithms perform well, although Greedy approaches are surprisingly effective, given the multimodal nature of the landscape. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
13. Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time
- Author
-
Danicic, Sebastian, Harman, Mark, Hierons, Rob, Howroyd, John, and Laurence, Michael R.
- Subjects
- *
COMPUTER software , *LINEAR systems , *BINARY number system , *COMPUTER arithmetic , *COMPUTER science - Abstract
Abstract: A program schema defines a class of programs, all of which have identical statement structure, but whose expressions may differ. We define a class of syntactic similarity binary relations between linear structured schemas, which characterise schema equivalence for structured schemas that are linear, free and liberal. In this paper we report that similarity implies equivalence for linear schemas, and that a near-converse holds for schemas that are linear, free and liberal. We also show that the similarity of two linear schemas is polynomial-time decidable. Our main result considerably extends the class of program schemas for which equivalence is known to be decidable, and suggests that linearity is a constraint worthy of further investigation. [Copyright &y& Elsevier]
- Published
- 2007
- Full Text
- View/download PDF
14. Analysis and Visualization of Predicate Dependence on Formal Parameters and Global Variables.
- Author
-
Binkley, David and Harman, Mark
- Subjects
- *
COMPUTER software , *VISUALIZATION , *VISUAL programming languages (Computer science) , *EMPIRICAL research , *MATHEMATICAL variables , *VISUAL perception - Abstract
Empirical data concerning the qualitative and quantitative nature of program dependence is presented for a set of 20 programs ranging from 600 lines of code to 167,000 lines of code. The sources of dependence considered are global variables and formal parameters and the targets considered are a program's predicate nodes. The results show that as the number of formal parameters available to a predicate increases, there is a decrease in the proportion of these format parameters which are depended upon by the predicate. No such correlation was found for global variables. Results from theoretical and actual computation time analysis indicate that the computation of dependence information is practical, suggesting that the analysis may be beneficial to several application areas. The paper also presents results concerning correlations that provide strong evidence that the global and formal dependence sources are independent of one another and that the numbers of globals and formals are independent of the size of the procedure that contains them. Finally, two visualization techniques for displaying dependence information are introduced. Illustrations show how these visualizations and predicate dependence analysis can assist in activities such as testing, comprehension, and evolution. [ABSTRACT FROM AUTHOR]
- Published
- 2004
- Full Text
- View/download PDF
15. Testability Transformation.
- Author
-
Harman, Mark, Lin Hu, Hierons, Rob, Wegener, Joachim, Sthamer, Harmen, Baresel, André, and Roper, Marc
- Subjects
- *
SOFTWARE engineering , *ENGINEERING , *COMPUTER software - Abstract
A testability transformation is a source-to-source transformation that aims to improve the ability of a given test generation method to generate test data for the original program. This paper introduces testability transformation, demonstrating that it differs from traditional transformation, both theoretically and practically, while still allowing many traditional transformation rules to be applied. The paper illustrates the theory of testability transformation with an example application to evolutionary testing. An algorithm for flag removal is defined and results are presented from an empirical study which show how the algorithm improves both the performance of evolutionary test data generation and the adequacy level of the test data so-generated. [ABSTRACT FROM AUTHOR]
- Published
- 2004
- Full Text
- View/download PDF
16. Guaranteed inconsistency avoidance during software evolution.
- Author
-
Gallagher, Keith, Harman, Mark, and Danicic, Sebastian
- Subjects
- *
SOFTWARE maintenance , *COMPUTER software , *COMPUTER programmers , *COMPUTER systems - Abstract
The attempt to design and integrate consistent changes to an existing system is the essence of software maintenance. Software developers also confront similar problems: there are changes during testing and the release of new system builds. Whether in development or maintenance, changes to evolving systems must be made consistently; that is, without damaging correct computations. It is difficult for the programmer to ascertain the complete effect of a code change; the programmer may make a change to a program that is syntactically and semantically legal, but which has ripples into the parts of the program that were intended to remain unchanged. Using the standard denotational semantics for procedural programming languages, this paper formalizes decomposition slicing, which identifies interferences between software components and isolates the components to be changed. We enumerate the conditions for changing one component in ways that will guarantee that changes to it will not interact inconsistently and prove that changes made under these conditions are sound. Thus, the programmer can then execute changes secure in the knowledge that the semantics of the new system are guaranteed to be consistent with the projection of the semantics of the original for which it behaved, correctly. Validating that the changes do not interfere not only guarantees consistency with respect to previous unchanging behaviors, but can also be achieved with a complexity proportional to the size of the change to be made. Copyright © 2003 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]
- Published
- 2003
- Full Text
- View/download PDF
17. `At least he could garden': Beckett and Kafka.
- Author
-
Harman, Mark
- Subjects
- *
AUTHORS , *LITERARY aesthetics , *HUMAN sexuality in literature - Abstract
Examines the rivalry between authors Paris Beckett and Franz Kafka. Literary style of both authors; Influence of the book `The Castle,' by Kafka on the novel `Watt,' by Beckett; Characterization of sexual tones by both authors; Mastery of the authors on deathbed scenes.
- Published
- 1999
18. `Digging the pit of Babel': Retranslating Franz Kafka's Castle.
- Author
-
Harman, Mark
- Subjects
- *
BOOKS , *TRANSLATIONS , *HISTORICAL criticism (Literature) - Abstract
Discusses translation as a complex issue when applied to Franz Kafka's novel `The Castle.' Literary translators' different conception of the art; Change in the paradigm governing the practice of the craft; Description of Kafka's unique style in his book; Omission of transitions as one of the most modern features of `The Castle'; Absence of a unitary style.
- Published
- 1996
- Full Text
- View/download PDF
19. Kafka Imagining America: A Preface.
- Author
-
Harman, Mark
- Subjects
- *
SHORT story (Literary form) - Abstract
This article analyzes the short story "Amerika: The Missing Person," by Franz Kafka.
- Published
- 2008
20. A Gaelic Blackbird in the Shadow of Language.
- Author
-
Harman, Mark
- Subjects
- *
ENGLISH language , *VOCABULARY , *TRANSLATING & interpreting , *LANGUAGE schools , *IRISH Gaelic language , *LINGUISTICS - Abstract
This article examines the difference in the meaning of English words when spoken by Irish. At the Irish-language secondary school he attended, the author heard of theory that students could be thrown out for speaking English. He explained that his early exposure to the Irish language enabled him to feel at home in the country wherein he was also inspired to negotiate between English and German by translating authors such as Hermann Hesse and Robert Walser. He pointed that translation has been considered the principal means between Gaelic and English linguistic in the country.
- Published
- 2006
21. Missing Persons: Two Little Riddles About Kafka and Berlin.
- Author
-
Harman, Mark
- Subjects
- *
AUTHORS , *CITIES & towns , *PERSONS , *STUDENTS , *CRITICS , *BIOGRAPHERS , *ESSAYS , *AUSTRIAN letters - Abstract
For Austrian-Czech writer Franz Kafka, Berlin was not so much the real city on the Spree as his private symbol for much that he felt was lacking in Prague. Already in 1902, as a nineteen year-old student, he had coined an often-quoted metaphor for Prague: "This little mother has claws." While Kafka's continual preoccupation with Berlin is certainly no secret, critics and biographers haven't quite done justice to the city's place in his inner life. Here he wishes to explore the tension between his exuberant initial image of Berlin and the grim reality he encountered when he went to live there in the fall of 1923. He should also like to report on an ultimately futile yet perhaps not entirely unproductive search for missing letters that Kafka wrote for a little girl in the suburb of Stegiltz, a search which he carried out on the side while he was in Berlin a couple of years ago writing a series of linked essays about the furtive autobiography underlying all of his writings. Although some commentators trace Kafka's fascination with Berlin to his first meeting with writer Felice Bauer at the Brod family apartment in Prague in August 1912, he had in fact visited the city earlier, in December 1910, after cutting short a visit to Paris.
- Published
- 2004
22. Assemblies.
- Author
-
Walser, Martin and Harman, Mark
- Subjects
- EIN Springender Brunnen (Book)
- Abstract
Presents an excerpt from the book 'Ein springender Brunnen.'
- Published
- 2001
23. Guest Editorial: Special Issue on Software Maintenance and Evolution.
- Author
-
Harman, Mark, Korel, Bogdan, and Linos, Panagiotis K.
- Subjects
- *
CONFERENCES & conventions , *SOFTWARE maintenance , *COMPUTER software development , *SOFTWARE engineering , *COMPUTER programming , *ALGORITHMS - Abstract
The article presents information on the 20th anniversary of the IEEE International Conference on Software Maintenance (ICSM). Software maintenance and evolution continues to play a vital role in the development of software systems. For many years there has been an international effort among researchers and practitioners to control the costs associated with software maintenance and evolution and to improve the quality of the processes and products associated with this vital activity. Software maintenance encompasses human elements of software engineering, which require psychological, statistical, and empirical evaluation. It involves algorithms, methods, and techniques which require a deep understanding of all activities in the software development life cycle. Since its inception in 1983, ICSM has evolved into an international forum for researchers, practitioners, educators, technology transfer experts, project managers, tool developers, and users who explore current issues facing the computing community. In 2004, the ICSM program chairs, Mark Harman from King's College in London and Bogdan Korel from Illinois institute of Technology in Chicago, selected 38 papers for inclusion in the proceedings from 122 submissions.
- Published
- 2005
- Full Text
- View/download PDF
24. H. and K.: A translator's story.
- Author
-
Harman, Mark
- Subjects
- *
BOOKS , *HISTORICAL criticism (Literature) , *TRANSLATIONS - Abstract
Translates and criticizes the book `The Castle,' by Franz Kafka.
- Published
- 1998
25. Approaching K.'s Castle.
- Author
-
Harman, Mark
- Subjects
- *
METAPHOR in literature , *CRITICISM - Abstract
Presents a critique of Franz Kafka's 1922 novel `The Castle.' Obsessiveness of the hero as a reflection of the precarious physical and mental state of Kafka himself shortly before he began to write it; Use of metaphors; Home as a recurrent motif in the book; Kafka's correspondence with Max Brod; Experimentation with certain images and situations that recur in the novel.
- Published
- 1997
26. Joyce and Kafka.
- Author
-
Harman, Mark
- Subjects
- *
BIOGRAPHIES of authors - Abstract
Comments on the parallels in the lives and works of writers James Joyce and Franz Kafka. Similarities and contrasts in the two authors' political sentiments and social, cultural and religious orientations; How these sentiments and orientations are reflected in their works.
- Published
- 1993
27. Automated Patching Techniques: The Fix Is In.
- Author
-
Harman, Mark
- Subjects
- *
DEBUGGING , *EVOLUTIONARY computation , *SOFTWARE engineering , *ALGORITHMS , *PROGRAM transformation - Abstract
The article discusses an article published in the journal which discusses computer patches that use evolutionary computation to find and repair computer bugs. The author discusses how search-based optimization can allow software programmers to locate computer bugs using optimization algorithms, a process known as search based software engineering (SBSE).
- Published
- 2010
- Full Text
- View/download PDF
28. 'There need to be a balance': Mental health nurses' perspectives on medication education in university and clinical practice.
- Author
-
Goodwin, John, Kilty, Caroline, Harman, Mark, and Horgan, Aine
- Subjects
- *
CLINICAL competence , *CONTENT analysis , *DRUGS , *FOCUS groups , *HEALTH education , *INFORMED consent (Medical law) , *INTERVIEWING , *RESEARCH methodology , *MEDICAL practice , *NURSES' attitudes , *NURSING practice , *PATIENT compliance , *PATIENT education , *PSYCHIATRIC nursing , *STATISTICAL sampling , *TIME , *UNIVERSITIES & colleges , *THEMATIC analysis , *HUMAN research subjects , *DATA analysis software , *FIELD notes (Science) - Abstract
Working with medication is an important role of the mental health nurse. However, little research has focused on staff nurses' perspectives on where the responsibility lies for preparing student nurses for safe, competent medication management. This study investigated mental health nurses' perspectives on medication education. An interpretive descriptive approach was used. Two focus groups were conducted, and data were analysed using inductive content analysis. It was found that participants embraced a medical approach to servicer user care, with less positive attitudes demonstrated towards psychosocial approaches. There were also tensions expressed between clinical practice and the university, with uncertainty voiced about whose responsibility it was to educate students about medication management. It is important that both environments complement each other in order to enhance the student nurse educational experience. While mental health nurses should be educated in this area to practice in a safe and competent manner, it is also key that a holistic approach to care is considered. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
29. Robert Walser: Writing on the Periphery.
- Author
-
Harman, Mark
- Subjects
- *
SHORT story (Literary form) , *FICTION - Abstract
Reviews the book "Speaking to the Rose: Writings, 1912-1932," by Robert Walser, edited and translated by Christopher Middleton.
- Published
- 2008
- Full Text
- View/download PDF
30. Circus rider on two horses?
- Author
-
HARMAN, MARK
- Subjects
- *
LITERATURE translations , *GERMAN literature , *JEWISH literature , *TRANSLATIONS - Abstract
The author considers the literary translations of author Franz Kafka's work. He highlights the Czech and Austrian influences on Kafka's writing. He explains Kafka's understanding of literary translations. He claims that Kafka's involvement with translation extends beyond linguistic issues to questions regarding the association between German and Jewish traditions.
- Published
- 2010
31. Diversity comes to British poetry.
- Author
-
Harman, Mark
- Subjects
- *
ENGLISH poetry - Abstract
Reviews various books containing British poetry. Includes `The Frighteners,' by Sean O'Brien; `Electroplating the Baby,' by Jo Shapcott; `Zoom,' by Simon Armitage; `Tale of the Mayor's Son,' by Glyn Maxwell; `Explaining Magnetism,' by Maura Dooley; `The Bradford Count,' by Ian Duhig; `The Tutankhamun Variations,' by John Greening; `Body Politic,' by Tony Flynn; `Red,' by Linda France; More.
- Published
- 1994
32. The German Joyce.
- Author
-
Harman, Mark
- Subjects
- *
GERMAN literature , *NONFICTION , *LITERATURE & society - Published
- 2014
- Full Text
- View/download PDF
33. Input Domain Reduction through Irrelevant Variable Removal and Its Effect on Local, Global, and Hybrid Search-Based Structural Test Data Generation.
- Author
-
McMinn, Phil, Harman, Mark, Lakhotia, Kiran, Hassoun, Youssef, and Wegener, Joachim
- Subjects
- *
DATA analysis , *MATHEMATICAL optimization , *COMPUTER algorithms , *COMPUTER software , *APPLICATION software , *MATHEMATICAL variables - Abstract
Search-Based Test Data Generation reformulates testing goals as fitness functions so that test input generation can be automated by some chosen search-based optimization algorithm. The optimization algorithm searches the space of potential inputs, seeking those that are “fit for purpose,” guided by the fitness function. The search space of potential inputs can be very large, even for very small systems under test. Its size is, of course, a key determining factor affecting the performance of any search-based approach. However, despite the large volume of work on Search-Based Software Testing, the literature contains little that concerns the performance impact of search space reduction. This paper proposes a static dependence analysis derived from program slicing that can be used to support search space reduction. The paper presents both a theoretical and empirical analysis of the application of this approach to open source and industrial production code. The results provide evidence to support the claim that input domain reduction has a significant effect on the performance of local, global, and hybrid search, while a purely random search is unaffected. [ABSTRACT FROM PUBLISHER]
- Published
- 2012
- Full Text
- View/download PDF
34. Software Engineering Meets Evolutionary Computation.
- Author
-
Harman, Mark
- Subjects
- *
EVOLUTIONARY computation , *SOFTWARE architecture , *SOFTWARE engineering , *COMPUTER software development , *ARTIFICIAL neural networks - Abstract
The concept of evolutionary computation has affected virtually every area of software design, not merely as a metaphor, but as a realistic algorithm for exploration, insight, and improvement. [ABSTRACT FROM PUBLISHER]
- Published
- 2011
- Full Text
- View/download PDF
35. An Analysis and Survey of the Development of Mutation Testing.
- Author
-
Jia, Yue and Harman, Mark
- Subjects
- *
ELECTRIC fault location , *COMPUTER software testing , *PROGRAMMING languages , *JAVA programming language , *COMPUTER programming , *SCHOOLS , *MACHINE theory , *SURVEYS - Abstract
Mutation Testing is a fault-based software testing technique that has been widely studied for over three decades. The literature on Mutation Testing has contributed a set of approaches, tools, developments, and empirical results. This paper provides a comprehensive analysis and survey of Mutation Testing. The paper also presents the results of several development trend analyses. These analyses provide evidence that Mutation Testing techniques and tools are reaching a state of maturity and applicability, while the topic of Mutation Testing itself is the subject of increasing interest. [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
36. Software Module Clustering as a Multi-Objective Search Problem.
- Author
-
Praditwong, Kata, Harman, Mark, and Yao, Xin
- Subjects
- *
SOFTWARE engineering , *MODULAR programming , *COMPUTATIONAL intelligence , *COMPUTER algorithms , *PERFORMANCE evaluation , *APPLICATION software , *EVOLUTIONARY computation , *EMPIRICAL research - Abstract
Software module clustering is the problem of automatically organizing software units into modules to improve program structure. There has been a great deal of recent interest in search-based formulations of this problem in which module boundaries are identified by automated search, guided by a fitness function that captures the twin objectives of high cohesion and low coupling in a single-objective fitness function. This paper introduces two novel multi-objective formulations of the software module clustering problem, in which several different objectives (including cohesion and coupling) are represented separately. In order to evaluate the effectiveness of the multi-objective approach, a set of experiments was performed on 17 real-world module clustering problems. The results of this empirical study provide strong evidence to support the claim that the multi-objective approach produces significantly better solutions than the existing single-objective approach. [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
37. Search Based Software Engineering: Introduction to the Special Issue of the IEEE Transactions on Software Engineering.
- Author
-
Harman, Mark and Mansouri, Afshin
- Subjects
- *
SOFTWARE engineering , *SEARCH engines , *ELECTRONIC information resource searching , *MATHEMATICAL optimization software , *COMPUTER software testing , *SOFTWARE architecture , *PREDICTION models - Published
- 2010
- Full Text
- View/download PDF
38. Kafka's 'A Message from the Emperor': A New Translation.
- Author
-
Kafka, Franz and Harman, Mark
- Subjects
- *
TRANSLATING & interpreting , *LETTERS - Abstract
The article presents the author's English translation of Franz Kafka's letter titled "A Message From the Emperor."
- Published
- 2011
39. Outsider.
- Author
-
HARMAN, MARK
- Subjects
- *
BIOGRAPHIES of authors , *NONFICTION - Published
- 2019
40. State-Based Model Slicing: A Survey.
- Author
-
ANDROUTSOPOULOS, KELLY, CLARK, DAVID, HARMAN, MARK, KRINKE, JENS, and TRATT, LAURENCE
- Subjects
- *
DATA extraction , *COMPUTER programming , *COMPUTER simulation , *DATA modeling , *FAULT-tolerant computing - Abstract
Slicing is a technique, traditionally applied to programs, for extracting the parts of a program that affect the values computed at a statement of interest. In recent years authors have begun to consider slicing at model level. We present a detailed review of existing work on slicing at the level of finite-state-machine-based models. We focus on state-based modeling notations because these have received sufficient attention from the slicing community that there is now a coherent body of hitherto unsurveyed work. We also identify the challenges that state-based slicing presents and how the existing literature has addressed these. We conclude by identifying problems that remain open either because of the challenges involved in addressing them or because the community simply has yet to turn its attention to solving them [ABSTRACT FROM AUTHOR]
- Published
- 2013
- Full Text
- View/download PDF
41. Efficient Identification of Linchpin Vertices in Dependence Clusters.
- Author
-
BINKLEY, DAVID, GOLD, NICOLAS, HARMAN, MARK, ISLAM, SYED, KRINKE, JENS, and ZHENG LI
- Subjects
- *
PROGRAMMING languages , *SOURCE code , *DATA flow computing , *EMPIRICAL research , *DEPENDENCE (Statistics) - Abstract
Several authors have found evidence of large dependence clusters in the source code of a diverse range of systems, domains, and programming languages. This raises the question of how we might efficiently locate the fragments of code that give rise to large dependence clusters.We introduce an algorithm for the identification of linchpin vertices, which hold together large dependence clusters, and prove correctness properties for the algorithm's primary innovations.We also report the results of an empirical study concerning the reduction in analysis time that our algorithm yields over its predecessor using a collection of 38 programs containing almost half a million lines of code. Our empirical findings indicate improvements of almost two orders of magnitude, making it possible to process larger programs for which it would have previously been impractical [ABSTRACT FROM AUTHOR]
- Published
- 2013
- Full Text
- View/download PDF
42. Amorphous Slicing of Extended Finite State Machines.
- Author
-
Androutsopoulos, Kelly, Clark, David, Harman, Mark, Hierons, Robert M., Li, Zheng, and Tratt, Laurence
- Subjects
- *
AMORPHOUS substances , *FINITE state machines , *SLICING machines (Cooking) , *SOFTWARE engineering , *ALGORITHMS , *COMPARATIVE studies - Abstract
Slicing is useful for many software engineering applications and has been widely studied for three decades, but there has been comparatively little work on slicing extended finite state machines (EFSMs). This paper introduces a set of dependence-based EFSM slicing algorithms and an accompanying tool. We demonstrate that our algorithms are suitable for dependence-based slicing. We use our tool to conduct experiments on 10 EFSMs, including benchmarks and industrial EFSMs. Ours is the first empirical study of dependence-based program slicing for EFSMs. Compared to the only previously published dependence-based algorithm, our average slice is smaller 40 percent of the time and larger only 10 percent of the time, with an average slice size of 35 percent for termination insensitive slicing. [ABSTRACT FROM PUBLISHER]
- Published
- 2013
- Full Text
- View/download PDF
43. A unifying theory of control dependence and its application to arbitrary program structures
- Author
-
Danicic, Sebastian, Barraclough, Richard W., Harman, Mark, Howroyd, John D., Kiss, Ákos, and Laurence, Michael R.
- Subjects
- *
CONTROL theory (Engineering) , *COMPUTER software , *FLOWGRAPHS , *MATHEMATICAL proofs , *GENERALIZATION , *COMPUTER algorithms , *SET theory - Abstract
Abstract: There are several similar, but not identical, definitions of control dependence in the literature. These definitions are given in terms of control flow graphs which have had extra restrictions imposed (for example, end-reachability). We define two new generalisations of non-termination insensitive and non-termination sensitive control dependence called weak and strong control-closure. These are defined for all finite directed graphs, not just control flow graphs and are hence allow control dependence to be applied to a wider class of program structures than before. We investigate all previous forms of control dependence in the literature and prove that, for the restricted graphs for which each is defined, vertex sets are closed under each if and only if they are either weakly or strongly control-closed. Low polynomial-time algorithms for producing minimal weakly and strongly control-closed sets over generalised control flow graphs are given. This paper is the first to define an underlying semantics for control dependence: we define two relations between graphs called weak and strong projections, and prove that the graph induced by a set of vertices is a weak/strong projection of the original if and only if the set is weakly/strongly control-closed. Thus, all previous forms of control dependence also satisfy our semantics. Weak and strong projections, therefore, precisely capture the essence of control dependence in our generalisations and all the previous, more restricted forms. More fundamentally, these semantics can be thought of as correctness criteria for future definitions of control dependence. [Copyright &y& Elsevier]
- Published
- 2011
- Full Text
- View/download PDF
44. Tool-Supported Refactoring of Existing Object-Oriented Code into Aspects.
- Author
-
Binkley, David, Ceccato, Mariano, Harman, Mark, Ricca, Filippo, and Tonella, Paolo
- Subjects
- *
ASPECT-oriented programming , *SOFTWARE refactoring , *PROGRAM transformation , *COMPUTER programming , *OBJECT-oriented programming , *PROGRAMMING languages , *JAVA programming language - Abstract
Aspect-Oriented Programming (AOP) provides mechanisms for the separation of crosscutting concerns--functionalities scattered through the system and tangled with the base code. Existing systems are a natural test-bed for the AOP approach since they often contain several crosscutting concerns which could not be modularized using traditional programming constructs. This paper presents an automated approach to the problem of migrating systems developed according to the Object-Oriented Programming (OOP) paradigm into Aspect-Oriented Programming (AOP). A simple set of six refactorings has been defined to transform OOP to AOP and has been implemented in the AOP-Migrator tool, an Eclipse plug-in. A set of enabling transformations from OOP to OOP complement the initial set of refactorings. The paper presents the results of four case studies, which use the approach to migrate selected crosscutting concerns from medium-sized Java programs (in the range of 10K to 40K lines of code) into equivalent programs in AspectJ. The case study results show the feasibility of the migration and indicate the importance of the enabling transformations as a preprocessing step. [ABSTRACT FROM AUTHOR]
- Published
- 2006
- Full Text
- View/download PDF
45. Equivalence of conservative, free, linear program schemas is decidable
- Author
-
Laurence, Michael R., Danicic, Sebastian, Harman, Mark, Hierons, Rob, and Howroyd, John
- Subjects
- *
DECIDABILITY (Mathematical logic) , *LINEAR programming - Abstract
A program schema defines a class of programs, all of which have identical statement structures, but whose expressions may differ. We prove that given any two structured schemas which are conservative, linear and free, it is decidable whether they are equivalent. [Copyright &y& Elsevier]
- Published
- 2003
- Full Text
- View/download PDF
46. Special Issue on Search-Based Software Maintenance.
- Author
-
Di Penta, Massimiliano, Antoniol, Giuliano, and Harman, Mark
- Subjects
- *
SOFTWARE maintenance , *ASSEMBLY machines - Abstract
The article discusses various papers which are presented within the issue, including one by Puneet Kapur on an approach for optimizing the staffing for product releases, one by Mark O'Keffe on an approach to automatically re-factor, using search-based techniques and object-oriented systems, and one by Nicolas Desnos on a search-based approach for the minimal assembly of the original component.
- Published
- 2008
- Full Text
- View/download PDF
47. THE CAMBRIDGE INTRODUCTION TO FRANZ KAFKA.
- Author
-
HARMAN, MARK
- Subjects
- *
GERMAN authors , *NONFICTION - Published
- 2014
48. Crawlability metrics for automated web testing.
- Author
-
Marchetto, Alessandro, Tiella, Roberto, Tonella, Paolo, Alshahwan, Nadia, and Harman, Mark
- Subjects
- *
APPLICATION software research , *COMPUTER systems , *QUALITY control , *TAXONOMY , *AUTOMATION - Abstract
Web applications are exposed to frequent changes both in requirements and involved technologies. At the same time, there is a continuously growing demand for quality and trust and such a fast evolution and quality constraints claim for mechanisms and techniques for automated testing. Web application automated testing often involves random crawlers to navigate the application under test and automatically explore its structure. However, owing to the specific challenges of the modern Web systems, automatic crawlers may leave large portions of the application unexplored. In this paper, we propose the use of structural metrics to predict whether an automatic crawler with given crawling capabilities will be sufficient or not to achieve high coverage of the application under test. In this work, we define a taxonomy of such capabilities and we determine which combination of them is expected to give the highest reward in terms of coverage increase. Our proposal is supported by an experiment in which 19 web applications have been analyzed. [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
49. A trajectory-based strict semantics for program slicing
- Author
-
Barraclough, Richard W., Binkley, David, Danicic, Sebastian, Harman, Mark, Hierons, Robert M., Kiss, Ákos, Laurence, Mike, and Ouarbya, Lahcen
- Subjects
- *
PROGRAMMING language semantics , *COMPUTER programming , *ALGORITHMS , *MACHINE theory , *NONSTANDARD mathematical analysis , *MATHEMATICAL transformations - Abstract
Abstract: We define a program semantics that is preserved by dependence-based slicing algorithms. It is a natural extension, to non-terminating programs, of the semantics introduced by Weiser (which only considered terminating ones) and, as such, is an accurate characterisation of the semantic relationship between a program and the slice produced by these algorithms. Unlike other approaches, apart from Weiser’s original one, it is based on strict standard semantics which models the ‘normal’ execution of programs on a von Neumann machine and, thus, has the advantage of being intuitive. This is essential since one of the main applications of slicing is program comprehension. Although our semantics handles non-termination, it is defined wholly in terms of finite trajectories, without having to resort to complex, counter-intuitive, non-standard models of computation. As well as being simpler, unlike other approaches to this problem, our semantics is substitutive. Substitutivity is an important property because it greatly enhances the ability to reason about correctness of meaning-preserving program transformations such as slicing. [Copyright &y& Elsevier]
- Published
- 2010
- Full Text
- View/download PDF
50. Using Formal Specifications to Support Testing.
- Author
-
HIERONS, ROBERT M., KAPOOR, KALPESH, BOGDANOV, KIRILL, KRAUSE, PAUL, BOWEN, JONATHAN P., LÜTTGEN, GERALD, CLEAVELAND, RANCE, SIMONS, ANTHONY J. H., DERRICK, JOHN, VILKOMIR, SERGIY, DICK, JEREMY, WOODWARD, MARTIN R., GHEORGHE, MARIAN, HARMAN, MARK, and ZEDAN, HUSSEIN
- Subjects
- *
COMPUTER science , *FORMAL methods (Computer science) , *COMPUTER training , *COMPUTER software development , *SOFTWARE verification , *TECHNICAL specifications - Abstract
Formal methods and testing are two important approaches that assist in the development of high-quality software. While traditionally these approaches have been seen as rivals, in recent years a new consensus has developed in which they are seen as complementary. This article reviews the state of the art regarding ways in which the presence of a formal specification can be used to assist testing. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.