Ebook: Programming Concepts and Methods PROCOMET ’98: IFIP TC2 / WG2.2, 2.3 International Conference on Programming Concepts and Methods (PROCOMET ’98) 8–12 June 1998, Shelter Island, New York, USA
- Tags: Information Storage and Retrieval, Software Engineering/Programming and Operating Systems, Programming Languages Compilers Interpreters
- Series: IFIP — The International Federation for Information Processing
- Year: 1998
- Publisher: Springer US
- Edition: 1
- Language: English
- pdf
This book constitutes the Proceedings of the IFIP Working Conference PRO COMET'98, held 8-12 June 1998 at Shelter Island, N.Y. The conference is organized by the t'wo IFIP TC 2 Working Groups 2.2 Formal Description of Programming Concepts and 2.3 Programming Methodology. WG2.2 and WG2.3 have been organizing these conferences every four years for over twenty years. The aim of such Working Conferences organized by IFIP Working Groups is to bring together leading scientists in a given area of computer science. Participation is by invitation only. As a result, these conferences distinguish themselves from other meetings by extensive and competent technical discus sions. PROCOMET stands for Programming Concepts and Methods, indicating that the area of discussion for the conference is the formal description of pro gramming concepts and methods, their tool support, and their applications. At PROCOMET working conferences, papers are presented from this whole area, reflecting the interest of the individuals in WG2.2 and WG2.3.
Content:
Front Matter....Pages i-ix
Extended static checking....Pages 1-1
From Lattices to Practical Formal Hardware Verification....Pages 3-3
Programming with Tabling in XSB....Pages 5-5
Verifying Electronic Control Units — today and tomorrow....Pages 7-7
Teaching Calculational Logic....Pages 9-9
Types for Trees....Pages 11-29
Structures for lazy semantics....Pages 30-48
A proof theory of asynchronously communicating sequential processes....Pages 49-67
Bisimulations in the Join-Calculus....Pages 68-86
Using State Space Exploration and a Natural Deduction Style Message Derivation Engine to Verify Security Protocols....Pages 87-106
Programming Language Semantics in Foundational Type Theory....Pages 107-125
An Algebraic Approach to the Specification of Stochastic Systems (Extended Abstract)....Pages 126-147
Refinement types for specification....Pages 148-166
An extension of the program derivation format....Pages 167-185
Deadlines are termination....Pages 186-204
The design of a linearization of a concurrent data object....Pages 205-224
Final semantics for the ?-calculus....Pages 225-243
Comparing CTL and PCTL on Labeled Markov Chains....Pages 244-262
Reactive Functional Programming....Pages 263-284
Imperative Objects and Mobile Processes....Pages 285-303
Relating Linear and Branching Model Checking....Pages 304-326
Verifying Duration Properties of Timed Transition Systems....Pages 327-345
Towards Squiggly Refinement Algebra....Pages 346-365
Towards a Theory of Sequential Hybrid Programs....Pages 366-384
Test Selection for Object-Oriented Software Based on Formal Specifications....Pages 385-403
Logical Foundations for Typed Object-Oriented Languages....Pages 404-423
Verifying a Self-Stabilizing Mutual Exclusion Algorithm....Pages 424-443
A Combination of Interval Logic and Linear Temporal Logic....Pages 444-461
A model of real-time distributed systems....Pages 462-481
Back Matter....Pages 483-486
Content:
Front Matter....Pages i-ix
Extended static checking....Pages 1-1
From Lattices to Practical Formal Hardware Verification....Pages 3-3
Programming with Tabling in XSB....Pages 5-5
Verifying Electronic Control Units — today and tomorrow....Pages 7-7
Teaching Calculational Logic....Pages 9-9
Types for Trees....Pages 11-29
Structures for lazy semantics....Pages 30-48
A proof theory of asynchronously communicating sequential processes....Pages 49-67
Bisimulations in the Join-Calculus....Pages 68-86
Using State Space Exploration and a Natural Deduction Style Message Derivation Engine to Verify Security Protocols....Pages 87-106
Programming Language Semantics in Foundational Type Theory....Pages 107-125
An Algebraic Approach to the Specification of Stochastic Systems (Extended Abstract)....Pages 126-147
Refinement types for specification....Pages 148-166
An extension of the program derivation format....Pages 167-185
Deadlines are termination....Pages 186-204
The design of a linearization of a concurrent data object....Pages 205-224
Final semantics for the ?-calculus....Pages 225-243
Comparing CTL and PCTL on Labeled Markov Chains....Pages 244-262
Reactive Functional Programming....Pages 263-284
Imperative Objects and Mobile Processes....Pages 285-303
Relating Linear and Branching Model Checking....Pages 304-326
Verifying Duration Properties of Timed Transition Systems....Pages 327-345
Towards Squiggly Refinement Algebra....Pages 346-365
Towards a Theory of Sequential Hybrid Programs....Pages 366-384
Test Selection for Object-Oriented Software Based on Formal Specifications....Pages 385-403
Logical Foundations for Typed Object-Oriented Languages....Pages 404-423
Verifying a Self-Stabilizing Mutual Exclusion Algorithm....Pages 424-443
A Combination of Interval Logic and Linear Temporal Logic....Pages 444-461
A model of real-time distributed systems....Pages 462-481
Back Matter....Pages 483-486
....