Остановите войну!
for scientists:
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 54 matches
- 2009
- Wolfgang Ahrendt, Frank S. de Boer, Immo Grabe:
Abstract Object Creation in Dynamic Logic. FM 2009: 612-627 - Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla:
Field-Sensitive Value Analysis by Field-Insensitive Analysis. FM 2009: 370-386 - María Alpuente, Demis Ballis, Daniel Romero:
Specification and Verification of Web Applications in Rewriting Logic. FM 2009: 790-805 - Juan Bicarregui, John S. Fitzgerald, Peter Gorm Larsen, J. C. P. Woodcock:
Industrial Practice in Formal Methods: A Review. FM 2009: 810-813 - Borzoo Bonakdarpour, Sandeep S. Kulkarni:
On the Complexity of Synthesizing Relaxed and Graceful Bounded-Time 2-Phase Recovery. FM 2009: 660-675 - Nicola Bonzanni, K. Anton Feenstra, Wan J. Fokkink, Elzbieta Krepska:
What Can Formal Methods Bring to Systems Biology? FM 2009: 16-22 - Raymond T. Boute:
Making Temporal Logic Calculational: A Tool for Unification and Discovery. FM 2009: 387-402 - Yifeng Chen, Jeff W. Sanders:
Unifying Probability with Nondeterminism. FM 2009: 467-482 - Edgar G. Daylight, Sandeep K. Shukla:
On the Difficulties of Concurrent-System Design, Illustrated with a 2×2 Switch Case Study. FM 2009: 273-288 - Rik Eshuis:
Translating Safe Petri Nets to Statecharts in a Structure-Preserving Way. FM 2009: 239-255 - Pawel Gancarski, Andrew Butterfield:
The Denotational Semantics of slotted-Circus. FM 2009: 451-466 - Holger Gast:
Reasoning about Memory Layouts. FM 2009: 628-643 - Theophilos Giannakopoulos, Daniel J. Dougherty, Kathi Fisler, Shriram Krishnamurthi:
Towards an Operational Semantics for Alloy. FM 2009: 483-498 - Artur Oliveira Gomes, Marcel Vinícius Medeiros Oliveira:
Formal Specification of a Cardiac Pacing System. FM 2009: 692-707 - William R. Harris, Nicholas Kidd, Sagar Chaki, Somesh Jha, Thomas W. Reps:
Verifying Information Flow Control over Unbounded Processes. FM 2009: 773-789 - Osman Hasan, Naeem Abbasi, Behzad Akbarpour, Sofiène Tahar, Reza Akbarpour:
Formal Reasoning about Expectation Properties for Continuous Random Variables. FM 2009: 435-450 - Faranak Heidarian, Julien Schmaltz, Frits W. Vaandrager:
Analysis of a Clock Synchronization Protocol for Wireless Sensor Networks. FM 2009: 516-531 - Ulrik H. Hjort, Jacob Illum Rasmussen, Kim Guldstrand Larsen, Michael A. Petersen, Arne Skou:
Model-Based GUI Testing Using Uppaal at Novo Nordisk. FM 2009: 814-818 - Jochen Hoenicke, K. Rustan M. Leino, Andreas Podelski, Martin Schäf, Thomas Wies:
It's Doomed; We Can Prove It. FM 2009: 338-353 - Joxan Jaffar, Andrew E. Santosa:
Recursive Abstractions for Parameterized Systems. FM 2009: 72-88 - Ralph D. Jeffords, Constance L. Heitmeyer, Myla Archer, Elizabeth I. Leonard:
A Formal Method for Developing Provably Correct Fault-Tolerant Systems Using Partial Refinement and Composition. FM 2009: 173-189 - Einar Broch Johnsen, Marcel Kyas, Ingrid Chieh Yu:
Dynamic Classes: Modular Asynchronous Evolution of Distributed Concurrent Objects. FM 2009: 596-611 - Steffen Jost, Hans-Wolfgang Loidl, Kevin Hammond, Norman Scaife, Martin Hofmann:
"Carbon Credits" for Resource-Bounded Computations Using Amortised Analysis. FM 2009: 354-369 - Michael Kohlhase, Johannes Lemburg, Lutz Schröder, Ewaryst Schulz:
Formal Management of CAD/CAM Processes. FM 2009: 223-238 - Frédéric Lang, Radu Mateescu:
Partial Order Reductions Using Compositional Confluence Detection. FM 2009: 157-172 - Kim Guldstrand Larsen, Shuhao Li, Brian Nielsen, Saulius Pusinskas:
Verifying Real-Time Systems against Scenario-Based Requirements. FM 2009: 676-691 - Kenneth Lausdahl, Hans Kristian Agerlund Lintrup, Peter Gorm Larsen:
Connecting UML and VDM++ with Open Tool Support. FM 2009: 563-578 - Dirk Leinenbach, Thomas Santen:
Verifying the Microsoft Hyper-V Hypervisor with VCC. FM 2009: 806-809 - Michael Leuschel, Jérôme Falampin, Fabian Fritz, Daniel Plagge:
Automated Property Verification for Large Scale B Models. FM 2009: 708-723 - Yang Liu, Wei Chen, Yanhong A. Liu, Jun Sun:
Model Checking Linearizability via Refinement. FM 2009: 321-337
skipping 24 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-08-26 03:33 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