RTA
2010
Springer
13 years 9 months ago
2010
Springer
We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of ...
DIS
2007
Springer
13 years 9 months ago
2007
Springer
In this paper, we propose a new concept, thinning-out, for reducing the number of trials in skill discovery. Thinning-out means to skip over such trials that are unlikely to improv...
ITICSE
2010
ACM
13 years 9 months ago
2010
ACM
ACMSE
2007
ACM
13 years 9 months ago
2007
ACM
ACMSE
2007
ACM
13 years 9 months ago
2007
ACM
ERSHOV
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. We address model checking problem for combination of Computation Tree Logic (CTL) and Propositional Logic of Knowledge (PLK) in finite systems with the perfect recall syn...
ERSHOV
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Information flow exhibited by multithreaded programs is subtle because the attacker may exploit scheduler properties when deducing secret information from publicly observ...
ERSHOV
2006
Springer
13 years 9 months ago
2006
Springer
We improve the decision procedure from [10] for the problem of generalized soundness of workflow nets. A workflow net is generalized sound iff every marking reachable from an initi...
ERSHOV
2006
Springer
13 years 9 months ago
2006
Springer
ERSHOV
2006
Springer
13 years 9 months ago
2006
Springer
Graph transformations are one of the best known approaches for defining transformations in model-based software development. They are defined over the abstract syntax of source and...