5 citations found. Retrieving documents...
D. R. Ghica, A regular-language model for Hoare-style correctness statements, in: Proceedings of the Veri cation and Computational Logic 2001.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
An approach to deciding observational equivalence of Algol-like.. - Ong   (Correct)

....Murawski [22] has shown that observational equivalence of fourthorder IA is undecidable. On the (Algorithmic) Game Semantics front, Ghica has extended his earlier work with McCusker to a call by value language with arrays [8] and to model checking Hoare style program correctness assertions [7]. For a tutorial introduction, we recommend [1] 1.4 Outline The rest of the paper is organized as follows. The syntax and operational semantics of Idealized Algol are introduced in Section 2. We develop the requisite game semantic machinery in Section 3, and give an innocent strategy withstate ....

D. R. Ghica. A regular-language model for Hoare-style correctness statements. In Proc. 2nd Int. Workshop on Veri cation and Computational Logic VCL'2001.


Observational equivalence of 3rd-order Idealized Algol is decidable - Ong   (Correct)

....it is not known whether observational equivalence of 4th or higher order IA is decidable. On the (Algorithmic) Game Semantics front, Ghica has extended his earlier work with McCusker to a call by value language with arrays [4] and to model checking Hoare style program correctness assertions [3]. In a foundational direction, Abramsky [1] has extended the regular language representation to games in whose plays there is at most one pending occurrence of a question at any time, so that each move has a unique justifier (and so pointers may be ignored) 2 Idealized Algol Reynolds Idealized ....

D. R. Ghica. A regular-language model for Hoare-style correctness statements. In Proc. VCL'2001.


Algorithmic Game Semantics - Abramsky   (Correct)

....Algol in a remarkably simple form as regular expressions. This leads to a decision procedure for observation equivalence on this fragment. Ghica has subsequently extended the approach to a call by value language with arrays [14] and to model checking Hoare style program correctness assertions [13]. We believe the time is ripe for a systematic development of this algorithmic approach to game semantics. Game Semantics has several features which make it very promising from this point of view. It provides a very concrete way of building fully abstract models. It has a clear operational ....

D. R. Ghica. A regular-language model for Hoare-style correctness statements. In Proc. 2nd Int. Workshop on Verification and Computational Logic VCL'


The Regular-Language Semantics of Second-Order Idealized ALGOL - Ghica, McCusker (2003)   Self-citation (Ghica)   (Correct)

....subject opaque. Moreover, the property of full abstraction together with the fact that reasoning can be carried out in a decidable formal language suggest that our approach constitutes a good foundation on which an automatic program checker for IA and related languages can be constructed (see also [12,13]) The idea of using game semantics to support automated program analysis has already been independently explored in a more general framework by Hankin and Malacaria [14,15] They used such models to derive static analysis algorithms which can be described without reference to games. In the ....

D. R. Ghica, A regular-language model for Hoare-style correctness statements, in: Proceedings of the Veri cation and Computational Logic 2001.


The Regular-Language Semantics of First-Order Idealized ALGOL - Ghica, McCusker   Self-citation (Ghica)   (Correct)

....subject opaque. Moreover, the property of full abstraction together with the fact that reasoning can be carried out in a decidable formal language suggest that our approach constitutes a good foundation on which an automatic program checker for IA and related languages can be constructed (see also [5]) The idea of using game semantics to support automated program analysis has already been independently explored in a more general framework by Hankin and Malacaria [8,9] They used such models to derive static analysis algorithms which can be described without reference to games. In the ....

D. R. Ghica. A regular-language model for Hoare-style correctness statements. In The Second International Worshop on Verication and Computational Logic, Florence, Italy, Sept. 2001.

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