King, Andy and Sondergaard, Harald (2010) Automatic Abstraction for Congruences. In: Eleventh International Conference on Verification, Model Checking, and Abstract Interpretation.
| The full text of this publication is not available from this repository. (Contact us about this Publication) | |
| Official URL http://www.cs.kent.ac.uk/pubs/2010/2966 |
Abstract
One approach to verifying bit-twiddling algorithms is to derive invariants between the bits that constitute the variables of a program. Such invariants can often be described with systems of congruences where in each equation �cc
| Item Type: | Conference or workshop item (UNSPECIFIED) |
|---|---|
| Uncontrolled keywords: | determinacy analysis, Craig interpolants |
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Divisions: | Faculties > Science Technology and Medical Studies > School of Computing > Programming Languages and Systems Group Faculties > Science Technology and Medical Studies > School of Computing > Security Group |
| Depositing User: | Andy King |
| Date Deposited: | 21 Sep 2012 09:49 |
| Last Modified: | 21 Sep 2012 09:49 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/30704 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
