TCS
2010
13 years 5 months ago
2010
Automatic debugging of UML class diagrams helps in the visual specification of software systems because users cannot detect errors in logical consistency easily. This paper focus...
TCS
2010
13 years 5 months ago
2010
— Rahman and Kaykobad introduced a shortest distance based condition for finding the existence of Hamiltonian paths in graphs as follows: Let G be a connected graph with n vertic...
TCS
2010
13 years 5 months ago
2010
The paper contains the first complete proof of strong normalization (SN) for full second order linear logic (LL): Girard’s original proof uses a standardization theorem which i...
TCS
2010
13 years 5 months ago
2010
We examine the itinerary of 0 ∈ S1 = R/Z under the rotation by α ∈ R\Q. The motivating question is: if we are given only the itinerary of 0 relative to I ⊂ S1 , a finite un...
SPIN
2010
Springer
13 years 5 months ago
2010
Springer
In the field of communication networks, protocol engineers usually employ several tools focused on specific kinds of analysis, such as performance or correctness. This paper pres...
SPIN
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Context-Bounded Analysis has emerged as a practical automatic formal analysis technique for fine-grained, shared-memory concurrent software. Two recent papers (in CAV 20...
SPIN
2010
Springer
13 years 5 months ago
2010
Springer
This paper addresses the problem of verifying programs for the relaxed memory models implemented in modern processors. Specifically, it considers the TSO (Total Store Order) relax...
SPIN
2010
Springer
13 years 5 months ago
2010
Springer
Directed model checking is a well-established technique to efficiently tackle the state explosion problem when the aim is to find error states in concurrent systems. Although dir...
SPIN
2010
Springer
13 years 5 months ago
2010
Springer
In this paper, we propose the nevertrace claim, which is a new construct for specifying the correctness properties that either finite or infinite execution traces (i.e., sequence...
SPIN
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...