Discovering the Law Again: John Grisham, Ed Stevens and the Postmaterial Lawyer

This paper uses three films adapted from the novels of John Grisham, The Firm, The Rainmaker and A Time To Kill, as well as associated television series like Ed to map a vernacular theory of what I have termed the 'postmaterial' lawyer. Grisham's work has been the focus of much critique by legal scholars who suggests he hates lawyers, is critical of the concept of law, and provides 'outlandishly' happy endings. I will challenge these critiques and, in tracing the history of legal thrillers and trial movies, suggest that Grisham and the related texts' explorations of how a just practitioner can operate in an unjust system constitute a powerful interrogation of what law can be.

Structural refinement of systems specified in object-z and CSP

This paper is concerned with methods for refinement of specifications written using a combination of Object-Z and CSP. Such a combination has proved to be a suitable vehicle for specifying complex systems which involve state and behaviour, and several proposals exist for integrating these two languages. The basis of the integration in this paper is a semantics of Object-Z classes identical to CSP processes. This allows classes specified in Object-Z to be combined using CSP operators. It has been shown that this semantic model allows state-based refinement relations to be used on the Object-Z components in an integrated Object-Z/CSP specification. However, the current refinement methodology does not allow the structure of a specification to be changed in a refinement, whereas a full methodology would, for example, allow concurrency to be introduced during the development life-cycle. In this paper, we tackle these concerns and discuss refinements of specifications written using Object-Z and CSP where we change the structure of the specification when performing the refinement. In particular, we develop a set of structural simulation rules which allow single components to be refined to more complex specifications involving CSP operators. The soundness of these rules is verified against the common semantic model and they are illustrated via a number of examples.