• 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 23 matches

• 2005
• 
  Ralph-Johan Back, Viorel Preoteasa:
  An algebraic treatment of procedure refinement to support mechanical verification. Formal Aspects Comput. 17(1): 69-90 (2005)
• 
  Bahareh Badban, Wan J. Fokkink, Jan Friso Groote, Jun Pang, Jaco van de Pol:
  Verification of a sliding window protocol in µCRL and PVS. Formal Aspects Comput. 17(3): 342-388 (2005)
• 
  Roberto Bagnara, Patricia M. Hill, Enea Zaffanella:
  Not necessarily closed convex polyhedra and the double description method. Formal Aspects Comput. 17(2): 222-257 (2005)
• 
  Bernhard Beckert, Steffen Schlager:
  Refinement and retrenchment for programming language data types. Formal Aspects Comput. 17(4): 423-442 (2005)
• 
  Eerke A. Boiten, John Derrick, Graeme Smith:
  Guest Editorial Integrated Formal Methods. Formal Aspects Comput. 17(4): 389-389 (2005)
• 
  Stefano Cattani, Marta Z. Kwiatkowska:
  A refinement-based process algebra for timed automata. Formal Aspects Comput. 17(2): 138-159 (2005)
• 
  Sagar Chaki, Edmund M. Clarke, Joël Ouaknine, Natasha Sharygina, Nishant Sinha:
  Concurrent software verification with states, events, and deadlocks. Formal Aspects Comput. 17(4): 461-483 (2005)
• 
  Andrew Cook, Andrew Ireland, Greg Michaelson, Norman Scaife:
  Discovering applications of higher order functions through proof planning. Formal Aspects Comput. 17(1): 38-57 (2005)
• 
  John Cooke:
  Editorial. Formal Aspects Comput. 17(3): 259-259 (2005)
• 
  Sidi O. Ehmety, Lawrence C. Paulson:
  Mechanizing compositional reasoning for concurrent systems: some lessons. Formal Aspects Comput. 17(1): 58-68 (2005)
• 
  Andrew D. Gordon, Riccardo Pucella:
  Validating a web service security abstraction by typing. Formal Aspects Comput. 17(3): 277-318 (2005)
• 
  Jan Friso Groote, François Monin, Jan Springintveld:
  A computer checked algebraic verification of a distributed summation algorithm. Formal Aspects Comput. 17(1): 19-37 (2005)
• 
  Elsa L. Gunter, Doron A. Peled:
  Model checking, testing and verification working together. Formal Aspects Comput. 17(2): 201-221 (2005)
• 
  Sigrid Gürgens, Carsten Rudolph:
  Security analysis of efficient (Un-)fair non-repudiation protocols. Formal Aspects Comput. 17(3): 260-276 (2005)
• 
  Jifeng He, Dang Van Hung, Geguang Pu, Zongyan Qiu, Wang Yi:
  Exploring optimal solution to hardware/software partitioning for synchronous model. Formal Aspects Comput. 17(4): 443-460 (2005)
• 
  Dominikus Herzberg, Manfred Broy:
  Modeling layered distributed communication systems. Formal Aspects Comput. 17(1): 1-18 (2005)
• 
  Michael Huth:
  Refinement is complete for implementations. Formal Aspects Comput. 17(2): 113-137 (2005)
• 
  Michael Leuschel:
  Guest Editorial. Formal Aspects Comput. 17(2): 91-92 (2005)
• 
  Gethin Norman, David Parker, Marta Z. Kwiatkowska, Sandeep K. Shukla, Rajesh Gupta:
  Using probabilistic model checking for dynamic power management. Formal Aspects Comput. 17(2): 160-176 (2005)
• 
  A. W. Roscoe:
  On the expressive power of CSP refinement. Formal Aspects Comput. 17(2): 93-112 (2005)
• 
  Steve A. Schneider, Helen Treharne:
  CSP theorems for communicating B machines. Formal Aspects Comput. 17(4): 390-422 (2005)
• 
  Bram De Wachter, Alexandre Genon, Thierry Massart, Cédric Meuter:
  The formal design of distributed controllers with _dSL and Spin. Formal Aspects Comput. 17(2): 177-200 (2005)
• 
  Martin De Wulf, Laurent Doyen, Jean-François Raskin:
  Almost ASAP semantics: from timed models to timed implementations. Formal Aspects Comput. 17(3): 319-341 (2005)