ѧ
JOURNAL OF SOFTWARE
1999ꡡ109ڡVol.10No.91999



*
ΡǮ
ժҪӦGoguen˵Ľ֤õ˼ṹĻ.һ,Щ֤˸Ŀж¶,ҿ԰ѽжϵĶΪ֤.һ,»˻ڷװԵĶ󾫻.ǵõһṹĶϵͳ.
ؼʡṹ,institution,-,ϵͳ,󾫻.
ͼšTP311
Object Calculus 
HUANG Tao,QIAN Jun,WANG Xu
(Laboratory of Computer Science Institute of Software The Chinese Academy of Sciences Beijing 100080)
(Object Technology Center Institute of Software The Chinese Academy of Sciences Beijing 100080)
AbstractIn this paper, some important theories of structured object calculus using the results contributed by Goguen are proved. These theories ensure to build up the description of new objects from the description of the existing objects and verify the global system with theories deduced from existing objects as lemma. In addition, the object reification on the basis of object encapsulation is studied, and a structured object calculus is achieved.
Key wordsStructured object calculus, institution,-theory, object system, object reification.
ף1,2,йص.Ȼ,ڸӶ,ܸ.ܹ󡱶ֳһϵСС,Ȼٽװ,⽫Ǵķ.жµĸӶҪ֮һ.ҪɶµĸӶ.Ϊ,ǽӶϵͳ.Ϊʹǰ۵йصȻЧ,Ҫģ黯,ǿԽӶϵͳֽΪһЩСĳɷֶ,ֱɷֶ,ҿɸɷֶӶ.,һЩǸӶе,ָɷֶĽ.Ҫֽܹ.
1ṹ
Ϊϵ()Ƶ()Ƿǽṹ,һķǽṹ׳ҽ.Ϊ,GoguenBurstall1983Institution3.
1.1Institution
InstitutionĶڡǷ롱(category signatures)ԱǷеÿһǦ,ӦС-/ʽ-ģͼԼϵ(satisfaction relation).InstitutionΨһҪǣǸı,Ĺ/ʽģ͵ı任/豣ϵµĶ.
1. Institution
.ǷSign
.ӣSenSignSet.,Sign,Sen()Ц-/ʽļϣ̬,,Sen()Sen()Sen()-/ʽ任ɦ-/ʽ
.ModSignCatop(Catʾķ,ԷΪ,ĺΪ̬䡱CatopʾCat淶,CatopCatͬĶ,ǰߵ̬Ǻߵ).ǦSign,Mod()-ģͷ룻̬ң,Mod()Mod()Mod()-ģͱ任ɦ-ģͣ
.ϵ|Mod()|Sen()(|Mod()|ʾMod()еġ)̬ң,fSen(),MMod()㣺
MSen()(f)Mod()(M)f.
Institution֤˵Ǹıʱ,Ӧģͽһ¸ı.һͨʾ.
2(̬). Ǧ=(S,F,A,E)ͦ=(S,F,A,E),ǴӦĶ̬Ϊ=(S,F,A,E),У
.SSS䣻
.FFF⺯fFs1...sn,s,F(f)F䡴S(s1)...S(sn),S(s)
.AAAԷfAs1...sn,s,A(f)A䡴S(s1)...S(sn),S(s)
.EEE⶯fEs1,...,sn,E(f)E䡴S(s1),...,S(sn).
 ǽһضĹ,ǦͦĻǶֱΪE=(SE,FE)ͦE=(SE,FE)̬ɶΪ=(ҦE,A).
ԶΪ,̬Ϊ̬䡱,=(S,F,A,E)ϵĺ̬(identutymorphism)Ϊ(idS,idF,idA,idE),̬(composition of morphism)ΪӦɷ̬/ӳĸ,жǵġϡһOSig.OSigеһǦ=(S,F,A,E),ǷֱSort()Func()Attr()Act()ʾS,F,AE.
Ϊṹӳ,̬֮ͬĹϵ(ͨһΪһĳɷ).ǿԽ̬䵽͹ʽ.
3. XSʶı,X=XssS,ң,Ƕ(X)ΪSʶıX
Xs=ȣXs(s)=s.
4. SenOSigSetΪ
.⦸OSig,Sen()F(,X)
.ң,Sen()ΪF(,X)F(,(X))ӳ,㣺
1 ,
(1) xXs,Sen()(x)x
(2) fFEs1...sn,s,tiT(,X)si,i,1in
Sen()(f(t1,...,tn))ҦE(f)(Sen()(t1),...,Sen()(tn))
(3) fAs1...sn,s,tiT(,X)si,i,1in,
Sen()(f(t1,...,tn))A(f)(Sen()(t1),...,Sen()(tn))
(4) aT(,X)E,tT(,X)s,Sen()(at)Sen()(a)Sen()(t)
(5) tT(,X)s,Sen()(Initt)InitSen()(t)
(6) tT(,X)s,Sen()(Xt)XSen()(t)
(7) tT(,X)s,Sen()(X-t)X-Sen()(t).
2 Թʽṹ,
(1) t1,t2T(,X)s,sSE,Sen()(t1=t2)(Sen()(t1)=Sen()(t2))
(2) aT(,X)E,Sen()(enabled(a))enabled(Sen()(a))
(3) aT(,X)E,pF(,X),Sen()(ap)Sen()(a)Sen()(p)
(4) pF(,X),Sen()(Initp)InitSen()(p)
(5) pF(,X),Sen()(Xp)XSen()(p)
(6) p,qF(,X),Sen()(pUq)Sen()(p)USen()(q)
(7) pF(,X),Sen()(X-p)X-Sen()(p)
(8) p,qF(,X),Sen()(pU-q)Sen()(p)U-Sen()(q)
(9) pF(,X),Sen()(p)Sen()(p)F(,X)
(10) p,qF(,X),Sen()(pq)Sen()(p)Sen()(q)
(11) pF(,X),xXs,Sen()(xsp)xҦE(s)Sen()(p).
5(-̬ͬ). һǦ=(S,F,A,E),-ͽṹ,,-̬ͬһӳ㣺
.fFEs1...sn,s,aisi,i,1in

.fAs1...sn,s,aisi,i,1in,ء,
hs((f)()(a1,...,an))=(f)(h*E())hs1(a1),...,hsn(an))
.ء,eE,
(,e)(h*E(),hE(e))ʡ.
h*shsڡȻ.
Ԧ-ͽṹΪ,-̬ͬΪ̬䡱,̬͸̬ͬӳĺ븴,еĦ-ͽṹġϡһInt().
һ,ǿ䦸-̬ͬõTrace-ṹ̬ͬ.
6(Trace-̬ͬ). һǦ=(S,F,A,E),-Trace-ṹ=(,v,),=(,v,ء),Trace-̬ͬhǦ-̬ͬhҦء=h*E().
һǦ,ӦTrace-ṹΪ,Trace-̬ͬΪ̬䡱,Ӧڦ-Trace-ṹġϡһMod().
7(-Լ). Ǧ=(S,F,A,E)ͦ=(S,F,A,E),һ̬ң,ǳƺӣңMod()Mod()Ϊ-Լ(-reduct functor),
1 һTrace-ṹ=(,v,w)Mod(),ئҵĹԼ|=(|,v|,)һTrace-ṹ,
(1) sSE,(v|)sv(s)
(2) sSE,(|)s(s)
(3) fFEs1...sn,s,|Ҧң
(4) fAs1...sn,s,|(f)((f))
(5) |ҡ.
2 h䣺,ҹԼh|ңҡTrace-̬ͬ,жsSE,(h|)sh(s).
ǿԽMod/IntΪǷOSigϵĺ(functor).
8. ModOSigCatopΪ
.⦸OSig,Mod()Trace-ṹķ룻
.ң,Mod()Mod(䣩Mod()Ǧ-Լ,Trace-ṹΪTrace-ṹ.
ǿԽMod(),Sen()дΪ.
1(). ֱ̬ң,Trace-ṹ,ʽpF(,X),

ƪ,֤.ϸۿɲμף4.ɸǵõ½.
1. TraceһInstitution.
1.2-
릸-ۺͦ-۷.
9. һǦ
(1) һ-۷һԪ(,F),FF(,X)һ-ʽ
(2) -ʽFıհΪпԴFƵĦ-ʽļ,ΪF
(3) -(,F)Ǧ-۷,F=F.
10. -T=(,F),T=(,F),һTT̬һ̬ң,pT,(p)(T).
Ϊ,̬Ϊ̬䡱,̬͸̬ͬǷ,۵ġϡһTh.ԷThеԪT=(,F),ǷֱOSig(T)Axioms(T)ʾT.
2. һ̬ң,-۷(,F)ͦ-۷(,F),ң(,F)(,F䡤)һ̬䵱ҽ(F)F䡤.
֤.
ǣҪ֤ǷΪһ̬䣬ֻҪ֤pF,(p)FƵ.
Ϊʹ2ݾTrace1ݵ,InstitutionҪ,ǿƵضһЩ롢̬ͺ,ͽṹ滻Ϊͽṹ,Traceṹ滻Ϊṹ.Щǲ.
ǿǵװ,ԶͽṹΪģ,.Ϊһ̬ң,ĳЩEж,Eûԭ,Ԧ,ЩӦⲿЧ.һ֦-ͽṹ,Ӧġ|ҲһǦ-ͽṹ,Զ2ݲһInstitution.ˣĶ淶ṹһ⦸-ͽṹ,|Ӧһ֦-ͽṹ.GoguentBurstall3ݵĶ壬ǿԽһҪ󿴳һ֡Լ(data constraints).
ͬ/ʽһ,Լģͼ.,һӦĶ̬˴Ӧ-Լ-Լı任.
һǶȿ,֤۷,һ֦-(,T)װ,ҪʽĹʽΪ-
(gExgg(xg))(fAxfaf(xf)=f(xf)),
xg,xfʾg,fӦμ,ǿEnc()ʾùʽ.ʵ,ùʽʾһʱ,һڦжĶ,Բı,һǷװԵҪ.Ȼ,(Enc())ȴһǦ-(ӦڦЧ,ԦԿǷЧ).,Ҫõ̬,ǻ֤.
2ϵͳ
Ըϳɡġ󡪡ۺ϶,ҲЩۺ϶Ϊһϵͳ(Ӧڳϵ).һϵͳĸɷֶ󲢲໥,ܴ֮ڸָ໥.໥Ƕ,ͬĳɷֶ.,໥ûͨ(ͨͬһͬ)Թ.ݶװҪ,ͬһ,Ǳ빲п޸ĸԵĶ.ʵ,Թɿ.
2.1ϵͳ
ף2еΪ1,PRODUCERBUFFERput,ͨµĸINTERFACEʾ.
objectSpec INTERFACE=ITEM+
SortsITEM
Functions
Attributes
Actions
put(ITEM)
Axioms
End
öɿPRODUCERBUFFERĲֶ.Ҳ˵,PRODUCERBUFFERͨINTERFACE໥.PRODUCERBUFFERɵϵͳɿǰPRODUCERBUFFER໥õС,öͨINTERFACE,PRODUCERBUFFER༫(colimit)õ.,һ(pushout).n༫޸˰n໥õС,༫ͬΨһ.ȴSignThOSigӳ༫.ǸPRODUCER,CONSUMERBUFFERɵϵͳSYSTEM.,Ǹ.
ObjectSignature SYSTEM=ITEM+BOOL+INT+
Sorts
Functions
Attributes
Producer.item,Consumer.item ITEM
Producer.waiting,Consumer.waiting BOOL
countINT
Actions
produce(ITEM)
consumer(ITEM)
put(ITEM)
get(ITEM)
End
Ϊ,Ǽ֮ͬǻͬĶ,Ӷʹɶɵϵͳеʱһ,ǰԺȻ.,ɶЩɵϵͳʱ,ʵĶĻ.
SYSTEMĹPRODUCER,CONSUMERBUFFERĳʵ.,ʾĹ3װԹ,ЩװԹΪϵͳṩ˻.
produce(i)Ч
p1produce(i)Producer.item=i
p2produce(i)Producer.waiting=t
consume(i)Ч
clconsume(i)Consumer.waiting=f
put(i)Ч
p3put(i)Producer.waiting=f
b1put(i)Buffer.count=Buffer.count+1
get(i)Ч
c2get(i)Consumer.item=i
c3get(i)Consumer.waiting=t
b2get(i)Buffer.count=Buffer.count-1
ʼ
p4Initwaiting=f
c4InitConsumer.waiting=f
b3InitBuffer.count=0
produce(i)ִеıҪ
p5enabled(produce(i))Producer.waiting=f
consume(i)ִеıҪ
c5enabled(consume(i))(Consumer.item=i)Consumer.waiting=t
put(i)ִеıҪ
p6enabled(put(i))(Producer.item=i)(Producer.waiting=t)
b4enabled(put(i))(Buffer.countsize)
get(i)ִеıҪ
c6enabled(get(i))Consumer.waiting=f
b5enabled(get(i))(Buffer.count0)
̬Լ
p7Producer.waiting=tFput(Producer.item)
c7Consumer.waiting=tFconsume(Consumer.item)
b6put(i)Fget(i)
Ȼ,ڹϵͳʱ,ʱҪʹͬһob໥ͨ,ʹöִͬĶ.ڶҪӦĶʹòͬĶ,ͬͨҪͬͨŵĸӦͬĶ.,ǱobĶǺ.ӶӦ.BUFFER,ǿӶget1(ITEM),get2(ITEM)Ӧ
ab1get1(i)get(i)
ab2get2(i)get(i)
ab3get1(i)get2(i)
ab4get(i)get1(i)get2(i)
йab1ab2ʾǸBUFFERµΪ,ǶԶget/ػ,,װԣab3ʾget1,get2⣻ab4ֹBUFFERĽһ.
Ҳʶ,С,
ab1䣺pget(id,i)get(i)
ab2䣺pget(id,i)pget(idi)id=id
2.2ϵͳ
GoguenBurstallInstitutionĽ,ǿԽһϵͳֽ,ֱϵͳĸɷֶ,ɳɷֶõĽΪϵͳ.Ķ.
2. Ǧ=(S,F,A,E)ͦ=(S,F,A,E),һ̬ң,
(1) Fp(F)(p)
(2) Fsp(F)s(p)
(3) Flp(F)l(p)
(4) Fep(F),(Enc())e(p)
(5) Fsep(F),(Enc())se(p)
(6) Flep(F),(Enc())lee(p).
ϱʾӦƵΪ򦸡Ƶ±s,l,e,seleֱʾӦƵΪȫƵƵװƵװԵİȫƵʹװԵĻƵ.
3. Ǧ=(S,F,A,E)ͦ=(S,F,A,E),һ̬ң,¹
(struct) ȣxgf(x1,...,xn)=f(x1,...,xn)(Enc()).
gE-(E),fA䡴,(s1)...,(sn),(s)xgXE,xiX(si),1in,n0.
Ȼ.öָ,ڦӵĶ޸ӦڦԵĦ(Լ̳жǼ̳,Ծۺ϶ǳɷֶ),̬ұװ.
-,ӦPRODUCER,CONSUMER,BUFFERSYSTEMĶǷֱΪp,c,bͦsԼ̬pps,cbsͦbcs,֤
SYSTEMs p(Enc(p)),
SYSTEMs c(Enc(c)),
SYSTEMs b(Enc(b)).
1SYSTEMsproduce(i)Fconsume(i).
֤ף23,
PRODUCERp produce(i)Fput(i).
b6,
BUFFERb put(i)Fget(i).
,֤
PRODUCERc get(i)Fconsume(i).
(1) get(i)(get(i)waiting=tģget(i)item=i)ʽget(i)Ķ
(2) get(i)waiting=tget(i)(waiting=t) =,tϸ
(3) get(i)(get(i)(waiting=t)ģget(i)item=i)(1),(2),(prep)
(4) (aitem=itemģawaiting=waiting)kget(k)lconsume(l)װ
(5) enabled(get(i))waiting=f c6
(6) lconsume(l)((waiting=tenabled(a))
(aitem=itemģawaiting=waiting))(4),(5)
(7) get(i)X((waiting=titem=i)Uconsume(i))(3),(6),(c7),(live6)
(8) get(i)Fconsume(i)(7),(prep)
Ϊ
SYSTEMsp(Enc(p))
SYSTEMsc(Enc(c))
SYSTEMsb(Enc(b))

SYSTEMsproduce(i)Fput(i)
SYSTEMsput(i)Fget(i)
SYSTEMsget(i)Fconsume(i)
(prep)ɵ
SYSTEMs produce(i)Fconsume(i).
ͨ,ʡƵ±.
3󾫻
ǰ˶Ľṹ,йض󾫻.һ,ʵֳķ,(1) еľʵĳ(2) ִе.1෽漰һϵƾ,Щ߰θľʾ.й෽ۺܶ,(refinement)ķΪķ.2෽ڱͷ,ķԿ,淶ģ.ڵʽ߼д෽һ.
,Ҫʹоϵͳ,ҪṩʹõͲ߲Ļ.ǰ߿ɳΪˮƽṹ(horizontal structuring),߿ɳΪֱṹ(vertical structuring).
,õǻ󾫵ʵַ.
ڽг󾫻ʱ,ͨм,ȻԸмΪһ(Լ)ضĳԼ.ǰΪضĳԼмΪƳΪ(reification).
3.1ľ
ľھϵʵ֡ھ嶯ϵʵֺͳʼʵ.Ȼ,AbsЩ,䶯ӦЩϵ(transaction).ھʱ,ͨ󸴺ϳһConȻͨӱҪĵԺҪConõTmp֤һTmpAbsġ,TmpĶ롱AbsĶ.
ԶBUFFERΪ,˵󾫻ȷ.һָʵBUFFER.
ObjectSpec POINTER=INT+
Sorts
Functions
Attributes
vINT
Actions
inc
Axioms
p1incv=v+1
End
ObjectSpec ARRAY=ITEM+INDEX+
Sorts
Functions
Attributes
vINDEXITEM
Actions
put(INT,ITEM)
get(INT,ITEM)
Axioms
a1put(k,i)v(modsize(k))=i
a2get(k,i)v(modsize(l))=v(modsize(l)),modsize(l)modsize(k)
a3put(k,i)put(l,i)modsize(k-l)=0
a4enabled(get(k,i))v(modsize(k))=i
End
INDEXΪ0...size-1,modsizeΪsizeȡģ.a3鲢ֵ.Conָʵһʵ.ConıǰǲཻĲ.
ObjectSpec Con=ITEM+INDEX
Sorts
Functions
Attributes
Array.vINDEXITEM
Head.vINDEX
Tail.vINDEX
Actions
Array.put(INDEX,ITEM)
Array.get(INDEX,ITEM)
Head.inc
Tail.inc
Axioms
Array.a1Array.a4
Head.p1
Tail.p1
End
Con.,countΪConԵĵ,count=Head.v-Tail.v,
countʵֲѵõ
Head.v-Tail.vsizecountsize,
Tail.vHead.vcount0.
ʼ
i1InitHead.v=0
i2InitTail.v=0
һ,ǿǳʵ.ڳput,ǿɽʵΪָHeadǰƺͶĸֵ,
i3put(i)Head.inc
i4put(i)Array.put(Head.v,i)
i5enabled(get(i))(Head.v-Tail.vsize)
ڳget,ǿɽʵΪָTailǰƺʹȡֵ,
i6get(i)Tail.inc
i7get(i)Array.get(Tail.v,i)
i8enabled(get(i))(Tail.vHead.v)(i=Array.v(Tail.v))
,ǽput,getʵֵһЩҪ,ûȫǵľʵ,ָǰƺʹ鸳ֵ/ȡֵԡִ,
Array.put(Head.v,i)Head.inc,
Array.get(Tail.v,i)Tail.inc.
ҲԴһ,񿴳һԭӶ,
Array.put(Head.v,i)Head.inc
Array.get(Tail.v,i)Tail.inc.
ʵʵʱ,ԭ.ԭԿɱʾΪԼ
Array.put(Head.v,i)XHead.inc,
Array.get(Tail.v,i)XTail.inc,
Head.incX-iArray.put(Head.v,i),
Tail.incX-iArray.get(Tail.v,i).
,Ӧڶ̬Լ,
i7 Head.incFTail.inc
ʵʵ,ǿԸԸĽ,ab,abɿǡ(propagate)̵.
3.2󾫻ȷ
Ǳ֤BUFFERľȷ,.
b1Ϊ,,ǽǺϷΪ.ǽputΪһArray.put(Head.v,i)Head.inc.ô,֤b1֤ʵеķ룺
Array.put(Head.v,i)Head.inc(Head.v-Tail.v)=(Head.v-Tail.v)+1.
,Array.put(Head.v,i)Head.incΪArray.put(Head.v,i)ݣHead.inc.
У
(1)Head.incHead.v=Head.v+1 Head.p1
(2)Array.put(Head.v,i)Head.v=Head.vHeadķװ
(3)Array.put(Head.v,i)ݣHead.incHead.v=
Array.put(Head.v,i)Head.v+1(1)͡=,+,1ϸ
(4)Array.put(Head.v,i)ݣHead.incHead.v=Head.v+1(2),(3),滻
(5)Array.put(Head.v,i)ݣHead.incTail.v=Tail.vTailķװ
(6)Array.put(Head.v,i)Head.inc(Head.v-Tail.v)=
Array.put(Head.v,i)ݣHead.incHead.v-
Array.put(Head.v,i)ݣHead.incTail.v=,-ϸ
(7)Array.put(Head.v,i)Head.inc(Head.v-Tail.v)=
(Head.v-Tail.v)+1 (3),(4),(6),滻
һ,ǿԺһЩʵϸ,ܶʵǡǡ.Ϊ,ڶݷװ,ǿɶԾΪ,ʹֻӦ,ҲԿһַװ,У
i10Head.inciput(i)
i11Tail.inciget(i)
i12Array.put(k,i)put(i)
i13Array.get(k,i)put(i)
ɴ,ǿԵõһЩ,
tx1aArray.v(p)=Array.v(p)modsize(p-Head.v)=0.
֤
(1) Array.put(k,i)Array.put(Head.v,i)i4,i12
(2) Array.get(k,i)modsize(k-Head.v)=0(1),Array.a3
(3) aArray.v(p)=Array.v(p)(Array.put(q,i)modsize(p-q)=0)Arrayķװ
(4) aArray.v(p)=Array.v(p)modsize(p-Head.v)=0(1),(2),(3),(prep)
(1),(2),κʱ̶ĸֵֻArray.put(Head.v),modsize(Head.v)ԪԱ޸,ĸֵ(hide).,i12ArrayķװԿɵã
tx2ۦArray.v(p)=Array.v(p)put(i)
Ƶ,ָķװ,У
aHead.v=Head.vHead.inc
aTail.v=Head.vTail.inc.
ǿԵõ
tx3aHead.v=Head.vput(i)
tx4aTail.v=Head.vget(i)
Ҳ˵,ִput/get,Head.v/Tail.vֲ.
,֤b1֤ʵеķ룺
put(i)(Head.v-Tail.v)=(Head.v-tail.v)+1.
(1) put(i)(Head.v-Tail.v)=put(i)Head.v-put(i)Tail.vϸ
(2) Head.incHead.v=Head.v+1Head.p1
(3) put(i)Head.v=Head.v+1i10
(4) put(i)Tail.v=Tail.vtx4
(5) put(i)(Head.v-Tail.v)=(Head.v-Tail.v)+1(1),(2),(4),滻
ƿ֤.
4 
ڶģ,󱻶ΪװԺΪʵ,Ǿ̬ṹͶ̬Ϊл.̬̻˶֮Ĺϵ,̬ṹ֮ĹϵͶ̬Ϊ֮Ĺϵ.󾫻ṩĴֱṹ.,Ƶÿһ,ϵͳɿһЩ̳ͨСۺϵȹ,ƵĵͲԽһЩ.󾫻Ҳǽڶķװ֮ϵ,ֻӦӦĶ,һֶװ.ܽһ½ṹϵͳص.
(1) ȿԷľ̬,ҲԷĶ̬.
(2) (requirement)͹淶(specification)һ.ԶģͶĹ淶ͬʹԼʽ/.
(3) ṹ.ʹöȿĹ(ˮƽṹ),Ҳľ(ֱṹ).
(4) ھʵֿ.ϵͳһϵͳ,״̬ǨΪԭԵĶ,ǻڹ̵÷ʽǻϢͷʽ,ҲϢͬ첽.
(5) ͳһľֲȫͬһ߼ϵͳ.ȿԷطֱ,ҲԷ໥,󷽷ľֲ/ֲϵͳȫ/ȫϵͳ,ΪǲȻΥԭ.
*оõȻѧ͹863߿ƼĿ.
ͨѶϵˣ, 100080,йѧԺоѧоʵ
߼飺,1965,ʿоԱ,ҪоΪ,,ֲ,Լ.
Ǯ,1966,ʿ,ҪоΪۺͼ,ֲ,ʽ.
,1971,ʿ,ҪоΪۺͼ,ֲ.
ߵλΣǮйѧԺоѧоʵ  100080
ΣǮйѧԺоġ100080
οף
1ݻ,Ǯ,߱.Trace.ѧ,1999,10(8):790799
(Huang Tao, Qian Jun, Ni Bin. Trace calculus. Journal of Software, 1999,10(8):790799)
2ݻ,Ǯ,ܻ.I.ѧ,1999,10(9):931940
(Huang Tao, Qian Jun, Zhou Huan. Object calculus . Journal of Software, 1999,10(9):931940)
3Goguen J A, Burstall R M. Introducing institutions. In: Clarke E, Kozen D eds. Proceedings of the Logic of Programming. LNCS164, Berlin: Springer-Verlag, 1984
4ݻ.ʽо۲ʿѧλģ.Ϸ:йƼѧ,1994
(Huang Tao. Theoretical research on object formal semantics Ph.D. Thesis. Hefei: University of Science and Technology of China, 1994)
ոڣ1997-12-12޸ڣ1998-09-04
