https://github.com/romac/sav-presentation
https://github.com/romac/sav-presentation
Last synced: 5 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/romac/sav-presentation
- Owner: romac
- Created: 2017-05-08T13:47:02.000Z (about 9 years ago)
- Default Branch: master
- Last Pushed: 2017-05-08T15:05:25.000Z (about 9 years ago)
- Last Synced: 2025-04-12T13:19:00.146Z (about 1 year ago)
- Language: TeX
- Size: 1.01 MB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# SAV Presentation: Efficient E-Matching for SMT solvers
> This is the code and slides for my presentation of the [Efficient E-Matching for SMT solvers](https://dl.acm.org/citation.cfm?id=1420872) paper for the [Synthesis and Verification class](http://lara.epfl.ch/w/sav17:top) at EPFL.
[Check out the rendered PDF slides](e-matching.pdf)
## References
[1] Detlefs, D. et al. 2005\. Simplify: A theorem prover for program checking. _J. ACM_. 52, 3 (May 2005), 365–473.
[2] Ganzinger, H. et al. 2001\. Context trees. _Automated reasoning: First international joint conference, ijcar 2001 siena, italy, june 18–22, 2001 proceedings_. R. Goré et al., eds. Springer Berlin Heidelberg. 242–256.
[3] Moskal, M. et al. 2008\. E-matching for fun and profit. _Electron. Notes Theor. Comput. Sci._ 198, 2 (May 2008), 19–35.
[4] Moura, L. de and Bjørner, N. 2007\. Efficient E-matching for SMT solvers. _Automated deduction – cade-21: 21st international conference on automated deduction bremen, germany, july 17-20, 2007 proceedings_. F. Pfenning, ed. Springer Berlin Heidelberg. 183–198.