200 search results - page 18 / 40 » Invariant Logics |
FMCAD
2008
Springer
13 years 9 months ago
2008
Springer
Abstract-- We consider the problem of optimal netlist simplification in the presence of constraints. Because constraints restrict the reachable states of a netlist, they may enhanc...
LICS
2003
IEEE
14 years 26 days ago
2003
IEEE
In this paper, we develop a new substructural logic that can encode invariants necessary for reasoning about hierarchical storage. We show how the logic can be used to describe th...
ESOP
2006
Springer
13 years 11 months ago
2006
Springer
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
ECOOP
2010
Springer
13 years 11 months ago
2010
Springer
Specifications of Object-Oriented programs conventionally employ Boolean expressions of the programming language for assertions. Programming errors can be discovered by checking at...
TLDI
2009
ACM
14 years 4 months ago
2009
ACM
We propose a dependent type theory that integrates programming, specifications, and reasoning about higher-order concurrent programs with shared transactional memory. The design ...