315 search results - page 13 / 63 » Reasoning about Assignments in Recursive Data Structures |
115
Voted
SIAMCOMP
2012
13 years 2 months 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...
129
click to vote
ACL2
2006
ACM
15 years 5 months ago
2006
ACM
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem proving framework. One must be able to represent and ...
94
Voted
TPHOL
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...
101
click to vote
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
We present an overview of the Jahob system for modular analysis of data structure properties. Jahob uses a subset of Java as the implementation language and annotations with formu...
118
Voted
CONCUR
2006
Springer
15 years 3 months ago
2006
Springer
We extend a previous type system for the -calculus that guarantees deadlock-freedom. The previous type systems for deadlockfreedom either lacked a reasonable type inference algorit...