1226 search results - page 27 / 246 » Proofs, Programs and Abstract Complexity |
113
click to vote
FROCOS
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Nowadays, formal methods rely on tools of different kinds: proof assistants with which the user interacts to discover a proof step by step; and fully automated tools whic...
102
click to vote
ESOP
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. We present the first formalization of implementation straor first-class continuations. The formalization hinges on abstract machines for continuation-passing style (CPS) ...
107
click to vote
ESOP
2005
Springer
15 years 7 months ago
2005
Springer
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and ...
143
click to vote
HASKELL
2005
ACM
15 years 7 months ago
2005
ACM
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...
144
click to vote
ITP
2010
15 years 4 months ago
2010
Recent advances in termination analysis have yielded new methods and tools that are highly automatic. However, when they fail, even experts have difficulty understanding why and de...