1302 search results - page 139 / 261 » Free-Style Theorem Proving |
178
click to vote
ICFP
2006
ACM
16 years 4 months ago
2006
ACM
I report on an experience using the Coq proof assistant to develop a program verification tool with a machine-checkable proof of full correctness. The verifier is able to prove me...
108
click to vote
CIE
2007
Springer
15 years 10 months ago
2007
Springer
The interest is in characterizing insightfully the power of program self-reference in effective programming systems (epses), the computability-theoretic analogs of programming lan...
129
click to vote
IFIP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
183
click to vote
CADE
1998
Springer
15 years 8 months ago
1998
Springer
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...
149
click to vote
CSFW
2010
IEEE
15 years 7 months ago
2010
IEEE
We embed an operational semantics for security protocols in the interactive theorem prover Isabelle/HOL and derive two strong protocol-independent invariants. These invariants allo...