245 search results - page 33 / 49 » Efficient Symbolic Model Checking for Process Algebras |
156
click to vote
SIGMOD
1996
ACM
15 years 10 months ago
1996
ACM
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
172
click to vote
ENTCS
2002
15 years 6 months ago
2002
We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root contention protocol combining two existing tools: the real-time modelchecker Kronos...
185
click to vote
SAC
2010
ACM
15 years 6 months ago
2010
ACM
Service-based systems can be modeled as stand-alone services coordinated by external connectors. Reo is a channelbased coordination language with well-defined semantics that enabl...
184
click to vote
ICGI
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. In this article, we propose the use of suffix arrays to efficiently implement n-gram language models with practically unlimited size n. This approach, which is used with ...
191
click to vote
FSEN
2009
Springer
15 years 10 months ago
2009
Springer
The rCOS modeler implements the requirements modelling phase of a model driven component-based software engineering process. Components are specified in rCOS, a relational calculus...