163 search results - page 15 / 33 » Higher-Order Logic and Theorem Proving for Structured Specif... |
ECCC
2010
13 years 6 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The focus of this paper is on reducing the complexity in verification by exploiting modularity at various levels: in specification, in verification, and structurally. For specifica...
JFP
2006
13 years 7 months ago
2006
The Theory of Contexts is a type-theoretic axiomatization aiming to give a metalogical account of the fundamental notions of variable and context as they appear in Higher stract S...
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...
WOODPECKER
2001
13 years 8 months ago
2001
Ensuring that specifications are consistent is an important part of specification development and testing. In this paper we introduce the ConsVISor tool for consistency checking o...