Presentation on theme: "nearly Formal Methods Automatic Validation and Verification Tools"— Presentation transcript:
1 nearlyFormal MethodsAutomatic Validation and Verification ToolsKim Guldstrand LarsenInstitute of Computer ScienceAalborg UniversityFormal Methods seems to be finding its way into industrial software engineering practice. In particular, methods based on fully automatic verification tools have for a long time been established practice for hardware designs.Today, an increasing number of (commercial) tools offering automatic verification support for industrial designs of embedded systems, real-time systems, and communication protocols are emerging.The scalability of these tools has been significantly improved due to recent, scientific advances in the underlying algorithmic techniques, which have allowed for large industrial applications to be verified.The talk will present the tool UPPAAL, a tool suite for validating and verifying real-time system models. The tool has been developed since 1995 in collaboration between Aalborg and Uppsala Universities. The presentation will be based on on-line demonstration and survey the industrial applications of UPPAAL.The final part of the talk will address the tool visualSTATE, a commercial tool for automatic validation and verification of embedded system models In addition visualSTATE allows for automatic generation of efficient code for a number of platforms. Resent collaboration between visualSTATE, and DTU has resulted in truely significant advances in the size of systems which may be dealt with.Hybrid Systems from timed automata to hybrid systems – and back Kim Guldstrand Larsen Paul Pettersson Mogens Nielsen
11 Symbolic Analysis Polyhedra TThe explorationmay lead to generationof infinitely many polyhedra=>No guarantee of terminationHManipulation of polyhedra inefficient!
12 TA’s versus LHA’s TOOLS Decidable Efficient Datastructure UPPAAL, KRONOS,CMC,...DecidableEfficient DatastructureDBM’s, NDD’s, CDD’s, ..ExpressivenessTOOLSHYTECH, POLLUX,..UndecidabilityDatastructuresPlyhedraExpressivenessSTOPWATCH AUTOMATAx’==0 or x’==1
13 STOPWATCH AUTOMATA Extension of UPPAAL to SWA Cassez, Larsen, CONCUR’00Extension of UPPAAL to SWAReuse of efficient datastructuresOverapproximationEvery LHA may be translated into a SWAAPPLICATIONSSchedulerGasburnerWater Level Control