Mathematical and Engineering Methods in Computer Science

Name: Mathematical and Engineering Methods in Computer Science | 7th International Doctoral Workshop, MEMICS 2011, Lednice, Czech Republic, October 14-16, 2011, Revised Selected Papers
Brand: Springer
Price: 53.49 EUR
Availability: OnlineOnly

7th International Doctoral Workshop, MEMICS 2011, Lednice, Czech Republic, October 14-16, 2011, Revised Selected Papers

Zdenek Kotásek Jan Bouda Ivana Cerná Lukas Sekanina Tomas Vojnar David Antos(Herausgeber*in)

Springer (Verlag)

Erschienen am 28. Januar 2012

XII, 215 Seiten

E-Book

PDF mit Wasserzeichen-DRM

Systemvoraussetzungen

978-3-642-25929-6 (ISBN)

53,49 €inkl. 7% MwSt.

Systemvoraussetzungen

für PDF mit Wasserzeichen-DRM

E-Book Einzellizenz

Als Download verfügbar

Beschreibung

Weitere Details

Weitere Ausgaben

Inhalt

Title
Preface
Organization
Table of Contents
Rigorous System Design: The BIP Approach
System Design
The BIP Design Flow
The BIP Language
Translating Application Software into BIP
Compositional Verification by Using D-Finder
Integrating Architectural Constraints in BIP
Generating Distributed Implementations
Case Studies
MJPEG Decoder
Heterogeneous Communication System
Discussion and Future Work
References
Natural Born Computing
Introduction
Origins
Embodied Computation
Physical Information
Systemic Computation
Summary
References
Games and Markov Decision Processes with Mean-Payoff Parity and Energy Parity Objectives
Introduction
Definitions
Games
Games with Parity, Mean-Payoff, and Energy Objectives
Games with Mean-Payoff Parity and Energy Parity Objectives
Markov Decision Process
MDPs with Parity, Mean-Payoff and Energy Objectives
MDPs with Mean-Payoff Parity and Energy Parity Objectives
New Result: Improved Algorithm for Mean-Payoff Parity Objectives
Conclusion
References
Assessing System Vulnerability Using Formal Verification Techniques
Introduction
Basics
Representation of Circuits and Systems
Faults and Errors
Fault Tolerance and Reliability
Assessing Vulnerability
General Model
Existing Approaches
Potential Pitfalls
Conclusions
References
Information Security in a Quantum World
Introduction
Limitations of Classical Information Theory
An Example: The Bounded Storage Model
Conclusions
References
Computer Memory: Why We Should Care What Is under the Hood
Introduction
Motivating Examples
Hardware Features
Caches: Not Just Size
Bandwidth: Far From Peak
Prefetching: Do Be Linear
Ordering: Hard to Get Right
Coherency: Not for Heavy Use
Controllers: No Longer Uniform
Software Techniques
References
Frequency Prediction of Functions
Introduction
Results
References
Timed Automata Approach to Verification of Systems with Degradation
Introduction
Preliminaries
Verification of Systems with Degradation
Modeling Systems with Degradation
Temporal Logic for Systems with Degradation
DLTL Model Checking
DLTL Viewed as a Probabilistic Logic
Conclusions and Future Work
References
Basic Operations on Binary Suffix-Free Languages
Introduction
Suffix-Free Languages and Suffix-Free Automata
Basic Operations on Binary Suffix-Free Languages
Conclusions
References
Efficient Data Representation of Large Job Schedules
Introduction
Problem Description
Data Representation of the Schedule
UpdateSchedule Procedure
Complexity of the UpdateSchedule Procedure
Experimental Evaluation
Conclusion
References
Prefix-Free Regular Languages: Closure Properties, Difference, and Left Quotient
Introduction
Preliminaries
Closure Properties
State Complexity of Difference
State Complexity of Left Quotient
Conclusions
References
Noise Injection Heuristics for Concurrency Testing
Introduction
Existing Noise Injection Heuristics
A New Coverage-Based Noise Injection Heuristics
A Comparison of Noise Injection Techniques
A Comparison of ConTest's Noise Seeding Settings
A Comparison of Heuristics for Determining Where to Generate Noise
Conclusions
References
Low GPU Occupancy Approach to Fast Arithmetic Coding in JPEG2000
Introduction
Arithmetic Coding in JPEG2000
Accelerating MQ-Coder Using GPU
MQ-Coder Concurrency and Speedup Techniques
Low GPU Occupancy Approach
Experimental Results and Discussion
Conclusion and Future Work
References
Using Dimensionality Reduction Method for Binary Data to Questionnaire Analysis
Introduction
Dimensionality Reduction Methods for Binary Data
The Model
Data
Questionnaire Analysis
Conclusion
References
Generalized Maneuvers in Route Planning
Introduction
Maneuvers: Basic Terms
Strongly Connected Road Network
Route Planning Queries
M-Dijkstra's Algorithm
Processing Negative Maneuvers
Correctness and Complexity Analysis
Conclusion
References
STANSE: Bug-Finding Framework for C Programs
Introduction
Framework Functionality
Configuration
Parsing Source Files
Program Internal Representation
Pointer Analysis in Stanse
Matching Language Constructs
Traversing Internal Representation
Support for Function Summaries
The Concept of Checkers
Processing Errors
Checkers
Results on the Linux Kernel
Important Bugs Found by Stanse
Conclusions and Future Work
References
Introducing the FPGA-Based Hardware Architecture of Systemic Computation (HAoS)
Introduction
Systemic Computation
Overview
Prior SC Implementations
The Proposed SC Hardware Architecture
The SC Architecture
The Control Unit
The SC Core
Testing and Evaluation
Conclusion
References
A Parallel Compact Hash Table
Introduction
Background
Bidirectional Linear Probing
A Compact Hash Table Using the Cleary Algorithm
Related Work on Parallel Hash Tables
Dynamic Region-Based Locking
Parallel FIND-OR-PUT Algorithm
Complexity and Scalability
Proof of Correctness
Experiments
Discussion and Conclusions
References
Four Authorization Protocols for an Electronic Payment System
Motivation and Setting
The Original Payment System
Motivation for Payment Authorization
Basic Requirements
Payment Authorization Protocols
Protocol 1: A Trusted PINpad
Protocol 2: Customer Token Not Involved
Protocol 3: Pre-distributed PINs
Protocol 4: On-Demand PIN List Delivery
Conclusions
References
Author Index

Systemvoraussetzungen

Als PDF speichern Als Link merken