3653 search results - page 366 / 731 » On Recognizable Timed Languages |
177
click to vote
SAS
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
157
click to vote
EDUTAINMENT
2009
Springer
16 years 1 months ago
2009
Springer
This paper addresses the issues of distributed interactions in a simulation based medial training environment, where a team of doctors, nurses and assistants are trained for handli...
156
Voted
POLICY
2009
Springer
16 years 1 months ago
2009
Springer
A central task in the context of logic-based decentralized authorization languages is that of gathering credentials from credential providers, required by the resource guard’s p...
199
click to vote
TIME
2007
IEEE
16 years 1 months ago
2007
IEEE
It is known that for temporal languages, such as firstorder LT L, reasoning about constant (time-independent) relations is almost always undecidable. This applies to temporal des...
169
click to vote
SEKE
2007
Springer
16 years 27 days ago
2007
Springer
With the growing interest in rule languages in the Semantic Web and the Business Rule community it is time to look again at the issue of debugging rule bases. New challenges have ...