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

• 1995
• 
  Howard Barringer, Graham Gough, Brian Monahan, Alan R. Williams:
  Formal support for the ELLA hardwar description language. CHARME 1995: 225-245
• 
  Dominique Bolignano:
  A partial-order approach to the verification of concurrent systems: checking liveness properties. CHARME 1995: 278-292
• 
  Gianpiero Cabodi, Stefano Quer, Paolo Camurati:
  Transforming boolean relations by symbolic encoding. CHARME 1995: 161-170
• 
  Francisco Corella, Michel Langevin, Eduard Cerny, Zijian Zhou, Xiaoyu Song:
  State enumeration with abstract descriptions of state machines. CHARME 1995: 146-160
• 
  Paul Curzon:
  Problems encountered in the machine-assisted proof of hardware. CHARME 1995: 56-70
• 
  David Déharbe, Dominique Borrione:
  Semantics of a verification-oriented subset of VHDL. CHARME 1995: 293-310
• 
  Dirk Eisenbiegler, Ramayya Kumar:
  Formally embedding existing high level synthesis algorithms. CHARME 1995: 71-83
• 
  Emmanuelle Encrenaz:
  A Symbolic Relation for a Subset of VHDL'87 Descriptions and its Application to Symbolic Model Checking. CHARME 1995: 328-342
• 
  Kees G. W. Goossens:
  Reasoning about VHDL using operational and observational semantics. CHARME 1995: 311-327
• 
  Hardi Hungar, Orna Grumberg, Werner Damm:
  What if model checking must be truly symbolic. CHARME 1995: 1-20
• 
  Oded Maler, Amir Pnueli:
  Timing analysis of asynchronous circuits using timed automata. CHARME 1995: 189-205
• 
  Michael C. McFarland, Thaddeus J. Kowalski:
  Symbolic analysis and verification of CPA descriptions. CHARME 1995: 103-123
• 
  Ana Cristina Vieira de Melo, Howard Barringer:
  A foundation for formal reuse of hardware. CHARME 1995: 124-145
• 
  Rocco De Nicola, Alessandro Fantechi, Stefania Gnesi, Salvatore Larosa, Gioia Ristori:
  Verifying hardware components within JACK. CHARME 1995: 246-260
• 
  Laurence Pierre:
  Describing and verifying synchronous circuits with the Boyer-Moore theorem prover. CHARME 1995: 35-55
• 
  Ulrich Stern, David L. Dill:
  Automatic verification of the SCI cache coherence protocol. CHARME 1995: 21-34
• 
  Ulrich Stern, David L. Dill:
  Improved probabilistic verification by hash compaction. CHARME 1995: 206-224
• 
  Serdar Tasiran, Ramin Hojati, Robert K. Brayton:
  Language containment of non-deterministic omega-automata. CHARME 1995: 261-277
• 
  Ayman M. Wahba, Dominique Borrione:
  Design error diagnosis in sequential circuits. CHARME 1995: 171-188
• 
  Li-Guo Wang, Michael Mendler:
  Formal design of a class of computers. CHARME 1995: 84-102
• 
  Paolo Camurati, Hans Eveking:
  Correct Hardware Design and Verification Methods, IFIP WG 10.5 Advanced Research Working Conference, CHARME '95, Frankfurt/Main, Germany, October 2-4, 1995, Proceedings. Lecture Notes in Computer Science 987, Springer 1995, ISBN 3-540-60385-9 [contents]