LEADER 01093nam0-22003851i-450-
001 990008285450403321
005 20130513161932.0
010   $a88-386-6218-5
035   $a000828545
035   $aFED01000828545
035   $a(Aleph)000828545FED01
035   $a000828545
100   $a20060301d2005----km-y0itay50------ba
101 0 $aita
102   $aIT
105   $aa---a---001yy
200 1 $aInformatica di base$fDennis P. Curtin...[et al.]$gFabio Ciotti (cur. ed. ita.)
205   $a3. ed.
210   $aMilano$cMcGraw-Hill$dc2005
215   $axi, 283 p.$cill. (col.)$d25 cm$ecd-rom
225 1 $aCollana di istruzione scientifica$iSerie di informatica
610 0 $aInformatica
610 0 $aArchitettura del computer
610 0 $aReti di elaboratori
676   $a004
700  1$aCurtin,$bDennis P.$0117790
801  0$aIT$bUNINA$gRICA$2UNIMARC
901   $aBK
912   $a990008285450403321
952   $a10 C 330$bdono$fDINEL
952   $a004-CUR-1$b4412$fSC1
959   $aSC1
959   $aDINEL
996   $aInformatica di base$980136
997   $aUNINA

LEADER 01098nam--2200349---450-
001 990000350760203316
035   $a0035076
035   $aUSA010035076
035   $a(ALEPH)000035076USA01
035   $a0035076
100   $a20010307d1982----km-y0itay0103----ba
101   $aeng
102   $aDE
105   $a||||||||001yy
200 1 $aVerifing concurrent processes using temporal logic$fBrent T. Hailpern
210   $aBerlin$cSpringer Verlag$d1982
215   $aVIII, 208 p.$cgraf.$d24 cm
225 2 $aLecture notes in computer science$v129
410   $12001$aLecture notes in computer science$v129
676   $a001.642
700  1$aHAILPERN,$bBrent T.$0537323
801  0$aIT$bsalbc$gISBD
912   $a990000350760203316
951   $a001 LNCS 129$b0002816 CBS$c001$d00101515
959   $aBK
969   $aSCI
979   $aTAMI$b40$c20010307$lUSA01$h1055
979   $aALANDI$b90$c20010319$lUSA01$h1142
979   $c20020403$lUSA01$h1643
979   $aPATRY$b90$c20040406$lUSA01$h1624
996   $aVerifing concurrent processes using temporal logic$9878442
997   $aUNISA