Sciweavers

1018 search results - page 84 / 204
» Abstraction and Refinement in Model Checking
Sort
View
UTP
2010
13 years 5 months ago
Unifying Theories of Confidentiality
Abstract. This paper presents a framework for reasoning about the security of confidential data within software systems. A novelty is that we use Hoare and He's Unifying Theor...
Michael J. Banks, Jeremy L. Jacob
CAISE
2006
Springer
13 years 11 months ago
From Requirements Models to Formal Specifications in B
Abstract. The development of critical systems requires a high assurance process from requirements to the running code. Formal methods, such as B, now provide industry-strength tool...
Christophe Ponsard, Emmanuel Dieul
VLSID
2004
IEEE
91views VLSI» more  VLSID 2004»
14 years 8 months ago
Program Slicing for ATPG-Based Property Checking
This paper presents a novel technique for abstracting designs in order to increase the efficiency of formal property checking. Bounded Model Checking (BMC), using Satisfiability (...
Vivekananda M. Vedula, Whitney J. Townsend, Jacob ...
POPL
1990
ACM
13 years 11 months ago
Higher-Order Modules and the Phase Distinction
Typed -calculus is an important tool in programming language research because it provides an extensible framework for studying language features both in isolation and in their rel...
Robert Harper, John C. Mitchell, Eugenio Moggi
CAV
2010
Springer
176views Hardware» more  CAV 2010»
13 years 10 months ago
Lazy Annotation for Program Testing and Verification
Abstract. We describe an interpolant-based approach to test generation and model checking for sequential programs. The method generates Floyd/Hoare style annotations of the program...
Kenneth L. McMillan