. A. Abc-+-08-]-p, A. Abdulla, J. Bouajjani, F. Cederberg, A. Haziza et al., Monotonic Abstraction for Programs with Dynamic Memory Heaps, Proc. of CAV, pp.341-354, 2008.

. A. Abh-+-08-]-p, A. Abdulla, L. Bouajjani, L. Holík, T. Kaati et al., Computing Simulations over Tree Automata: Efficient Techniques for Reducing Tree Automata, Proc. of TACAS, number 4963 in LNCS, pp.93-108, 2008.

. A. Ach-+-10-]-p, Y. Abdulla, L. Chen, R. Holík, T. Mayr et al., When Simulation Meets Antichains (on Checking Language Inclusion of NFAs), Proc. of TACAS'10, pp.158-174, 2010.

J. [. Abdulla, T. Cederberg, and . Vojnar, Monotonic Abstraction for Programs with Multiply-Linked Structures, Proc. of RP, pp.125-138, 2011.

L. [. Abdulla, L. Holík, T. Kaati, and . Vojnar, A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata, Electronic Notes in Theoretical Computer Science, vol.251
DOI : 10.1016/j.entcs.2009.08.026

]. P. Ajmd02, B. Abdulla, P. Jonsson, and J. Mahata, Regular Tree Model Checking, Proc. of CAV'02, 2002.

]. P. Aldr05, A. Abdulla, J. Legay, A. Orso, and . Rezine, Simulation- Based Iteration of Tree Transducers, Proc. of TACAS, pp.30-44, 2005.

A. Bouajjani, M. Bozga, P. Habermehl, R. Iosif, P. Moro et al., Programs with Lists are Counter Automata. Formal Methods in System Design, pp.158-192, 2011.
DOI : 10.1007/s10703-011-0111-7

URL : https://hal.archives-ouvertes.fr/hal-00722398

]. J. Bcc-+-07, C. Berdine, B. Calcagno, D. Cook, P. W. Distefano et al., Shape analysis for composite data structures, Proc. of CAV, pp.178-192, 2007.

A. Bouajjani, P. Habermehl, L. Holík, T. Touili, and T. Vojnar, Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata, Proc. of CIAA'08, 2008.
DOI : 10.1007/978-3-540-70844-5_7

P. [. Bouajjani, P. Habermehl, T. Moro, and . Vojnar, Verifying Programs with Dynamic 1-Selector-Linked Structures in Regular Model Checking, Proc. of TACAS'05, 2005.
DOI : 10.1007/978-3-540-31980-1_2

URL : https://hal.archives-ouvertes.fr/hal-00147978

]. A. Bhrv06a, P. Bouajjani, A. Habermehl, T. Rogalewicz, and . Vojnar, Abstract Regular Tree Model Checking, ENTCS, vol.149, pp.37-48, 2006.

]. A. Bhrv06b, P. Bouajjani, A. Habermehl, T. Rogalewicz, and . Vojnar, Abstract Regular Tree Model Checking of Complex Dynamic Data Structures, Proc. of SAS'06, pp.52-70, 2006.

P. [. Bouajjani, T. Habermehl, and . Vojnar, Abstract Regular Model Checking, Proc. of CAV, pp.372-386, 2004.
DOI : 10.1007/978-3-540-27813-9_29

URL : https://hal.archives-ouvertes.fr/hal-00159512

]. T. Bou11 and . Bourdier, Tree Automata-based Semantics of Firewalls, Proc. of SAR-SSI, pp.171-178, 2011.

]. R. Bry86 and . Bryant, Graph-Based Algorithms for Boolean Function Manipulation, IEEE Transactions on Computing, vol.35, issue.8, pp.677-691, 1986.

A. Bouajjani and T. Touili, Extrapolating Tree Transformations, Proc. of CAV, pp.539-554, 2002.
DOI : 10.1007/3-540-45657-0_46

URL : https://hal.archives-ouvertes.fr/hal-00161115

D. [. Calcagno, P. W. Distefano, H. O-'hearn, and . Yang, Compositional shape analysis by means of bi-abduction, Proc. of PLDI, pp.289-300, 2009.
DOI : 10.1145/1594834.1480917

P. Claves, D. Jansen, S. J. Holtrup, M. Mohr, A. Reis et al., Schatz, and I. Thesing. The LETHAL Library, 2009.

. M. Cmz-+-97-]-e, K. L. Clarke, X. Mcmillan, M. Zhao, J. Fujita et al., Spectral Transforms for Large Boolean Functions withApplications to Technology Mapping. Formal Methods in System Design, pp.137-148, 1997.

B. Chang, X. Rival, and G. Necula, Shape Analysis with Structural Invariant Checkers, Proc. of SAS, pp.384-401, 2007.
DOI : 10.1007/978-3-540-74061-2_24

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.161.1921

E. [. Deshmukh, P. Emerson, and . Gupta, Automatic Verification of Parameterized Data Structures, Proc. of TACAS, pp.27-41, 2006.
DOI : 10.1145/292540.292552

O. [. Dams, R. Grumberg, and . Gerth, Generation of reduced models for checking fragments of CTL, Proc. of CAV, pp.479-490, 1993.
DOI : 10.1007/3-540-56922-7_39

P. [. Dudka, T. Peringer, and . Vojnar, Predator: A Practical Tool for Checking Manipulation of Dynamic Data Structures Using Separation Logic, Proc. of CAV, pp.372-378, 2011.
DOI : 10.1007/978-3-540-70545-1_36

J. [. Doyen and . Raskin, Antichain Algorithms for Finite Automata, Proc. of TACAS, pp.2-22, 2010.
DOI : 10.1007/978-3-642-12002-2_2

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.4913

L. [. De-wulf, T. Doyen, J. Henzinger, and . Raskin, Antichains: A New Algorithm for Checking Universality of Finite Automata, Proc. of CAV, pp.17-30, 2006.
DOI : 10.1007/11817963_5

]. T. Gen03 and . Genet, Timbuk/Taml: A Tree Automata Library, 2003.

D. [. Grumberg and . Long, Model checking and modular verification, ACM Transactions on Programming Languages and Systems, vol.16, issue.3, pp.843-871, 1994.
DOI : 10.1145/177492.177725

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.6959

N. [. Guo and D. I. Vachharajani, Shape analysis with inductive recursion synthesis, Proc. of PLDI, pp.256-265, 2007.
DOI : 10.1145/1273442.1250764

T. [. Henzinger, P. W. Henzinger, and . Kopke, Computing simulations on finite and infinite graphs, Proceedings of IEEE 36th Annual Foundations of Computer Science, pp.453-462, 1995.
DOI : 10.1109/SFCS.1995.492576

URL : http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.48.3591&rep=rep1&type=pdf

. Hhr-+-11b-]-p, L. Habermehl, A. Holík, J. Rogalewicz, T. Simá?ek et al., Forest Automata for Verification of Heap Manipulation, Faculty of Information Technology, BUT, vol.12, 2011.

P. Habermehl, L. Holík, A. Rogalewicz, J. Simá?ek, and T. Vojnar, Forest automata for verification of heap manipulation, Formal Methods in System Design, pp.1-24, 2012.

]. L. Hl?v11ahl?hl?v11a, O. Holík, J. Lengál, T. Simá?ek, and . Vojnar, Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata, Proc. of ATVA, pp.243-258, 2011.

]. L. Hl?v11bhl?hl?v11b, O. Holík, J. Lengál, T. Simá?ek, and . Vojnar, Efficient Inclusion Checking on Explicit and Semi-Symbolic Tree Automata Holík. Simulations and Antichains for Efficient Handling of Finite Automata, 2011.

]. H. Hos10 and . Hosoya, Foundations of XML Processing: The Tree-Automata Approach, 2010.

J. [. Holík and . Simá?ek, Optimizing an LTS-Simulation

J. [. Holík and . Simá?ek, Optimizing an LTS-Simulation Algorithm, 2009.

J. [. Holík, ]. H. Simá?ekhvp05, J. Hosoya, B. C. Vouillon, and . Pierce, Optimizing an LTS-Simulation Algorithm Computing and Informatics Regular Expression Types for XML, TOPLAS, vol.27, issue.71, pp.20101337-134846, 2005.

G. [. Ilie, S. Navarro, and . Yu, On NFA Reductions, Theory Is Forever, pp.112-124, 2004.
DOI : 10.1007/978-3-540-27812-2_11

A. [. Klarlund, M. Møller, and . Schwartzbach, MONA Implementation Secrets, Proc. of CIAA, pp.182-194, 2001.
DOI : 10.1007/3-540-44674-5_15

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.1846

J. [. Lengál, T. Simá?ek, and . Vojnar, VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata, Proc. of TACASMPQ11] P. Madhusudan, G. Parlato, and X. Qiu. Decidable Logics Combining Heap Structures and Data Proc. of POPL, pp.79-94, 2011.
DOI : 10.1007/978-3-642-28756-5_7

A. Møller and M. I. Schwartzbach, The pointer assertion logic engine, Proc. of PLDI, pp.221-231, 2001.
DOI : 10.1145/381694.378851

M. [. Magill, P. Tsai, Y. Lee, and . Tsay, Automatic numeric abstractions for heap-manipulating programs, Proc. of POPL, pp.211-222, 2010.
DOI : 10.1145/1707801.1706326

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.155.589

C. [. Nguyen, S. David, W. Qin, and . Chin, Automated Verification of Shape and Size Properties Via Separation Logic, Proc. of VMCAI, pp.251-266, 2007.
DOI : 10.1007/978-3-540-69738-1_18

H. [. Nielson, C. Nielson, and . Hankin, Principles of Program Analysis, 1999.
DOI : 10.1007/978-3-662-03811-6

R. [. Paige and . Tarjan, Three Partition Refinement Algorithms, SIAM Journal on Computing, vol.16, issue.6, pp.973-989, 1987.
DOI : 10.1137/0216062

]. W. Pug90 and . Pugh, Skip Lists: A Probabilistic Alternative to Balanced Trees, Communications of the ACM, vol.33, issue.6, pp.668-676, 1990.

]. J. [-rey02 and . Reynolds, Separation Logic: A Logic for Shared Mutable Data Structures, Proc. of LICS, pp.55-74, 2002.

F. [. Ranzato and . Tapparo, A New Efficient Simulation Equivalence Algorithm, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), pp.171-180, 2007.
DOI : 10.1109/LICS.2007.8

]. E. Sha01 and . Shahar, Tools and Techniques for Verifying Parameterized Systems, The Weizmann Inst. of Science, 2001.

P. [. Sawa and . Jan?ar, Behavioural Equivalences on Finite- State Systems are PTIME-hard, Computing and Informatics, vol.24, issue.5, pp.513-528, 2005.

]. F. Som11 and . Somenzi, CUDD: CU Decision Diagram Package Release 2.4.2, 2011.

T. [. Sagiv, R. Reps, and . Wilhelm, Parametric Shape Analysis via 3-valued Logic, TOPLAS, vol.24, issue.3, 2002.
DOI : 10.1145/292540.292552

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.2132

M. [. Tozawa and . Hagiya, XML Schema Containment Checking Based on Semi-implicit Techniques, Proc. of CIAA, pp.51-61, 2003.
DOI : 10.1007/3-540-45089-0_20

H. Yang, O. Lee, C. Calcagno, D. Distefano, and P. W. O-'hearn, On Scalable Shape Analysis, 2007.

V. [. Zee, M. Kuncak, and . Rinard, Full functional verification of linked data structures, Proc. of PLDI, pp.349-361, 2008.
DOI : 10.1145/1379022.1375624