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
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
Authors
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
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, 2010-2012, running
Developement of techniques for automatic verification of programs with dynamic data structures, GACR, Standardní projekty, GP201/09/P531, 2009-2011, completed
Mathematical and Engineering Approaches to Developing Reliable and Secure Concurrent and Distributed Computer Systems, GACR, Doktorské granty, GD102/09/H042, 2009-2012, completed
Secured, reliable and adaptive computer systems, BUT, Vnitřní projekty VUT, FIT-S-10-1, 2010, completed
Security-Oriented Research in Information Technology, MŠMT, Institucionální prostředky SR ČR (např. VZ, VC), MSM0021630528, 2007-2013, running
Static and Dynamic Verification of Programs with Advanced Features of Concurrency and Unboundedness, GACR, Standardní projekty, GAP103/10/0306, 2010-2013, running
Research groups
Departments
Back to top