142 search results - page 14 / 29 » Proving Termination by Invariance Relations |
FMICS
2010
Springer
14 years 10 months ago
2010
Springer
Bitwise instructions, loops and indirect data access pose difficult challenges to the verification of microcontroller programs. In particular, it is necessary to show that an indir...
FUIN
2008
14 years 10 months ago
2008
We show that timed branching bisimilarity as defined by Van der Zwaag [16] and Baeten and Middelburg [2] is not an equivalence relation, in case of a dense time domain. We propose ...
CAV
2009
Springer
15 years 10 months ago
2009
Springer
D-Finder tool implements a compositional method for the verification of component-based systems described in BIP language encompassing multi-party interaction. For deadlock detecti...
ESA
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
CSFW
1999
IEEE
15 years 2 months ago
1999
IEEE
The combination of two security protocols, a simple shared-key communication protocol and the Di e-Hellman key distribution protocol, is modeled formally and proved correct. The m...