• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 27
Next 10 →

Symbolic Simulation of the JEM1 Microprocessor

by David A. Greve, The World's First Java - In Formal Methods in Computer-Aided Design – FMCAD, LNCS , 1998
"... . Symbolic simulation is the simulation of the execution of a computer system on an incompletely defined, or symbolic, state. This process results in a set of expressions that define the final machine state symbolically in terms of the initial machine state. We describe our use of symbolic simul ..."
Abstract - Cited by 27 (1 self) - Add to MetaCart
simulation in conjunction with the development of the JEM1 1 , the world's first Java 2 processor. We demonstrate that symbolic simulation can be used to detect microcode design errors and that it can be integrated into our current design process. 1 Introduction Traditional microcode

HLS: Combining Statistical and Symbolic Simulation to Guide Microprocessor Designs

by Mark Oskin, Frederic T. Chong, Matthew Farrens , 2000
"... As micro processors continue to evolve, many optimizations reach a point of diminishing returns. We introduce HLS, a hybrid processor simulator which uses statistical models and symbolic execution to evaluate design alternatives. This simulation methodology allows for quick and accurate contour maps ..."
Abstract - Cited by 101 (0 self) - Add to MetaCart
As micro processors continue to evolve, many optimizations reach a point of diminishing returns. We introduce HLS, a hybrid processor simulator which uses statistical models and symbolic execution to evaluate design alternatives. This simulation methodology allows for quick and accurate contour

Using Statistical and Symbolic Simulation for Microprocessor Performance Evaluation

by Mark Oskin, Frederic T. Chong, Matthew Farrens
"... As microprocessor designs continue to evolve, many optimizations reach a point of diminishing returns. We introduce HLS, a hybrid processor simulator which uses statistical models and symbolic execution to evaluate design alternatives. This simulation methodology enables quick and accurate generatio ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
As microprocessor designs continue to evolve, many optimizations reach a point of diminishing returns. We introduce HLS, a hybrid processor simulator which uses statistical models and symbolic execution to evaluate design alternatives. This simulation methodology enables quick and accurate

Symbolic simulation of microprocessor models using type classes in Haskell

by Nancy A. Day, Jeffrey R. Lewis, Byron Cook - In CHARME’99 Poster Session , 1999
"... Abstract. We present a technique for doing symbolic simulation of microprocessor models in the functional programming language Haskell. We use polymorphism and the type class system, a unique feature of Haskell, to write models that work over both concrete and symbolic data. We offer this approach a ..."
Abstract - Cited by 6 (1 self) - Add to MetaCart
Abstract. We present a technique for doing symbolic simulation of microprocessor models in the functional programming language Haskell. We use polymorphism and the type class system, a unique feature of Haskell, to write models that work over both concrete and symbolic data. We offer this approach

Verification of Pipelined Microprocessors by Comparing Memory Execution Sequences in Symbolic Simulation

by Randal E. Bryant , 1997
"... . This paper extends Burch and Dill's pipeline verification method [4] to the bit level. We introduce the idea of memory shadowing, a new technique for providing on-the-fly identical initial memory state to two different memory execution sequences. We also present an algorithm which compares th ..."
Abstract - Cited by 5 (2 self) - Add to MetaCart
the final states of two memories for equality. Memory shadowing and the comparison algorithm build on the Efficient Memory Model (EMM) [13], a behavioral memory model where the number of symbolic variables used to characterize the initial state of a memory is proportional to the number of distinct symbolic

Verification of Pipelined Microprocessors by Correspondence Checking in Symbolic Ternary Simulation

by Miroslav N. Velev, Randal E. Bryant , 1998
"... This paper makes the idea of memory shadowing [5] applicable to symbolic ternary simulation. Memory shadowing, an extension of Burch and Dill's pipeline verification method [6] to the bit level, is a technique for providing on-the-fly identical initial memory state to two different memory execu ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
to that of its unpipelined specification by simulating two symbolic ternary execution sequences and comparing their final memory states. Experimental results show the potential of the new ideas. 1. Introduction This paper makes memory shadowing [5] applicable to symbolic ternary simulation. Memory shadowing

A Property Checking Approach to Microprocessor Verification using Symbolic Simulation

by Prabhat Mishra, Narayanan Krishnamurthy, Nikil Dutt, Magdy Abadir
"... Several bottom-up validation techniques have been proposed to formally verify the implementation of a microprocessor by comparing the pipelined implementation with its Instruction-Set Architecture (ISA) specification model, or by deriving the ISA model from the implementation. We present a top-down ..."
Abstract - Add to MetaCart
-down validation approach using symbolic simulation. We define a set of properties and verify the correctness of the processor by verifying if the properties are met. We applied our methodology to verify several properties on a Memory Management Unit (MMU) of a microprocessor that is compliant with the Power

Finding bugs in an alpha microprocessor using satisfiability solvers

by Per Bjesse, Tim Leonard, Abdel Mokkedem , 2001
"... Abstract. We describe the techniques we have used to search for bugs in the memory subsystem of a next-generation Alpha microprocessor. Our approach is based on two model checking methods that use satisfiability (SAT) solvers rather than binary decision diagrams (BDDs). We show that the first method ..."
Abstract - Cited by 65 (0 self) - Add to MetaCart
checking and symbolic trajectory evaluation to industrial strength verification. The bugs we have found are significantly more complex than those previously found with methods based on SAT-solvers. 1 Introduction Getting microprocessors right is a hard problem, with harsh punishments for failure

Formally verifying a microprocessor using a simulation methodology

by Randal E. Bryant - In Proc. 31st Design Automation Conference , 1994
"... Formal verification is becoming a useful means of validating designs. We have developed a methodology for formally verifying dataintensive circuits (e.g., processors) with sophisticated timing (e.g., pipelining) against high-level declarative specifications. Previously, formally verifying a micropro ..."
Abstract - Cited by 41 (2 self) - Add to MetaCart
microprocessor required the use of an automatic theorem prover, but our technique requires little more than a symbolic simulator. We have formally verified a pre-existing 16-bit CISC microprocessor circuit extracted from the fabricated layout.

Automatic verification of pipelined microprocessors

by Vishal Bhagwati, Srinivas Devadas - In Proc. DAC , 1994
"... Abstract- We address the problem of automatically verifying large digital designs at the logic level, against high-level specifications. In this paper, we present a methodology which allows for the verification of a specific class of synchronous machines, namely pipelined microprocessors. The specif ..."
Abstract - Cited by 14 (0 self) - Add to MetaCart
/output behavior that result from pipelining, and takes into account data hazards and control transfer instructions that modify pipelined execution. The correctness requirement is that the β-relation hold between the implementation and specification. We use symbolic simulation of the specification
Next 10 →
Results 1 - 10 of 27
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2016 The Pennsylvania State University