Program abstraction in a higher-order logic framework
UNSPECIFIED (1998) Program abstraction in a higher-order logic framework. In: 11th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 98), CANBERRA, AUSTRALIA, SEP 27-OCT 01, 1998. Published in: THEOREM PROVING IN HIGHER ORDER LOGICS, 1479 pp. 33-48.Full text not available from this repository.
We present a hybrid approach to program verification: a higher-order logic, used as a specification language, and a human-driven proof environment, with a process-algebraic engine to allow the use of process simulation as an abstraction technique. The domain of application is the validation of object code, and our intent is to adapt and mix existing formalisms to make the verification of representative programs possible. In this paper, we describe the logic in question and an underlying semantics given in terms of a process algebra.
|Item Type:||Conference Item (UNSPECIFIED)|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software|
|Series Name:||LECTURE NOTES IN COMPUTER SCIENCE|
|Journal or Publication Title:||THEOREM PROVING IN HIGHER ORDER LOGICS|
|Editor:||Grundy, J and Newey, M|
|Number of Pages:||16|
|Page Range:||pp. 33-48|
|Title of Event:||11th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 98)|
|Location of Event:||CANBERRA, AUSTRALIA|
|Date(s) of Event:||SEP 27-OCT 01, 1998|
Actions (login required)