903 search results - page 2 / 181 » Completeness Results for Memory Logics |
143
click to vote
LOGCOM
2006
15 years 5 months ago
2006
For every Kripke complete modal logic L we define its hybrid companion LH . For a reasonable class of logics, we present a satisfiability-preserving translation from LH to L. We p...
162
click to vote
DDECS
2008
IEEE
16 years 13 days ago
2008
IEEE
: We propose a simple and fast two-level minimization algorithm for completely specified functions in this paper. The algorithm is based on processing ternary trees. A ternary tree...
175
click to vote
CHARME
2003
Springer
15 years 11 months ago
2003
Springer
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
167
click to vote
FASE
2008
Springer
15 years 7 months ago
2008
Springer
For a number of programming languages, among them Eiffel, C, Java and Ruby, Hoare-style logics and dynamic logics have been developed. In these logics, pre- and postconditions are ...
179
click to vote
ATAL
2010
Springer
15 years 6 months ago
2010
Springer
ATL+ is a variant of alternating-time temporal logic that does not have the expressive power of full ATL , but still allows for expressing some natural properties of agents. It ha...