Automatic program bug fixing by focusing on finding the shortest sequence of changes
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
1 Online-Ressource.
- Language
-
Englisch
- Bibliographic citation
-
Automatic program bug fixing by focusing on finding the shortest sequence of changes ; volume:57 ; number:2 ; day:7 ; month:2 ; year:2024 ; pages:1-23 ; date:2.2024
Artificial intelligence review ; 57, Heft 2 (7.2.2024), 1-23, 2.2024
- Classification
-
Informatik
- Creator
-
Yousofvand, Leila
Soleimani, Seyfollah
Rafe, Vahid
Esfandyari, Sajad
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10462-023-10686-y
- URN
-
urn:nbn:de:101:1-2404291031221.532455860354
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 11:00 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Yousofvand, Leila
- Soleimani, Seyfollah
- Rafe, Vahid
- Esfandyari, Sajad
- SpringerLink (Online service)
Other Objects (12)
Finding k-shortest paths with limited overlap
Finding k-shortest paths with limited overlap
Finding k-shortest paths with limited overlap
Finding k Shortest Paths in Cayley Graphs of Finite Groups
App review driven collaborative bug finding
Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap
Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs
Bug-fixing and code-writing : the private provision of open source software
Bug-fixing and code-writing : the private provision of open source software
K∗: A Directed On-The-Fly Algorithm for Finding the k Shortest Paths
K<sup>⁎</sup> : A heuristic search algorithm for finding the k shortest paths
A fine-grained data set and analysis of tangling in bug fixing commits
Finding k-shortest paths with limited overlap
Finding k-shortest paths with limited overlap
Finding k-shortest paths with limited overlap
Finding k Shortest Paths in Cayley Graphs of Finite Groups
App review driven collaborative bug finding
Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap
Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs
Bug-fixing and code-writing : the private provision of open source software
Bug-fixing and code-writing : the private provision of open source software
K∗: A Directed On-The-Fly Algorithm for Finding the k Shortest Paths
K<sup>⁎</sup> : A heuristic search algorithm for finding the k shortest paths
A fine-grained data set and analysis of tangling in bug fixing commits
Finding k-shortest paths with limited overlap
Finding k-shortest paths with limited overlap
Finding k-shortest paths with limited overlap
Finding k Shortest Paths in Cayley Graphs of Finite Groups
App review driven collaborative bug finding
Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap
Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs
Bug-fixing and code-writing : the private provision of open source software
Bug-fixing and code-writing : the private provision of open source software
K∗: A Directed On-The-Fly Algorithm for Finding the k Shortest Paths
K<sup>⁎</sup> : A heuristic search algorithm for finding the k shortest paths