793 search results - page 77 / 159 » Argumentation and standards of proof |
95
Voted
TPHOL
2000
IEEE
15 years 5 months ago
2000
IEEE
We provide a proof using HOL and SPIN of convergence for the Routing Information Protocol (RIP), an internet protocol based on distance vector routing. We also calculate a sharp re...
94
Voted
TPHOL
1999
IEEE
15 years 5 months ago
1999
IEEE
We present a development of Universal Algebra inside Type Theory, formalized using the proof assistant Coq. We define the notion of a signature and of an algebra over a signature. ...
129
Voted
CSFW
2007
IEEE
15 years 4 months ago
2007
IEEE
We present interpretations of type systems for secure information flow in Hoare logic, complementing previous encodings in binary (e.g. relational) program logics. Treating base-l...
95
Voted
ESOP
2000
Springer
15 years 4 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) ...
93
Voted
IANDC
2008
15 years 22 days ago
2008
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...