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 20 matches
- 1992
- Antonio Cau, Ruurd Kuiper, Willem-Paul de Roever:
Formalising Dijkstra's Development Strategy within Stark's Formalism. Refine 1992: 4-42 - Tim Clement:
Using Metavariables in Natural Deduction Proofs. Refine 1992: 255-271 - Morten Elvang-Gøransson:
Classification of Refinements in VDM. Refine 1992: 172-180 - Andrew M. Gravell:
Constructive Refinement of First Order Specifications. Refine 1992: 181-210 - Lindsay Groves, Raymond G. Nickson, Mark Utting:
A Tactic Driven Refinement Tool. Refine 1992: 272-297 - Jim Grundy:
A Window Inference Tool for Refinement. Refine 1992: 230-254 - Roger Bishop Jones:
Methods and Tools for the Verification of Critical Properties. Refine 1992: 88-118 - Robin Milner:
Concurrent Processes as Objects. Refine 1992: 3 - Maurice Naftalin:
A Model of the Refinement Process. Refine 1992: 211-229 - Patrick O'Ferrall:
Opening Address. Refine 1992: 1-2 - Colin O'Halloran:
Refinement and Confidentiality. Refine 1992: 119-139 - José N. Oliveira:
Software Reification using the SETS Calculus. Refine 1992: 140-171 - C. T. Sennett:
Demonstrating the Compliance of Ada Programs with Z Specifications. Refine 1992: 70-87 - Ketil Stølen:
Proving Total Correctness with Respect to a Fair (Shared-State) Parallel Language. Refine 1992: 320-341 - Martin P. Ward:
A Recursion Removal Theorem. Refine 1992: 43-69 - Jeannette M. Wing:
Revisiting Abstraction Functions For Reasoning About Concurrency. Refine 1992: 298-300 - J. C. P. Woodcock:
Implementing Promoted Operations in Z. Refine 1992: 367-378 - Qiwen Xu, Jifeng He:
A case study in formally developing state-based parallel programs - the Dutch National Torus. Refine 1992: 301-319 - Job Zwiers, J. Coenen, Willem P. de Roever:
A Note on Compositional Refinement. Refine 1992: 342-366 - Cliff B. Jones, Roger C. Shaw, B. Tim Denvir:
5th Refinement Workshop, Proceedings of the 5th Refinement Workshop, organised by BCS-FACS, London, 8-10 January 1992. Workshops in Computing, Springer London 1992, ISBN 978-3-540-19752-2 [contents]
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-12-23 01:59 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