11345 search results - page 1849 / 2269 » Foundations of Computer Science |
142
click to vote
SPIN
2010
Springer
15 years 3 months ago
2010
Springer
In our earlier work we have proposed using the declarative language DecSerFlow for modeling, analysis and enactment of processes in autonomous web services. DecSerFlow uses constra...
137
click to vote
SPIN
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Context-Bounded Analysis has emerged as a practical automatic formal analysis technique for fine-grained, shared-memory concurrent software. Two recent papers (in CAV 20...
168
click to vote
TCS
2010
15 years 3 months ago
2010
There has been much interest in testing from finite state machines (FSMs) as a result of their suitability for modelling or specifying state-based systems. Where there are multip...
111
click to vote
TCS
2010
15 years 3 months ago
2010
We give a new construction of strongly aperiodic set of tiles in H2 , exhibiting a kind of hierarchical structure, simplifying the central framework of Margenstern’s proof that t...
160
Voted
TCS
2010
15 years 3 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...