default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 37 matches
- 1998
- Atsushi Togashi, Tadanori Mizuno, Norio Shiratori, Teruo Higashino:
Formal Description Techniques and Protocol Specification, Testing and Verification, FORTE X / PSTV XVII'97, IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE X) and Protocol Specification, Testing and Verification (PSTV XVII), 18-21 November, 1997, Osaka, Japan. IFIP Conference Proceedings 107, Chapman & Hall 1998, ISBN 0-412-82060-9 [contents] - 1997
- Parosh Aziz Abdulla, Mats Kindahl, Doron A. Peled:
An Improved Search Strategy for Lossy Channel Systems. FORTE 1997: 251-264 - Toshihiko Ando, Kaoru Takahashi, Yasushi Kato:
On a Concurrency Calculus for Design of Mobile Telecommunication Systems. FORTE 1997: 535-546 - James H. Andrews, Nancy A. Day, Jeffrey J. Joyce:
Using a Formal Description Technique to Model Aspects of a Global Air Traffic Telecommunications Network. FORTE 1997: 417-432 - L. Andriantsiferana, Jean-Pierre Courtiat, Roberto C. de Oliveira, L. Picci:
An Experiment in using RT-LOTOS for the Formal Specification and Verification of a Distributed Scheduling Algorithm in a Nuclear Power Plant Monitoring System. FORTE 1997: 433-448 - Roberto Barbuti, Nicoletta De Francesco, Antonella Santone, Gigliola Vaglini:
Selective µ-calculus: New Modal Operators for Proving Properties on Reduced Transition Systems. FORTE 1997: 519-534 - Hanêne Ben-Abdallah, Stefan Leue:
Timing Constraints in Message Sequence Chart Specifications. FORTE 1997: 91-106 - Girish Bhat, Rance Cleaveland, Gerald Lüttgen:
Dynamic Priorities for Modeling Real-Time. FORTE 1997: 321-336 - Henry Chang:
Distributed Object Consistency in Mobile Environments. FORTE 1997: 483 - Gyula Csopaki, Kenneth J. Turner:
Modelling Digital Logic in SDL. FORTE 1997: 367-382 - Joubine Dustzadeh, Elie Najm:
Consistent Semantics for ODP Information and Computational Models. FORTE 1997: 107-126 - André Engels, Sjouke Mauw, Michel A. Reniers:
A Hierarchy of Communication Models for Message Sequence Charts. FORTE 1997: 75-90 - Clemens Fischer, Graeme Smith:
Combining CSP and Object-Z: Finite or Infinite Trace Semantics? FORTE 1997: 503-518 - David de Frutos-Escrig, Luis Fernando Llana Díaz, Manuel Núñez:
Friendly Testing as a Conformance Relation. FORTE 1997: 283-298 - François Germeau, Guy Leduc:
A Computer Aided Design of a Secure Registration Protocol. FORTE 1997: 145-160 - Roland Groz, Nathalie Risser:
Eight Years of Experience in Test Generation from FDTs using TVEDA. FORTE 1997: 465-480 - Lex Heerink, Jan Tretmans:
Refusal Testing for Classes of Transition Systems with Inputs and Outputs. FORTE 1997: 23-38 - Ralf Henke, Andreas Mitschele-Thiel, Hartmut König:
On the Influence of Semantic Constraints on the Code Generation from Estelle Specifications. FORTE 1997: 399-414 - Christian Hernalsteen:
A Timed Automaton Model for ET-LOTOS Verification. FORTE 1997: 193-204 - Manuel J. Fernández-Iglesias, Martín Llamas Nistal:
Algebraic Specification through Expression Transformation. FORTE 1997: 355-366 - Guy Juanole, Laurent Gallon:
Concept of Quantified Abstract Quotient Automaton and its Advantage. FORTE 1997: 223-238 - Sungwon Kang, Myungchul Kim:
Interoperability Test Suite Derivation for Symmetric Communication Protocols. FORTE 1997: 57-72 - Deukyoon Kang, Sungwon Kang, Myungchul Kim, Sangjo Yoo:
A Weighted Random Walk Approach for Conformance Testing of a System Specified as Communicating Finite State Machines. FORTE 1997: 267-282 - Toshihiko Kato, Tomohiko Ogishi, Akira Idoue, Kenji Suzuki:
Intelligent Protocol Analyzer with TCP Behavior Emulation for Interoperability Testing of TCP/IP Protocols. FORTE 1997: 449-464 - Giovanny F. Lucero, Juan Quemada:
Specifying the ODP Trader: An Introduction to E-LOTOS. FORTE 1997: 127-142 - Marek Musial:
On-Line Timed Protocol Trace Analysis Based on Uncertain State Descriptions. FORTE 1997: 337-352 - Shoichi Noguchi:
The Future Information Technology and its Impact to the Society. FORTE 1997: 317 - Seungjoon Park, Satyaki Das, David L. Dill:
Automatic Checking of Aggregation Abstractions Through State Enumeration. FORTE 1997: 207-222 - Ichiroh Sakakibara:
Network and Application for New Generation. FORTE 1997: 1 - Gurdip Singh, Hong Liu:
Validating Protocol Composition for Progress by Parallel Step Reachability Analysis. FORTE 1997: 239-250
skipping 7 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-11-11 04:51 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint