124
Voted
CHARME
2001
Springer
15 years 7 months ago
2001
Springer
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
135
click to vote
CHARME
2001
Springer
15 years 7 months ago
2001
Springer
The framework of this paper is the formal specification and proof of applications distributed on symmetric interconnection networks, e.g. the torus or the hypercube. The algorithms...
118
Voted
CHARME
2001
Springer
15 years 7 months ago
2001
Springer
We report on the formal verification of the floating point unit used in the VAMP processor. The FPU is fully IEEE compliant, and supports denormals and exceptions in hardware. The ...
145
click to vote
CAISE
2003
Springer
15 years 7 months ago
2003
Springer
We present our work on composing mobile Web services, denoted by M-services, in the wireless world. The wireless world has its own features that make it completely different from t...
