|
|
Debugging Support for Static Analysis Library WALA
Havel, Filip ; Parízek, Pavel (advisor) ; Kofroň, Jan (referee)
Nowadays, static analysis is a helpful option for developers to ensure all the important properties of a developed application. But these analyses must be also developed and it is inevitable that sometimes they must be debugged to find and solve problems inside of the analyses themself. The debugging of static analyses might be more complicated because some popular analysis frameworks do not provide sufficient support for debugging. One of the widely used analysis frameworks is WALA. In this thesis, we thoroughly explored all the main features of WALA and determined possible points for better debugging support. For each of these points, we designed and implemented supporting infrastructure that should accelerate the process of debugging by avoiding the tedious manual effort needed for inspection and evaluation of the internal state of WALA. One kind of these points is the analysis configuration where we created an inspection system for class hierarchy and call graph that should detect common misconfiguration problems. The next point is the debugging of the data flow transfer functions, for which we created a visualizer of the running analysis over the subject program. This visualization is done within the Visual Studio Code editor. To connect the editor with the analysis we used Debug Adapter Protocol and...
|
|
|
Searching and Updating Public Transport Timetables
Havel, Filip ; Zavoral, Filip (advisor) ; Škoda, Petr (referee)
Most of the people who use public transportation have specific areas of interests which can be used to cut down the transport network to several smaller parts. It is reasonable to assume that these people will want to be informed in case a change occurs in the restricted part of transport network they are interested in. For this reason, we created an application which informs its users about the changes in public transportation that concern them. We assume that for users, the most important area of interest are the connections between individual stations, which is why this thesis mainly focuses on the possibility of search for connection in timetables. In addition to this search, we also deal with the application's adaptability and we have implemented examples of expansions for various result outputs, user interfaces and data sources. To improve general user experience, we have developed a mobile application that communicates with the main application and displays updated timetables according to the user's area of interest. 1
|
|
|
The determination of the route for running footraces by a modification Travelling Salesman Problem
Havel, Filip ; Borovička, Adam (advisor) ; Fábry, Jan (referee)
This diploma thesis deals with finding the optimal route for running footraces. This work seeks to find a link that determines a lap with a predetermined beginning and a goal at the same time, given the possibility of 251 intersections. This model is derived from the travelling salesman problem, whose primary task is to pass the specified set of places according to the shortest route or in the shortest possible time and to return back to the starting point while visiting each place only once. Of course, the routes searched for in this work may be differentiated in several aspects. First of all, it is not necessary to include all of the places you can visit multiple times. The resulting route does not have to be the shortest, but it should have a certain span of distance, as the height metrics obtained are the key factor for optimization. A solution with the exact methods will be demonstrated by the LINGO optimization software, but only for a higher computational difficulty with a limited range of tasks, 21 junctions in the city center. Determining a longer route on a larger set of intersections will allow for derived heuristics with working names: the furthest neighbor with the smallest ascent and a minimal profile change. Part of the thesis is a detailed description of the mathematical model used, the general procedure, along with both a demonstration and an analysis of the applied heuristics.
|
guest ::
RSS feed.