4573 search results - page 671 / 915 » Automated Reasoning |
136
click to vote
CSL
2009
Springer
15 years 10 months ago
2009
Springer
For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. I...
103
Voted
CSL
2009
Springer
15 years 10 months ago
2009
Springer
We investigate the relationship between two independently developed termination techniques for rst and higher-order rewrite systems. On the one hand, sized-types based termination...
116
click to vote
CSL
2009
Springer
15 years 10 months ago
2009
Springer
We study Craig interpolation for fragments and extensions of propositional linear temporal logic (PLTL). We consider various fragments of PLTL obtained by restricting the set of te...
140
click to vote
CSL
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. For a two-variable formula B(X,Y) of Monadic Logic of Order (MLO) the Church Synthesis Problem concerns the existence and construction of a finite-state operator Y=F(X) ...
130
click to vote
CSL
2009
Springer
15 years 10 months ago
2009
Springer
This paper investigates a methodology of using FM (Fraenkel-Mostowski) sets, and the ideas of nominal set theory, to adjoin name generation to a semantic theory. By developing a d...