The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
The Height of Factorization Forests
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
The Theory of Stabilisation Monoids and Regular Cost Functions
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Factorization forests for infinite words and applications to countable scattered linear orderings
Theoretical Computer Science
Faster algorithms for finitary games
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Regular temporal cost functions
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
On the topological complexity of MSO+U and related automata models
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Promptness in w-regular automata
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Weak cost monadic logic over infinite trees
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
On the expressive power of cost logics over infinite words
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Languages of profinite words and the limitedness problem
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
The Topological Complexity of MSO+U and Related Automata Models
Fundamenta Informaticae - Emergent Computing
Factorisation forests for infinite words application to countable scattered linear orderings
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
A combinatorial theorem for trees applications to monadic logic and infinite structures
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Adding an Equivalence Relation to the Interval Logic ABB: Complexity and Expressiveness
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Magnitude Monadic Logic over Words and the Use of Relative Internal Set Theory
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |
The UCLID project seeks to develop formal verification tools for infinite-state systems having a degree of automation comparable to that of model checking tools for finitestate systems. The UCLID modeling language describes systems where the state variables ...