-
2
-
-
84941179444
-
-
Lukas Ruf and various contributors. TOPSY - A Teachable Operating System. http://www.topsy.net/.
-
-
-
Ruf, L.1
-
4
-
-
84941181004
-
-
Various contributors
-
Various contributors. The Coq Proof assistant, http://coq.inria.fr.
-
-
-
-
7
-
-
1442335816
-
Building certified libraries for PCC: Dynamic storage allocation
-
Elsevier, Mar.
-
Dachuan Yu, Nadeem Abdul Hamid, and Zhong Shao. Building Certified Libraries for PCC: Dynamic Storage Allocation. Science of Computer Programming, 50(1-3) :101-127. Elsevier, Mar. 2004.
-
(2004)
Science of Computer Programming
, vol.50
, Issue.1-3
, pp. 101-127
-
-
Dachuan, Y.1
Hamid, N.A.2
Zhong, S.3
-
8
-
-
26844582848
-
Towards mechanized program verification with separation logic
-
13th Conference on Computer Science Logic (CSL 2004), Springer
-
Tjark Weber. Towards Mechanized Program Verification with Separation Logic. In 13th Conference on Computer Science Logic (CSL 2004), volume 3210 of LNCS, p. 250-264. Springer.
-
LNCS
, vol.3210
, pp. 250-264
-
-
Weber, T.1
-
9
-
-
35048817891
-
A decidable fragment of separation logic
-
24th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2004), Springer
-
Josh Berdine, Cristiano Calcagno, and Peter W. O'Hearn. A Decidable Fragment of Separation Logic. In 24th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2004), volume 3328 of LNCS, p. 97-109. Springer.
-
LNCS
, vol.3328
, pp. 97-109
-
-
Berdine, J.1
Calcagno, C.2
O'Hearn, P.W.3
-
10
-
-
33646807486
-
Symbolic execution with separation logic
-
3rd Asian Symposium on Programming Languages and Systems (APLAS 2005), Springer
-
Josh Berdine, Cristiano Calcagno, and Peter W. O'Hearn. Symbolic Execution with Separation Logic. In 3rd Asian Symposium on Programming Languages and Systems (APLAS 2005), volume 3780 of LNCS, p. 52-68. Springer.
-
LNCS
, vol.3780
, pp. 52-68
-
-
Berdine, J.1
Calcagno, C.2
O'Hearn, P.W.3
-
11
-
-
26844546715
-
A verification environment for sequential imperative programs in isabelle/HOL
-
11th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2004), Springer
-
Norbert Schirmer. A Verification Environment for Sequential Imperative Programs in Isabelle/HOL. In 11th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2004), volume 3452 of LNCS, p. 398-414. Springer.
-
LNCS
, vol.3452
, pp. 398-414
-
-
Schirmer, N.1
-
12
-
-
20144375380
-
Proving pointer programs in higher-order logic
-
Elsevier
-
Farhad Mehta and Tobias Nipkow. Proving Pointer Programs in Higher-Order Logic. In Information and Computation, 199:200-227. Elsevier, 2005.
-
(2005)
Information and Computation
, vol.199
, pp. 200-227
-
-
Mehta, F.1
Nipkow, T.2
-
13
-
-
33745447351
-
A unified memory model for pointers
-
12th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2005), Springer
-
Harvey Tuch and Gerwin Klein. A Unified Memory Model for Pointers. In 12th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2005), volume 3885 of LNCS, p. 474-488. Springer.
-
LNCS
, vol.3885
, pp. 474-488
-
-
Tuch, H.1
Klein, G.2
-
14
-
-
35048862900
-
Multi-prover verification of C programs
-
6th International Conference on Formal Engineering Methods (ICFEM 2004) Springer
-
Jean-Christophe Filliâtre. Multi-Prover Verification of C Programs. In 6th International Conference on Formal Engineering Methods (ICFEM 2004). volume 3308 of LNCS, p. 15-29. Springer.
-
LNCS
, vol.3308
, pp. 15-29
-
-
Filliâtre, J.-C.1
|