UNRESTRICTED AND DISJOINT OPERATIONS OVER MULTI-STACK VISIBLY PUSHDOWN LANGUAGES

Stefan D. Bruda, Tawhid Bin Waez

Abstract

Visibly pushdown languages (VPL) were proposed as a formalism for specifying and verifying complex, recursive systems such as application software. However, VPL are unsuitable for compositional specification, as they are not closed under shuffle. Multi-stack visibly pushdown languages (MVPL) express naturally concurrent constructions. Concurrency cannot be expressed compositionally however, for MVPL are not closed under shuffle either. MVPL operations also restrict rigidly the input alphabets, which hinders the specification of dynamic threads; if we remove these restrictions MVPL loose almost all their closure properties. We find however a natural renaming process that yields disjoint MVPL operations. These operations eliminate the mentioned restrictions and creates closure under shuffle. This effort opens the area of MVPL-based compositional specification and verification.

References

  1. Alur, R., Etessami, K., and Madhusudan, P. (2004). A temporal logic of nested calls and returns. In Proceedings of the 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 04), pages 467-481. Springer.
  2. Alur, R. and Madhusudan, P. (2004). Visibly pushdown languages. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC 04), pages 202-211. ACM Press.
  3. Bergstra, J. A. and Klop, J. W. (1988). Process theory based on bisimulation semantics. In de Bakker, J. W., de Roever, W., and Rozenberg, G., editors, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, pages 50-122. Springer.
  4. Bruda, S. D. and Bin Waez, M. T. (2009). Communicating Visibly pushdown Processes. In The 17th International Conference on Control Systems and Computer Science, volume 1, pages 507-514.
  5. Carotenuto, D., Murano, A., and Peron, A. (2007). 2-visibly pushdown automata. In Proceedings of the 11th International Conference on Developments in Language Theory (DLT 2007), pages 132-144. Springer.
  6. La Torre, S., Madhusudan, P., and Parlato, G. (2007). A robust class of context-sensitive languages. In Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 07), pages 161-170, Washington, DC, USA. IEEE Computer Society.
  7. Lewis, H. R. and Papadimitriou, C. H. (1998). Elements of the Theory of Computation. Prentice-Hall.
  8. Madhusudan, P. (2008). Private communication.
Download


Paper Citation


in Harvard Style

D. Bruda S. and Bin Waez T. (2011). UNRESTRICTED AND DISJOINT OPERATIONS OVER MULTI-STACK VISIBLY PUSHDOWN LANGUAGES . In Proceedings of the 6th International Conference on Software and Database Technologies - Volume 2: ICSOFT, ISBN 978-989-8425-77-5, pages 156-161. DOI: 10.5220/0003494101560161


in Bibtex Style

@conference{icsoft11,
author={Stefan D. Bruda and Tawhid Bin Waez},
title={UNRESTRICTED AND DISJOINT OPERATIONS OVER MULTI-STACK VISIBLY PUSHDOWN LANGUAGES},
booktitle={Proceedings of the 6th International Conference on Software and Database Technologies - Volume 2: ICSOFT,},
year={2011},
pages={156-161},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003494101560161},
isbn={978-989-8425-77-5},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 6th International Conference on Software and Database Technologies - Volume 2: ICSOFT,
TI - UNRESTRICTED AND DISJOINT OPERATIONS OVER MULTI-STACK VISIBLY PUSHDOWN LANGUAGES
SN - 978-989-8425-77-5
AU - D. Bruda S.
AU - Bin Waez T.
PY - 2011
SP - 156
EP - 161
DO - 10.5220/0003494101560161