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 43 matches
- 1995
- Dieter Hogrefe, Stefan Leue:
Formal Description Techniques VII, Proceedings of the 7th IFIP WG6.1 International Conference on Formal Description Techniques, Berne, Switzerland, 1994. IFIP Conference Proceedings 6, Chapman & Hall 1995, ISBN 0-412-64450-9 [contents] - 1994
- Jos C. M. Baeten, Sjouke Mauw:
Delayed choice: an operator for joining Message Sequence Charts. FORTE 1994: 340-354 - Marco Bernardo, Lorenzo Donatiello, Roberto Gorrieri:
Integrated analysis of concurrent distributed systems using Markovian process algebra. FORTE 1994: 455-457 - Bhed Bahadur Bista, Zixue Cheng, Atsushi Togashi, Norio Shiratori:
A synthesis algorithm of a protocol model from a single entity. FORTE 1994: 477-492 - Stefan Böhmer, Ralf Klafka:
A new approach to performance evaluation of formally specified protocols. FORTE 1994: 452-454 - B. Botma, Rom Langerak:
Simulator for LOTOS to study the independence and causality of events. FORTE 1994: 221-223 - Jan Bredereke, Reinhard Gotzhein:
Specification, detection and resolution of IN feature interactions with Estelle. FORTE 1994: 376-378 - S. Le Bricquir, A. Lauzanne:
Validation of supplementary services in the context of interoperability. FORTE 1994: 119-134 - Thierry Cattel:
Modelization and verification of a multiprocessor realtime OS kernel. FORTE 1994: 55-70 - Zixue Cheng, Tongjun Huang, Norio Shiratori:
A new distributed algorithm for implementation of LOTOS. FORTE 1994: 493-504 - Jean-Pierre Courtiat, Djamel-Eddine Saïdouni:
Relating maximality-based semantics to action refinement in process algebras. FORTE 1994: 293-308 - Jim Davies, Matt Wallis:
On the formal specification and verification of network routing algorithms. FORTE 1994: 100-115 - Conrado Daws, Alfredo Olivero, Sergio Yovine:
Verifying ET-LOTOS programmes with KRONOS. FORTE 1994: 227-242 - Alessandro Fantechi, Stefania Gnesi, R. Sacchelli:
Tableau methods to describe strong bisimilarity on LOTOS processes involving pure interleaving and enabling. FORTE 1994: 218-220 - Franco Fiore, Fosca Giannotti:
An abstract interpreter for the specification language LOTOS. FORTE 1994: 309-323 - Hacène Fouchal, Ana R. Cavalli:
A modal based verification for LOTOS. FORTE 1994: 215-217 - Oliverio González, Victor G. García, Miguel Riesco, Enrique Vázquez:
Design of operating systems using the F.D.T. ESTELLE. FORTE 1994: 71-86 - Jean-Charles Grégoire:
Verification model reduction through abstractions. FORTE 1994: 280-282 - Willem Hengeveld, Peter van der Toorn, Geert-Jan Houben:
Using formal specification and simulation: practical experience with distributed applications. FORTE 1994: 151-162 - Jane Hillston, Holger Hermanns, Ulrich Herzog, Vassilis Mertsiotakis, Michael Rettelbach:
Stochastic process algebras: integrating qualitative and quantitative modelling. FORTE 1994: 449-451 - Eckhardt Holz, Ketil Stølen:
An attempt to embed a restricted version of SDL as a target language in Focus. FORTE 1994: 324-339 - Gerard J. Holzmann:
Proving the value of formal methods. FORTE 1994: 385-396 - Gerard J. Holzmann, Doron A. Peled:
An improvement in formal verification. FORTE 1994: 197-211 - Tomasz Janowski:
Stepwise transformations for fault-tolerant design of CCS processes. FORTE 1994: 505-520 - Yoshiaki Kakuda, Hiroyuki Asada, Tohru Kikuno:
Application of protocol sythesis technique to resolution of the service interaction problem. FORTE 1994: 379-381 - Pim Kars:
Representation of process-gate nets in LOTOS and verification of LOTOS laws: the Boolean algebra approach. FORTE 1994: 165-180 - Alain Kerbrat:
Reachable state space analysis of LOTOS specifications. FORTE 1994: 181-196 - H. Kremer:
Derivation of efficient implementations from formal descriptions - issues, methods and conformance. FORTE 1994: 431-446 - Peter B. Ladkin, Stefan Leue:
Four issues concerning the semantics of Message Flow Graphs. FORTE 1994: 355-369 - Leslie Lamport:
How good is your specification method? FORTE 1994: 289
skipping 13 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-22 22:28 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