-
3
-
-
85029633250
-
Equality and Disequality Constraints on Direct Subterms in Tree Automata
-
9th Symp. on Theoretical Aspects of Computer Science, STACS, of, Springer
-
B. Bogaert and S. Tison. Equality and Disequality Constraints on Direct Subterms in Tree Automata. In 9th Symp. on Theoretical Aspects of Computer Science, STACS, volume 577 of LNCS, pages 161-171. Springer, 1992.
-
(1992)
LNCS
, vol.577
, pp. 161-171
-
-
Bogaert, B.1
Tison, S.2
-
4
-
-
15744388991
-
Tree automata with one memory, set constraints and cryptographic protocols
-
Feb
-
H. Comon and V. Cortier. Tree automata with one memory, set constraints and cryptographic protocols. Theoretical Computer Science, 331(1):143-214, Feb. 2005.
-
(2005)
Theoretical Computer Science
, vol.331
, Issue.1
, pp. 143-214
-
-
Comon, H.1
Cortier, V.2
-
5
-
-
0004060205
-
-
H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. http://www.grappa.univ-lille3.fr/tata, 1997.
-
(1997)
Tree Automata Techniques and Applications
-
-
Comon, H.1
Dauchet, M.2
Gilleron, R.3
Jacquemard, F.4
Lugiez, D.5
Tison, S.6
Tommasi, M.7
-
6
-
-
0344981314
-
Ground reducibility is exptime-complete
-
H. Comon and F. Jacquemard. Ground reducibility is exptime-complete. Information and Computation, 187(1):123-153, 2003.
-
(2003)
Information and Computation
, vol.187
, Issue.1
, pp. 123-153
-
-
Comon, H.1
Jacquemard, F.2
-
7
-
-
84858513843
-
-
H. Comon-Lundh, F. Jacquemard, and N. Perrin. Tree automata with memory, visibility and structural constraints. Technical Report LSV-07-01, Laboratoire Spécification et Vérification, Jan. 2007. 25 pages.
-
H. Comon-Lundh, F. Jacquemard, and N. Perrin. Tree automata with memory, visibility and structural constraints. Technical Report LSV-07-01, Laboratoire Spécification et Vérification, Jan. 2007. 25 pages.
-
-
-
-
8
-
-
0028769280
-
Bottom-up tree push-down automata: Classification and connection with rewrite systems
-
J.-L. Coquidé, M. Dauchet, R. Gilleron, and S. Vagvölgyi. Bottom-up tree push-down automata: classification and connection with rewrite systems. Theoretical Computer Science, 127(1):69-98, 1994.
-
(1994)
Theoretical Computer Science
, vol.127
, Issue.1
, pp. 69-98
-
-
Coquidé, J.-L.1
Dauchet, M.2
Gilleron, R.3
Vagvölgyi, S.4
-
11
-
-
33745789640
-
Automata-based verification of programs with tree updates
-
Proc. 12th Intern. Conf. on Tools and Algorithms for the Construction and Analysis of Systems TACAS'06, of, April
-
P. Habermehl, R. Iosif, and T. Vojnar. Automata-based verification of programs with tree updates. In Proc. 12th Intern. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'06), volume 3920 of LNCS, April 2006.
-
(2006)
LNCS
, vol.3920
-
-
Habermehl, P.1
Iosif, R.2
Vojnar, T.3
-
14
-
-
0028548321
-
Powerlist: A structure for parallel recursion
-
November
-
J. Misra. Powerlist: A structure for parallel recursion. ACM Transactions on Programming Languages and Systems, 16(6):1737-1767, November 1994.
-
(1994)
ACM Transactions on Programming Languages and Systems
, vol.16
, Issue.6
, pp. 1737-1767
-
-
Misra, J.1
|