![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
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 159 matches
- 2018
- Eric C. R. Hehner:
A Theory of Lazy Imperative Timing. Refine@FM 2018: 1-9 - Ian J. Hayes:
Some Challenges of Specifying Concurrent Program Components. Refine@FM 2018: 10-22 - Graeme Smith
, Kirsten Winter, Robert J. Colvin:
Correctness of Concurrent Objects under Weak Memory Models. Refine@FM 2018: 53-67 - Emil Sekerinski, Shucai Yao:
Refining Santa: An Exercise in Efficient Synchronization. Refine@FM 2018: 68-86 - Mathieu Montin, Marc Pantel:
Ordering Strict Partial Orders to Model Behavioral Refinement. Refine@FM 2018: 23-38 - Marwa Benabdelali, Lamia Labed Jilani, Wided Ghardallou, Ali Mili:
Programming Without Refining. Refine@FM 2018: 39-52 - John Derrick
, Brijesh Dongol
, Steve Reeves
:
Proceedings 18th Refinement Workshop, Refine@FM 2018, Oxford, UK, 18th July 2018. EPTCS 282, 2018 [contents] - 2016
- John Derrick
, Eerke A. Boiten, Steve Reeves
:
Proceedings 17th International Workshop on Refinement, Refine@FM 2015, Oslo, Norway, 22nd June 2015. EPTCS 209, 2016 [contents] - 2015
- Eerke A. Boiten:
Big Data Refinement. Refine@FM 2015: 17-23 - Nafi Diallo, Wided Ghardallou, Jules Desharnais, Ali Mili:
Program Derivation by Correctness Enhacements. Refine@FM 2015: 57-70 - Brijesh Dongol
, Lindsay Groves:
Towards linking correctness conditions for concurrent objects and contextual trace refinement. Refine@FM 2015: 107-111 - Thomas Fayolle, Marc Frappier, Régine Laleau, Frédéric Gervais:
Formal refinement of extended state machines. Refine@FM 2015: 1-16 - Jason Koenig, K. Rustan M. Leino:
Programming Language Features for Refinement. Refine@FM 2015: 87-106 - Alexandre Madeira
, Manuel A. Martins
, Luís Soares Barbosa
:
A logic for n-dimensional hierarchical refinement. Refine@FM 2015: 40-56 - Alvaro Miyazawa
, Ana Cavalcanti
:
SCJ-Circus: a refinement-oriented formal notation for Safety-Critical Java. Refine@FM 2015: 71-86 - Mats Neovius, Luigia Petre, Kaisa Sere:
A Theory of Service Dependency. Refine@FM 2015: 112-128 - Gerard Ekembe Ngondi:
Unifying Theories of Mobile Channels. Refine@FM 2015: 24-39 - 2011
- Maria Teresa Llano, Andrew Ireland, Alison Pease
:
Discovery of Invariants through Automated Theory Formation. Refine@FM 2011: 1-19 - Gian Perrone, Søren Debois, Thomas T. Hildebrandt:
Bigraphical Refinement. Refine@FM 2011: 20-36 - John Derrick
, Siobhán North
, Anthony J. H. Simons
:
Building a refinement checker for Z. Refine@FM 2011: 37-52 - César Jesus Rodrigues, Manuel A. Martins
, Alexandre Madeira
, Luís Soares Barbosa
:
Refinement by interpretation in π-institutions. Refine@FM 2011: 53-64 - Alvaro Miyazawa
, Ana Cavalcanti
:
Refinement-based verification of sequential implementations of Stateflow charts. Refine@FM 2011: 65-83 - Steve Reeves
, David Streader:
Refinement for Probabilistic Systems with Nondeterminism. Refine@FM 2011: 84-100 - Ukachukwu Ndukwu, Annabelle McIver
:
Model exploration and analysis for quantitative safety refinement in probabilistic B. Refine@FM 2011: 101-120 - Richard Banach, Huibiao Zhu, Wen Su, Runlei Huang:
Formalising the Continuous/Discrete Modeling Step. Refine@FM 2011: 121-138 - Steve A. Schneider, Helen Treharne
, Heike Wehrheim:
A CSP Account of Event-B Refinement. Refine@FM 2011: 139-154 - Eerke A. Boiten
:
Perspicuity and Granularity in Refinement. Refine@FM 2011: 155-165 - Pontus Boström
, Fredrik Degerlund, Kaisa Sere, Marina Waldén:
Concurrent Scheduling of Event-B Models. Refine@FM 2011: 166-182 - John Derrick, Eerke A. Boiten, Steve Reeves:
Proceedings 15th International Refinement Workshop, Refine@FM 2011, Limerick, Ireland, 20th June 2011. EPTCS 55, 2011 [contents] - 2009
- Eerke A. Boiten
, John Derrick
, Steve Reeves
:
Preface. REFINE@FMWeek 2009: 1
skipping 129 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-09-03 02:13 CEST 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