| 000 | 04746nam a22005895i 4500 | ||
|---|---|---|---|
| 001 | 978-3-319-11737-9 | ||
| 003 | DE-He213 | ||
| 005 | 20200421112542.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 141015s2014 gw | s |||| 0|eng d | ||
| 020 |
_a9783319117379 _9978-3-319-11737-9 |
||
| 024 | 7 |
_a10.1007/978-3-319-11737-9 _2doi |
|
| 050 | 4 | _aQA76.758 | |
| 072 | 7 |
_aUMZ _2bicssc |
|
| 072 | 7 |
_aCOM051230 _2bisacsh |
|
| 082 | 0 | 4 |
_a005.1 _223 |
| 245 | 1 | 0 |
_aFormal Methods and Software Engineering _h[electronic resource] : _b16th International Conference on Formal Engineering Methods, ICFEM 2014, Luxembourg, Luxembourg, November 3-5, 2014. Proceedings / _cedited by Stephan Merz, Jun Pang. |
| 264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2014. |
|
| 300 |
_aXVIII, 460 p. 125 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 ; _v8829 |
|
| 505 | 0 | _aApproximations for Stochastic Graph Rewriting -- Computing Maximal Bisimulations -- Improving the Model Checking of Strategies under Partial Observability and Fairness Constraints -- A Formal Model for Natural-Language Timed Requirements of Reactive Systems -- A Hybrid Model of Connectors in Cyber-Physical Systems -- A Language-Independent Proof System for Mutual Program Equivalence -- PHASE: A Stochastic Formalism for Phase-Type Distributions -- CASSANDRA: An Online Failure Prediction Strategy for Dynamically Evolving Systems -- Modal Characterisations of Probabilistic and Fuzzy Bisimulations -- Pointer Program Derivation Using Coq: Graphs and Schorr-Waite Algorithm -- An LTL Model Checking Approach for Biological Parameter Inference -- SCC-Based Improved Reachability Analysis for Markov Decision Processes -- Comprehension of Spacecraft Telemetry Using Hierarchical Specifications of Behavior -- Timed Automata Verification via IC3 with Zones -- GRL: A Specification Language for Globally Asynchronous Locally Synchronous Systems -- A Formal Framework to Prove the Correctness of Model Driven Engineering Composition Operators -- A Formula-Based Approach for Automatic Fault Localization of Imperative Programs -- A Resource-Based Logic for Termination and Non-termination Proofs -- Practical Analysis Framework for Software-Based Attestation Scheme -- TAuth: Verifying Timed Security Protocols -- On the Formal Analysis of HMM Using Theorem Proving -- Formal Modeling and Analysis of Cassandra in Maude -- Bounded Model Checking High Level Petri Nets in PIPE+Verifier -- Fast Translation from LTL to B�uchi Automata via Non-transition-Based Automata -- Complete Model-Based Equivalence Class Testing for the ETCS Ceiling Speed Monitor -- Contract-Based Verification of MATLAB and Simulink Matrix-Manipulating Code -- GPU Accelerated Counterexample Generation in LTL Model Checking -- Formal Throughput and Response Time Analysis of MARTE Models -- Extending MSVL with Function Calls. | |
| 520 | _aThis book constitutes the refereed proceedings of the 16th International Conference on Formal Engineering Methods, ICFEM 2014, held in Luxembourg, Luxembourg, in November 2014. The 28 revised full papers presented were carefully reviewed and selected from 73 submissions. The papers cover a wide range of topics in the area of formal methods and software engineering and are devoted to advancing the state of the art of applying formal methods in practice. They focus in particular on combinations of conceptual and methodological aspects with their formal foundation and tool support. | ||
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aComputer communication systems. | |
| 650 | 0 | _aComputer programming. | |
| 650 | 0 | _aSoftware engineering. | |
| 650 | 0 | _aProgramming languages (Electronic computers). | |
| 650 | 0 | _aAlgorithms. | |
| 650 | 0 | _aMathematical logic. | |
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aSoftware Engineering. |
| 650 | 2 | 4 | _aProgramming Techniques. |
| 650 | 2 | 4 | _aProgramming Languages, Compilers, Interpreters. |
| 650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
| 650 | 2 | 4 | _aMathematical Logic and Formal Languages. |
| 650 | 2 | 4 | _aComputer Communication Networks. |
| 700 | 1 |
_aMerz, Stephan. _eeditor. |
|
| 700 | 1 |
_aPang, Jun. _eeditor. |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783319117362 |
| 830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v8829 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-319-11737-9 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-LNC | ||
| 942 | _cEBK | ||
| 999 |
_c58362 _d58362 |
||