Sciweavers

1418 search results - page 115 / 284
» The Dynamic Complexity of Formal Languages
Sort
View
147
Voted
ICALP
2007
Springer
15 years 10 months ago
Conservative Ambiguity Detection in Context-Free Grammars
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
Sylvain Schmitz
EUROMICRO
2007
IEEE
15 years 6 months ago
Analysis of BPEL Data Dependencies
BPEL is a de-facto standard language for web service orchestration. It is a challenge to test BPEL processes automatically because of the complex features of the language. The cur...
Yongyan Zheng, Jiong Zhou, Paul Krause
ECOOP
2008
Springer
15 years 6 months ago
A Model for Java with Wildcards
Wildcards are a complex and subtle part of the Java type system, present since version 5.0. Although there have been various formalisations and partial type soundness results conce...
Nicholas R. Cameron, Sophia Drossopoulou, Erik Ern...
ENTCS
2007
112views more  ENTCS 2007»
15 years 4 months ago
A Calculus of Global Interaction based on Session Types
This paper proposes a calculus for describing communication-centred programs and discusses its use through a formal description of several use cases from real business protocols. ...
Marco Carbone, Kohei Honda, Nobuko Yoshida
FORTE
2009
15 years 2 months ago
Typing Component-Based Communication Systems
Abstract. Building complex component-based software systems, for instance communication systems based on the Click, Coyote, Appia, or Dream frameworks, can lead to subtle assemblag...
Michael Lienhardt, Claudio Antares Mezzina, Alan S...