7529 search results - page 271 / 1506 » The Modula-3 Type System |
156
click to vote
WINE
2010
Springer
15 years 4 months ago
2010
Springer
Trust propagation is a fundamental topic of study in the theory and practice of ranking and recommendation systems on networks. The Page Rank [9] algorithm ranks web pages by propa...
185
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract-- We study the convergence rate of average consensus algorithms in networks with stochastic communication failures. We show how the system dynamics can be modeled by a dis...
331
click to vote
NFM
2011
15 years 1 months ago
2011
Abstract. We present a general scheme for automated instantiation-based invariant discovery. Given a transition system, the scheme produces k-inductive invariants from templates re...
173
click to vote
PLDI
2003
ACM
15 years 12 months ago
2003
ACM
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
149
click to vote
TAPSOFT
1997
Springer
15 years 10 months ago
1997
Springer
The SML-like module systems are small typed languages of their own. As is, one would expect a proof of their soundness following from a proof of subject reduction. Unfortunately, t...