| Bednarczyk, M. A. and T. Borzyszkowski. Towards program development with Isabelle. Proc. 1st Isabelle User Workshop, pp.101-121, Cambridge, 1995. |
....the form # sat # as basic judgments. Above, # is an imperative program, thus its extension is an action, and # is a formula # . In its most general form the system enables to reason on the level of parametrized non deterministic programs with loops. Its applicability has been demonstrated in [4, 5]. We claim that it is suitable for the tasks ranging from verification, via specification, to formal program development. It should not be di#cult to realize that actually, the shooting action Shoot specified in (12) with (ldd = yes) ldd = yes) # ) corresponds to the program ....
Bednarczyk, M. A. and T. Borzyszkowski. Towards program development with Isabelle. Proc. 1st Isabelle User Workshop, pp.101--121, Cambridge, 1995.
.... sat as basic judgments. Above, is an imperative program, thus its extension is an action, and is a formula of LP . In its most general form the system enables to reason on the level of parameterized non deterministic programs with loops. Its applicability has been demonstrated in [3, 4]. We claim that it is suitable for the tasks ranging from veri cation, via speci cation, to formal program development. It should not be dicult to realize that actually, the shooting action Shoot speci ed in (12) as ) ldd = yes) corresponds to the program Shoot = if ldd = ....
Bednarczyk, M. A. and T. Borzyszkowski. Towards program development with Isabelle. Proc. 1st Isabelle User Workshop, pp.101-121, Cambridge, 1995.
....proposed by Soko lowski (1993, 1996) The resulting logic, called pLSD, is then demonstrated in action when a simple development task is accomplished. The specially interesting feature of pLSD is that as specifications it uses formulae of logic of predicates with explicit substitution proposed by Bednarczyk (1995a,1996) It turns out that this logic of specifications is a fragment of linear logic, and that its linear features are relevant to software constructs. The programming logic pLSD has already been encoded by the authors (1995) in a general purpose theorem prover Isabelle developed by Paulson in ....
....are pairs of assertions, and do not form a well known logic of specifications as such. That was a reason for modification Hoare logic proposed by Soko lowski (1993) One easily notices that in assignment and in skip axioms the first order assertions play the role of dummies. It was noticed by Bednarczyk (1995), that one can get rid off the dummies by turning into logic of predicates with explicit substitutions. The rules of the new logic called pLSD are presented in Table 2. Predicate logic with explicit substitutions turns out to be a fragment of linear logic developed by Girard (1987) This explains ....
Bednarczyk, M. A., and Borzyszkowski, T.,(1995), Towards Program Development with Isabelle. Proc. 1st Isabelle User Workshop, pp.101--121, Cambridge, Available as url: http://www.cl.cam.ac.uk/users/lcp/Workshop/papers/bednarczyk.ps.gz.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC