238 search results - page 43 / 48 » Compositional Proof Methods for Concurrency: A Semantic Appr... |
157
click to vote
POPL
2004
ACM
15 years 10 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
ICTAC
2009
Springer
14 years 7 months ago
2009
Springer
Testing from first-order specifications has mainly been studied for flat specifications, that are specifications of a single software module. However, the specifications of large s...
ENTCS
2008
14 years 9 months ago
2008
Mathematical texts can be computerized in many ways that capture differing amounts of the mathematical meaning. At one end, there is document imaging, which captures the arrangeme...
ILP
2003
Springer
15 years 2 months ago
2003
Springer
The learning system Progol5 and the underlying inference method of Bottom Generalisation are firmly established within Inductive Logic Programming (ILP). But despite their success...
ECAI
2000
Springer
15 years 1 months ago
2000
Springer
Several high-level programming languages for programming agents and robots have been proposed in recent years. Each of these languages has its own features and merits. It is still...