000 04122nam a22005055i 4500
001 978-3-540-68519-7
003 DE-He213
005 20160624102050.0
007 cr nn 008mamaa
008 121227s1997 gw | s |||| 0|eng d
020 _a9783540685197
_9978-3-540-68519-7
024 7 _a10.1007/BFb0035375
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aCOM051230
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aTools and Algorithms for the Construction and Analysis of Systems
_h[electronic resource] :
_bThird International Workshop, TACAS'97 Enschede, The Netherlands, April 2–4, 1997 Proceedings /
_cedited by Ed Brinksma.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1997.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1997.
300 _aX, 437 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v1217
505 0 _aHardware and software synthesis, optimization, and verification from Esterel programs -- Manipulation algorithms for K*BMDs -- Combining partial order and symmetry reductions -- Partial model checking with ROBDDs -- Space efficient reachability analysis through use of pseudo-root states -- The reference component of PEP -- A tool to support formal reasoning about computer languages -- The term processor generator Kimwitu -- Graphs in MetaFrame: The unifying power of polymorphism -- A tableau system for linear-TIME temporal logic -- Model-checking for a subclass of event structures -- Real-time logics: Fictitious clock as an abstraction of dense time -- Mosel: A flexible toolset for monadic second-order logic -- A brief introduction to coloured Petri Nets -- Design/CPN — A computer tool for Coloured Petri Nets -- Formal verification of statecharts with instantaneous chain reactions -- Compositional state space generation from Lotos programs -- Syntactic detection of process divergence and non-local choice in message sequence charts -- An automata based verification environment for mobile processes -- Compositional performance analysis -- Incremental development of deadlock-free communicating systems -- Automatic synthesis of specifications from the dynamic observation of reactive programs -- Visual verification of reactive systems -- Theorem prover support for the refinement of stream processing functions -- Integration in PVS: Tables, types, and model checking -- Test generation for intelligent networks using model checking -- Mechanically verified self-stabilizing hierarchical algorithms -- The bounded retransmission protocol must be on time!.
520 _aThis book constitutes the refereed proceedings of the Third International Workshop on Tools and Algorithms for the Construction and Analysis of Systems, TACAS '97, held in Enschede, The Netherlands, in April 1997. The book presents 20 revised full papers and 5 tool demonstrations carefully selected out of 54 submissions; also included are two extended abstracts and a full paper corresponding to invited talks. The papers are organized in topical sections on space reduction techniques, tool demonstrations, logical techniques, verification support, specification and analysis, and theorem proving, model checking and applications.
650 0 _aComputer science.
650 0 _aComputer Communication Networks.
650 0 _aSoftware engineering.
650 0 _aLogic design.
650 1 4 _aComputer Science.
650 2 4 _aSoftware Engineering.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aComputer Communication Networks.
700 1 _aBrinksma, Ed.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540627906
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v1217
856 4 0 _uhttp://dx.doi.org/10.1007/BFb0035375
942 _2EBK7018
_cEBK
999 _c36312
_d36312