Proceedings of the Estonian Academy of Sciences, Physics and Mathematics

2DFS Aalst abstract syntax abstract value algorithm analysis Andromeda automata theoretic verification Biichi automaton BNF Converter branch index called Coloured Petri Nets compiler constraint system CPNs created data dependency algebras defined definition denote embedding empty enabledness labelled EPlus Estonian Estonian Academy Publishers evaluation execution Exp2 Exp3 Expl expO fair cycle fairness assumption finite fixpoint formal framework function given global grammar Haskell Ident implemented infinitely Integer interprocedural Java JavaletteLight Labelled BNF language LBNF lexer ListStm model checking monitor automata monotonic morphism multi-threaded mutex mutex locks natural transformation nodes notation parallel programming parser partial invariant partial solution pragmas pretty-printer Proposition railroad reachable recursion regular expression reserved words right-hand sides rule label SCC method segment semantic sequence side-effecting solver space-time algebra String strong fairness strongly connected component subnet Tallinn thread token train transition weak fairness weakly fair YACC