Combining Data Structures with Nonstably Infinite Theories Using Many-Sorted Logic

Abstract

Most computer programs store elements of a given nature into container-based data structures such as lists, arrays, sets, and multisets. To verify the correctness of these programs, one needs to combine a theory S modeling the data structure with a theory T modeling the elements. This combination can be achieved using the classic Nelson-Oppen method only if… (More)
DOI: 10.1007/11559306_3

Topics

Statistics

0510'05'06'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

56 Citations

Semantic Scholar estimates that this publication has 56 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Ranise2005CombiningDS, title={Combining Data Structures with Nonstably Infinite Theories Using Many-Sorted Logic}, author={Silvio Ranise and Christophe Ringeissen and Calogero G. Zarba}, booktitle={FroCoS}, year={2005} }