Home > Search Results: Tatarko, William
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 2 records found  Search took 0.00 seconds. 
Branching loop summarization
 Tatarko, William ; Blicha, Martin (advisor) ; Bednárek, David (referee)
In this thesis we present a novel algorithm for summarization of loops with multiple branches operating over integers. The algorithm is based on anal- ysis of a so-called state diagram, which reflects feasibility of various branch interleavings. Summarization can be used to replace loops with equivalent non-iterative statements. This supports examination of reachability and can be used for software verification. For instance, summarization may also be used for (compiler) optimizations. 1
Detailed record
CSP over oriented trees
 Tatarko, William ; Bulín, Jakub (advisor) ; Barto, Libor (referee)
In this thesis we present an oriented tree with only 26 vertices, whose CSP is NP-complete. This serves as a counterexample for a conjecture that any oriented tree with this property has at least 39 vertices. The work itself is divided into three chapters. In the first one, basic definitions and tools of this topic are introduced. Then, tractability of trees of special shapes is shown. Finally, NP-completeness of a certain oriented tree is proven. 1
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English