632 search results - page 14 / 127 » Proving Invariants of Functional Programs |
80
Voted
TPHOL
2009
IEEE
15 years 7 months ago
2009
IEEE
VCC is an industrial-strength verification environment for low-level concurrent system code written in C. VCC takes a program (annotated with function contracts, state assertions,...
CAV
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Modern termination provers rely on a safety checker to construct disjunctively well-founded transition invariants. This safety check is known to be the bottleneck of the ...
115
Voted
FSE
2004
Springer
15 years 5 months ago
2004
Springer
Recent research shows that the class of Rotation Symmetric Boolean Functions (RSBFs), i.e., the class of Boolean functions that are invariant under circular translation of indices,...
SEFM
2006
IEEE
15 years 6 months ago
2006
IEEE
tic analysis tools based on abstraction are sound but not complete. Several practical static analysis tools are heuristic in nature —they are neither sound nor complete, but have...
SIGSOFT
2003
ACM
16 years 1 months ago
2003
ACM
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...