Shape and Content

作者: Diego Calvanese , Tomer Kotek , Mantas Šimkus , Helmut Veith , Florian Zuleger

DOI: 10.1007/978-3-319-10181-1_1

关键词:

摘要: The verification community has studied dynamic data structures primarily in a bottom-up way by analyzing pointers and the shapes induced them. Recent work fields such as separation logic made significant progress extracting from program source code. Many real world programs however manipulate complex whose structure content is most naturally described formalisms object oriented programming databases. In this paper, we look at of with perspective representation. Our approach based on description logic, widely used knowledge representation paradigm which gives logical underpinning for diverse modeling frameworks UML ER. Technically, assume that have shape invariants obtained analysis tool, requirements terms logic. We show two-variable fragment first order counting trees can be joint framework to embed suitable fragments

参考文章(35)
Sven Apel, Dirk Beyer, Karlheinz Friedberger, Franco Raimondi, Alexander von Rhein, Domain Types: Abstract-Domain Selection Based on Variable Usage haifa verification conference. pp. 262- 278 ,(2013) , 10.1007/978-3-319-03077-7_18
Franz Baader, Benjamin Zarrieß, Verification of Golog Programs over Description Logic Actions frontiers of combining systems. pp. 181- 196 ,(2013) , 10.1007/978-3-642-40885-4_12
S. Tobies, The complexity of reasoning with cardinality restrictions and nominals in expressive description logics Journal of Artificial Intelligence Research. ,vol. 12, pp. 199- 217 ,(2000) , 10.1613/JAIR.705
Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin Rinard, Mooly Sagiv, Data structure fusion asian symposium on programming languages and systems. pp. 204- 221 ,(2010) , 10.1007/978-3-642-17164-2_15
Rajeev Alur, Kousha Etessami, P. Madhusudan, A Temporal Logic of Nested Calls and Returns tools and algorithms for construction and analysis of systems. ,vol. 2988, pp. 467- 481 ,(2004) , 10.1007/978-3-540-24730-2_35
Lukáš Holík, Ondřej Lengál, Adam Rogalewicz, Jiří Šimáček, Tomáš Vojnar, None, Fully Automated Shape Analysis Based on Forest Automata Computer Aided Verification. pp. 740- 755 ,(2013) , 10.1007/978-3-642-39799-8_52
G. Yorsh, Thomas Reps, Mooly Sagiv, Symbolically Computing Most-Precise Abstract Operations for Shape Analysis tools and algorithms for construction and analysis of systems. pp. 530- 545 ,(2004) , 10.1007/978-3-540-24730-2_39
Yves Lespérance, Fabio Patrizi, Giuseppe De Giacomo, Bounded situation calculus action theories and decidable verification principles of knowledge representation and reasoning. pp. 467- 477 ,(2012)
Helmut Veith, Mantas Simkus, Tomer Kotek, Florian Zuleger, Extending ALCQIO with reachability arXiv: Logic in Computer Science. ,(2014)