FORTE
2010
13 years 9 months ago
2010
Abstract. In this paper, we propose the notion of partial time abstraction for timed process algebras, which introduces the possibility to abstract away parts of the timing of syst...
FORTE
2010
13 years 9 months ago
2010
Abstract. The complexity of distributed algorithms, such as state machine replication, motivates the use of formal methods to assist correctness verification. The design of the for...
FORTE
2010
13 years 9 months ago
2010
Abstract. Separation logic is a popular specification language for imperative programs where the heap can only be mentioned through pointsto assertions. However, separation logic&#...
FORTE
2010
13 years 9 months ago
2010
FORTE
2010
13 years 9 months ago
2010
Abstract. Covariant-contravariant simulation and conformance simulation are two generalizations of the simple notion of simulation which aim at capturing the fact that it is not al...
FORTE
2010
13 years 9 months ago
2010
Abstract. Rule-based specifications have been very successful as a declarative approach in many domains, due to the handy yet solid foundations offered by rule-based machineries li...
FORTE
2010
13 years 9 months ago
2010
Wireless sensor networks are typically ad-hoc networks of resource-constrained nodes; in particular, the nodes are limited in power resources. It can be difficult and costly to rep...
FORTEST
2008
13 years 9 months ago
2008
Algebraic specifications of data types provide a natural basis for testing data types implementations. In this framework, the conformance relation is based on the satisfaction of a...
FORTEST
2008
13 years 9 months ago
2008
Abstract. This chapter presents principles and techniques for model-based blackbox conformance testing of real-time systems using the UPPAAL model-checking tool-suite. The basis fo...
FORTEST
2008
13 years 9 months ago
2008