Commit message (Collapse) | Author | Age | Files | Lines | ||
---|---|---|---|---|---|---|
... | ||||||
* | New technology mapper. | Alan Mishchenko | 2013-07-14 | 1 | -7/+17 | |
| | ||||||
* | New technology mapper. | Alan Mishchenko | 2013-07-13 | 1 | -3/+12 | |
| | ||||||
* | Precomputing DSD functions. | Alan Mishchenko | 2013-07-11 | 1 | -0/+13 | |
| | ||||||
* | New MFS package. | Alan Mishchenko | 2013-05-30 | 1 | -0/+8 | |
| | ||||||
* | New DSD detection code. | Alan Mishchenko | 2013-05-30 | 1 | -9/+18 | |
| | ||||||
* | New MFS package. | Alan Mishchenko | 2013-05-27 | 1 | -0/+19 | |
| | ||||||
* | New MFS package. | Alan Mishchenko | 2013-05-23 | 1 | -1/+18 | |
| | ||||||
* | New MFS package. | Alan Mishchenko | 2013-05-12 | 2 | -3/+11 | |
| | ||||||
* | Changing the queue to work in the same the array of costs is realloced. | Alan Mishchenko | 2013-05-05 | 3 | -5/+13 | |
| | ||||||
* | New fast extract. | Alan Mishchenko | 2013-05-05 | 3 | -7/+198 | |
| | ||||||
* | C++ compiler errors. | Alan Mishchenko | 2013-05-04 | 1 | -2/+4 | |
| | ||||||
* | Adding new API to the queue. | Alan Mishchenko | 2013-05-04 | 1 | -0/+4 | |
| | ||||||
* | Compiler warnings. | Alan Mishchenko | 2013-05-03 | 1 | -1/+0 | |
| | ||||||
* | Reading/writing MiniAIG and several minor changes. | Alan Mishchenko | 2013-05-03 | 1 | -0/+19 | |
| | ||||||
* | Minor changes and improvement in PO partitioning (command &popart). | Alan Mishchenko | 2013-05-01 | 1 | -0/+14 | |
| | ||||||
* | Faster isomorphism detection (command &iso). | Alan Mishchenko | 2013-05-01 | 1 | -1/+92 | |
| | ||||||
* | SAT sweeping under constraints. | Alan Mishchenko | 2013-04-28 | 1 | -0/+20 | |
| | ||||||
* | New fast extract. | Alan Mishchenko | 2013-04-27 | 5 | -1/+860 | |
| | ||||||
* | PO partitioning algorithm. | Alan Mishchenko | 2013-03-09 | 1 | -12/+10 | |
| | ||||||
* | User-controlable SAT sweeper. | Alan Mishchenko | 2013-02-26 | 1 | -0/+8 | |
| | ||||||
* | User-controlable SAT sweeper. | Alan Mishchenko | 2013-02-25 | 1 | -0/+5 | |
| | ||||||
* | Enabled detecting CEXes in multiple POs without stopping (sim3 -a). | Alan Mishchenko | 2013-01-23 | 1 | -1/+2 | |
| | ||||||
* | Integration of timing manager. | Alan Mishchenko | 2013-01-23 | 1 | -2/+4 | |
| | ||||||
* | Improvements to LMS code. | Alan Mishchenko | 2012-10-27 | 1 | -8/+7 | |
| | ||||||
* | Improvements to LMS code. | Alan Mishchenko | 2012-10-27 | 1 | -5/+78 | |
| | ||||||
* | Improvements to gate sizing. | Alan Mishchenko | 2012-10-09 | 1 | -0/+3 | |
| | ||||||
* | Improvements to gate sizing. | Alan Mishchenko | 2012-10-08 | 1 | -0/+360 | |
| | ||||||
* | Minor bug fix. | Alan Mishchenko | 2012-10-04 | 1 | -3/+3 | |
| | ||||||
* | Minor bug fixes. | Alan Mishchenko | 2012-10-03 | 1 | -3/+3 | |
| | ||||||
* | Modified structural constraint extraction (unfold -s) to work for ↵ | Alan Mishchenko | 2012-09-23 | 1 | -0/+22 | |
| | | | | multi-output testcases. | |||||
* | Upgrading hierarchy timing manager. | Alan Mishchenko | 2012-09-21 | 1 | -0/+22 | |
| | ||||||
* | Changes to command 'upsize'. | Alan Mishchenko | 2012-09-18 | 1 | -0/+36 | |
| | ||||||
* | Moving binary IO streams to the vector package. | Alan Mishchenko | 2012-09-17 | 1 | -0/+115 | |
| | ||||||
* | Added printout of library cells. | Alan Mishchenko | 2012-08-27 | 1 | -0/+22 | |
| | ||||||
* | New package to read/write a subset of Liberty for STA. | Alan Mishchenko | 2012-08-24 | 1 | -0/+17 | |
| | ||||||
* | Improved abstraction refinement. | Alan Mishchenko | 2012-08-09 | 1 | -4/+6 | |
| | ||||||
* | Fixing performance bug with old proof-logging (adding clauses multiple times). | Alan Mishchenko | 2012-07-30 | 1 | -0/+22 | |
| | ||||||
* | Reducing memory usage in proof-based abstraction. | Alan Mishchenko | 2012-07-29 | 1 | -0/+2 | |
| | ||||||
* | Adding memory reporting to vectors. | Alan Mishchenko | 2012-07-29 | 7 | -118/+120 | |
| | ||||||
* | Updated code for lazy man's synthesis (memory optimization). | Alan Mishchenko | 2012-07-20 | 1 | -0/+290 | |
| | ||||||
* | Updated code for lazy man's synthesis. | Alan Mishchenko | 2012-07-20 | 1 | -2/+2 | |
| | ||||||
* | Debugging a proof error. | Alan Mishchenko | 2012-07-13 | 1 | -25/+17 | |
| | ||||||
* | Debugging a proof error. | Alan Mishchenko | 2012-07-13 | 1 | -0/+7 | |
| | ||||||
* | Debugging a proof error. | Alan Mishchenko | 2012-07-13 | 1 | -0/+1 | |
| | ||||||
* | Debugging a proof error. | Alan Mishchenko | 2012-07-13 | 1 | -2/+2 | |
| | ||||||
* | Debugging a proof error. | Alan Mishchenko | 2012-07-13 | 1 | -0/+19 | |
| | ||||||
* | Debugging a proof error. | Alan Mishchenko | 2012-07-13 | 1 | -31/+9 | |
| | ||||||
* | Fixing a mismatch in regular/shadow page memory appending procedure. | Alan Mishchenko | 2012-07-13 | 1 | -2/+2 | |
| | ||||||
* | Added learned clause recycling to the SAT solver (may impact bmc2, bmc3, ↵ | Alan Mishchenko | 2012-07-09 | 1 | -7/+10 | |
| | | | | dsat, etc). | |||||
* | Updating project settings to have simpler include paths. | Alan Mishchenko | 2012-07-07 | 1 | -1/+1 | |
| |