402 search results - page 63 / 81 » Model Checking Quantified Computation Tree Logic |
75
Voted
LICS
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper describes an assembly-language type system capable of ensuring memory safety in the presence of both heap and stack allocation. The type system uses linear logic and a ...
71
Voted
TPDS
2008
14 years 9 months ago
2008
This paper proposes a new methodology to model the distribution of finite size content to a group of users connected through an overlay network. Our methodology describes the distr...
101
click to vote
SIAMCOMP
2012
13 years 18 hour ago
2012
Let S be a set of n intervals in R, and let (S, +) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the se...
83
Voted
ICALP
1994
Springer
15 years 1 months ago
1994
Springer
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
IIWAS
2008
14 years 11 months ago
2008
In a service-oriented architecture, systems communicate by exchanging messages. In this work, we propose a formal model based on OCL-constrained UML Class diagrams and a methodolo...