1076 search results - page 131 / 216 » Operations on proofs and labels |
ENTCS
2010
13 years 9 months ago
2010
The validity/satisfiability problem for most propositional interval temporal logics is (highly) undecidable, under very weak assumptions on the class of interval structures in whi...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
This paper shows how the steady-state availability and failure frequency can be calculated in a single pass for very large systems, when the availability is expressed as a product...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
It is known that the expansion property of a graph influences the performance of the corresponding code when decoded using iterative algorithms. Certain graph products may be used ...
ENTCS
2006
13 years 9 months ago
2006
We define and use a SOS-based framework to specify the transition systems of calculi with name-passing properties. This setting uses proof-theoretic tools to take care of some of ...
JFP
2006
13 years 9 months ago
2006
Confinement properties impose a structure on object graphs which can be used to enforce encapsulation properties. From a practical point of view, encapsulation is essential for bu...