-
3
-
-
0033224819
-
Approximating the domains of functional and imperative programs
-
J. Brauburger and J. Giesl. Approximating the domains of functional and imperative programs. Science of Computer Programming, 35(2):113-136, 1999.
-
(1999)
Science of Computer Programming
, vol.35
, Issue.2
, pp. 113-136
-
-
Brauburger, J.1
Giesl, J.2
-
4
-
-
0004487160
-
Redlog user manual, edition 2.0
-
University of Passau, Germany
-
A. Dolzmann and T. Sturm. Redlog user manual, edition 2.0. Technical Report MIP-9905, Department of Mathematics and Informatics, University of Passau, Germany, 1999.
-
(1999)
Technical Report MIP-9905, Department of Mathematics and Informatics
-
-
Dolzmann, A.1
Sturm, T.2
-
5
-
-
0002003695
-
Symbolic evaluation methods - Implementations and applications
-
B. Chandrasekaran and S. Radicchi, editors, North-Holland
-
L.A. Clarke and D.J. Richardson. Symbolic evaluation methods - implementations and applications. In B. Chandrasekaran and S. Radicchi, editors, Computer Program Testing, pages 65-102. North-Holland, 1981.
-
(1981)
Computer Program Testing
, pp. 65-102
-
-
Clarke, L.A.1
Richardson, D.J.2
-
7
-
-
0003564155
-
Using PVS to prove some the orems of David Parnas
-
J.J. Joyce and C.-J.H. Seger, editors, volume 780 of LNCS, Springer
-
J. Rushby and M. Srivas. Using PVS to prove some the orems of David Parnas. In J.J. Joyce and C.-J.H. Seger, editors, Proc. of the Sixth Int'l Workshop on Higher Order Logic Theorem Proving and Its Applications, volume 780 of LNCS, pages 163-173. Springer, 1994.
-
(1994)
Proc. of the Sixth Int'l Workshop on Higher Order Logic Theorem Proving and Its Applications
, pp. 163-173
-
-
Rushby, J.1
Srivas, M.2
-
8
-
-
0028538729
-
On proving the termination of algorithms by machine
-
C. Walther. On proving the termination of algorithms by machine. ArtiJicial Intelligence, 71(1): 101-157, 1994.
-
(1994)
ArtiJicial Intelligence
, vol.71
, Issue.1
, pp. 101-157
-
-
Walther, C.1
-
9
-
-
0000129940
-
Specification analysis and test data generation by solving Boolean combinations of numeric constraints
-
T.H. Tse and T.Y. Chen, editors, IEEE Computer Society
-
J. Zhang. Specification analysis and test data generation by solving boolean combinations of numeric constraints. In T.H. Tse and T.Y. Chen, editors, Proc. of the First Asia-Pacific Conference on Quality Software, pages 267-274. IEEE Computer Society, 2000.
-
(2000)
Proc. of the First Asia-Pacific Conference on Quality Software
, pp. 267-274
-
-
Zhang, J.1
|