Muutke küpsiste eelistusi

E-raamat: FM 2014: Formal Methods: 19th International Symposium, Singapore, May 12-16, 2014. Proceedings

Edited by , Edited by , Edited by
  • Formaat - PDF+DRM
  • Hind: 110,53 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

This book constitutes the refereed proceedings of the 19th International Symposium on Formal Methods, FM 2014, held in Singapore, May 2014. The 45 papers presented together with 3 invited talks were carefully reviewed and selected from 150 submissions. The focus of the papers is on the following topics: Interdisciplinary Formal Methods, Practical Applications of Formal Methods in Industrial and Research Settings, Experimental Validation of Tools and Methods as well as Construction and Evolution of Formal Methods Tools.
Validity Checking of Put back Transformations in Bidirectional
Programming.- Proof Engineering Considered Essential.- Engineering UToPiA:
Formal Semantics for CML.- 40 Years of Formal Methods: Some Obstacles and
Some Possibilities?.- A Refinement Based Strategy for Local Deadlock Analysis
of Networks of CSP Processes.- Algebraic Principles for Rely-Guarantee Style
Concurrency Verification Tools.- Definition, Semantics and Analysis of Multi
rate Synchronous AADL.- Trust Found: Towards a Formal Foundation for Model
Checking Trusted Computing Platforms.- The VerCors Tool for Verification of
Concurrent Programs.- Knowledge-Based Automated Repair of Authentication
Protocols.- A Simplified Z Semantics for Presentation Interaction Models.-
Log Analysis for Data Protection Accountability.- Automatic Compositional
Synthesis of Distributed Systems.- Automated Real Proving in PVS via
MetiTarski.- Quiescent Consistency: Defining and Verifying Relaxed
Linearizability.- Temporal Precedence Checking for Switched Models and Its
Application to a Parallel Landing Protocol.- Contracts in Practice.- When
Equivalence and Bisimulation Join Forces in Probabilistic Automata.- Precise
Predictive Analysis for Discovering Communication Deadlocks in MPI Programs.-
Proof Patterns for Formal Methods.- Efficient Runtime Monitoring with Metric
Temporal Logic: A Case Study in the Android Operating System.- IscasMc: A
Web-Based Probabilistic Model Checker.- Invariants, Well-Founded Statements
and Real-Time Program Algebra.- Checking Liveness Properties of Presburger
Counter Systems Using Reachability Analysis.- A Symbolic Algorithm for the
Analysis of Robust Timed Automata.- Revisiting Compatibility of Input-Output
Modal Transition Systems.- Co-induction Simply: Automatic Co-inductive Proofs
in a Program Verifier.- Management of Time Requirements in Component-Based
Systems.- Compositional Synthesis of Concurrent Systems through Causal Model
Checking and Learning.- Formal Verification of Operational Transformation.-
Verification of a Transactional Memory Manager under Hardware Failures and
Restarts.- SCJ: Memory-Safety Checking without Annotations.- Refactoring,
Refinement and Reasoning: A Logical Characterization for Hybrid Systems.-
Object Propositions.- Flexible Invariants through Semantic Collaboration.-
Efficient Tight Field Bounds Computation Based on Shape Predicates.- A
Graph-Based Transformation Reduction to Reach UPPAAL States Faster.-
Computing Quadratic Invariants with Min- and Max-Policy Iterations: A
Practical Comparison.- Efficient Self-composition for Weakest Precondition
Calculi.- Towards a Formal Analysis of Information Leakage for Signature
Attacks in Preferential Elections.- Analyzing Clinical Practice Guidelines
Using a Decidable Metric Interval-Based Temporal Logic.- A Modular Theory of
Object Orientation in Higher-Order UTP.- Formalizing and Verifying a Modern
Build Language.- The Wireless Fire Alarm System: Ensuring Conformance to
Industrial Standards through Formal Verification.- Formally Verifying
Graphics FPU: An Intel® Experience.- MDP-Based Reliability Analysis of an
Ambient Assisted Living System.- Diagnosing Industrial Business Processes:
Early Experiences.- Formal Verification of Lunar Rover Control Software Using
UPPAAL.- Formal Verification of a Descent Guidance Control Program of a Lunar
Lander.