Verwandte Artikel zu New Finite Automata Applications in Novice Program...
Inhaltsangabe
Automatically comprehending novice programs with the aim of giving useful feedback has been an Artificial Intelligence problem for over four decades. Solving this problem basically entails manipulating the underlying program plans; i.e. extracting and comparing the novice's plan to the expert's plan and inferring where the novice's bug is from. The bugs of interest in this domain are often semantic bugs as all syntactic bugs are handled by automatic debuggers — built in most compilers. Hence, a program that debugs like the human expert should understand the problem and know the expected solution(s) in order to detect semantic bugs. This book proposes a new approach to comprehending novice programs using: regular expressions for the recognition of plans in the program text, finite automata for defining the space of program plan variations, and automata-based algorithms for the detection of semantic bugs. The new approach is tested with a repository of novice programs with known semantic bugs and specific bugs were detected. As a proof of concept, the theories presented in this book are further implemented in software prototypes.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Reseña del editor
Automatically comprehending novice programs with the aim of giving useful feedback has been an Artificial Intelligence problem for over four decades. Solving this problem basically entails manipulating the underlying program plans; i.e. extracting and comparing the novice's plan to the expert's plan and inferring where the novice's bug is from. The bugs of interest in this domain are often semantic bugs as all syntactic bugs are handled by automatic debuggers — built in most compilers. Hence, a program that debugs like the human expert should understand the problem and know the expected solution(s) in order to detect semantic bugs. This book proposes a new approach to comprehending novice programs using: regular expressions for the recognition of plans in the program text, finite automata for defining the space of program plan variations, and automata-based algorithms for the detection of semantic bugs. The new approach is tested with a repository of novice programs with known semantic bugs and specific bugs were detected. As a proof of concept, the theories presented in this book are further implemented in software prototypes.
Biografía del autor
Dr. Abejide Ade-Ibijola holds a Ph.D. in Computer Science (specializing in Program Comprehension) from the University of the Witwatersrand, Johannesburg, South Africa in 2016. He is currently a Senior Lecturer in the Department of Applied Information Systems at the University of Johannesburg, South Africa.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Neu kaufen
Diesen Artikel anzeigen
EUR 64,90
Gratis für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & DauerSuchergebnisse für New Finite Automata Applications in Novice Program...
Foto des Verkäufers
New Finite Automata Applications in Novice Program Comprehension
Verlag:
LAP LAMBERT Academic Publishing Jan 2017, 2017
ISBN 10: 3330029056
ISBN 13: 9783330029057
Neu
Taschenbuch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. Neuware -Automatically comprehending novice programs with the aim of giving useful feedback has been an Artificial Intelligence problem for over four decades. Solving this problem basically entails manipulating the underlying program plans; i.e. extracting and comparing the novice's plan to the expert's plan and inferring where the novice's bug is from. The bugs of interest in this domain are often semantic bugs as all syntactic bugs are handled by automatic debuggers ¿ built in most compilers. Hence, a program that debugs like the human expert should understand the problem and know the expected solution(s) in order to detect semantic bugs. This book proposes a new approach to comprehending novice programs using: regular expressions for the recognition of plans in the program text, finite automata for defining the space of program plan variations, and automata-based algorithms for the detection of semantic bugs. The new approach is tested with a repository of novice programs with known semantic bugs and specific bugs were detected. As a proof of concept, the theories presented in this book are further implemented in software prototypes.Books on Demand GmbH, Überseering 33, 22297 Hamburg 188 pp. Englisch. Artikel-Nr. 9783330029057
Anzahl: 2 verfügbar
Beispielbild für diese ISBN
New Finite Automata Applications in Novice Program Comprehension
Verlag:
LAP LAMBERT Academic Publishing, 2017
ISBN 10: 3330029056
ISBN 13: 9783330029057
Neu
Paperback
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: Brand New. 188 pages. 8.66x5.91x0.43 inches. In Stock. Artikel-Nr. 3330029056
Anzahl: 1 verfügbar