|
|
|
|
LEADER |
05213nam a22005775i 4500 |
001 |
978-3-642-34281-3 |
003 |
DE-He213 |
005 |
20151103123337.0 |
007 |
cr nn 008mamaa |
008 |
121029s2012 gw | s |||| 0|eng d |
020 |
|
|
|a 9783642342813
|9 978-3-642-34281-3
|
024 |
7 |
|
|a 10.1007/978-3-642-34281-3
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a QA76.758
|
072 |
|
7 |
|a UMZ
|2 bicssc
|
072 |
|
7 |
|a COM051230
|2 bisacsh
|
082 |
0 |
4 |
|a 005.1
|2 23
|
245 |
1 |
0 |
|a Formal Methods and Software Engineering
|h [electronic resource] :
|b 14th International Conference on Formal Engineering Methods, ICFEM 2012, Kyoto, Japan, November 12-16, 2012. Proceedings /
|c edited by Toshiaki Aoki, Kenji Taguchi.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2012.
|
300 |
|
|
|a XIV, 512 p. 131 illus.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 7635
|
505 |
0 |
|
|a Toward Practical Application of Formal Methods in Software Lifecycle Processes -- Formal Methods in the Aerospace Industry: Follow the Money -- Applying Term Rewriting to Speech Recognition of Numbers -- Variable Permissions for Concurrency Verification -- A Concurrent Temporal Programming Model with Atomic Blocks -- A Composable Mixed Mode Concurrency Control Semantics for Transactional Programs -- Towards a Formal Verification Methodology for Collective Robotic Systems -- Modeling Resource-Aware Virtualized Applications for the Cloud in Real-Time ABS -- Specification and Model Checking of the Chandy and Lamport Distributed Snapshot Algorithm in Rewriting Logic -- Quantitative Program Dependence Graphs -- Quantitative Analysis of Information Flow Using Theorem Proving -- Modeling and Verification of Probabilistic Actor Systems Using pRebeca -- Modular Verification of OO Programs with Interfaces -- Separation Predicates: A Taste of Separation Logic in First-Order Logic -- The Confinement Problem in the Presence of Faults -- Verification of ATL Transformations Using Transformation Models and Model Finders -- Automatic Generation of Provably Correct Embedded Systems -- Complementary Methodologies for Developing Hybrid Systems with Event-B -- A Temporal Logic with Mean-Payoff Constraints -- Time Constraints with Temporal Logic Programming -- Stepwise Satisfiability Checking Procedure for Reactive System Specifications by Tableau Method and Proof System -- Equational Abstraction Refinement for Certified Tree Regular Model Checking -- SMT-Based False Positive Elimination in Static Program Analysis -- Predicate Analysis with Block-Abstraction Memoization -- Heuristic-Guided Abstraction Refinement for Concurrent Systems -- More Anti-chain Based Refinement Checking -- An Analytical and Experimental Comparison of CSP Extensions and Tools -- Symbolic Model-Checking of Stateful Timed CSP Using BDD and Digitization -- Annotations for Alloy: Automated Incremental Analysis Using Domain Specific Solvers -- State Space c-Reductions of Concurrent Systems in Rewriting Logic -- A Practical Loop Invariant Generation Approach Based on Random Testing, Constraint Solving and Verification -- ConSMutate: SQL Mutants for Guiding Concolic Testing of Database Applications -- Demonic Testing of Concurrent Programs -- Towards Certified Runtime Verification.
|
520 |
|
|
|a This book constitutes the refereed proceedings of the 14th International Conference on Formal Engineering Methods, ICFEM 2012, held in Kyoto, Japan, November 2012. The 31 revised full papers together with 3 invited talks presented were carefully reviewed and selected from 85 submissions. The papers address all current issues in formal methods and their applications in software engineering. They are organized in topical sections on concurrency, applications of formal methods to new areas, quantity and probability, formal verification, modeling and development methodology, temporal logics, abstraction and refinement, tools, as well as testing and runtime verification.
|
650 |
|
0 |
|a Computer science.
|
650 |
|
0 |
|a Computer communication systems.
|
650 |
|
0 |
|a Computer programming.
|
650 |
|
0 |
|a Software engineering.
|
650 |
|
0 |
|a Programming languages (Electronic computers).
|
650 |
|
0 |
|a Algorithms.
|
650 |
|
0 |
|a Mathematical logic.
|
650 |
1 |
4 |
|a Computer Science.
|
650 |
2 |
4 |
|a Software Engineering.
|
650 |
2 |
4 |
|a Programming Techniques.
|
650 |
2 |
4 |
|a Programming Languages, Compilers, Interpreters.
|
650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
650 |
2 |
4 |
|a Computer Communication Networks.
|
700 |
1 |
|
|a Aoki, Toshiaki.
|e editor.
|
700 |
1 |
|
|a Taguchi, Kenji.
|e editor.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783642342806
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 7635
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-34281-3
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
950 |
|
|
|a Computer Science (Springer-11645)
|