Остановите войну!
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 44 matches
- 2011
- Islam Abdelhalim, Steve A. Schneider, Helen Treharne:
Towards a Practical Approach to Check UML/fUML Models Consistency Using CSP. ICFEM 2011: 33-48 - Kyungmin Bae, Peter Csaba Ölveczky, Abdullah Al-Nayeem, José Meseguer:
Synchronous AADL and Its Formal Analysis in Real-Time Maude. ICFEM 2011: 651-667 - Andreas Bollin:
Is There Evolution Before Birth? Deterioration Effects of Formal Z Specifications. ICFEM 2011: 66-81 - Pontus Boström:
Contract-Based Verification of Simulink Models. ICFEM 2011: 291-306 - Jeremy W. Bryans:
Developing a Consensus Algorithm Using Stepwise Refinement. ICFEM 2011: 553-568 - Giulia Costantini, Pietro Ferrara, Agostino Cortesi:
Static Analysis of String Values. ICFEM 2011: 505-521 - Maximiliano Cristiá, Diego A. Hollmann, Pablo Albertengo, Claudia S. Frydman, Pablo Rodríguez Monetti:
A Language for Test Case Refinement in the Test Template Framework. ICFEM 2011: 601-616 - Maissa Elleuch, Osman Hasan, Sofiène Tahar, Mohamed Abid:
Formal Analysis of a Scheduling Algorithm for Wireless Sensor Networks. ICFEM 2011: 388-403 - Roozbeh Farahbod, Vladimir Avram, Uwe Glässer, Adel Guitouni:
A Formal Engineering Approach to High-Level Design of Situation Analysis Decision Support Systems. ICFEM 2011: 211-226 - Holger Gast:
Developer-Oriented Correctness Proofs - A Case Study of Cheney's Algorithm. ICFEM 2011: 489-504 - Rainer Gmehlich, Katrin Grau, Stefan Hallerstede, Michael Leuschel, Felix Lösch, Daniel Plagge:
On Fitting a Formal Method into Practice. ICFEM 2011: 195-210 - Walter Guttmann, Georg Struth, Tjark Weber:
Automating Algebraic Methods in Isabelle. ICFEM 2011: 617-632 - Stefan Hallerstede, Colin F. Snook:
Refining Nodes and Edges of State Machines. ICFEM 2011: 569-584 - Martin Hilscher, Sven Linker, Ernst-Rüdiger Olderog, Anders P. Ravn:
An Abstract Model for Proving Safety of Multi-lane Traffic Manoeuvres. ICFEM 2011: 404-419 - Thai Son Hoang, Jean-Raymond Abrial:
Reasoning about Liveness Properties in Event-B. ICFEM 2011: 456-471 - Alexei Iliasov, Linas Laibinis, Elena Troubitsyna, Alexander B. Romanovsky:
Formal Derivation of a Distributed Program in Event B. ICFEM 2011: 420-436 - Joabe Jesus, Alexandre Mota, Augusto Sampaio, Luiz Grijo:
Architectural Verification of Control Systems Using CSP. ICFEM 2011: 323-339 - Narges Khakpour, Marjan Sirjani, Ursula Goltz:
Context-Based Behavioral Equivalence of Components in Self-Adaptive Systems. ICFEM 2011: 16-32 - Masoud Koleini, Mark Ryan:
A Knowledge-Based Verification Method for Dynamic Access Control Policies. ICFEM 2011: 243-258 - Kenneth Lausdahl, Peter Gorm Larsen, Nick Battle:
A Deterministic Interpreter Simulating a Distributed Real Time System Using VDM. ICFEM 2011: 179-194 - Ewen Maclean, Andrew Ireland:
Mutation in Linked Data Structures. ICFEM 2011: 275-290 - João G. Martins, André Platzer, João Leite:
Statistical Model Checking for Distributed Probabilistic-Control Hybrid Automata with Smart Grid Applications. ICFEM 2011: 131-146 - Dapeng Mo, Xiaobing Wang, Zhenhua Duan:
Asynchronous Communication in MSVL. ICFEM 2011: 82-97 - Anh Cuong Nguyen, Siau-Cheng Khoo:
Extracting Significant Specifications from Mining through Mutation Testing. ICFEM 2011: 472-488 - Jonathan Nicholson:
A Theory of Classes from the Theoretical Foundations of LePUS3. ICFEM 2011: 522-536 - Peter W. O'Hearn:
Reasoning about Programs Using a Scientific Method. ICFEM 2011: 14 - David J. Power, Mark Slaymaker, Andrew Simpson:
Conformance Checking of Dynamic Access Control Policies. ICFEM 2011: 227-242 - Shaz Qadeer:
Poirot - A Concurrency Sleuth. ICFEM 2011: 15 - Nafees Qamar, Yves Ledru, Akram Idani:
Validation of Security-Design Models Using Z. ICFEM 2011: 259-274 - David W. Renshaw, Sarah M. Loos, André Platzer:
Distributed Theorem Proving for Distributed Hybrid Systems. ICFEM 2011: 356-371
skipping 14 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-04-25 11: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