The SCEAS System
Navigation Menu

Conferences in DBLP

Correct Hardware Design and Verification Methods (CHARME) (charme)
2005 (conf/charme/2005)

  1. Wolfram Büttner
    Is Formal Verification Bound to Remain a Junior Partner of Simulation? [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:1- [Conf]
  2. Masaharu Imai, Akira Kitajima
    Verification Challenges in Configurable Processor Design with ASIP Meister. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:2- [Conf]
  3. Thomas In der Rieden, Dirk Leinenbach, Wolfgang J. Paul
    Towards the Pervasive Verification of Automotive Systems. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:3-4 [Conf]
  4. Emil Axelsson, Koen Claessen, Mary Sheeran
    Wired: Wire-Aware Circuit Design. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:5-19 [Conf]
  5. Warren A. Hunt Jr., Erik Reeber
    Formalization of the DE2 Language. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:20-34 [Conf]
  6. Stefan Staber, Barbara Jobstmann, Roderick Bloem
    Finding and Fixing Faults. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:35-49 [Conf]
  7. Arindam Chakrabarti, Krishnendu Chatterjee, Thomas A. Henzinger, Orna Kupferman, Rupak Majumdar
    Verifying Quantitative Properties Using Bound Functions. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:50-64 [Conf]
  8. Arie Gurfinkel, Marsha Chechik
    How Thorough Is Thorough Enough? [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:65-80 [Conf]
  9. Liang Zhang, Mukul R. Prasad, Michael S. Hsiao
    Interleaved Invariant Checking with Dynamic Abstraction. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:81-96 [Conf]
  10. Miroslav N. Velev
    Automatic Formal Verification of Liveness for Pipelined Processors with Multicycle Functional Units. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:97-113 [Conf]
  11. Viresh Paruthi, Christian Jacobi 0002, Kai Weber
    Efficient Symbolic Simulation via Dynamic Scheduling, Don't Caring, and Case Splitting. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:114-128 [Conf]
  12. Orna Grumberg, Tamir Heyman, Nili Ifergan, Assaf Schuster
    Achieving Speedups in Distributed Symbolic Reachability Analysis Through Asynchronous Computation. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:129-145 [Conf]
  13. Gianfranco Ciardo, Andy Jinqing Yu
    Saturation-Based Symbolic Reachability Analysis Using Conjunctive and Disjunctive Partitioning. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:146-161 [Conf]
  14. Leslie Lamport
    Real-Time Model Checking Is Really Simple. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:162-175 [Conf]
  15. Hana Chockler, Kathi Fisler
    Temporal Modalities for Concisely Capturing Timing Diagrams. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:176-190 [Conf]
  16. Doron Bustan, Alon Flaisher, Orna Grumberg, Orna Kupferman, Moshe Y. Vardi
    Regular Vacuity. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:191-206 [Conf]
  17. David Ward, Fabio Somenzi
    Automatic Generation of Hints for Symbolic Traversal. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:207-221 [Conf]
  18. Jason Baumgartner, Hari Mony
    Maximal Input Reduction of Sequential Netlists via Synergistic Reparameterization and Localization Strategies. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:222-237 [Conf]
  19. Jan-Willem Roorda, Koen Claessen
    A New SAT-Based Algorithm for Symbolic Trajectory Evaluation. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:238-253 [Conf]
  20. Nina Amla, Xiaoqun Du, Andreas Kuehlmann, Robert P. Kurshan, Kenneth L. McMillan
    An Analysis of SAT-Based Model Checking Techniques in an Industrial Environment. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:254-268 [Conf]
  21. Hari Mony, Jason Baumgartner, Adnan Aziz
    Exploiting Constraints in Transformation-Based Verification. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:269-284 [Conf]
  22. Ou Wei, Arie Gurfinkel, Marsha Chechik
    Identification and Counter Abstraction for Full Virtual Symmetry. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:285-300 [Conf]
  23. Iakov Dalinger, Mark A. Hillebrand, Wolfgang J. Paul
    On the Verification of Memory Management Mechanisms. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:301-316 [Conf]
  24. Sudhindra Pandav, Konrad Slind, Ganesh Gopalakrishnan
    Counterexample Guided Invariant Discovery for Parameterized Cache Coherence Verification. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:317-331 [Conf]
  25. Ritwik Bhattacharya, Steven M. German, Ganesh Gopalakrishnan
    Symbolic Partial Order Reduction for Rule Based Transition Systems. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:332-335 [Conf]
  26. Christian Ferdinand, Reinhold Heckmann
    Verifying Timing Behavior by Abstract Interpretation of Executable Code. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:336-339 [Conf]
  27. Masahiro Fujita
    Behavior-RTL Equivalence Checking Based on Data Transfer Analysis with Virtual Controllers and Datapaths. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:340-344 [Conf]
  28. Biniam Gebremichael, Frits W. Vaandrager, Miaomiao Zhang, Kees Goossens, Edwin Rijpkema, Andrei Radulescu
    Deadlock Prevention in the Æthereal Protocol. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:345-348 [Conf]
  29. Daniel Große, Rolf Drechsler
    Acceleration of SAT-Based Iterative Property Checking. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:349-353 [Conf]
  30. Subramanian K. Iyer, Jawahar Jain, Mukul R. Prasad, Debashis Sahoo, Thomas Sidle
    Error Detection Using BMC in a Parallel Environment. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:354-358 [Conf]
  31. Tsachy Kapschitz, Ran Ginosar
    Formal Verification of Synchronizers. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:359-362 [Conf]
  32. Panagiotis Manolios, Sudarshan K. Srinivasan
    A Parameterized Benchmark Suite of Hard Pipelined-Machine-Verification Problems. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:363-366 [Conf]
  33. João P. Marques Silva
    Improvements to the Implementation of Interpolant-Based Model Checking. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:367-370 [Conf]
  34. Petr Matousek, Ales Smrcka, Tomás Vojnar
    High-Level Modelling, Analysis, and Verification on FPGA-Based Hardware Design. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:371-375 [Conf]
  35. Katell Morin-Allory, David Cachera
    Proving Parameterized Systems: The Use of Pseudo-Pipelines in Polyhedral Logic. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:376-379 [Conf]
  36. Oliver Pell, Wayne Luk
    Resolving Quartz Overloading. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:380-383 [Conf]
  37. Mona Safar, M. Watheq El-Kharashi, Ashraf Salem
    FPGA Based Accelerator for 3-SAT Conflict Analysis in SAT Solvers. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:384-387 [Conf]
  38. Debashis Sahoo, Jawahar Jain, Subramanian K. Iyer, David L. Dill, E. Allen Emerson
    Predictive Reachability Using a Sample-Based Approach. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:388-392 [Conf]
  39. ShengYu Shen, Ying Qin, Sikun Li
    Minimizing Counterexample of ACTL Property. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:393-397 [Conf]
  40. Alex Tsow, Steven D. Johnson
    Data Refinement for Synchronous System Specification and Construction. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:398-401 [Conf]
  41. William D. Young
    Introducing Abstractions via Rewriting. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:402-405 [Conf]
  42. Emmanuel Zarpas
    A Case Study: Formal Verification of Processor Critical Properties. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:406-409 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002