429 search results - page 17 / 86 » Theorem Proving Languages for Verification |
TPHOL
1998
IEEE
14 years 25 days ago
1998
IEEE
Abstract. Over the last decade, the increasing demand for the validation of safety critical systems lead to the development of domain-specific programming languages (e.g. synchrono...
ICFP
2009
ACM
14 years 9 months ago
2009
ACM
We report on our experience using Haskell as an executable specification language in the formal verification of the seL4 microkernel. fication connects an abstract operational spe...
DAC
2003
ACM
14 years 9 months ago
2003
ACM
SAT-based decision procedures for quantifier-free fragments of firstorder logic have proved to be useful in formal verification. These decision procedures are either based on enco...
FM
2003
Springer
14 years 1 months ago
2003
Springer
Incomplete, inaccurate, ambiguous, and volatile requirements have plagued the software industry since its inception. The convergence of model-based development and formal methods o...
JSYML
2000
13 years 8 months ago
2000
We derive a Mal'cev condition for congruence meet-semidistributivity and then use it to prove two theorems. Theorem A: if a variety in a finite language is congruence meet-sem...