6167 search results - page 1172 / 1234 » Can Refinement be Automated |
POPL
2007
ACM
14 years 10 months ago
2007
ACM
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
RECOMB
2006
Springer
14 years 10 months ago
2006
Springer
Abstract. Protein motions, ranging from molecular flexibility to largescale conformational change, play an essential role in many biochemical processes. Despite the explosion in ou...
RECOMB
2004
Springer
14 years 10 months ago
2004
Springer
Finding recurring residue packing patterns, or spatial motifs, that characterize protein structural families is an important problem in bioinformatics. To this end, we apply a nov...
CADE
2007
Springer
14 years 10 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
CADE
2001
Springer
14 years 10 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...