Product Details
libSFTA: A Semi-symbolic Nondeterministic Finite Tree Automata Library Prototype
Created: 2010
Czech title
libSFTA: Prototyp knihovny pro efektivní práci se semi-symbolicky reprezentovanými nedeterministickými stromovými automaty
Type
software
License
required - free
Authors
Holík Lukáš, doc. Mgr., Ph.D. (DITS FIT BUT)
Lengál Ondřej, Ing., Ph.D. (DITS FIT BUT)
Vojnar Tomáš, prof. Ing., Ph.D. (DITS FIT BUT)
Lengál Ondřej, Ing., Ph.D. (DITS FIT BUT)
Vojnar Tomáš, prof. Ing., Ph.D. (DITS FIT BUT)
Keywords
tree automata, formal verification, binary decision diagrams, multi-terminal binary decision diagrams
Description
This library implements semi-symbolically encoded nondeterministic bottom-up finite tree automata and standard operations on them.
Location
Licence
Free software under the GNU GPL v3.
Projects
Developement of techniques for automatic verification of programs with dynamic data structures (GP201/09/P531)
Mathematical and Engineering Approaches to Developing Reliable and Secure Concurrent and Distributed Computer Systems (GD102/09/H042)
Rich-Model Toolkit -- An Infrastructure for Reliable Computer Systems (IC0901)
Secured, reliable and adaptive computer systems (FIT-S-10-1)
Security-Oriented Research in Information Technology (MSM0021630528)
Static and Dynamic Verification of Programs with Advanced Features of Concurrency and Unboundedness (GAP103/10/0306)
Mathematical and Engineering Approaches to Developing Reliable and Secure Concurrent and Distributed Computer Systems (GD102/09/H042)
Rich-Model Toolkit -- An Infrastructure for Reliable Computer Systems (IC0901)
Secured, reliable and adaptive computer systems (FIT-S-10-1)
Security-Oriented Research in Information Technology (MSM0021630528)
Static and Dynamic Verification of Programs with Advanced Features of Concurrency and Unboundedness (GAP103/10/0306)
Research groups
Departments
Department of Intelligent Systems FIT BUT (DITS FIT BUT)