Result Details
libSFTA: A Semi-symbolic Nondeterministic Finite Tree Automata Library Prototype
        Created: 2010
    
                Type
            
        
                software
            
        
                Language
            
        
                English
            
        
            Authors
            
        
                Lengál Ondřej, doc. Ing., Ph.D., FIT (FIT), DITS (FIT)
                
Holík Lukáš, doc. Mgr., Ph.D., FIT (FIT), DITS (FIT)
Vojnar Tomáš, prof. Ing., Ph.D., DITS (FIT)
        Holík Lukáš, doc. Mgr., Ph.D., FIT (FIT), DITS (FIT)
Vojnar Tomáš, prof. Ing., Ph.D., DITS (FIT)
                    Description
            
        This library implements semi-symbolically encodednondeterministic bottom-up finite tree automata and standard operationson them.
                Keywords
            
        tree automata, formal verification, binary decision diagrams, multi-terminal binary decision diagrams
                URL
            
        
                    License
                
            
                    In order to use the result by another entity, it is always necessary to acquire a license
                
            
                    License Fee
                
            
                    The licensor does not require a license fee for the result
                
            
                    License Conditions
                
            Free software under the GNU GPL v3.
                Projects
            
        
        
            
        
    
    
        Dealing with Complex Data Structures and Concurrency within the Rich Model Toolkit, MŠMT, COST, OC10009, start: 2010-01-01, end: 2012-12-31, running
                
Developement of techniques for automatic verification of programs with dynamic data structures, GACR, Postdoktorandské granty, GP201/09/P531, start: 2009-01-01, end: 2011-12-31, completed
Mathematical and Engineering Approaches to Developing Reliable and Secure Concurrent and Distributed Computer Systems, GACR, Doktorské granty, GD102/09/H042, start: 2009-01-30, end: 2012-12-31, completed
Secured, reliable and adaptive computer systems, BUT, Vnitřní projekty VUT, FIT-S-10-1, start: 2010-03-01, end: 2010-12-31, completed
Security-Oriented Research in Information Technology, MŠMT, Institucionální prostředky SR ČR (např. VZ, VC), MSM0021630528, start: 2007-01-01, end: 2013-12-31, running
Static and Dynamic Verification of Programs with Advanced Features of Concurrency and Unboundedness, GACR, Standardní projekty, GAP103/10/0306, start: 2010-01-01, end: 2013-12-31, running
        Developement of techniques for automatic verification of programs with dynamic data structures, GACR, Postdoktorandské granty, GP201/09/P531, start: 2009-01-01, end: 2011-12-31, completed
Mathematical and Engineering Approaches to Developing Reliable and Secure Concurrent and Distributed Computer Systems, GACR, Doktorské granty, GD102/09/H042, start: 2009-01-30, end: 2012-12-31, completed
Secured, reliable and adaptive computer systems, BUT, Vnitřní projekty VUT, FIT-S-10-1, start: 2010-03-01, end: 2010-12-31, completed
Security-Oriented Research in Information Technology, MŠMT, Institucionální prostředky SR ČR (např. VZ, VC), MSM0021630528, start: 2007-01-01, end: 2013-12-31, running
Static and Dynamic Verification of Programs with Advanced Features of Concurrency and Unboundedness, GACR, Standardní projekty, GAP103/10/0306, start: 2010-01-01, end: 2013-12-31, running
                Research groups
            
        
                Departments