1032 search results - page 16 / 207 » Extended Computation Tree Logic |
FSTTCS
2010
Springer
14 years 7 months ago
2010
Springer
This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-o...
PROCEDIA
2010
14 years 4 months ago
2010
The field of bioinformatics is witnessing a rapid and overwhelming accumulation of molecular sequence data, predominantly driven by novel wet-lab sequencing techniques. This trend...
74
Voted
WOLLIC
2009
Springer
15 years 4 months ago
2009
Springer
Team logic is a new logic, introduced by Väänänen [11], extending dependence logic by classical negation. Dependence logic adds to first-order logic atomic formulas expressing...
81
Voted
IWFM
2003
14 years 11 months ago
2003
We outline a possible logic that will allow us to give a unified approach to reasoning about computational effects. The logic is given by extending Moggi’s computational λ-cal...
ESOP
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...