default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID22nd FORTE 2002: Houston, Texas, USA
- Doron A. Peled, Moshe Y. Vardi:
Formal Techniques for Networked and Distributed Systems - FORTE 2002, 22nd IFIP WG 6.1 International Conference Houston, Texas, USA, November 11-14, 2002, Proceedings. Lecture Notes in Computer Science 2529, Springer 2002, ISBN 3-540-00141-7 - Manuel Núñez, Ismael Rodríguez:
Encoding PAMR into (Timed) EFSMs. 1-16 - Gregor von Bochmann:
Submodule Construction for Specifications with Input Assumptions and Output Guarantees. 17-33 - Ronald W. Brower, Kenneth S. Stevens:
Congruent Weak Conformance, a Partial Order among Processes. 34-49 - Farn Wang, Karsten Schmidt:
Symmetric Symbolic Safety-Analysis of Concurrent Software with Pointer Data Structures. 50-64 - Dragan Bosnacki:
A Nested Depth First Search Algorithm for Model Checking with Symmetry Reduction. 65-80 - Kenneth J. Turner, Qian Bing:
Protocol Techniques for Testing Radiotherapy Accelerators. 81-96 - Simon Pickin, Claude Jard, Yves Le Traon, Thierry Jéron, Jean-Marc Jézéquel, Alain Le Guennec:
System Test Synthesis from UML Models of Distributed Software. 97-113 - Peter H. Deussen, Stephan Tobies:
Formal Test Purposes and the Validity of Test Cases. 114-129 - Stephan Reiff-Marganiec, Kenneth J. Turner:
Use of Logic to Describe Enhanced Communications Services. 130-145 - Carolos Livadas, Nancy A. Lynch:
A Formal Venture into Reliable Multicast Territory. 146-161 - Kenneth J. Turner:
Modelling SIP Services Using CRESS. 162-177 - Teemu Tynjälä, Sari Leppänen, Vesa Luukkala:
Verifying Reliable Data Transmission over UMTS Radio Interface with High Level Petri Nets. 178-193 - Marta Z. Kwiatkowska, Gethin Norman:
Verifying Randomized Byzantine Agreement. 194-209 - Alessandro Armando, Luca Compagna:
Automatic SAT-Compilation of Protocol Insecurity Problems via Reduction to Planning. 210-225 - Nina Amla, E. Allen Emerson, Kedar S. Namjoshi, Richard J. Trefler:
Visual Specifications for Modular Reasoning about Asynchronous Systems. 226-242 - Gilles Audemard, Alessandro Cimatti
, Artur Kornilowicz, Roberto Sebastiani:
Bounded Model Checking for Timed Systems. 243-259 - Daniel C. DuVarney, S. Purushothaman Iyer:
C Wolf - A Toolset for Extracting Models from C Programs. 260-275 - Hubert Garavel, Frédéric Lang:
NTIF: A General Symbolic Model for Communicating Sequential Processes with Data. 276-291 - Alberto Verdejo:
Building Tools for LOTOS Symbolic Semantics in Maude. 292-307 - Dimitra Giannakopoulou, Flavio Lerda:
From States to Transitions: Improving Translation of LTL Formulae to Büchi Automata. 308-326 - Lars Michael Kristensen, Thomas Mailund:
A Compositional Sweep-Line State Space Exploration Method. 327-343 - Pierre-Olivier Ribet, François Vernadat, Bernard Berthomieu:
On Combining the Persistent Sets Method with the Covering Steps Graph Method. 344-359 - Victor Melamed, Harry Stuimer, David Wilkins, Lawrence Chang, Kevin Normoyle, Sutikshan Bhutani:
Innovative Verification Techniques Used in the Implementation of a Third-Generation 1.1GHz 64b Microprocessor. 360-363 - Andrej Bogdanov, Stephen J. Garland, Nancy A. Lynch:
Mechanical Translation of I/O Automaton Specifications into First-Order Logic. 364-368 - Thanyapat Sakunkonchak, Masahiro Fujita:
Verification of Event-Based Synchronization of SpecC Description Using Difference Decision Diagrams. 369 - Robert Palmer, Ganesh Gopalakrishnan:
A Distributed Partial Order Reduction Algorithm. 370
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
