简介:INTERFERENCECHECKINGINCOMPUTER-AIDEDPLANTDESIGNSYSTEMWangFengZhaoHongNiuJunyuAbstractInthispaper,theinterferencecheckingofthr...
简介:ItisprovedinthispaperthatcheckingatimedautomatonMwithrespecttoalineardurationpropertyDcanbedonebyinvestigatingonlytheintegraltimedstatesofM,Anequivalencerelationisintroducedinthispapertodividetheinfinitenumberofintegraltimedstatesintofinitenumberofequivalenceclasses.Basedonthis,amethodisproposedforcheckingwhetherMsatisfiesD.Insomecases,thenumberofequivalenceclassesistoolargeforacomputertomainpulate,Atechniqueforreducingthesearch-spaceforcheckinglineardurationpropoertyisalsodescribed.Thistechniqueismoresuitableforthecaseinthispaperthanthoseintheliteraturebecausemostofthosetechniquesaredesignedforreachablilityanalysis.
简介:TheDepUty(dependenciesutility)canbeclassifiedasaprojectandprocessmanagementtool.ThemaingoalofDepUtyistoassistbymeansofsourcecodeanalysisandgraphicalrepresentationusingUML,inunderstandingdependenciesofsub-systemsandpackagesinCMSobjectOrientedsoftware,tounderstandarchitecturealstructure,andtoschedulecodereleaseinmodularisedintegration.Italsoallowsanew-comertomoreeasilyunderstandtheglobalstructure,ofCMSsoftware,andtovoidcirculardependenciesup-frontorre-factorthecode,incaseitwasalreadytooclosetotheedgeofnon-maintainability.WewilldiscussthevariousviewsDepUtyprovidestoanalysepackagedependenciesandillustrateboththemetricsandstylecheckingfacilitiesitprovides.
简介:SAT-basedboundedmodelchecking(BMC)hasbeenintroducedasacomplementarytechniquetoBDD-basedsymbolicmodelcheckinginrecentyears,andalotofsuccessfulworkhasbeendoneinthisdirection.TheapproachwasfirstintroducedbyA.Biereetal.incheckinglineartemporallogic(LTL)formulaeandthenalsoadaptedtocheckformulaeoftheuniversalfragmentofcomputationtreelogic(ACTL)byW.Penczeketal.Astheefficiencyofmodelcheckingisstillanimportantissue,wepresentanimprovedBMCapproachforACTLbasedonPenczek'smethod.Weconsidertwoaspectsoftheapproach.Oneisreductionofthenumberofvariablesandtransitionsinthek-modelbydistinguishingthetemporaloperatorEXfromtheothers.Theotherissimplificationofthetransformationofformulaebyusinguniformpathencodinginsteadofadisjunctionofallpathsneededinthek-model.Withtheseimprovements,foranACTLformula,thelengthofthefinalencodingoftheformulaintheworstcaseisreduced.TheimprovedapproachisimplementedinthetoolBMVandiscomparedwiththeoriginalonebyapplyingbothtotwowellknownexamples,mutualexclusionanddiningphilosophers.Thecomparisonshowstheadvantagesoftheimprovedapproachwithrespecttotheefficiencyofmodelchecking.
简介:
简介:Inthispaper,aschemeofcombiningmodelcheckingandtheoremprovingtechniquestoverifyhightrustworthyembeddedsoftwareisproposed.Thesoftwaremodeldescribedinstatemachineofunifiedmodellanguageistransformedintotheinputmodelinglanguageofamodelcheckerinwhichthemodelisanalyzedwithassociatedpropertyspecificationsexpressedintemporallogic.Thesoftwaremodelwhichhasbeenverifiedbymodelcheckeristhentransformedintoabstractspecificationsofatheoremprover,inwhichthemodelwillberefined,verifiedandtranslatedintosourceCcode.Thetransformationrulesfromstatemachinetoinputlanguageofmodelcheckerandabstractspecificationsoftheoremproveraregiven.Theexperimentshowsthattheproposedschemecaneffectivelyimprovethedevelopmentandverificationofhightrustworthyembeddedsoftware.