455 search results - page 76 / 91 » The Linear Logical Abstract Machine |
73
Voted
SIGSOFT
2006
ACM
15 years 10 months ago
2006
ACM
A method for extracting syntactic specifications from heapmanipulating code is described. The state of the heap is represented as an environment mapping each variable or field to ...
ICRA
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract— Tightly-coupled multi-agent systems such as modular robots frequently exhibit properties of interest that span multiple modules. These properties cannot easily be detec...
CAV
2007
Springer
15 years 3 months ago
2007
Springer
Liveness temporal properties state that something “good” eventually happens, e.g., every request is eventually granted. In Linear Temporal Logic (LTL), there is no a priori bo...
106
click to vote
CONCUR
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
DBPL
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. Based on the recursion mechanism of the XML transformation language XSL, the document transformation language DTL is defined. First the instantiation DTLreg is considere...