815 search results - page 19 / 163 » Algebraic Recognizability of Languages |
116
click to vote
JSS
2010
14 years 6 months ago
2010
Architectural description languages are a useful tool for modeling complex systems at a high level of abstraction. If based on formal methods, they can also serve for enabling the...
TACS
2001
Springer
15 years 4 months ago
2001
Springer
We give a logic programming language based on Fiore, Plotkin and Turi’s binding algebras. In this language, we can use not only first-order terms but also terms involving variab...
ICALP
1997
Springer
15 years 3 months ago
1997
Springer
Abstract. Milner proposed an axiomatization for the Kleene star in basic process algebra, in the presence of deadlock and empty process, modulo bisimulation equivalence. In this pa...
IFIP
1994
Springer
15 years 3 months ago
1994
Springer
We describe the architecture of an evolving algebra partial evaluator, a program which specializes an evolving algebra with respect to a portion of its input. We discuss the parti...
115
click to vote
SOSL
1993
15 years 3 months ago
1993
In this paper we study automatic veri cation of proofs in process algebra. Formulas of process algebra are represented by types in typed -calculus. Inhabitants (terms) of these ty...