528 search results - page 32 / 106 » Transition Logic Revisited |
108
Voted
MLQ
2002
15 years 1 months ago
2002
A modal logic is called invariant if for all automorphisms of NExt K, () = . An invariant logic is therefore uniquely determined by its surrounding in the lattice. It will be est...
121
click to vote
FTRTFT
1998
Springer
15 years 6 months ago
1998
Springer
We present a compositional semantics of synchronous systems that captures both safety and progress properties of such systems. The fair synchronous transitions systems (fsts) mode...
109
click to vote
HIPEAC
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Technological advances and increasingly complex and dynamic application behavior argue for revisiting mechanisms that adapt logical cache block size to application charac...
122
click to vote
APLAS
2007
ACM
15 years 5 months ago
2007
ACM
Abstract. We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete lattices. This theory improves over existing results by providing a way to c...
172
Voted
MLG
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We revisit an application developed originally using Inductive Logic Programming (ILP) by replacing the underlying Logic Program (LP) description with Stochastic Logic Pr...