%0 Generic %1 perera2021linked %A Perera, Roly %A Nguyen, Minh %A Petricek, Tomas %A Wang, Meng %D 2021 %K galois_dependecies mathematics visualization %T Linked visualisations via Galois dependencies %U http://arxiv.org/abs/2109.00445 %X We present new language-based dynamic analysis techniques for linking visualisations and other structured outputs to data in a fine-grained way, allowing a user to interactively explore how data attributes map to visual or other output elements by selecting (focusing on) substructures of interest. This can help both programmers and end-users understand how data sources and complex outputs are related, which can be a challenge even for someone with expert knowledge of the problem domain. Our approach builds on bidirectional program slicing techiques based on Galois connections, which provide desirable round-tripping properties. Unlike the prior work in program slicing, our approach allows selections to be negated. In a setting with negation, the bidirectional analysis has a De Morgan dual, which can be used to link different outputs generated from the same input. This offers a principled language-based foundation for a popular interactive visualisation feature called brushing and linking where selections in one chart automatically select corresponding elements in another related chart. Although such view coordination features are valuable comprehension aids, they tend be to hard-coded into specific applications or libraries, or require programmer effort.

@misc{perera2021linked, abstract = {We present new language-based dynamic analysis techniques for linking visualisations and other structured outputs to data in a fine-grained way, allowing a user to interactively explore how data attributes map to visual or other output elements by selecting (focusing on) substructures of interest. This can help both programmers and end-users understand how data sources and complex outputs are related, which can be a challenge even for someone with expert knowledge of the problem domain. Our approach builds on bidirectional program slicing techiques based on Galois connections, which provide desirable round-tripping properties. Unlike the prior work in program slicing, our approach allows selections to be negated. In a setting with negation, the bidirectional analysis has a De Morgan dual, which can be used to link different outputs generated from the same input. This offers a principled language-based foundation for a popular interactive visualisation feature called brushing and linking where selections in one chart automatically select corresponding elements in another related chart. Although such view coordination features are valuable comprehension aids, they tend be to hard-coded into specific applications or libraries, or require programmer effort.}, added-at = {2023-08-30T12:09:14.000+0200}, author = {Perera, Roly and Nguyen, Minh and Petricek, Tomas and Wang, Meng}, biburl = {https://www.bibsonomy.org/bibtex/226e1d9a59475ac4fb70f4e979a7b6cfd/tabularii}, description = {Linked visualisations via Galois dependencies}, interhash = {a9494d87d696aeddc7d5941d50f46e03}, intrahash = {26e1d9a59475ac4fb70f4e979a7b6cfd}, keywords = {galois_dependecies mathematics visualization}, note = {cite arxiv:2109.00445Comment: Extended paper with additional supporting material}, timestamp = {2023-09-06T14:33:19.000+0200}, title = {Linked visualisations via Galois dependencies}, url = {http://arxiv.org/abs/2109.00445}, year = 2021 }