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 35 matches
- 2010
- Jiri Barnat, Lubos Brim, Petr Rockai:
Parallel Partial Order Reduction with Topological Sort Proviso. SEFM 2010: 222-231 - José Bernardo Barros, Daniela Carneiro da Cruz, Pedro Rangel Henriques, Jorge Sousa Pinto:
Assertion-based Slicing and Slice Graphs. SEFM 2010: 93-102 - Massimo Bartoletti, Roberto Zunino:
Static Enforcement of Service Deadlines. SEFM 2010: 320-324 - Davide Benetti, Massimo Merro, Luca Viganò:
Model Checking Ad Hoc Network Routing Protocols: ARAN vs. endairA. SEFM 2010: 191-202 - Marcello M. Bersani, Luca Cavallaro, Achille Frigeri, Matteo Pradella, Matteo Rossi:
SMT-based Verification of LTL Specification with Integer Constraints and its Application to Runtime Checking of Service Substitutability. SEFM 2010: 244-254 - Maximiliano Cristiá, Pablo Albertengo, Pablo Rodríguez Monetti:
Pruning Testing Trees in the Test Template Framework by Detecting Mathematical Contradictions. SEFM 2010: 268-277 - Haitao Dan, Robert M. Hierons, Steve Counsell:
Non-local Choice and Implied Scenarios. SEFM 2010: 53-62 - Jose Pablo Escobedo, Christophe Gaston, Pascale Le Gall, Ana R. Cavalli:
Testing Web Service Orchestrators in Context: A Symbolic Approach. SEFM 2010: 257-267 - María-del-Mar Gallardo, David Sanán:
Verification of Dynamic Data Tree with mu-calculus Extended with Separation. SEFM 2010: 211-221 - Stefan J. Galler, Martin Weiglhofer, Franz Wotawa:
Synthesize It: From Design by Contract to Meaningful Test Input Data. SEFM 2010: 286-295 - Carlo Ghezzi:
Adaptive Software Needs Continuous Verification. SEFM 2010: 3-4 - Dimitra Giannakopoulou:
"Fly Me to the Moon": Verification of Aerospace Systems. SEFM 2010: 5-11 - Michael Goldsmith, Sadie Creese:
Refinement-Friendly Bigraphs and Spygraphs. SEFM 2010: 203-207 - Thomas Göthel, Sabine Glesner:
Towards the Semi-Automatic Verification of Parameterized Real-Time Systems Using Network Invariants. SEFM 2010: 310-314 - Niusha Hakimipour, Paul A. Strooper, Andy J. Wellings:
TART: Timed-Automata to Real-Time Java Tool. SEFM 2010: 299-309 - Ábel Hegedüs, Gábor Bergmann, István Ráth, Dániel Varró:
Back-annotation of Simulation Traces with Change-Driven Model Transformations. SEFM 2010: 145-155 - Faraz Hussain, Gary T. Leavens:
temporaljmlc: A JML Runtime Assertion Checker Extension for Specification and Checking of Temporal Properties. SEFM 2010: 63-72 - Emilia Katz, Shmuel Katz:
User Queries for Specification Refinement Treating Shared Aspect Join Points. SEFM 2010: 73-82 - Adrien De Kermadec, Frédéric Dadeau, Fabrice Bouquet:
Assessing the Quality of B Models. SEFM 2010: 83-90 - Natallia Kokash, Christian Krause, Erik P. de Vink:
Time and Data-Aware Analysis of Graphical Service Models in Reo. SEFM 2010: 125-134 - Peter Gorm Larsen, Kenneth Lausdahl, Nick Battle:
Combinatorial Testing for VDM. SEFM 2010: 278-285 - Christian Leuxner, Wassiou Sitou, Bernd Spanfelner:
A Formal Model for Work Flows. SEFM 2010: 135-144 - Peter A. Lindsay:
Behavior Trees: From Systems Engineering to Software Engineering. SEFM 2010: 21-30 - Peter A. Lindsay, Kirsten Winter, Nisansala Yatapanage:
Safety Assessment Using Behavior Trees and Model Checking. SEFM 2010: 181-190 - Mieke Massink, Diego Latella, Andrea Bracciali, Michael D. Harrison:
A Scalable Fluid Flow Process Algebraic Approach to Emergency Egress Analysis. SEFM 2010: 169-180 - Daniel Le Métayer, Eduardo Mazza, Marie-Laure Potet:
Designing Log Architectures for Legal Evidence. SEFM 2010: 156-165 - Dusko Pavlovic:
The Unreasonable Ineffectiveness of Security Engineering: An Overview. SEFM 2010: 12-18 - Daniel Powell:
Behavior Engineering - A Scalable Modeling and Analysis Method. SEFM 2010: 31-40 - Giuseppe Scanniello, Michele Risi, Genoveffa Tortora:
Architecture Recovery Using Latent Semantic Indexing and K-Means: An Empirical Evaluation. SEFM 2010: 103-112 - Cristina Tudose, Radu Opria:
A Method for Testing Software Systems Based on State Design Pattern Using Symbolic Execution. SEFM 2010: 113-117
skipping 5 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 2025-01-09 22:48 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