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 543 matches
- 2001
- Howard Bowman:
Formal Methods Elsewhere - a Satellite Workshop of FORTE-PSTV-2000 devoted to applications of formal methods to areas other than communication protocols and software engineering, FM-Elsewhere 2000, Pisa, Italy, October 2000. Electronic Notes in Theoretical Computer Science 43, Elsevier 2001 [contents] - 2000
- Michael von der Beeck:
A Concise Compositionalj Statecharts Semantics Definition. FORTE 2000: 335-350 - Massimo Benerecetti, Fausto Giunchiglia, Maurizio Panti, Luca Spalazzi:
A Logic of Belief and a Model Checking Algorithm for Security Protocols. FORTE 2000: 393-408 - Marco Bernardo, Marina Ribaudo, Nadia Busi:
Compact Net Semantics for Process Algebras. FORTE 2000: 319-334 - Michele Boreale, Rocco De Nicola, Rosario Pugliese:
Process Algebraic Analysis of Cryptographic Protocols. FORTE 2000: 375-392 - Giorgio Delzanno:
Verification of Consistency Protocols via Infinite-Stae Symbolic Model Checking. FORTE 2000: 171-186 - Luca Durante, Riccardo Sisto, Adriano Valenzano:
A State-Exploration Technique for Spi-Calculus Testing Equivalence Verification. FORTE 2000: 155-170 - Kousha Etessami, Mihalis Yannakakis:
From Rule-based to Automata-based Testing. FORTE 2000: 53-68 - Nancy D. Griffeth, Ruibing Hao, David Lee, Rakesh K. Sinha:
Integrated System Interoperability Testing with Applications to VOIP. FORTE 2000: 69-84 - Serge Haddad, Jean-Michel Ilié, Khalil Ajami:
A Model Checking Method for Partially Symmetric Systems. FORTE 2000: 121-136 - Ruibing Hao, David Lee, Rakesh K. Sinha, Dario Vlah:
Testing IP Routing Protocols - From Probabilistic Algorithms to a Software Tool. FORTE 2000: 249-264 - Ji He, Kenneth J. Turner:
Verifying and Testing Asynchronous Circuits using LOTOS. FORTE 2000: 267-283 - Ahmed Helmy, Sandeep Gupta, Deborah Estrin, Alberto Cerpa, Yan Yu:
Systematic Performance Evaluation of Multipoint Protocols. FORTE 2000: 189-204 - Hisaaki Katagiri, Masayuki Kirimura, Keiichi Yasumoto, Teruo Higashino, Kenichi Taniguchi:
Hardware implementation of Concurrent Periodic EFSM's. FORTE 2000: 285-300 - Mila E. Majster-Cederbaum, Frank Salger, Maria Sorea:
A Priori Verification of Reactive Systems. FORTE 2000: 35-50 - Doron A. Peled:
Specification and Verification of Message Sequence Charts. FORTE 2000: 139-154 - Alexandre Petrenko, Nina Yevtushenko:
On Test Derivation from Partial Specifications. FORTE 2000: 85-102 - Holger Pfeifer:
Formal Verification of the TTP Group Membership Algorithm. FORTE 2000: 3-18 - Basant Rajan, R. K. Shyamasundar:
Modeling Distributed Embedded Systems in Multiclock ESTEREL. FORTE 2000: 301-316 - John M. Rushby:
From Refutation to Verification. FORTE 2000: 369-374 - Antonella Santone:
Compositionality for Improving Model Checking. FORTE 2000: 105-120 - Mark A. Smith, Nils Klarlund:
Verification of a Sliding Window Protocol Using IOA and MONA. FORTE 2000: 19-34 - Thomas Steinert, Georg Rößler:
Generation of Realistic Signalling Traffic in an ISDN Load Test System using SDL User Models. FORTE 2000: 219-234 - Justin Templemore-Finlayson, Eugen Borcoci:
Simulating Multicast Transport Protocols in Estelle. FORTE 2000: 205-218 - Ulrich Ultes-Nitsche:
Satisfaction up to Liveness. FORTE 2000: 237-248 - Alberto Verdejo, Narciso Martí-Oliet:
Implementing CCS in Maude. FORTE 2000: 351-366 - Michael Baldamus, Klaus Schneider, Michael Wenz, Roberto Ziller:
Can American Checkers be Solved by Means of Symbolic Model Checking? FM-Everywhere@FORTE/PSTV 2000: 15-33 - Howard Bowman:
Formal Methods Elsewhere - A Satellite Workshop of FORTE-PSTV-2000 devoted to applications of formal methods to areas other than communication protocols and software engineering. FM-Everywhere@FORTE/PSTV 2000: 162-163 - Howard Bowman, Giorgio P. Faconti, Mieke Massink:
Towards Integrated Cognitive and Interface Analysis. FM-Everywhere@FORTE/PSTV 2000: 97-112 - Gavin J. Doherty, Giorgio P. Faconti, Mieke Massink:
Formal Verification in the Design of Gestural Interaction. FM-Everywhere@FORTE/PSTV 2000: 75-96
skipping 513 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-19 05:11 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