265 search results - page 49 / 53 » entcs 2007 |
ENTCS
2007
14 years 10 months ago
2007
In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships. We employ a task str...
ENTCS
2007
14 years 10 months ago
2007
We present in this article a precise security model for data confidentiality in the framework of ASP (Asynchronous Sequential Processes). ASP is based on active objects, asynchro...
ENTCS
2007
14 years 10 months ago
2007
The dependency pairs method is one of the most powerful technique for proving termination of rewriting and it is currently central in most automatic termination provers. Recently,...
ENTCS
2007
14 years 10 months ago
2007
Several model-checker based methods to automated test-case generation have been proposed recently. The performance and applicability largely depends on the complexity of the model...
ENTCS
2007
14 years 10 months ago
2007
The engineering of systems that are acceptably correct is a hard problem. On the one hand, semi-formal modelling approaches that are used in practical, large-scale system developm...