1536 search results - page 158 / 308 » The Underlying Logic of Hoare Logic |
144
click to vote
AISC
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We present a personal view and strategy for algorithm-supported mathematical theory exploration and draw some conclusions for the desirable functionality of future mathem...
173
Voted
ICFP
2010
ACM
15 years 7 months ago
2010
ACM
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
187
click to vote
LPNMR
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We study the complexity of consistency checking and query answering on incomplete databases for languages ranging from non-recursive Datalog to disjunctive Datalog with n...
251
click to vote
TMC
2012
13 years 9 months ago
2012
—We investigate the following fundamental question—how fast can information be collected from a wireless sensor network organized as tree? To address this, we explore and evalu...
174
click to vote
BIRTHDAY
1992
Springer
15 years 10 months ago
1992
Springer
A context-free grammar is a single-tree grammar (STG) if every nonterminal symbol has at most one production rule whose right hand side contains nonterminal symbols. Various prope...