Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Reasoning about arrays

From MaRDI portal
Publication:4176940
Jump to:navigation, search

DOI10.1145/359104.359110zbMath0394.68009OpenAlexW2037247941MaRDI QIDQ4176940

John C. Reynolds

Publication date: 1979

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/359104.359110

zbMATH Keywords

PartitionsArraysMergingBinary SearchProgram Proving


Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Discrete mathematics in relation to computer science (68R99)


Related Items

Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras, Decision procedures for extensions of the theory of arrays, Symbolic verification method for definite iteration over data structures, Heuristics for the dynamic facility layout problem with unequal-area departments, An algebraic approach to the syntax and semantics of languages with subscripted variables, Problem-oriented verification system and its application to linear algebra programs, A note on Presburger arithmetic with array segments, permutation and equality



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4176940&oldid=18007045"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 6 February 2024, at 13:01.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki