A parameterized benchmark suite of hard pipelined-machine-verification problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3725 LNCS, Issue , 2005, Pages 363-366

  Manolios, Panagiotis ^a   Srinivasan, Sudarshan K ^b  

^a Georgia Institute of Technology   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARK SUITE; PIPELINED MACHINE VERIFICATION; SYMBOLIC SIMULATIONS;

BENCHMARKING; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; PARAMETER ESTIMATION; PROBLEM SOLVING; WORLD WIDE WEB;

PIPELINE PROCESSING SYSTEMS;

EID: 33646426378     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11560548_32     Document Type: Conference Paper

References (11)

1. C. Barret, L. M. de Moura, and A. Stump. The satisfiability modulo theories competition (SMT-COMP'05), 2005. See URL http://www.csl.sri.com/users/- demoura/smt-comp.
2. R. E. Bryant, S. K. Lahiri, and S. Seshia. Modeling and verifying systems using a logic of counter arithmetic with lambda expressions and uninterpreted functions. In E. Brinksma and K. Larsen, editors, Computer-Aided Verification-CAV 2002, volume 2404 of LNCS, pages 78-92. Springer-Verlag, 2002.
3. I. R. Burch and D. L. Dill. Automatic verification of pipelined microprocessor control. In Computer-Aided Verification (CAV '94), volume 818 of LNCS, pages 68-80. Springer-Verlag, 1994.
4. L. M. de Moura and H. Rueß. An experimental evaluation of ground decision procedures. In Computer aided verification (CAV'04), pages 162-174, 2004.
5. P. Manolios. Correctness of pipelined machines, pages 161-178.
6. P. Manolios. Mechanical Verification of Reactive Systems. PhD thesis, University of Texas at Austin, August 2001. See URL http://www.cc.gatech. edu/~manolios/-publications.html.
7. P. Manolios and S. Srinivasan. Automatic verification of safety and liveness for xscale-like processor models using web refinement. In Design, Automation, and Test in Europe (DATE'04), 2004.
8. P. Manolios and S. K. Srinivasan. A computationally efficient method based on commitment refinement maps for verifying pipelined machines. In Formal Methods and Models for Codesign (MEMOCODE), July 2005. Accepted to appear.
9. P. Manolios and S. K. Srinivasan. A parameterized benchmark suite of hard pipelined-machine-verification problems, 2005. See URL http://www.cc.gatech. edu/-manolios/benchmarks/charme.html.
10. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. Design Automation Conference (DAC'01), pages 530-535, 2001.
11. L. Ryan. Siege homepage. See URL http://www.cs.sfu.ca/~loryan/-personal.