Results 1  10
of
13
Longrange effects of retroviral insertion on cmyb: overexpression may be obscured by silencing during tumor growth in
, 2003
"... Updated information and services can be found at: ..."
(Show Context)
Towards Correct, Efficient and Reusable Transformational Developments
 KORSO, Correct Software by Formal Methods, LNCS
, 1994
"... The KORSO methodology for the development of correct software is instantiated such that each development step corresponds to the application of a preconceived transformation rule or method. The framework is generic with respect to an object language and permits the verification of semantic correctne ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The KORSO methodology for the development of correct software is instantiated such that each development step corresponds to the application of a preconceived transformation rule or method. The framework is generic with respect to an object language and permits the verification of semantic correctness. Elementary transformation rules incorporate a powerful notion of matching that allows abstraction to rule schemata. Higherorder rules are the elements of a tactical calculus with a number of desirable algebraic properties. This is the basis for a formalisation of transformational developments, for generalisation of concrete developments to tactical methods, and for a refinement of methods to efficient transformation scripts. Thus reusability of the development process is achieved and general, correct development methods can be established and refined into efficient tactical programs.
integration loci associated with leukaemia
"... Linkage on chromosome 10 of several murine retroviral ..."
(Show Context)
Terminal Region of cMyb Removed as a Result of Retroviral
, 1998
"... These include: This article cites 28 articles, 14 of which can be accessed free at: ..."
Abstract
 Add to MetaCart
(Show Context)
These include: This article cites 28 articles, 14 of which can be accessed free at:
Regulation of the Resident Chromosomal Copy of cmyc by cMyb Is Involved in Myeloid Leukemogenesis
, 1999
"... These include: This article cites 70 articles, 41 of which can be accessed free at: ..."
Abstract
 Add to MetaCart
(Show Context)
These include: This article cites 70 articles, 41 of which can be accessed free at:
Formal Development of Processes by ModelChecking and Theorem Proving with FDR and HOLCSP
"... Abstract. Modelcheckers are highly specialized tools, geared towards one particular formal method. In contrast, theorem provers are flexible, versatile formal proof environments suitable for a wide variety of formal methods. Their strengths are complimentary, and hence their combination rewarding. ..."
Abstract
 Add to MetaCart
Abstract. Modelcheckers are highly specialized tools, geared towards one particular formal method. In contrast, theorem provers are flexible, versatile formal proof environments suitable for a wide variety of formal methods. Their strengths are complimentary, and hence their combination rewarding. This paper describes a case study where the embedding HOLCSP of the process algebra CSP into the theorem prover Isabelle and the modelchecker FDR are combined, arriving at a development environment combining the advantages of both FDR and HOLCSP. In this environment, we can use FDR to prove properties about processes with a finite state space, whereas HOLCSP serves a general logical framework, in which these properties can be generalized. 1 Introduction Tools for formal methods can be classified in a spectrum between the following two extremes. On the one hand, there are automated tools, specialized to one particular formal method, in which they often demonstrate a remarkable proof power. A popular variety of tools of this kind are socalled modelcheckers, which are based on exhaustive search of a finite state space. They run with hardly any user intervention: users enter a property they wish to prove, and the modelchecker can either show the property, or will fail. On the other hand, there are generalpurpose theorem provers, usually based on a powerful metalogic like higherorder logic or type theory, into which the formal method is embedded. A theorem prover assists the construction of proofs; the main proof work remains to be done by the user. The respective advantages of these tools are complimentary modelcheckers are fully automatic and highly specialized, theorem provers are userdriven and very versatile and hence much can be gained by combining them. In this paper, a case study is described in which two such tools for the process algebra CSP [5, 16] are combined: the modelchecker FDR [3, 16], and the encoding HOLCSP [17] of CSP into the theorem prover Isabelle [14].
Transformational Development of LEX
"... In this paper we present a transformational development of an efficient implementation of a lexical scanner, corresponding to the wellknown LEX in the UNIX system. Based on a formal requirement specification of LEX written in the algebraic specification language SPECTRUM, the development is guided ..."
Abstract
 Add to MetaCart
In this paper we present a transformational development of an efficient implementation of a lexical scanner, corresponding to the wellknown LEX in the UNIX system. Based on a formal requirement specification of LEX written in the algebraic specification language SPECTRUM, the development is guided by global plans and realised by applications of correctnesspreserving transformations (partly developed in the PROSPECTRA project [HK 93]). Optimization is obtained naturally as the end product of the formal development. Our transformational approach is partly an alternative to common "invent and verify" techniques. The development is formally presented and embedded in the terminology of the KORSO Framework.
III. The Definition of LIMA
"... Syntax (Module AS): We will not formally describe the translation from concrete syntax to AS, since it is straightforward in all cases. Note, however, that a single Ide as FParm is interpreted as a sort, i.e. it is parsed by default as name(X,nil,sort). This is due to the fact that parameters are tr ..."
Abstract
 Add to MetaCart
Syntax (Module AS): We will not formally describe the translation from concrete syntax to AS, since it is straightforward in all cases. Note, however, that a single Ide as FParm is interpreted as a sort, i.e. it is parsed by default as name(X,nil,sort). This is due to the fact that parameters are treated as declarations. The following definition of an AS for LIMA emmerged from the original implementation in OPAL (except for the introduction of the variant occr for attribute occurences, notational changes and minor simplifications). Definition 1.2: The abstract syntax: spec ABSY [sort obj] = {enrich SEQ + PHYLA[obj]; type struct == layer( head : obj, imports : seq[import], exports: seq[obj], signature : seq[obj], phylums : seq[phylum]) type import== complete( importKind : importKind, origin : obj) only( importKind : importKind, origin : obj, only : seq[obj]) type importKind == AS AD AN } spec PHYLA [sort obj] = {enrich STRING + SEQ + OPT + NAMES[obj] type phylum == phylum( f: obj, cons:...
A Calculus of Transformation (Extended Abstract)
"... ) Burkhart Wolff, Hui Shi 1. Conceptual view This paper presents the concepts and the semantics of a transformation calculus TC that is generic w.r.t. concrete object languages (see also [WS 94]). Built upon an object language description given by an algebraic specification, TC provides contextsens ..."
Abstract
 Add to MetaCart
) Burkhart Wolff, Hui Shi 1. Conceptual view This paper presents the concepts and the semantics of a transformation calculus TC that is generic w.r.t. concrete object languages (see also [WS 94]). Built upon an object language description given by an algebraic specification, TC provides contextsensitive rules in which requirements can be imposed on the context of a redex, and integrates a restricted form of extended rewriting (see [DJ 90], [SW 94]) to express schematic rules. Furthermore, rules may be higherorder in order to represent "parametric transformations" and to focus on particular redeces. This work provides a specification of transformation systems and a foundation for correctness proofs of transformations in TC following the lines of [CIP#85] and [HK 93]. Transformation in our sense is as a form of deduction, applying transformation rules in a kind of termrewriting process. A transformation rule is a pair of terms l and r, written as l Þ r. If a term t matches l , then a ...