000 | 03385nam a22005415i 4500 | ||
---|---|---|---|
001 | 978-3-642-40213-5 | ||
003 | DE-He213 | ||
005 | 20200420220214.0 | ||
007 | cr nn 008mamaa | ||
008 | 130829s2013 gw | s |||| 0|eng d | ||
020 |
_a9783642402135 _9978-3-642-40213-5 |
||
024 | 7 |
_a10.1007/978-3-642-40213-5 _2doi |
|
050 | 4 | _aQA76.9.L63 | |
050 | 4 | _aQA76.5913 | |
050 | 4 | _aQA76.63 | |
072 | 7 |
_aUM _2bicssc |
|
072 | 7 |
_aUYF _2bicssc |
|
072 | 7 |
_aCOM051000 _2bisacsh |
|
072 | 7 |
_aCOM036000 _2bisacsh |
|
082 | 0 | 4 |
_a005.1015113 _223 |
245 | 1 | 0 |
_aFundamentals of Software Engineering _h[electronic resource] : _b5th International Conference, FSEN 2013, Tehran, Iran, April 24-26, 2013, Revised Selected Papers / _cedited by Farhad Arbab, Marjan Sirjani. |
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2013. |
|
300 |
_aXIX, 283 p. 85 illus. _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 ; _v8161 |
|
505 | 0 | _aUnbounded Allocation in Bounded Heaps -- On the Complexity of Adding Convergence -- Deadlock Checking by Data Race Detection -- Delta Modeling and Model Checking of Product Families -- Lending Petri Nets and Contracts -- On Efficiency Preorders -- Compiling Cooperative Task Management to Continuations -- Extending UPPAAL for the Modeling and Verification of Dynamic Real-Time Systems -- Efficient Operational Semantics for EB3 for Verification of Temporal Properties -- Interval Soundness of Resource-Constrained Workflow Nets: Decidability and Repair -- Statistical Model Checking of a Clock Synchronization Protocol for Sensor Networks -- A New Representation of Two-Dimensional Patterns and Applications to Interactive Programming -- Push-Down Automata with Gap-Order Constraints -- Model Checking MANETs with Arbitrary Mobility -- Validating SCTP Simultaneous Open Procedure -- Improving Time Bounded Reachability Computations in Interactive Markov Chains -- Checking Compatibility of Web Services Behaviorally. | |
520 | _aThis book constitutes the proceedings of the 5th IPM International Conference on Fundamentals of Software Engineering, FSEN 2013, held in Tehran, Iran, in April 2013. The 17 full papers presented in this volume were carefully reviewed and selected from 65 submissions. The topics of interest in FSEN span over all aspects of formal methods, especially those related to advancing the application of formal methods in software industry and promoting their integration with practical engineering techniques. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aSoftware engineering. | |
650 | 0 | _aComputer logic. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aLogics and Meanings of Programs. |
650 | 2 | 4 | _aSoftware Engineering. |
700 | 1 |
_aArbab, Farhad. _eeditor. |
|
700 | 1 |
_aSirjani, Marjan. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783642402128 |
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v8161 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-642-40213-5 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-LNC | ||
942 | _cEBK | ||
999 |
_c51488 _d51488 |