-
1
-
-
0004025792
-
-
Cambridge University Press, Cambridge
-
Abrial, J.-R.: The B-book. Cambridge University Press, Cambridge (1996)
-
(1996)
The B-Book
-
-
Abrial, J.-R.1
-
2
-
-
84885608064
-
# programming system: Challenges and directions
-
Meyer, B., Woodcock, J. (eds.) LNCS Springer, Heidelberg
-
# programming system: Challenges and directions. In: Meyer, B., Woodcock, J. (eds.) VSTTE 2005. LNCS, vol. 4171, pp. 144-152. Springer, Heidelberg (2008)
-
(2008)
VSTTE 2005
, vol.4171
, pp. 144-152
-
-
Barnett, M.1
DeLine, R.2
Fähndrich, M.3
Jacobs, B.4
Leino, K.R.M.5
Schulte, W.6
Venter, H.7
-
4
-
-
77957050565
-
-
http://freeelks.svn.sourceforge.net
-
-
-
-
5
-
-
0002424767
-
An initial algebra approach to the specification, correctness, and implementation of abstract data types
-
Prentice-Hall, Englewood Cliffs
-
Gougen, J.A., Thatcher, J.W., Wagner, E.G.: An initial algebra approach to the specification, correctness, and implementation of abstract data types. In: Current Trends in Programming Methodology, pp. 80-149. Prentice-Hall, Englewood Cliffs (1978)
-
(1978)
Current Trends in Programming Methodology
, pp. 80-149
-
-
Gougen, J.A.1
Thatcher, J.W.2
Wagner, E.G.3
-
6
-
-
0004988782
-
The algebraic specification of abstract data types
-
Guttag, J.V., Horning, J.J.: The algebraic specification of abstract data types. Acta Inf. 10, 27-52 (1978)
-
(1978)
Acta Inf.
, vol.10
, pp. 27-52
-
-
Guttag, J.V.1
Horning, J.J.2
-
7
-
-
0015482118
-
Proof of correctness of data representations
-
Hoare, C.A.R.: Proof of correctness of data representations. Acta Inf. 1, 271-281 (1972)
-
(1972)
Acta Inf.
, vol.1
, pp. 271-281
-
-
Hoare, C.A.R.1
-
8
-
-
13144252258
-
How the design of JML accommodates both runtime assertion checking and formal verification
-
Leavens, G.T., Cheon, Y., Clifton, C., Ruby, C., Cok, D.R.: How the design of JML accommodates both runtime assertion checking and formal verification. Sci. Comput. Program. 55(1-3), 185-208 (2005)
-
(2005)
Sci. Comput. Program
, vol.55
, Issue.1-3
, pp. 185-208
-
-
Leavens, G.T.1
Cheon, Y.2
Clifton, C.3
Ruby, C.4
Cok, D.R.5
-
10
-
-
70349446168
-
Programs that test themselves
-
Meyer, B., Fiva, A., Ciupa, I., Leitner, A., Wei, Y., Stapf, E.: Programs that test themselves. Computer 42(9), 46-55 (2009)
-
(2009)
Computer
, vol.42
, Issue.9
, pp. 46-55
-
-
Meyer, B.1
Fiva, A.2
Ciupa, I.3
Leitner, A.4
Wei, Y.5
Stapf, E.6
-
11
-
-
77957042227
-
-
Extended version
-
Polikarpova, N., Furia, C.A., Meyer, B.: Specifying reusable components, Extended version, http://arxiv.org/abs/1003.5777
-
Specifying Reusable Components
-
-
Polikarpova, N.1
Furia, C.A.2
Meyer, B.3
-
13
-
-
33746218971
-
Making specifications complete through models
-
Schoeller, B., Widmer, T., Meyer, B.: Making specifications complete through models. In: Architecting Systems with Trustworthy Components, pp. 48-70 (2004)
-
(2004)
Architecting Systems with Trustworthy Components
, pp. 48-70
-
-
Schoeller, B.1
Widmer, T.2
Meyer, B.3
-
14
-
-
77957056161
-
-
http://vsr.sourceforge.net/
-
-
-
-
15
-
-
57349111788
-
Full functional verification of linked data structures
-
ACM, New York
-
Zee, K., Kuncak, V., Rinard, M.C.: Full functional verification of linked data structures. In: PLDI 2008, pp. 349-361. ACM, New York (2008)
-
(2008)
PLDI 2008
, pp. 349-361
-
-
Zee, K.1
Kuncak, V.2
Rinard, M.C.3
|