• 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.

found 16 matches

• 2011
• 
  Christel Baier, Joachim Klein, Sascha Klüppelholz:
  Modeling and Verification of Components and Connectors. SFM 2011: 114-147
• 
  Antonia Bertolino, Antonello Calabrò, Felicita Di Giandomenico, Nicola Nostro:
  Dependability and Performance Assessment of Dynamic CONNECTed Systems. SFM 2011: 350-392
• 
  Gordon S. Blair, Massimo Paolucci, Paul Grace, Nikolaos Georgantas:
  Interoperability in Complex Distributed Systems. SFM 2011: 1-26
• 
  Dave Clarke, Nikolay Diakov, Reiner Hähnle, Einar Broch Johnsen, Ina Schaefer, Jan Schäfer, Rudolf Schlatte, Peter Y. H. Wong:
  Modeling Spatial and Temporal Variability with the HATS Abstract Behavioral Modeling Language. SFM 2011: 417-457
• 
  Gabriele Costa, Valérie Issarny, Fabio Martinelli, Ilaria Matteucci, Rachid Saadi:
  Security and Trust. SFM 2011: 393-416
• 
  Vojtech Forejt, Marta Z. Kwiatkowska, Gethin Norman, David Parker:
  Automated Verification Techniques for Probabilistic Systems. SFM 2011: 53-113
• 
  Dimitra Giannakopoulou, Corina S. Pasareanu:
  Context Synthesis. SFM 2011: 191-216
• 
  Paul Grace, Nikolaos Georgantas, Amel Bennaceur, Gordon S. Blair, Franck Chauvel, Valérie Issarny, Massimo Paolucci, Rachid Saadi, Bertrand Souville, Daniel Sykes:
  The CONNECT Architecture. SFM 2011: 27-52
• 
  Paola Inverardi, Romina Spalazzese, Massimo Tivoli:
  Application-Layer Connector Synthesis. SFM 2011: 148-190
• 
  Valérie Issarny, Amel Bennaceur, Yérom-David Bromberg:
  Middleware-Layer Connector Synthesis: Beyond State of the Art in Middleware Interoperability. SFM 2011: 217-255
• 
  Bengt Jonsson:
  Learning of Automata Models Extended with Data. SFM 2011: 327-349
• 
  Jan Jürjens, Martín Ochoa, Holger Schmidt, Loïc Marchal, Siv Hilde Houmb, Shareeful Islam:
  Modelling Secure Systems Evolution: Abstract and Concrete Change Specifications. SFM 2011: 504-526
• 
  Alessandro Moschitti:
  Kernel-Based Machines for Abstract and Easy Modeling of Automatic Learning. SFM 2011: 458-503
• 
  Bernhard Steffen, Falk Howar, Maik Merten:
  Introduction to Active Automata Learning from a Practical Perspective. SFM 2011: 256-296
• 
  Jan Tretmans:
  Model-Based Testing and Some Steps towards Test-Based Modelling. SFM 2011: 297-326
• 
  Marco Bernardo, Valérie Issarny:
  Formal Methods for Eternal Networked Software Systems - 11th International School on Formal Methods for the Design of Computer, Communication and Software Systems, SFM 2011, Bertinoro, Italy, June 13-18, 2011. Advanced Lectures. Lecture Notes in Computer Science 6659, Springer 2011, ISBN 978-3-642-21454-7 [contents]