Formal Techniques for Networked and Distributed Systems - FORTE 2002 22nd IFIP WG 6.1 International Conference Houston, Texas, USA, November 11-14, 2002, Proceedings /
The IFIP TC6 WG 6.1 Joint International Conference on Formal Techniques for Networked and Distributed Systems, FORTE 2002, was held this year at Rice University, Houston, Texas, on November 11-14. This annual conference provides a forum for researchers and practitioners from universities and industr...
Συγγραφή απο Οργανισμό/Αρχή: | |
---|---|
Άλλοι συγγραφείς: | , |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2002.
|
Έκδοση: | 1st ed. 2002. |
Σειρά: | Lecture Notes in Computer Science,
2529 |
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- Encoding PAMR into (Timed) EFSMs
- Submodule Construction for Specifications with Input Assumptions and Output Guarantees
- Congruent Weak Conformance, a Partial Order among Processes
- Symmetric Symbolic Safety-Analysis of Concurrent Software with Pointer Data Structures
- A Nested Depth First Search Algorithm for Model Checking with Symmetry Reduction
- Protocol Techniques for Testing Radiotherapy Accelerators
- System Test Synthesis from UML Models of Distributed Software
- Formal Test Purposes and the Validity of Test Cases
- Use of Logic to Describe Enhanced Communications Services
- A Formal Venture into Reliable Multicast Territory
- Modelling SIP Services Using Cress
- Verifying Reliable Data Transmission over UMTS Radio Interface with High Level Petri Nets
- Verifying Randomized Byzantine Agreement_
- Automatic SAT-Compilation of Protocol Insecurity Problems via Reduction to Planning
- Visual Specifications for Modular Reasoning about Asynchronous Systems
- Bounded Model Checking for Timed Systems
- C Wolf - A Toolset for Extracting Models from C Programs
- NTIF: A General Symbolic Model for Communicating Sequential Processes with Data
- Building Tools for LOTOS Symbolic Semantics in Maude
- From States to Transitions: Improving Translation of LTL Formulae to Büchi Automata
- A Compositional Sweep-Line State Space Exploration Method
- On Combining the Persistent Sets Method with the Covering Steps Graph Method
- Innovative Verification Techniques Used in the Implementation of a Third-Generation 1.1GHz 64b Microprocessor
- Mechanical Translation of I/O Automaton Specifications into First-Order Logic
- Verification of Event-Based Synchronization of SpecC Description Using Difference Decision Diagrams
- A Distributed Partial Order Reduction Algorithm.