4 search results - page 1 / 1 » On Elkan's theorems: Clarifying their meaning via simple pro... |
IJIS
2007
13 years 10 months ago
2007
PLPV
2011
ACM
13 years 1 months ago
2011
ACM
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...
POPL
2010
ACM
14 years 8 months ago
2010
ACM
Building semantic models that account for various kinds of indirect reference has traditionally been a difficult problem. Indirect reference can appear in many guises, such as hea...
PODS
2007
ACM
14 years 11 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...