Automatic Complexity Analysis for Programs Extracted from Coq Proof.

Jean-Pierre Jouannaud Weiwen Xu

Published in: Electron. Notes Theor. Comput. Sci. (2006)

Keyphrases

complexity analysis
theorem prover
theoretical analysis
first order logic
lower bound
fully automatic
semi automatic
provably correct
imperative programs
theorem proving
automatically extracted
formal methods
databases
data structure
object oriented
data driven