11 search results - page 2 / 3 » On Recognizable Stable Trace Languages |
CONCUR
2006
Springer
13 years 8 months ago
2006
Springer
Traditionally, the various semantics of the process algebra Csp are formulated in denotational style. For many Csp models, e.g., the traces model, equivalent semantics have been gi...
PPPJ
2009
ACM
13 years 11 months ago
2009
ACM
Dynamic compilers can optimize application code speciļ¬cally for observed code behavior. Such behavior does not have to be stable across the entire program execution to be beneļ¬...
SEFM
2006
IEEE
13 years 10 months ago
2006
IEEE
We deļ¬ne a model of labelled product systems of automata and explore its connections with process calculi and trace languages. Bisimilarity of labelled product systems is deļ¬n...
NLDB
2004
Springer
13 years 10 months ago
2004
Springer
We propose a method of synonymous paraphrasing of a text based on WordNet synonymy data and Internet statistics of stable word combinations (collocations). Given a text, we look fo...
OOPSLA
2009
Springer
13 years 11 months ago
2009
Springer
Programs written in managed languages are compiled to a platform-independent intermediate representation, such as Java bytecode. The relative high level of Java bytecode has engen...