632 search results - page 32 / 127 » Combining programming with theorem proving |
FMCAD
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Termination poses one of the main challenges for mechanically verifying infinite state systems. In this paper, we develop a powerful and extensible framework based on th...
PADL
2011
Springer
12 years 10 months ago
2011
Springer
Abstract. Modern web forms interact with the user in real-time by detecting errors and filling-in implied values, which in terms of automated reasoning amounts to SAT solving and ...
CPP
2011
12 years 7 months ago
2011
Abstract. In this paper we present a new technique for automatically verifying typing constraints in the setting of Dminor, a first-order data processing language with refinement...
DAC
2003
ACM
14 years 8 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...
APSEC
2005
IEEE
14 years 1 months ago
2005
IEEE
— Invariant based programming is an approach to program construction where we provide the program pre- and postconditions as well as loop invariants before we construct the code ...