Monotonic Abstraction for Programs with Dynamic Memory Heaps, Proc. of CAV, pp.341-354, 2008. ,
Computing Simulations over Tree Automata: Efficient Techniques for Reducing Tree Automata, Proc. of TACAS, number 4963 in LNCS, pp.93-108, 2008. ,
When Simulation Meets Antichains (on Checking Language Inclusion of NFAs), Proc. of TACAS'10, pp.158-174, 2010. ,
Monotonic Abstraction for Programs with Multiply-Linked Structures, Proc. of RP, pp.125-138, 2011. ,
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
Regular Tree Model Checking, Proc. of CAV'02, 2002. ,
Simulation- Based Iteration of Tree Transducers, Proc. of TACAS, pp.30-44, 2005. ,
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-01418868
Shape analysis for composite data structures, Proc. of CAV, pp.178-192, 2007. ,
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
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
Abstract Regular Tree Model Checking, ENTCS, vol.149, pp.37-48, 2006. ,
Abstract Regular Tree Model Checking of Complex Dynamic Data Structures, Proc. of SAS'06, pp.52-70, 2006. ,
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
Tree Automata-based Semantics of Firewalls, Proc. of SAR-SSI, pp.171-178, 2011. ,
Graph-Based Algorithms for Boolean Function Manipulation, IEEE Transactions on Computing, vol.35, issue.8, pp.677-691, 1986. ,
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
Compositional shape analysis by means of bi-abduction, Proc. of PLDI, pp.289-300, 2009. ,
DOI : 10.1145/1594834.1480917
Schatz, and I. Thesing. The LETHAL Library, 2009. ,
Spectral Transforms for Large Boolean Functions withApplications to Technology Mapping. Formal Methods in System Design, pp.137-148, 1997. ,
Shape Analysis with Structural Invariant Checkers, Proc. of SAS, pp.384-401, 2007. ,
DOI : 10.1007/978-3-540-74061-2_24
Automatic Verification of Parameterized Data Structures, Proc. of TACAS, pp.27-41, 2006. ,
DOI : 10.1007/3-540-44802-0_1
Generation of reduced models for checking fragments of CTL, Proc. of CAV, pp.479-490, 1993. ,
DOI : 10.1007/3-540-56922-7_39
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
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
Antichains: A New Algorithm for Checking Universality of Finite Automata, Proc. of CAV, pp.17-30, 2006. ,
DOI : 10.1007/11817963_5
Timbuk/Taml: A Tree Automata Library, 2003. ,
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
Shape analysis with inductive recursion synthesis, Proc. of PLDI, pp.256-265, 2007. ,
DOI : 10.1145/1273442.1250764
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.4769
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/summary?doi=10.1.1.48.3591
Forest Automata for Verification of Heap Manipulation, 2011. ,
Forest automata for verification of heap manipulation, Formal Methods in System Design, pp.1-24, 2012. ,
Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata, Proc. of ATVA, pp.243-258, 2011. ,
Efficient Inclusion Checking on Explicit and Semi-Symbolic Tree Automata Holík. Simulations and Antichains for Efficient Handling of Finite Automata, 2011. ,
Foundations of XML Processing: The Tree-Automata Approach, 2010. ,
Optimizing an LTS-Simulation ,
Optimizing an LTS-Simulation Algorithm, 2009. ,
Optimizing an LTS-Simulation Algorithm Computing and Informatics Regular Expression Types for XML, TOPLAS, vol.27, issue.71, pp.20101337-134846, 2005. ,
On NFA Reductions, Theory Is Forever, pp.112-124, 2004. ,
DOI : 10.1007/978-3-540-27812-2_11
MONA Implementation Secrets, Proc. of CIAA, pp.182-194, 2001. ,
DOI : 10.7146/brics.v7i40.20206
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.1846
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
The pointer assertion logic engine, Proc. of PLDI, pp.221-231, 2001. ,
DOI : 10.1145/381694.378851
Automatic numeric abstractions for heap-manipulating programs, Proc. of POPL, pp.211-222, 2010. ,
DOI : 10.1145/1707801.1706326
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
Principles of Program Analysis, 1999. ,
DOI : 10.1007/978-3-662-03811-6
Three Partition Refinement Algorithms, SIAM Journal on Computing, vol.16, issue.6, pp.973-989, 1987. ,
DOI : 10.1137/0216062
Skip Lists: A Probabilistic Alternative to Balanced Trees, Communications of the ACM, vol.33, issue.6, pp.668-676, 1990. ,
Separation Logic: A Logic for Shared Mutable Data Structures, Proc. of LICS, pp.55-74, 2002. ,
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
Tools and Techniques for Verifying Parameterized Systems, The Weizmann Inst. of Science, 2001. ,
Behavioural Equivalences on Finite- State Systems are PTIME-hard, Computing and Informatics, vol.24, issue.5, pp.513-528, 2005. ,
CUDD: CU Decision Diagram Package Release 2.4.2, 2011. ,
Parametric Shape Analysis via 3-valued Logic, TOPLAS, vol.24, issue.3, 2002. ,
DOI : 10.1145/514188.514190
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.3161
XML Schema Containment Checking Based on Semi-implicit Techniques, Proc. of CIAA, pp.51-61, 2003. ,
DOI : 10.1007/3-540-45089-0_20
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.7483
On Scalable Shape Analysis, 2007. ,
Full functional verification of linked data structures, Proc. of PLDI, pp.349-361, 2008. ,
DOI : 10.1145/1379022.1375624