A logic you can count on

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn 31, Issue , 2004, Pages 135-146

  Dal Zilio, Silvano ^a   Lugiez, Denis ^a   Meyssonnler, Charles ^a  

^a CNRS   (France)

Author keywords

Ambient; Presburger arithmetic; Semi structured data; Substructural logic; Tree automata

Indexed keywords

ALGORITHMS; DATA REDUCTION; INFORMATION ANALYSIS; OPTIMIZATION; PROBLEM SOLVING; RECURSIVE FUNCTIONS; SYNTACTICS; TREES (MATHEMATICS);

AMBIENT; PRESBURGER ARITHMETIC; SEMI-STRUCTURED DATA; SUBSTRUCTURAL LOGIC; TREE AUTOMATA;

COMPUTER PROGRAMMING LANGUAGES;

EID: 2442596049     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/964001.964013     Document Type: Conference Paper

References (31)

1. S. Abiteboul, P. Buneman, and D. Suciu. Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, 1999.
2. B. Boigelot, S. Jodogne, and P. Wolper. On the use of weak automata for deciding linear arithmetic with integer and real variables. In International Joint Conference on Automated Reasoning (IJCAR), volume 2083 of LNCS, pp. 611-625. Springer, 2001.
3. C. Calcagno, L. Cardelli, and A. D. Gordon. Deciding validcity in a spatial logic for trees. In ACM Workshop on Types in Language Design and Implementaion, TLDI '03, pp. 62-73. ACM Press, 2003.
4. C. Calcagno, H. Yang, and P. O'Heam. Computability and complexity results for a spatial assertion language for data structures. In Foundations of Software Technology and Theoretical Computer Science (FST & TCS), volume 2245 of LNCS. Springer, 2001.
5. L. Cardelli. Describing semistructured data. SIGMOD Record, 30(4), 2001. Database Principles Column.
6. L. Cardelli and L. Caires. A spatial logic for concurrency (part I). In Theoretical Aspects of Computer Software (TACS), volume 2215 of LNCS, pp. 1-37. Springer, 2001.
7. L. Cardelli and G. Ghelli. A query language based on the ambient logic. In ESOP'01, volume 2028 of LNCS, pp. 1-22. Springer, 2001.
8. L. Cardelli and A. Gordon. Mobile ambients. In Foundations of Software Science and Computation Structures (FoSSaCS), volume 1378 of LNCS, pp. 140-155. Springer, 1998.
9. L. Cardelli and A. Gordon. Anytime, anywhere: Modal logic for mobile ambients. In Principles of Programming Languages (POPL). ACM Press, 2000.
10. L. Cardelli and A. Gordon. Logical properties of name restriction. In Typed Lambda Calculus and Applications (TLCA), volume 2044 of LNCS. Springer, 2001.
11. W. Charatonik, S. Dal Zilio, A. Gordon, S. Mukhopadhyay, and J.-M. Talbot. Model checking mobile ambients. Theoretical Computer Science, 308(1):277-332, 2003.
12. W. Charatonik and J.-M. Talbot. The decidability of model checking mobile ambients. In Conference of the European Association for Computer Science Logic (CSL), volume 2142 of LNCS, pp. 339-354. Springer, 2001.
13. T. Colcombet. Rewriting in the partial algebra of typed terms modulo AC. In International Workshop on Verification of Infinite-State Systems (INFINITY), volume 68 of Electronic Notes in Theoretical Computer Science. Elsevier Science, 2002.
14. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http://www. grappa.univ-lille3.fr/tata, 1997. release October, 1st 2002.
15. D. Cooper. Theorem-proving in arithmetic without multiplication. Machine Intelligence, 7, 1972.
16. S. Dal Zilio and D. Lugiez. Multitrees automata, Presburger constraints and tree logics. Technical Report 08-2002, LIF, June 2002.
17. S. Dal Zilio and D. Lugiez. XML schema, tree logic and sheaves automata. In Rewriting Techniques and Applications (RTA), volume 2706 of LNCS, pp. 246-263. Springer, 2003. Appears also as Technical Report 4641, INRIA, Nov. 2002.
18. S. Dal Zilio and D. Lugiez. XML schema, tree logic and sheaves automata. In Rewriting Techniques and Applications (RTA), volume 2706 of LNCS, pp. 246-263. Springer, 2003. Appears also as Technical Report 4641, INRIA, Nov. 2002.
19. S. Dal Zilio, D. Lugiez, and C. Meyssonnier. A logic you can count on. Technical report, INRIA, 2003. (to appear).
20. M. Fischer and M.O.Rabin. Super-exponential complexity of presburger arithmetic. In SIAM-AMS Symposium in Applied Mathematics, volume 7, pp. 27-41, 1974.
21. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax involving binders. In Symposium on Logic in Computer Science (LICS), pp. 214-224. IEEE, 1999.
22. H. Hosoya and B. C. Pierce. Regular expression pattern matching for XML. In Principles of Programming Languages (POPL), pp. 67-80. ACM Press, 2001.
23. S. Ishtiaq and P. W. O'Heam. BI as an assertion language for mutable data structures. In Principles of Programming Languages (POPL), pp. 14-26. ACM Press, 2001.
24. M. Kanovich. Horn programming in linear logic is NP-complete. In Symposium on Logic in Computer Science (LICS), pp. 200-210. IEEE, 1992.
25. D. Lugiez. Counting and equality constraints for multitree automata. In Foundations of Software Science and Computation Structures (FoSSaCS), volume 2620 of LNCS, pp. 328-342. Springer, 2003.
26. M. Makoto. Extended path expression for XML. In Principles of Database Systems (PODS). ACM Press, 2001.
27. 22pn upper bound on the complexity of pres-burger arithmetic. Journal of Computer and System Sciences, 16:323-332, 1978.
28. Profundis: Proofs of functionality for mobile distributed systems, http://www.it.uu.se/profundis/.
29. W. Pugh. The omega test: a fast and practical integer programming algorithm for dependence analysis. Communications of the ACM, 35(8): 102-114, 1992.
30. RELAX-NG. http://www.relaxng.org.
31. W3C Recommendation. XML Schema Part 1: Structures, 2001.