Generalizing simulation to abstract domains
Pages 485 - 499
Abstract
We introduce a notion of subsumption for domains used in abstract interpretation. We show that subsumption has the same properties and applications in the context of abstract interpretation that simulation has for transition systems. These include a modal characterisation theorem, a fixed point characterisation, and the construction of property-preserving abstractions. We use the notion of conjugate functions from algebraic logic to develop bisubsumption, an order-theoretic generalisation of bisimulation to Boolean domains. We prove a representation theorem that relates simulation and subsumption.
References
[1]
Abdulla, P. A., Chen, Y.-F., Holík, L., Mayr, R., Vojnar, T.: When simulation meets antichains: on checking language inclusion of nondeterministic finite (tree) automata. In: Proc. of Tools and Algorithms for the Construction and Analysis of Systems, pp. 158-174 (2010)
[2]
Abdulla, P. A., Čerans, K., Jonsson, B., Tsay, Y.-K.: Algorithmic analysis of programs with well quasi-ordered domains. Information and Computation 160(1-2), 109-127 (2000)
[3]
Celani, S. A., Jansana, R.: Priestley duality, a Sahlqvist theorem and a Goldblatt-Thomason theorem for positive modal logic. Logic Journal of the IGPL 7(6), 683- 715 (1999)
[4]
Cîrstea, C.: A modular approach to defining and characterising notions of simulation. Information and Computation 204(4), 469-502 (2006)
[5]
Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: Proc. of Principles of Programming Languages, pp. 269-282. ACM Press (1979)
[6]
Cousot, P., Cousot, R.: Temporal abstract interpretation. In: Proc. of Principles of Programming Languages, pp. 12-25. ACM Press (2000)
[7]
Doyen, L., Raskin, J.-F.: Antichain algorithms for finite automata. In: Proc. of Tools and Algorithms for the Construction and Analysis of Systems (2010)
[8]
Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theoretical Computer Science 256(1-2), 63-92 (2001)
[9]
Gehrke, M., Nagahashi, H., Venema, Y.: A Sahlqvist theorem for distributive modal logic. Annals of Pure and Applied Logic 131(1-3), 65-102 (2005)
[10]
van Glabbeek, R. J.: The linear time - branching time spectrum II. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 66-81. Springer, Heidelberg (1993)
[11]
Henzinger, T. A., Majumdar, R., Raskin, J.-F.: A classification of symbolic transition systems. ACM Transactions on Computational Logic 6(1), 1-32 (2005)
[12]
Hughes, J., Jacobs, B.: Simulations in coalgebra. Theoretical Computer Science 327(1-2), 71-108 (2004)
[13]
Jónsson, B., Tarski, A.: Boolean algebras with operators. American Journal of Mathematics 74(1), 127-162 (1952)
[14]
Levy, P. B.: Similarity quotients as final coalgebras. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol. 6604, pp. 27-41. Springer, Heidelberg (2011)
[15]
Loiseaux, C., Graf, S., Sifakis, J., Bouajjani, A., Bensalem, S.: Property preserving abstractions for the verification of concurrent systems. Formal Methods in Systems Design 6(1), 11-44 (1995)
[16]
Lynch, N., Vaandrager, F.: Forward and backward simulations I: untimed systems. Information and Computation 121(2), 214-233 (1995)
[17]
Maidl, M.: The common fragment of CTL and LTL. In: Foundations of Computer Science, p. 643. IEEE Computer Society, Washington, DC (2000)
[18]
Malacaria, P.: Studying equivalences of transition systems with algebraic tools. Theoretical Computer Science 139(1-2), 187-205 (1995)
[19]
Ranzato, F., Tapparo, F.: Generalized strong preservation by abstract interpretation. J. of Logic and Computation 17(1), 157-197 (2007)
[20]
Sangiorgi, D.: On the origins of bisimulation and coinduction. ACM Transactions on Programming Languages and Systems 31(4), 15:1-15:41 (2009)
[21]
van Glabbeek, R. J.: The linear time - branching time spectrum I. the semantics of concrete, sequential processes. In: Handbook of Process Algebra, pp. 3-99. Elsevier (2001)
- Generalizing simulation to abstract domains
Recommendations
The Abstract Expressive Power of First-Order and Description Logics with Concrete Domains
SAC '24: Proceedings of the 39th ACM/SIGAPP Symposium on Applied ComputingConcrete domains have been introduced in description logic (DL) to enable reference to concrete objects (such as numbers) and predefined predicates on these objects (such as numerical comparisons) when defining concepts. The primary research goal in this ...
Logics with Concrete Domains: First-Order Properties, Abstract Expressive Power, and (Un)Decidability
Concrete domains have been introduced in description logic (DL) to enable reference to concrete objects (such as numbers) and predefined predicates on these objects (such as numerical comparisons) when defining concepts. The primary research goal in this ...
Generalizing Functional Completeness in Belnap-Dunn Logic
One of the problems we face in many-valued logic is the difficulty of capturing the intuitive meaning of the connectives introduced through truth tables. At the same time, however, some logics have nice ways to capture the intended meaning of ...
Comments
Information & Contributors
Information
Published In
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 27 August 2013
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 08 Feb 2025