Formal Techniques for Networked and Distributed Systems FORTE 2001

Formal Techniques for Networked and Distributed Systems FORTE 2001 / edited by Myungchul Kim, Byoungmoon Chin, Sungwon Kang, Danhyung Lee.

FORTE 2001, formerly FORTE/PSTV conference, is a combined conference of FORTE (Formal Description Techniques for Distributed Systems and Communication Protocols) and PSTV (Protocol Specification, Testing and Verification) conferences. This year the conference has a new name FORTE (Formal Techniques...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Myungchul Kim (Editor), Byoungmoon Chin (Editor), Sungwon Kang (Editor), Danhyung Lee (Editor)
Format: eBook
Language:English
Published: New York, NY : Springer US : Imprint: Springer, 2001.
Edition:1st ed. 2001.
Series:IFIP Advances in Information and Communication Technology, 69
Springer eBook Collection.
Subjects:
Computer communication systems.
Artificial intelligence.
Microprocessors.
Software engineering.
Electrical engineering.
Electronic resources (E-books)
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Table of Contents:
  • Formal Methods in Software Development I
  • Automated Derivation of ILP Implementations from SDL Specifications
  • Stepwise Design with Message Sequence Charts
  • Formal Synthesis and Control of Soft Embedded Real-Time Systems
  • Distributed Systems Testing
  • Towards a Formal Framework for Interoperability Testing
  • Distributed Test Using Logical Clock
  • Diagnosing Multiple Faults in Communicating Finite State Machines
  • From Active to Passive: Progress in Testing of Internet Routing Protocols
  • Timed Automata
  • Time and Action Lock Freedom Properties for Timed Automata
  • Compiling Real-time Scenarios into a Timed Automaton
  • Deriving Parameter Conditions for Periodic Timed Automata Satisfying Real-time Temporal Logic Formulas
  • Process Algebra
  • PAMR: A Process Algebra for the Management of Resources in Concurrent Systems
  • A Symbolic Semantics and Bisimulation for Full Lotos
  • Implementing a Modal Logic Over Data and Processes Using XTL
  • Applications of Verification
  • Formal Verification of Peephole Optimizations in Asynchronous Circuits
  • Symbolic Verification of Complex Real-time Systems with Clock-restriction Diagram
  • Verifying a Sliding-Window Protocol Using PVS
  • Test Sequence Derivation
  • Test Sequence Selection
  • Executable Test Sequence for the Protocol Data Flow Property
  • A Method to Generate Conformance Test Sequences for FSM with Timer System Call
  • Formal Methods in Software Development II
  • A Tool for Generating Specifications from A Family of Formal Requirements
  • Patterns and Rules for Behavioural Subtyping
  • Theories of Verification
  • Verification of Dense Time Properties Using Theories of Untimed Process Algebra
  • Testing Liveness Properties
  • SVL: A Scripting Language for Compositional Verification
  • Invited Papers
  • On Formal Techniques in Protocol Engineering — Example Challenges
  • A PKI-based End-To-End Secure Infrastructure for Mobile E-Commerce
  • A Family of Resource-Bound Real-Time Process Algebras
  • Survivability Analysis of Networked Systems.

Similar Items