Sciweavers

2137 search results - page 36 / 428
» Proving Abstract Non-interference
Sort
View
TPHOL
2003
IEEE
15 years 3 months ago
Programming a Symbolic Model Checker in a Fully Expansive Theorem Prover
Abstract. Model checking and theorem proving are two complementary approaches to formal verification. In this paper we show how binary decision diagram (BDD) based symbolic model ...
Hasan Amjad
APLAS
2007
ACM
15 years 1 months ago
Adjunct Elimination in Context Logic for Trees
Abstract. We study adjunct-elimination results for Context Logic applied to trees, following previous results by Lozes for Separation Logic and Ambient Logic. In fact, it is not po...
Cristiano Calcagno, Thomas Dinsdale-Young, Philipp...
ETRICS
2006
15 years 1 months ago
Allowing State Changes in Specifications
Abstract. We provide a static analysis (using both dataflow analysis and theorem proving) to allow state changes within specifications. This can be used for specification languages...
Michael Barnett, David A. Naumann, Wolfram Schulte...
JNS
2007
55views more  JNS 2007»
14 years 9 months ago
Two-Dimensional Infinite Prandtl Number Convection: Structure of Bifurcated Solutions
Abstract. This paper examines the bifurcation and structure of the bifurcated solutions of the two-dimensional infinite Prandtl number convection problem. The existence of a bifur...
Jungho Park
FCT
1999
Springer
15 years 2 months ago
A Polynomial Time Approximation Scheme for Dense MIN 2SAT
Abstract. It is proved that everywhere-dense Min 2SAT and everywheredense Min Eq both have polynomial time approximation schemes.
Cristina Bazgan, Wenceslas Fernandez de la Vega