close
1.

電子ブック
ＥＢ
1. Cooperative Bug Isolation
Ben Liblit, David Hutchison, Takeo Kanade, Association for Computing Machinery.
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2007
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Perfect, or Close Enough / 1.1：
Automatic Failure Reporting / 1.2：
The Next Step Forward / 1.3：
Cooperative Bug Isolation / 1.4：
Instrumentation Framework / 2：
Basic Instrumentation Strategy / 2.1：
Sampling the Bernoulli Way / 2.1.1：
From Blocks to Functions / 2.1.2：
Interprocedural Issues / 2.1.3：
Instrumentation Schemes for Distributed Debugging / 2.2：
Issues in Remote Sampling / 2.2.1：
Counter-Based Instrumentation Schemes / 2.2.2：
Additional Instrumentation Schemes / 2.2.3：
Performance and Optimizations / 2.3：
Static Branch Prediction / 2.3.1：
Weightless Functions / 2.3.2：
Empty and Singleton Regions / 2.3.3：
Local Countdown Caching / 2.3.4：
Random Countdown Generation / 2.3.5：
Path Balancing / 2.3.6：
Statically Selective Sampling / 2.3.7：
Optimization Recap / 2.3.8：
Adaptive Sampling / 2.4：
Nonuniformity Via Multiple Countdowns / 2.4.1：
Nonuniformity Via Non-Unit Site Weights / 2.4.2：
Policy Notes / 2.4.3：
Realistic Sampling Rates / 2.5：
Practical Considerations / 3：
Native Compiler Integration / 3.1：
Static Site Information / 3.1.1：
Libraries and Plugins / 3.2：
Threads / 3.3：
Next-Sample Countdown / 3.3.1：
Predicate Counters / 3.3.2：
Compilation Unit Registry and Report File / 3.3.3：
Time Stamp Clock / 3.3.4：
Performance Evaluation / 3.3.5：
Privacy and Security / 3.4：
User Interaction / 3.5：
Status of the Public Deployment / 3.6：
Resource Requirements / 3.6.1：
Reporting Trends / 3.6.2：
Techniques for Statistical Debugging / 4：
Notation and Terminology / 4.1：
Predicate Elimination / 4.2：
Instrumentation Strategy / 4.2.1：
Elimination Strategies / 4.2.2：
Data Collection and Analysis / 4.2.3：
Refinement over time / 4.2.4：
Performance Impact / 4.2.5：
Limitations and Insights / 4.2.6：
Regularized Logistic Regression / 4.3：
Crash Prediction Using Logistic Regression / 4.3.1：
Moss: A Multiple-Bug Challenge / 4.3.2：
Nonuniform Sampling / 4.4.1：
Analysis Results / 4.4.2：
Iterative Bug Isolation and Elimination / 4.5：
Increase Scores / 4.5.1：
Statistical Interpretation / 4.5.2：
Balancing Specificity and Sensitivity / 4.5.3：
Redundancy Elimination / 4.5.4：
Case Studies / 4.6：
Moss / 4.6.1：
CCRYPT / 4.6.2：
BC / 4.6.3：
EXIF / 4.6.4：
Rhythmbox / 4.6.5：
Related Work / 5：
Static Analysis / 5.1：
Profiling and Tracing / 5.2：
Dynamic Analysis / 5.3：
Conclusion / 6：
References
Introduction / 1：
Perfect, or Close Enough / 1.1：
Automatic Failure Reporting / 1.2：
2.

電子ブック
ＥＢ
2. Cooperative Bug Isolation
Ben Liblit, David Hutchison, Takeo Kanade, Association for Computing Machinery.
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2007
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Perfect, or Close Enough / 1.1：
Automatic Failure Reporting / 1.2：
The Next Step Forward / 1.3：
Cooperative Bug Isolation / 1.4：
Instrumentation Framework / 2：
Basic Instrumentation Strategy / 2.1：
Sampling the Bernoulli Way / 2.1.1：
From Blocks to Functions / 2.1.2：
Interprocedural Issues / 2.1.3：
Instrumentation Schemes for Distributed Debugging / 2.2：
Issues in Remote Sampling / 2.2.1：
Counter-Based Instrumentation Schemes / 2.2.2：
Additional Instrumentation Schemes / 2.2.3：
Performance and Optimizations / 2.3：
Static Branch Prediction / 2.3.1：
Weightless Functions / 2.3.2：
Empty and Singleton Regions / 2.3.3：
Local Countdown Caching / 2.3.4：
Random Countdown Generation / 2.3.5：
Path Balancing / 2.3.6：
Statically Selective Sampling / 2.3.7：
Optimization Recap / 2.3.8：
Adaptive Sampling / 2.4：
Nonuniformity Via Multiple Countdowns / 2.4.1：
Nonuniformity Via Non-Unit Site Weights / 2.4.2：
Policy Notes / 2.4.3：
Realistic Sampling Rates / 2.5：
Practical Considerations / 3：
Native Compiler Integration / 3.1：
Static Site Information / 3.1.1：
Libraries and Plugins / 3.2：
Threads / 3.3：
Next-Sample Countdown / 3.3.1：
Predicate Counters / 3.3.2：
Compilation Unit Registry and Report File / 3.3.3：
Time Stamp Clock / 3.3.4：
Performance Evaluation / 3.3.5：
Privacy and Security / 3.4：
User Interaction / 3.5：
Status of the Public Deployment / 3.6：
Resource Requirements / 3.6.1：
Reporting Trends / 3.6.2：
Techniques for Statistical Debugging / 4：
Notation and Terminology / 4.1：
Predicate Elimination / 4.2：
Instrumentation Strategy / 4.2.1：
Elimination Strategies / 4.2.2：
Data Collection and Analysis / 4.2.3：
Refinement over time / 4.2.4：
Performance Impact / 4.2.5：
Limitations and Insights / 4.2.6：
Regularized Logistic Regression / 4.3：
Crash Prediction Using Logistic Regression / 4.3.1：
Moss: A Multiple-Bug Challenge / 4.3.2：
Nonuniform Sampling / 4.4.1：
Analysis Results / 4.4.2：
Iterative Bug Isolation and Elimination / 4.5：
Increase Scores / 4.5.1：
Statistical Interpretation / 4.5.2：
Balancing Specificity and Sensitivity / 4.5.3：
Redundancy Elimination / 4.5.4：
Case Studies / 4.6：
Moss / 4.6.1：
CCRYPT / 4.6.2：
BC / 4.6.3：
EXIF / 4.6.4：
Rhythmbox / 4.6.5：
Related Work / 5：
Static Analysis / 5.1：
Profiling and Tracing / 5.2：
Dynamic Analysis / 5.3：
Conclusion / 6：
References
Introduction / 1：
Perfect, or Close Enough / 1.1：
Automatic Failure Reporting / 1.2：
3.

電子ブック
ＥＢ
3. Constructing Correct Software
John Cooke
出版情報: Springer eBooks Computer Science , Springer London, 2005
所蔵情報: loading…
目次情報: 続きを見る
Abridged Preface to First Edition
Preface to Second Edition
Introduction / 0：
What Is this Book About? / 0.1：
Some Terminology / 0.2：
How Might Programs Fail? / 0.3：
A Way Forward / 0.4：
On Mathematics / 0.5：
Linking Paradigms / 0.6：
Problem Solving / 0.7：
The Book Plan / 0.8：
Preliminaries / Part A：
The Technical Background / 1：
Functions, Relations and Specifications / 1.0：
Summary of Features / 1.1.1：
Guidelines for Specifications / 1.1.2：
Equational Reasoning and Types / 1.2：
The Origin and Application of Rules / 1.3：
Data Types / 1.4：
A Glimpse at the Integers / 1.4.1：
Logical Types / 1.4.2：
The Boolean Type, IB / 1.4.2.1：
Implication and Deduction / 1.4.2.2：
Boolean Quantifiers / 1.4.2.3：
Extended (3-valued) Logic / 1.4.2.4：
Sets / 1.4.3：
Integers / 1.4.4：
Inequalities / 1.4.4.1：
Bags / 1.4.5：
Lists / 1.4.6：
Records and n-tuples / 1.4.7：
Union Types / 1.4.8：
Sub-types and Sub-ranges / 1.4.9：
Type Transfer Functions and Casts / 1.4.10：
Data Types and Transformations / 1.4.11：
On Quantification / 1.4.12：
Applying Unfold/Fold Transformations / 1.5：
On Programming / 2：
Overview / 2.0：
Procedural Programming / 2.1：
'Good' Programming / 2.2：
Structuring and (control) Flowcharts / 2.3：
PDL Overview / 2.4：
"Let" and "Where" / 2.4.1：
Scope and Parameters / 2.4.2：
Comments and Assertions / 2.5：
Verification of Procedural Programs / 2.6：
Sequencing / 2.6.1：
Alternation / 2.6.2：
Iteration / 2.6.3：
Program Derivation / 2.7：
Fundamentals / Part B：
Algorithm Extraction / 3：
On Converging Recursion / 3.0：
Design Tactics / 3.2：
Checking Perceived Answers / 3.2.1：
Problem Reduction / 3.2.2：
Problem Decomposition / 3.2.3：
Structural Splitting / 3.2.3.1：
Predicated Splitting / 3.2.3.2：
Mixed Strategies / 3.2.3.3：
Domain Partitioning / 3.2.3.4：
The Use of Analogy / 3.2.4：
'Eureka' Processes / 3.3：
Summary
Recursion Removal / 4：
Tail Recursion / 4.1：
Associative Recursion / 4.2：
Up and Down Iteration / 4.3：
Speeding up Iteratons / 4.4：
Recursive Procedures / 4.5：
Quantifications / 5：
Defining Composite Values / 5.0：
Derived Composite Values / 5.2：
1-place Functions / 5.2.1：
2-place Functions / 5.2.2：
Application to Program Development / 5.3：
An Extended Example: The Factorial Function / 5.3.1：
Some Rules for Quantifications / 5.4：
General Rules / 5.4.1：
Special Rules for Logical Quantifiers / 5.4.2：
Refinement and Re-use / 6：
Operational Refinement / 6.1：
On Correctness / 6.1.1：
Some Properties of Design Refinement / 6.1.2：
An Alternative View / 6.1.3：
Re-using Designs / 6.2：
Developments / Part C：
Sorting / 7：
Specification and Initial Discussion / 7.1：
Initial Designs / 7.2：
Predicated Splitting (Partitioning) / 7.2.1：
Complete Designs / 7.3：
Exchange Sorts / 7.3.1：
Merge Sorts / 7.3.2：
The Basic Merge Sort / 7.3.2.1：
Partition Sorts / 7.3.3：
Simple Partition Sort / 7.3.3.1：
A Quick Design / 7.4：
Data Refinement / 8：
On 'Internal' Data Types / 8.1：
Changing Data Types / 8.2：
Where to next? / 8.3：
Sorting Revisited / 9：
Variants of the Merge Sort / 9.1：
Failures and Fixes / 9.3：
Inadequate Pre-Conditions / 10.1：
Failures in Structural Splitting / 10.2：
Loss of Vital Information / 10.2.1：
Further Examples / 11：
The 2-D Convex Hull / 11.1：
Topological Sort / 11.2：
Experimentation / 11.2.1：
A Proper Formulation / 11.2.2：
Some 'Extremal' Problems / 11.3：
On Interactive Software / 12：
Specifications Involving Change / 12.1：
Specifications of Input/Output / 12.1.1：
Conventional Communications / 12.1.2：
The Enabling of Computations / 12.1.3：
Pertaining to (Software) Systems / 12.2：
System Requirements / 12.2.1：
Specifying Systems / 12.2.2：
Transformation Digest / Appendix：
Re-write Rule Conventions / A.0：
Data Manipulation Rules / A.1：
The Type IB / A.1.1：
Extended Logic and Conditional Expressions / A.1.2：
Common Conversion Functions / A.1.3：
Quantifier Rules / A.1.8：
Quantifier Properties / A.2：
'Not Occurs in' / A.3：
On PDL Structure / A.4：
PDL Transformation Rules / A.4.1：
Bibliography
Index
Abridged Preface to First Edition
Preface to Second Edition
Introduction / 0：
4.

電子ブック
ＥＢ
4. Constructing Correct Software
John Cooke
出版情報: SpringerLink Books - AutoHoldings , Springer London, 2005
所蔵情報: loading…
目次情報: 続きを見る
Abridged Preface to First Edition
Preface to Second Edition
Introduction / 0：
What Is this Book About? / 0.1：
Some Terminology / 0.2：
How Might Programs Fail? / 0.3：
A Way Forward / 0.4：
On Mathematics / 0.5：
Linking Paradigms / 0.6：
Problem Solving / 0.7：
The Book Plan / 0.8：
Preliminaries / Part A：
The Technical Background / 1：
Functions, Relations and Specifications / 1.0：
Summary of Features / 1.1.1：
Guidelines for Specifications / 1.1.2：
Equational Reasoning and Types / 1.2：
The Origin and Application of Rules / 1.3：
Data Types / 1.4：
A Glimpse at the Integers / 1.4.1：
Logical Types / 1.4.2：
The Boolean Type, IB / 1.4.2.1：
Implication and Deduction / 1.4.2.2：
Boolean Quantifiers / 1.4.2.3：
Extended (3-valued) Logic / 1.4.2.4：
Sets / 1.4.3：
Integers / 1.4.4：
Inequalities / 1.4.4.1：
Bags / 1.4.5：
Lists / 1.4.6：
Records and n-tuples / 1.4.7：
Union Types / 1.4.8：
Sub-types and Sub-ranges / 1.4.9：
Type Transfer Functions and Casts / 1.4.10：
Data Types and Transformations / 1.4.11：
On Quantification / 1.4.12：
Applying Unfold/Fold Transformations / 1.5：
On Programming / 2：
Overview / 2.0：
Procedural Programming / 2.1：
'Good' Programming / 2.2：
Structuring and (control) Flowcharts / 2.3：
PDL Overview / 2.4：
"Let" and "Where" / 2.4.1：
Scope and Parameters / 2.4.2：
Comments and Assertions / 2.5：
Verification of Procedural Programs / 2.6：
Sequencing / 2.6.1：
Alternation / 2.6.2：
Iteration / 2.6.3：
Program Derivation / 2.7：
Fundamentals / Part B：
Algorithm Extraction / 3：
On Converging Recursion / 3.0：
Design Tactics / 3.2：
Checking Perceived Answers / 3.2.1：
Problem Reduction / 3.2.2：
Problem Decomposition / 3.2.3：
Structural Splitting / 3.2.3.1：
Predicated Splitting / 3.2.3.2：
Mixed Strategies / 3.2.3.3：
Domain Partitioning / 3.2.3.4：
The Use of Analogy / 3.2.4：
'Eureka' Processes / 3.3：
Summary
Recursion Removal / 4：
Tail Recursion / 4.1：
Associative Recursion / 4.2：
Up and Down Iteration / 4.3：
Speeding up Iteratons / 4.4：
Recursive Procedures / 4.5：
Quantifications / 5：
Defining Composite Values / 5.0：
Derived Composite Values / 5.2：
1-place Functions / 5.2.1：
2-place Functions / 5.2.2：
Application to Program Development / 5.3：
An Extended Example: The Factorial Function / 5.3.1：
Some Rules for Quantifications / 5.4：
General Rules / 5.4.1：
Special Rules for Logical Quantifiers / 5.4.2：
Refinement and Re-use / 6：
Operational Refinement / 6.1：
On Correctness / 6.1.1：
Some Properties of Design Refinement / 6.1.2：
An Alternative View / 6.1.3：
Re-using Designs / 6.2：
Developments / Part C：
Sorting / 7：
Specification and Initial Discussion / 7.1：
Initial Designs / 7.2：
Predicated Splitting (Partitioning) / 7.2.1：
Complete Designs / 7.3：
Exchange Sorts / 7.3.1：
Merge Sorts / 7.3.2：
The Basic Merge Sort / 7.3.2.1：
Partition Sorts / 7.3.3：
Simple Partition Sort / 7.3.3.1：
A Quick Design / 7.4：
Data Refinement / 8：
On 'Internal' Data Types / 8.1：
Changing Data Types / 8.2：
Where to next? / 8.3：
Sorting Revisited / 9：
Variants of the Merge Sort / 9.1：
Failures and Fixes / 9.3：
Inadequate Pre-Conditions / 10.1：
Failures in Structural Splitting / 10.2：
Loss of Vital Information / 10.2.1：
Further Examples / 11：
The 2-D Convex Hull / 11.1：
Topological Sort / 11.2：
Experimentation / 11.2.1：
A Proper Formulation / 11.2.2：
Some 'Extremal' Problems / 11.3：
On Interactive Software / 12：
Specifications Involving Change / 12.1：
Specifications of Input/Output / 12.1.1：
Conventional Communications / 12.1.2：
The Enabling of Computations / 12.1.3：
Pertaining to (Software) Systems / 12.2：
System Requirements / 12.2.1：
Specifying Systems / 12.2.2：
Transformation Digest / Appendix：
Re-write Rule Conventions / A.0：
Data Manipulation Rules / A.1：
The Type IB / A.1.1：
Extended Logic and Conditional Expressions / A.1.2：
Common Conversion Functions / A.1.3：
Quantifier Rules / A.1.8：
Quantifier Properties / A.2：
'Not Occurs in' / A.3：
On PDL Structure / A.4：
PDL Transformation Rules / A.4.1：
Bibliography
Index
Abridged Preface to First Edition
Preface to Second Edition
Introduction / 0：
5.

電子ブック
ＥＢ
5. Analysis and Design of Advice
Ivan Jureta
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2011
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Coordination and Advice / 2：
When There Is None / 2.1：
From Division of Labor to Dependence on Advice / 2.2：
Autonomy and Coordination / 2.3：
Coordination Through Advice / 2.4：
Advice in Political Coordination / 2.5：
Dictatorship and Consent / 2.5.1：
Under Democracy / 2.5.2：
Advice and Meta-Advice in Politics / 2.5.3：
Advice in Economic Coordination / 2.6：
Central Planning / 2.6.1：
Market / 2.6.2：
Homo Follis / 2.7：
Conceptual Analysis of Advice / 3：
Rigorous Definition / 3.1：
Ostensive and Intensional Definitions / 3.1.1：
Primitive Terms / 3.1.2：
Criteria from Standard Theory / 3.1.3：
Signs to Objects and Back, via Concepts / 3.2：
Signs / 3.2.1：
Objects and Concepts / 3.2.2：
Relating Signs, Objects, and Concepts / 3.2.3：
Sings, Objects, and Concepts, in Advice / 3.2.4：
Ontology and Primitive Terms / 3.3：
Ontology in Philosophy / 3.3.1：
On the Engineering of Ontologies / 3.3.2：
Advice, Defined / 3.4：
Initial Ontological Commitments / 3.4.1：
Advice in Communication, Communication as Action / 3.4.2：
Essential Properties of and Identity Criteria for Advice / 3.4.3：
What Advice Is Not, but May Refer To / 3.4.4：
Relativist's Conceptual Analysis / 3.5：
Interpretation of Advice / 4：
Open Reference / 4.1：
Vague Advice / 4.2：
Referent Lost / 4.3：
Kinds of Advice / 5：
Classification from a Model of Choice / 5.1：
Perfect and Bounded Rational Choice / 5.2：
Ontology of Decision Analysis / 5.2.1：
Ontology of Choice in Organized Anarchies / 5.2.2：
Ontology of Intervowen Organisational Choice / 5.2.3：
Intolerance for Substitutes / 5.3：
Probability Intolerance / 5.3.1：
Utility Intolerance / 5.3.2：
Decision Information / 5.4：
Revealed Intentional States / 5.4.1：
Decision Information Ontology / 5.4.2：
Synthesis of the Decision Information Ontology / 5.4.3：
Taxonomy of Advice / 5.5：
Whose Explanations? / 5.5.1：
Specialization of the Concept of Advice / 5.5.2：
Reinterpreting Advice / 5.6：
Advisor's Problem and Its Solutions / 6：
Advice from Simple Explanations and Predictions / 6.1：
Models of Advice: An Overview / 6.2：
Introductory Example / 6.2.1：
Overview of the Framework for the Modeling of Advice / 6.2.2：
Modeling Language / 6.3：
AML2 / 6.3.1：
AML1 / 6.3.2：
AML / 6.3.3：
A-nets / 6.3.4：
Why the Interest in Structure? / 6.3.5：
Formulation of the Advisor's Problem / 6.4：
Solving the Advisor's Problem / 6.5：
Criteria for a Robust Solution / 6.6：
Criteria for a Clear Solution / 6.7：
Criteria from Empirical Evidence / 6.8：
Perspectives / 7：
References
Index
Introduction / 1：
Coordination and Advice / 2：
When There Is None / 2.1：
6.

電子ブック
ＥＢ
6. Analysis and Design of Advice
Ivan Jureta
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2011
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Coordination and Advice / 2：
When There Is None / 2.1：
From Division of Labor to Dependence on Advice / 2.2：
Autonomy and Coordination / 2.3：
Coordination Through Advice / 2.4：
Advice in Political Coordination / 2.5：
Dictatorship and Consent / 2.5.1：
Under Democracy / 2.5.2：
Advice and Meta-Advice in Politics / 2.5.3：
Advice in Economic Coordination / 2.6：
Central Planning / 2.6.1：
Market / 2.6.2：
Homo Follis / 2.7：
Conceptual Analysis of Advice / 3：
Rigorous Definition / 3.1：
Ostensive and Intensional Definitions / 3.1.1：
Primitive Terms / 3.1.2：
Criteria from Standard Theory / 3.1.3：
Signs to Objects and Back, via Concepts / 3.2：
Signs / 3.2.1：
Objects and Concepts / 3.2.2：
Relating Signs, Objects, and Concepts / 3.2.3：
Sings, Objects, and Concepts, in Advice / 3.2.4：
Ontology and Primitive Terms / 3.3：
Ontology in Philosophy / 3.3.1：
On the Engineering of Ontologies / 3.3.2：
Advice, Defined / 3.4：
Initial Ontological Commitments / 3.4.1：
Advice in Communication, Communication as Action / 3.4.2：
Essential Properties of and Identity Criteria for Advice / 3.4.3：
What Advice Is Not, but May Refer To / 3.4.4：
Relativist's Conceptual Analysis / 3.5：
Interpretation of Advice / 4：
Open Reference / 4.1：
Vague Advice / 4.2：
Referent Lost / 4.3：
Kinds of Advice / 5：
Classification from a Model of Choice / 5.1：
Perfect and Bounded Rational Choice / 5.2：
Ontology of Decision Analysis / 5.2.1：
Ontology of Choice in Organized Anarchies / 5.2.2：
Ontology of Intervowen Organisational Choice / 5.2.3：
Intolerance for Substitutes / 5.3：
Probability Intolerance / 5.3.1：
Utility Intolerance / 5.3.2：
Decision Information / 5.4：
Revealed Intentional States / 5.4.1：
Decision Information Ontology / 5.4.2：
Synthesis of the Decision Information Ontology / 5.4.3：
Taxonomy of Advice / 5.5：
Whose Explanations? / 5.5.1：
Specialization of the Concept of Advice / 5.5.2：
Reinterpreting Advice / 5.6：
Advisor's Problem and Its Solutions / 6：
Advice from Simple Explanations and Predictions / 6.1：
Models of Advice: An Overview / 6.2：
Introductory Example / 6.2.1：
Overview of the Framework for the Modeling of Advice / 6.2.2：
Modeling Language / 6.3：
AML2 / 6.3.1：
AML1 / 6.3.2：
AML / 6.3.3：
A-nets / 6.3.4：
Why the Interest in Structure? / 6.3.5：
Formulation of the Advisor's Problem / 6.4：
Solving the Advisor's Problem / 6.5：
Criteria for a Robust Solution / 6.6：
Criteria for a Clear Solution / 6.7：
Criteria from Empirical Evidence / 6.8：
Perspectives / 7：
References
Index
Introduction / 1：
Coordination and Advice / 2：
When There Is None / 2.1：
7.

電子ブック
ＥＢ
7. Software Architecture
Zheng Qin, Jiankuan Xing, Xiang Zheng
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2008
所蔵情報: loading…
目次情報: 続きを見る
Introduction to Software Architecture / 1：
A Brief History of Software Development / 1.1：
The Evolution of Programming Language-Abstract Level / 1.1.1：
The Evolution of Software Development-Concerns / 1.1.2：
The Origin and Growth of Software Architecture / 1.1.3：
Basic Terminologies / 1.2：
Understanding IEEE 1471-2000 / 1.2.2：
Views Used in Software Architecture / 1.2.3：
Why We Need Software Architecture / 1.2.4：
Where Is Software Architecture in Software Life Cycle / 1.2.5：
Summary / 1.3：
References
Architectural Styles and Patterns / 2：
Fundamentals of Architectural Styles and Patterns / 2.1：
Pipes Filters / 2.2：
Style Description / 2.2.1：
Study Case / 2.2.2：
Object-oriented / 2.3：
Event-driven / 2.3.1：
Hierarchical Layer / 2.4.1：
Data Sharing / 2.5.1：
Virtual Machine / 2.6.1：
Feedback Loop / 2.7.1：
Comparison among Styles / 2.8.1：
Integration of Heterogeneous Styles / 2.10：
Application and Analysis of Architectural Styles / 2.11：
Introduction to SMCSP / 3.1：
Program Background / 3.1.1：
Technical Routes / 3.1.2：
Function Design / 3.1.3：
System Realization / 3.2：
The Pattern Choice / 3.2.1：
Interaction Mechanism / 3.2.2：
Realization of Mobile Collaboration / 3.2.3：
Knowledge-based Design / 3.2.4：
Software Architecture Description / 3.3：
Formal Description of Software Architecture / 4.1：
Problems in Informal Description / 4.1.1：
Why Are Formal Methods Necessary / 4.1.2：
Architectural Description Language / 4.2：
Introduction to ADL / 4.2.1：
Comparing among Typical ADLs / 4.2.2：
Describing Architectural Behaviors / 4.2.3：
Study Case: WRIGHT System / 4.3：
Description of Component and Connector / 4.3.1：
Description of Configuration / 4.3.2：
Description of Style / 4.3.3：
CSP-Semantic Basis of Formal Behavior Description / 4.3.4：
FEAL: An Infrastructure to Construct ADLs / 4.4：
Design Purpose / 4.4.1：
FEC / 4.4.2：
FEAL Structure / 4.4.3：
FEAL Mapper / 4.4.4：
Examples of FEAL Application / 4.4.5：
Design Strategies in Architecture Level / 4.5：
From Reuse to Architecture Design / 5.1：
Architectural Design Space and Rules / 5.2：
SADPBA / 5.3：
Overview / 5.3.1：
Split Design Process with Design Space / 5.3.2：
Trace Mechanism in SADPBA / 5.3.3：
Life Cycle Model of Software Architecture / 5.3.4：
SADPBA in Practice / 5.3.5：
Study Case: MEECS / 5.4：
Introduction to MEECS / 5.4.1：
Applying SADPBA in MEECS / 5.4.2：
Software Architecture IDE / 5.5：
What Can Software Architecture IDE Do / 6.1：
A Comparison with Formalized Description Approach / 6.1.1：
Important Roles of Architecture IDE / 6.1.2：
Prototype / 6.2：
User Interface Layer / 6.2.1：
Model Layer / 6.2.2：
Foundational Layer / 6.2.3：
IDE Design Tactics / 6.2.4：
ArchStudio 4 System / 6.3：
Introduction / 6.3.1：
Installing ArchStudio 4 / 6.3.2：
ArchStudio 4 Overview / 6.3.3：
Using ArchStudio 4 / 6.3.4：
Evaluating Software Architecture / 6.4：
What Is Software Architecture Evaluation / 7.1：
Quality Attribute / 7.1.1：
Why Is Evaluation Necessary / 7.1.2：
Scenario-based Evaluation Methods / 7.1.3：
SAAM / 7.2：
General Steps of SAAM / 7.2.1：
Scenario Development / 7.2.2：
Architecture Description / 7.2.3：
Scenario Classification and Prioritization / 7.2.4：
Individual Evaluation of Indirect Scenarios / 7.2.5：
Assessment of Scenario Interaction / 7.2.6：
Creation of Overall Evaluation / 7.2.7：
ATAM / 7.3：
Initial ATAM / 7.3.1：
ATAM Improvement / 7.3.2：
General Process of ATAM / 7.3.3：
Presentation / 7.3.4：
Investigation and Analysis / 7.3.5：
Testing / 7.3.6：
Present the Results / 7.3.7：
Comparison among Evaluation Methods / 7.4：
Comparison Framework / 7.4.1：
Overview and Comparison of Evaluation Methods / 7.4.2：
Flexible Software Architecture / 7.5：
What Is Flexibility for / 8.1：
Dynamic Software Architecture / 8.2：
[pi]-ADL: A Behavior Perspective / 8.2.1：
MARMOL: A Reflection Perspective / 8.2.2：
LIME: A Coordination Perspective / 8.2.3：
Flexibility: Beyond the Dynamism / 8.3：
Concept of Flexible Software Architecture / 8.3.1：
Trade-off of Flexibility / 8.3.2：
Study Cases / 8.4：
Rainbow / 8.4.1：
MADAM / 8.4.2：
A Vision on Software Architecture / 8.5：
Software Architecture in Modern Software Industry / 9.1：
Categorizing Software / 9.1.1：
Software Product Line / 9.1.2：
Software Architecture Used in Other Fields / 9.2：
The Outline of Software Architecture Application Practice / 9.2.1：
The Development Trends of Domain-Specific Software / 9.2.2：
Software Architecture's Future Research / 9.3：
Index / 9.4：
Introduction to Software Architecture / 1：
A Brief History of Software Development / 1.1：
The Evolution of Programming Language-Abstract Level / 1.1.1：
8.

電子ブック
ＥＢ
8. Software Architecture
Zheng Qin, Jiankuan Xing, Xiang Zheng, Jian-Kuan Xing
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2008
所蔵情報: loading…
目次情報: 続きを見る
Introduction to Software Architecture / 1：
A Brief History of Software Development / 1.1：
The Evolution of Programming Language-Abstract Level / 1.1.1：
The Evolution of Software Development-Concerns / 1.1.2：
The Origin and Growth of Software Architecture / 1.1.3：
Basic Terminologies / 1.2：
Understanding IEEE 1471-2000 / 1.2.2：
Views Used in Software Architecture / 1.2.3：
Why We Need Software Architecture / 1.2.4：
Where Is Software Architecture in Software Life Cycle / 1.2.5：
Summary / 1.3：
References
Architectural Styles and Patterns / 2：
Fundamentals of Architectural Styles and Patterns / 2.1：
Pipes Filters / 2.2：
Style Description / 2.2.1：
Study Case / 2.2.2：
Object-oriented / 2.3：
Event-driven / 2.3.1：
Hierarchical Layer / 2.4.1：
Data Sharing / 2.5.1：
Virtual Machine / 2.6.1：
Feedback Loop / 2.7.1：
Comparison among Styles / 2.8.1：
Integration of Heterogeneous Styles / 2.10：
Application and Analysis of Architectural Styles / 2.11：
Introduction to SMCSP / 3.1：
Program Background / 3.1.1：
Technical Routes / 3.1.2：
Function Design / 3.1.3：
System Realization / 3.2：
The Pattern Choice / 3.2.1：
Interaction Mechanism / 3.2.2：
Realization of Mobile Collaboration / 3.2.3：
Knowledge-based Design / 3.2.4：
Software Architecture Description / 3.3：
Formal Description of Software Architecture / 4.1：
Problems in Informal Description / 4.1.1：
Why Are Formal Methods Necessary / 4.1.2：
Architectural Description Language / 4.2：
Introduction to ADL / 4.2.1：
Comparing among Typical ADLs / 4.2.2：
Describing Architectural Behaviors / 4.2.3：
Study Case: WRIGHT System / 4.3：
Description of Component and Connector / 4.3.1：
Description of Configuration / 4.3.2：
Description of Style / 4.3.3：
CSP-Semantic Basis of Formal Behavior Description / 4.3.4：
FEAL: An Infrastructure to Construct ADLs / 4.4：
Design Purpose / 4.4.1：
FEC / 4.4.2：
FEAL Structure / 4.4.3：
FEAL Mapper / 4.4.4：
Examples of FEAL Application / 4.4.5：
Design Strategies in Architecture Level / 4.5：
From Reuse to Architecture Design / 5.1：
Architectural Design Space and Rules / 5.2：
SADPBA / 5.3：
Overview / 5.3.1：
Split Design Process with Design Space / 5.3.2：
Trace Mechanism in SADPBA / 5.3.3：
Life Cycle Model of Software Architecture / 5.3.4：
SADPBA in Practice / 5.3.5：
Study Case: MEECS / 5.4：
Introduction to MEECS / 5.4.1：
Applying SADPBA in MEECS / 5.4.2：
Software Architecture IDE / 5.5：
What Can Software Architecture IDE Do / 6.1：
A Comparison with Formalized Description Approach / 6.1.1：
Important Roles of Architecture IDE / 6.1.2：
Prototype / 6.2：
User Interface Layer / 6.2.1：
Model Layer / 6.2.2：
Foundational Layer / 6.2.3：
IDE Design Tactics / 6.2.4：
ArchStudio 4 System / 6.3：
Introduction / 6.3.1：
Installing ArchStudio 4 / 6.3.2：
ArchStudio 4 Overview / 6.3.3：
Using ArchStudio 4 / 6.3.4：
Evaluating Software Architecture / 6.4：
What Is Software Architecture Evaluation / 7.1：
Quality Attribute / 7.1.1：
Why Is Evaluation Necessary / 7.1.2：
Scenario-based Evaluation Methods / 7.1.3：
SAAM / 7.2：
General Steps of SAAM / 7.2.1：
Scenario Development / 7.2.2：
Architecture Description / 7.2.3：
Scenario Classification and Prioritization / 7.2.4：
Individual Evaluation of Indirect Scenarios / 7.2.5：
Assessment of Scenario Interaction / 7.2.6：
Creation of Overall Evaluation / 7.2.7：
ATAM / 7.3：
Initial ATAM / 7.3.1：
ATAM Improvement / 7.3.2：
General Process of ATAM / 7.3.3：
Presentation / 7.3.4：
Investigation and Analysis / 7.3.5：
Testing / 7.3.6：
Present the Results / 7.3.7：
Comparison among Evaluation Methods / 7.4：
Comparison Framework / 7.4.1：
Overview and Comparison of Evaluation Methods / 7.4.2：
Flexible Software Architecture / 7.5：
What Is Flexibility for / 8.1：
Dynamic Software Architecture / 8.2：
[pi]-ADL: A Behavior Perspective / 8.2.1：
MARMOL: A Reflection Perspective / 8.2.2：
LIME: A Coordination Perspective / 8.2.3：
Flexibility: Beyond the Dynamism / 8.3：
Concept of Flexible Software Architecture / 8.3.1：
Trade-off of Flexibility / 8.3.2：
Study Cases / 8.4：
Rainbow / 8.4.1：
MADAM / 8.4.2：
A Vision on Software Architecture / 8.5：
Software Architecture in Modern Software Industry / 9.1：
Categorizing Software / 9.1.1：
Software Product Line / 9.1.2：
Software Architecture Used in Other Fields / 9.2：
The Outline of Software Architecture Application Practice / 9.2.1：
The Development Trends of Domain-Specific Software / 9.2.2：
Software Architecture's Future Research / 9.3：
Index / 9.4：
Introduction to Software Architecture / 1：
A Brief History of Software Development / 1.1：
The Evolution of Programming Language-Abstract Level / 1.1.1：
9.

電子ブック
ＥＢ
9. Concurrency Theory
Howard Bowman, Rodolfo Gomez
出版情報: Springer eBooks Computer Science , Springer London, 2006
所蔵情報: loading…
目次情報: 続きを見る
Introduction / Part I：
Background on Concurrency Theory / 1：
Concurrency Is Everywhere / 1.1：
Characteristics of Concurrent Systems / 1.2：
Classes of Concurrent Systems / 1.3：
Basic Event Ordering / 1.3.1：
Timing Axis / 1.3.2：
Probabilistic Choice Axis / 1.3.3：
Mobility Axis / 1.3.4：
Mathematical Theories / 1.4：
Overview of Book / 1.5：
Concurrency Theory - Untimed Models / Part II：
Process Calculi: LOTOS / 2：
Example Specifications / 2.1：
A Communication Protocol / 2.2.1：
The Dining Philosophers / 2.2.2：
Primitive Basic LOTOS / 2.3：
Abstract Actions / 2.3.1：
Action Prefix / 2.3.2：
Choice / 2.3.3：
Nondeterminism / 2.3.4：
Process Definition / 2.3.5：
Concurrency / 2.3.6：
Sequential Composition and Exit / 2.3.7：
Syntax of pbLOTOS / 2.3.8：
Example / 2.4：
Basic Interleaved Semantic Models / 3：
A General Perspective on Semantics / 3.1：
Why Semantics? / 3.1.1：
Formal Definition / 3.1.2：
Modelling Recursion / 3.1.3：
What Makes a Good Semantics? / 3.1.4：
Trace Semantics / 3.2：
The Basic Approach / 3.2.1：
Formal Semantics / 3.2.2：
Development Relations / 3.2.3：
Discussion / 3.2.4：
Labelled Transition Systems / 3.3：
Verification Tools / 3.3.1：
Overview of CADP / 3.4.1：
Bisimulation Checking in CADP / 3.4.2：
True Concurrency Models: Event Structures / 4：
The Basic Approach - Event Structures / 4.1：
Event Structures and pbLOTOS / 4.3：
An Event Structures Semantics for pbLOTOS / 4.4：
Relating Event Structures to Labelled Transition Systems / 4.5：
Alternative Event Structure Models / 4.6：
Summary and Discussion / 4.8：
Testing Theory and the Linear Time - Branching Time Spectrum / 5：
Trace-refusals Semantics / 5.1：
Deriving Trace-refusal Pairs / 5.1.1：
Internal Behaviour / 5.1.4：
Development Relations: Equivalences / 5.1.5：
Nonequivalence Development Relations / 5.1.6：
Explorations of Congruence / 5.1.7：
Testing Justification for Trace-refusals Semantics / 5.1.8：
Testing Theory in General and the Linear Time - Branching Time Spectrum / 5.3：
Sequence-based Testing / 5.3.1：
Tree-based Testing / 5.3.2：
Applications of Trace-refusals Relations in Distributed Systems / 5.4：
Relating OO Concepts to LOTOS / 5.4.1：
Behavioural Subtyping / 5.4.2：
Viewpoints and Consistency / 5.4.3：
Concurrency Theory - Further Untimed Notations / Part III：
Beyond pbLOTOS / 6：
Basic LOTOS / 6.1：
Disabling / 6.1.1：
Generalised Choice / 6.1.2：
Generalised Parallelism / 6.1.3：
Verbose Specification Syntax / 6.1.4：
Verbose Process Syntax / 6.1.5：
Syntax of bLOTOS / 6.1.6：
Full LOTOS / 6.2：
Guarded Choice / 6.2.1：
Specification Notation / 6.2.2：
Process Definition and Invocation / 6.2.3：
Value Passing Actions / 6.2.4：
Local Definitions / 6.2.5：
Selection Predicates / 6.2.6：
Parameterised Enabling / 6.2.7：
Syntax of fLOTOS / 6.2.9：
Comments / 6.2.10：
Examples / 6.3：
Communication Protocol / 6.3.1：
Dining Philosophers / 6.3.2：
Extended LOTOS / 6.4：
Comparison of LOTOS with CCS and CSP / 7：
CCS and LOTOS / 7.1：
Parallel Composition and Complementation of Actions / 7.1.1：
Restriction and Hiding / 7.1.2：
Minor Differences / 7.1.3：
CSP and LOTOS / 7.2：
Alphabets / 7.2.1：
Internal Actions / 7.2.2：
Parallelism / 7.2.3：
Hiding / 7.2.5：
Comparison of LOTOS Trace-refusals with CSP Failures-divergences / 7.2.6：
Communicating Automata / 8：
Networks of Communicating Automata / 8.1：
Component Automata / 8.2.1：
Parallel Composition / 8.2.2：
Semantics and Development Relations / 8.2.3：
Verification of Networks of Communicating Automata / 8.2.5：
Relationship to Process Calculi / 8.2.6：
Infinite State Communicating Automata / 8.3：
Networks of Infinite State Communicating Automata / 8.3.1：
Semantics of ISCAs as Labelled Transition Systems / 8.3.2：
Concurrency Theory - Timed Models / Part IV：
Timed Process Calculi, a LOTOS Perspective / 9：
Timed LOTOS - The Issues / 9.1：
Timed Action Enabling / 9.2.1：
Urgency / 9.2.2：
Persistency / 9.2.3：
Synchronisation / 9.2.4：
Timing Domains / 9.2.6：
Time Measurement / 9.2.7：
Timing of Nonadjacent Actions / 9.2.8：
Timed Interaction Policies / 9.2.9：
Forms of Internal Urgency / 9.2.10：
Timed LOTOS Notation / 9.2.11：
The Language / 9.3.1：
Timing Anomalies in tLOTOS / 9.3.2：
E-LOTOS, the Timing Extensions / 9.5：
Semantic Models for tLOTOS / 10：
Branching Time Semantics / 10.1：
Timed Transition Systems / 10.1.1：
Operational Semantics / 10.1.2：
Branching Time Development Relations / 10.1.3：
True Concurrency Semantics / 10.2：
Timed Bundle Event Structures / 10.2.1：
Causal Semantics for tLOTOS / 10.2.3：
Anomalous Behaviour / 10.2.4：
Timed Communicating Automata / 10.2.5：
Timed Automata - Formal Definitions / 11.1：
Syntax / 11.2.1：
Semantics / 11.2.2：
Real-time Model-checking / 11.3：
Forward Reachability / 11.3.1：
Example: Reachability Analysis on the Multimedia Stream / 11.3.2：
Issues in Real-time Model-checking / 11.3.3：
Timelocks in Timed Automata / 12：
A Classification of Deadlocks in Timed Automata / 12.1：
Discussion: Justifying the Classification of Deadlocks / 12.2.1：
Discussion: Timelocks in Process Calculi / 12.2.2：
Time-actionlocks / 12.3：
Timed Automata with Deadlines / 12.3.1：
Example: A TAD Specification for the Multimedia Stream / 12.3.2：
Zeno-timelocks / 12.4：
Example: Zeno-timelocks in the Multimedia Stream / 12.4.1：
Nonzenoness: Syntactic Conditions / 12.4.2：
Nonzenoness: A Sufficient-and-Necessary Condition / 12.4.3：
Timelock Detection in Real-time Model-checkers / 12.5：
Uppaal / 12.5.1：
Kronos / 12.5.2：
Discrete Timed Automata / 13：
Infinite vs. Finite States / 13.1：
Preliminaries / 13.2：
Fair Transition Systems and Invariance Proofs / 13.2.1：
The Weak Monadic Second-order Theory of 1 Successor (WS1S) and MONA / 13.2.2：
Discrete Timed Automata - Formal definitions / 13.3：
Example: A DTA Specification for the Multimedia Stream / 13.3.1：
Verifying Safety Properties over DTAs / 13.3.3：
Discussion: Comparing DTAs and TIOAs with Urgency / 13.5：
References
Appendix
Enabling as a Derived Operator / 14.1：
Strong Bisimulation Is a Congruence / 14.2：
Weak Bisimulation Congruence / 14.3：
Timed Enabling as a Derived Operator / 14.4：
Hiding is Not Substitutive for Timed Bisimulations / 14.5：
Substitutivity of Timed Strong Bisimulation / 14.6：
Substitutivity of Timed Rooted Weak Bisimulation / 14.7：
Index
Introduction / Part I：
Background on Concurrency Theory / 1：
Concurrency Is Everywhere / 1.1：
10.

電子ブック
ＥＢ
10. Concurrency Theory
Howard Bowman, Rodolfo Gomez
出版情報: SpringerLink Books - AutoHoldings , Springer London, 2006
所蔵情報: loading…
目次情報: 続きを見る
Introduction / Part I：
Background on Concurrency Theory / 1：
Concurrency Is Everywhere / 1.1：
Characteristics of Concurrent Systems / 1.2：
Classes of Concurrent Systems / 1.3：
Basic Event Ordering / 1.3.1：
Timing Axis / 1.3.2：
Probabilistic Choice Axis / 1.3.3：
Mobility Axis / 1.3.4：
Mathematical Theories / 1.4：
Overview of Book / 1.5：
Concurrency Theory - Untimed Models / Part II：
Process Calculi: LOTOS / 2：
Example Specifications / 2.1：
A Communication Protocol / 2.2.1：
The Dining Philosophers / 2.2.2：
Primitive Basic LOTOS / 2.3：
Abstract Actions / 2.3.1：
Action Prefix / 2.3.2：
Choice / 2.3.3：
Nondeterminism / 2.3.4：
Process Definition / 2.3.5：
Concurrency / 2.3.6：
Sequential Composition and Exit / 2.3.7：
Syntax of pbLOTOS / 2.3.8：
Example / 2.4：
Basic Interleaved Semantic Models / 3：
A General Perspective on Semantics / 3.1：
Why Semantics? / 3.1.1：
Formal Definition / 3.1.2：
Modelling Recursion / 3.1.3：
What Makes a Good Semantics? / 3.1.4：
Trace Semantics / 3.2：
The Basic Approach / 3.2.1：
Formal Semantics / 3.2.2：
Development Relations / 3.2.3：
Discussion / 3.2.4：
Labelled Transition Systems / 3.3：
Verification Tools / 3.3.1：
Overview of CADP / 3.4.1：
Bisimulation Checking in CADP / 3.4.2：
True Concurrency Models: Event Structures / 4：
The Basic Approach - Event Structures / 4.1：
Event Structures and pbLOTOS / 4.3：
An Event Structures Semantics for pbLOTOS / 4.4：
Relating Event Structures to Labelled Transition Systems / 4.5：
Alternative Event Structure Models / 4.6：
Summary and Discussion / 4.8：
Testing Theory and the Linear Time - Branching Time Spectrum / 5：
Trace-refusals Semantics / 5.1：
Deriving Trace-refusal Pairs / 5.1.1：
Internal Behaviour / 5.1.4：
Development Relations: Equivalences / 5.1.5：
Nonequivalence Development Relations / 5.1.6：
Explorations of Congruence / 5.1.7：
Testing Justification for Trace-refusals Semantics / 5.1.8：
Testing Theory in General and the Linear Time - Branching Time Spectrum / 5.3：
Sequence-based Testing / 5.3.1：
Tree-based Testing / 5.3.2：
Applications of Trace-refusals Relations in Distributed Systems / 5.4：
Relating OO Concepts to LOTOS / 5.4.1：
Behavioural Subtyping / 5.4.2：
Viewpoints and Consistency / 5.4.3：
Concurrency Theory - Further Untimed Notations / Part III：
Beyond pbLOTOS / 6：
Basic LOTOS / 6.1：
Disabling / 6.1.1：
Generalised Choice / 6.1.2：
Generalised Parallelism / 6.1.3：
Verbose Specification Syntax / 6.1.4：
Verbose Process Syntax / 6.1.5：
Syntax of bLOTOS / 6.1.6：
Full LOTOS / 6.2：
Guarded Choice / 6.2.1：
Specification Notation / 6.2.2：
Process Definition and Invocation / 6.2.3：
Value Passing Actions / 6.2.4：
Local Definitions / 6.2.5：
Selection Predicates / 6.2.6：
Parameterised Enabling / 6.2.7：
Syntax of fLOTOS / 6.2.9：
Comments / 6.2.10：
Examples / 6.3：
Communication Protocol / 6.3.1：
Dining Philosophers / 6.3.2：
Extended LOTOS / 6.4：
Comparison of LOTOS with CCS and CSP / 7：
CCS and LOTOS / 7.1：
Parallel Composition and Complementation of Actions / 7.1.1：
Restriction and Hiding / 7.1.2：
Minor Differences / 7.1.3：
CSP and LOTOS / 7.2：
Alphabets / 7.2.1：
Internal Actions / 7.2.2：
Parallelism / 7.2.3：
Hiding / 7.2.5：
Comparison of LOTOS Trace-refusals with CSP Failures-divergences / 7.2.6：
Communicating Automata / 8：
Networks of Communicating Automata / 8.1：
Component Automata / 8.2.1：
Parallel Composition / 8.2.2：
Semantics and Development Relations / 8.2.3：
Verification of Networks of Communicating Automata / 8.2.5：
Relationship to Process Calculi / 8.2.6：
Infinite State Communicating Automata / 8.3：
Networks of Infinite State Communicating Automata / 8.3.1：
Semantics of ISCAs as Labelled Transition Systems / 8.3.2：
Concurrency Theory - Timed Models / Part IV：
Timed Process Calculi, a LOTOS Perspective / 9：
Timed LOTOS - The Issues / 9.1：
Timed Action Enabling / 9.2.1：
Urgency / 9.2.2：
Persistency / 9.2.3：
Synchronisation / 9.2.4：
Timing Domains / 9.2.6：
Time Measurement / 9.2.7：
Timing of Nonadjacent Actions / 9.2.8：
Timed Interaction Policies / 9.2.9：
Forms of Internal Urgency / 9.2.10：
Timed LOTOS Notation / 9.2.11：
The Language / 9.3.1：
Timing Anomalies in tLOTOS / 9.3.2：
E-LOTOS, the Timing Extensions / 9.5：
Semantic Models for tLOTOS / 10：
Branching Time Semantics / 10.1：
Timed Transition Systems / 10.1.1：
Operational Semantics / 10.1.2：
Branching Time Development Relations / 10.1.3：
True Concurrency Semantics / 10.2：
Timed Bundle Event Structures / 10.2.1：
Causal Semantics for tLOTOS / 10.2.3：
Anomalous Behaviour / 10.2.4：
Timed Communicating Automata / 10.2.5：
Timed Automata - Formal Definitions / 11.1：
Syntax / 11.2.1：
Semantics / 11.2.2：
Real-time Model-checking / 11.3：
Forward Reachability / 11.3.1：
Example: Reachability Analysis on the Multimedia Stream / 11.3.2：
Issues in Real-time Model-checking / 11.3.3：
Timelocks in Timed Automata / 12：
A Classification of Deadlocks in Timed Automata / 12.1：
Discussion: Justifying the Classification of Deadlocks / 12.2.1：
Discussion: Timelocks in Process Calculi / 12.2.2：
Time-actionlocks / 12.3：
Timed Automata with Deadlines / 12.3.1：
Example: A TAD Specification for the Multimedia Stream / 12.3.2：
Zeno-timelocks / 12.4：
Example: Zeno-timelocks in the Multimedia Stream / 12.4.1：
Nonzenoness: Syntactic Conditions / 12.4.2：
Nonzenoness: A Sufficient-and-Necessary Condition / 12.4.3：
Timelock Detection in Real-time Model-checkers / 12.5：
Uppaal / 12.5.1：
Kronos / 12.5.2：
Discrete Timed Automata / 13：
Infinite vs. Finite States / 13.1：
Preliminaries / 13.2：
Fair Transition Systems and Invariance Proofs / 13.2.1：
The Weak Monadic Second-order Theory of 1 Successor (WS1S) and MONA / 13.2.2：
Discrete Timed Automata - Formal definitions / 13.3：
Example: A DTA Specification for the Multimedia Stream / 13.3.1：
Verifying Safety Properties over DTAs / 13.3.3：
Discussion: Comparing DTAs and TIOAs with Urgency / 13.5：
References
Appendix
Enabling as a Derived Operator / 14.1：
Strong Bisimulation Is a Congruence / 14.2：
Weak Bisimulation Congruence / 14.3：
Timed Enabling as a Derived Operator / 14.4：
Hiding is Not Substitutive for Timed Bisimulations / 14.5：
Substitutivity of Timed Strong Bisimulation / 14.6：
Substitutivity of Timed Rooted Weak Bisimulation / 14.7：
Index
Introduction / Part I：
Background on Concurrency Theory / 1：
Concurrency Is Everywhere / 1.1：
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼