4353 search results - page 242 / 871 » Expressiveness of Process Algebras |
174
click to vote
CNL
2009
15 years 7 months ago
2009
Abstract. Anaphora resolution in current computer-processable controlled natural languages relies mainly on syntactic information, accessibility constraints and the distance of the...
144
click to vote
TGC
2007
Springer
16 years 19 days ago
2007
Springer
We study type systems for termination in the π-calculus from the point of view of type inference. We analyse four systems by Deng and Sangiorgi. We show that inference can be done...
162
click to vote
FORTE
2001
15 years 8 months ago
2001
The modal logic FULL is designed to capture strong bisimulation over early symbolic transition systems (STSs) for full LOTOS. It provides a compact way of expressing and verifying ...
159
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
—Situations in many fields of research, such as digital communications, nuclear physics and mathematical finance, can be modelled with random matrices. When the matrices get la...
150
click to vote
TSE
2002
15 years 6 months ago
2002
We propose an approach (GQM/MEDEA) for defining measures of product attributes in software engineering. The approach is driven by the experimental goals of measurement, expressed v...