z-logo
open-access-imgOpen Access
Theorem Proving in Higher Order Logics
Author(s) -
Victor A. Carreño,
César Muñoz,
Sofiène Tahar
Publication year - 2002
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
DOI - 10.1007/3-540-45685-6
Subject(s) - computer science , order (exchange) , automated theorem proving , second order logic , calculus (dental) , algebra over a field , theoretical computer science , mathematics , higher order logic , pure mathematics , description logic , medicine , dentistry , finance , economics
DOVE is a Isabelle-based, graphical tool for the trusted design and analysis of state machine designs. Work is currently underway aimed at increasing the scope of DOVE to include complex, dynamic and real-time processes. This paper describes a refinement approach to the design and analysis of complex processes, including a formal development of the approach in Isabelle. It is argued that the addition of a network feedback operator and associated refinement rules makes the refinement calculus of Back a powerful development tool for process networks, allowing essentially arbitrary decomposition of network properties over subcomponents. The feedback operator is shown to be ‘compositional’ with respect to an implementation language of digital input/output processes with local state. Some simple examples are considered.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom