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

• 2005
• 
  Nina Amla, Xiaoqun Du, Andreas Kuehlmann, Robert P. Kurshan, Kenneth L. McMillan:
  An Analysis of SAT-Based Model Checking Techniques in an Industrial Environment. CHARME 2005: 254-268
• 
  Emil Axelsson, Koen Claessen, Mary Sheeran:
  Wired: Wire-Aware Circuit Design. CHARME 2005: 5-19
• 
  Jason Baumgartner, Hari Mony:
  Maximal Input Reduction of Sequential Netlists via Synergistic Reparameterization and Localization Strategies. CHARME 2005: 222-237
• 
  Ritwik Bhattacharya, Steven M. German, Ganesh Gopalakrishnan:
  Symbolic Partial Order Reduction for Rule Based Transition Systems. CHARME 2005: 332-335
• 
  Doron Bustan, Alon Flaisher, Orna Grumberg, Orna Kupferman, Moshe Y. Vardi:
  Regular Vacuity. CHARME 2005: 191-206
• 
  Wolfram Büttner:
  Is Formal Verification Bound to Remain a Junior Partner of Simulation? CHARME 2005: 1
• 
  Arindam Chakrabarti, Krishnendu Chatterjee, Thomas A. Henzinger, Orna Kupferman, Rupak Majumdar:
  Verifying Quantitative Properties Using Bound Functions. CHARME 2005: 50-64
• 
  Hana Chockler, Kathi Fisler:
  Temporal Modalities for Concisely Capturing Timing Diagrams. CHARME 2005: 176-190
• 
  Gianfranco Ciardo, Andy Jinqing Yu:
  Saturation-Based Symbolic Reachability Analysis Using Conjunctive and Disjunctive Partitioning. CHARME 2005: 146-161
• 
  Iakov Dalinger, Mark A. Hillebrand, Wolfgang J. Paul:
  On the Verification of Memory Management Mechanisms. CHARME 2005: 301-316
• 
  Christian Ferdinand, Reinhold Heckmann:
  Verifying Timing Behavior by Abstract Interpretation of Executable Code. CHARME 2005: 336-339
• 
  Masahiro Fujita:
  Behavior-RTL Equivalence Checking Based on Data Transfer Analysis with Virtual Controllers and Datapaths. CHARME 2005: 340-344
• 
  Biniam Gebremichael, Frits W. Vaandrager, Miaomiao Zhang, Kees Goossens, Edwin Rijpkema, Andrei Radulescu:
  Deadlock Prevention in the Æthereal Protocol. CHARME 2005: 345-348
• 
  Daniel Große, Rolf Drechsler:
  Acceleration of SAT-Based Iterative Property Checking. CHARME 2005: 349-353
• 
  Orna Grumberg, Tamir Heyman, Nili Ifergan, Assaf Schuster:
  Achieving Speedups in Distributed Symbolic Reachability Analysis Through Asynchronous Computation. CHARME 2005: 129-145
• 
  Arie Gurfinkel, Marsha Chechik:
  How Thorough Is Thorough Enough? CHARME 2005: 65-80
• 
  Warren A. Hunt Jr., Erik Reeber:
  Formalization of the DE2 Language. CHARME 2005: 20-34
• 
  Masaharu Imai, Akira Kitajima:
  Verification Challenges in Configurable Processor Design with ASIP Meister. CHARME 2005: 2
• 
  Subramanian K. Iyer, Jawahar Jain, Mukul R. Prasad, Debashis Sahoo, Thomas Sidle:
  Error Detection Using BMC in a Parallel Environment. CHARME 2005: 354-358
• 
  Tsachy Kapschitz, Ran Ginosar:
  Formal Verification of Synchronizers. CHARME 2005: 359-362
• 
  Leslie Lamport:
  Real-Time Model Checking Is Really Simple. CHARME 2005: 162-175
• 
  Panagiotis Manolios, Sudarshan K. Srinivasan:
  A Parameterized Benchmark Suite of Hard Pipelined-Machine-Verification Problems. CHARME 2005: 363-366
• 
  João Marques-Silva:
  Improvements to the Implementation of Interpolant-Based Model Checking. CHARME 2005: 367-370
• 
  Petr Matousek, Ales Smrcka, Tomás Vojnar:
  High-Level Modelling, Analysis, and Verification on FPGA-Based Hardware Design. CHARME 2005: 371-375
• 
  Hari Mony, Jason Baumgartner, Adnan Aziz:
  Exploiting Constraints in Transformation-Based Verification. CHARME 2005: 269-284
• 
  Katell Morin-Allory, David Cachera:
  Proving Parameterized Systems: The Use of Pseudo-Pipelines in Polyhedral Logic. CHARME 2005: 376-379
• 
  Sudhindra Pandav, Konrad Slind, Ganesh Gopalakrishnan:
  Counterexample Guided Invariant Discovery for Parameterized Cache Coherence Verification. CHARME 2005: 317-331
• 
  Viresh Paruthi, Christian Jacobi, Kai Weber:
  Efficient Symbolic Simulation via Dynamic Scheduling, Don't Caring, and Case Splitting. CHARME 2005: 114-128
• 
  Oliver Pell, Wayne Luk:
  Resolving Quartz Overloading. CHARME 2005: 380-383
• 
  Thomas In der Rieden, Dirk Leinenbach, Wolfgang J. Paul:
  Towards the Pervasive Verification of Automotive Systems. CHARME 2005: 3-4

skipping 13 more matches