311 search results - page 31 / 63 » A Bialgebraic Approach to Automata and Formal Language Theor... |
LOPSTR
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In this paper we focus on the problem of testing agent programs written in BUpL, an executable, high-level modelling agent language. Our approach consists of two main ste...
GPCE
2008
Springer
13 years 9 months ago
2008
Springer
Building complex component-based software architectures can lead to subtle assemblage errors. In this paper, we introduce a typesystem-based approach to avoid message handling err...
IEEEARES
2009
IEEE
14 years 3 months ago
2009
IEEE
—Alice and Bob notation is a popular way to describe security protocols: it is intuitive, succinct, and yet expressive. Several formal protocol specification languages are based...
OTM
2007
Springer
14 years 2 months ago
2007
Springer
Development of ontology development tools and ontology-enhanced software applications requires thorough understanding of ontology languages in order to implement them according to ...
MLG
2007
Springer
14 years 2 months ago
2007
Springer
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...