Presentation
Using Abstract Stobjs in ACL2 to Compute Matrix Normal Forms
Author/s | Lambán Pardo, Laureano
Martín Mateos, Francisco Jesús Rubio, Julio Ruiz Reina, José Luis |
Department | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial |
Publication Date | 2017 |
Deposit Date | 2019-05-16 |
Published in |
|
ISBN/ISSN | 978-3-319-66106-3 0302-9743 |
Abstract | We present here an application of abstract single threaded
objects (abstract stobjs) in the ACL2 theorem prover, to define a formally
verified algorithm that given a matrix with elements in the ring
of integers, computes ... We present here an application of abstract single threaded objects (abstract stobjs) in the ACL2 theorem prover, to define a formally verified algorithm that given a matrix with elements in the ring of integers, computes an equivalent matrix in column echelon form. Abstract stobjs allow us to define a sound logical interface between matrices defined as lists of lists, convenient for reasoning but inefficient, and matrices represented as unidimensional stobjs arrays, which implement accesses and (destructive) updates in constant time. Also, by means of the abstract stobjs mechanism, we use a more convenient logical representation of the transformation matrix, as a sequence of elemental transformations. Although we describe here a particular normalization algorithm, we think this approach could be useful to obtain formally verified and efficient executable implementations of a number of matrix normal form algorithms. |
Project ID. | TIN2013-41086-P
MTM2014-54151-P |
Citation | Lambán Pardo, L., Martín Mateos, F.J., Rubio, J. y Ruiz Reina, J.L. (2017). Using Abstract Stobjs in ACL2 to Compute Matrix Normal Forms. En ITP 2017: 8th International Conference on Interactive Theorem Proving (354-370), Brasília, Brazil: Springer. |
Files | Size | Format | View | Description |
---|---|---|---|---|
Using Abstract Stobjs in ACL2.pdf | 147.0Kb | [PDF] | View/ | |