3424 search results - page 260 / 685 » Automated Testing of Classes |
165
click to vote
LPAR
2004
Springer
16 years 4 days ago
2004
Springer
Abstract. Matching is a basic operation extensively used in computation. Second-order matching, in particular, provides an adequate environment for expressing program transformatio...
186
Voted
CSL
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. A new tree automata framework, called equational tree automata, is presented. In the newly introduced setting, congruence closures of recognizable tree languages are reco...
186
click to vote
ECSQARU
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. In this paper, we first investigate set semantics of propositional logic in terms of rough sets and discuss how truth values of propositions (sentences) can be interpret...
162
click to vote
ECSQARU
2001
Springer
15 years 11 months ago
2001
Springer
Abstract A (general) preferential entailment is defined by a “preference relation” among “states”. States can be either interpretations or sets of interpretations, or “c...
196
click to vote
LOPSTR
2001
Springer
15 years 11 months ago
2001
Springer
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of prin...