000 | 04902nam a22005415i 4500 | ||
---|---|---|---|
001 | 978-3-319-33693-0 | ||
003 | DE-He213 | ||
005 | 20200421111159.0 | ||
007 | cr nn 008mamaa | ||
008 | 160523s2016 gw | s |||| 0|eng d | ||
020 |
_a9783319336930 _9978-3-319-33693-0 |
||
024 | 7 |
_a10.1007/978-3-319-33693-0 _2doi |
|
050 | 4 | _aQA76.758 | |
072 | 7 |
_aUMZ _2bicssc |
|
072 | 7 |
_aCOM051230 _2bisacsh |
|
082 | 0 | 4 |
_a005.1 _223 |
245 | 1 | 0 |
_aIntegrated Formal Methods _h[electronic resource] : _b12th International Conference, IFM 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings / _cedited by Erika �Abrah�am, Marieke Huisman. |
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2016. |
|
300 |
_aXIV, 538 p. 145 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 ; _v9681 |
|
505 | 0 | _aInvited Contributions -- Can Formal Methods Improve the Efficiency of Code Reviews.-Symbolic Computation and Automated Reasoning for Program Analysis -- Program verification -- On Type Checking Delta-Oriented Product Lines -- Verifying a priority scheduler for an SCJ runtime environment -- Why Just Boogie? Translating Between Intermediate Verification Languages -- Probabilistic systems -- Statistical Approximation of Optimal Schedulers for Probabilistic Timed Automata -- Probabilistic Formal Analysis of App Usage to Inform Redesign -- Extension of PRISM by Synthesis of Optimal Timeouts in Fixed-Delay CTMC -- Concurrency -- Monitoring Multi-threaded Component-Based Systems -- A Generalised Theory of Interface Automata, Component Compatibility and Error -- On Implementing a Monitor-Oriented Programming Framework for Actor Systems -- Towards a Thread-Local Proof Technique for Starvation Freedom -- Reasoning about Inheritance and Unrestricted Reuse in Object-Oriented Concurrent Systems -- A Formal Model of the Safety-Critical Java Level 2 Paradigm -- Safety and liveness -- Deciding Monadic Second Order Logic over omega-words by Specialized Finite Automata -- Property Preservation for Extension Patterns of State Transition Diagrams -- Symbolic Reachability Analysis of B through ProB and LTSmin -- Model learning -- Enhancing Automata Learning by Log-Based Metrics -- Refactoring of Legacy Software using Model Learning and Equivalence Checking: an Industrial Experience Report -- On Robust Malware Classifiers by Verifying Unwanted Behaviours -- SAT and SMT solving -- Efficient Deadlock-Freedom Checking using Local Analysis and SAT Solving -- SMT Solvers for Validation of B and Event-B models -- Avoiding Medication Conflicts for Patients with Multimorbidities -- Testing -- Temporal Random Testing for Spark Streaming -- Combining Static Analysis and Testing for Deadlock Detection -- Fuzzing JavaScript Engine APIs -- Theorem proving and constraint satisfaction -- A Component-based Approach to Hybrid Systems Safety Verification -- Verifying Pointer Programs using Separation Logic and Invariant Based Programming in Isabelle -- A Constraint Satisfaction Method for Configuring Non-Local Service Interfaces -- Case studies -- Rule-based Consistency Checking of Railway Infrastructure Designs -- Formal Verification of Safety PLC Based Control Software -- Enabling Static Driver Verifier using Microsoft Azure. | |
520 | _aThis book constitutes the refereed proceedings of the 12th International Conference on Integrated Formal Methods, IFM 2016, held in Reykjavik, Iceland, in June 2016. The 33 papers presented in this volume were carefully reviewed and selected from 99 submissions. They were organized in topical sections named: invited contributions; program verification; probabilistic systems; concurrency; safety and liveness; model learning; SAT and SMT solving; testing; theorem proving and constraint satisfaction; case studies. . | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aSoftware engineering. | |
650 | 0 | _aProgramming languages (Electronic computers). | |
650 | 0 | _aComputer logic. | |
650 | 0 | _aMathematical logic. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aSoftware Engineering. |
650 | 2 | 4 | _aLogics and Meanings of Programs. |
650 | 2 | 4 | _aProgramming Languages, Compilers, Interpreters. |
650 | 2 | 4 | _aMathematical Logic and Formal Languages. |
700 | 1 |
_a�Abrah�am, Erika. _eeditor. |
|
700 | 1 |
_aHuisman, Marieke. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783319336923 |
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v9681 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-319-33693-0 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-LNC | ||
942 | _cEBK | ||
999 |
_c53713 _d53713 |