Sciweavers

5699 search results - page 4 / 1140
» Alternating model trees
Sort
View
CAV
2006
Springer
129views Hardware» more  CAV 2006»
15 years 2 months ago
Languages of Nested Trees
We study languages of nested trees--structures obtained by augmenting trees with sets of nested jump-edges. These graphs can naturally model branching behaviors of pushdown program...
Rajeev Alur, Swarat Chaudhuri, P. Madhusudan
QEST
2007
IEEE
15 years 4 months ago
Performance Trees: Expressiveness and Quantitative Semantics
—Performance Trees are a recently-proposed mechanism for the specification of performance properties and measures. They represent an attractive alternative to stochastic logics,...
Tamas Suto, Jeremy T. Bradley, William J. Knottenb...
FOCS
2005
IEEE
15 years 4 months ago
Safraless Decision Procedures
The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical logics. To decide whether a formula in a logic with the...
Orna Kupferman, Moshe Y. Vardi
CORR
2010
Springer
125views Education» more  CORR 2010»
14 years 10 months ago
Tree Languages Defined in First-Order Logic with One Quantifier Alternation
We study tree languages that can be defined in 2. These are tree languages definable by a first-order formula whose quantifier prefix is , and simultaneously by a first-order for...
Mikolaj Bojanczyk, Luc Segoufin
ISIPTA
2003
IEEE
102views Mathematics» more  ISIPTA 2003»
15 years 3 months ago
A Sensitivity Analysis for the Pricing of European Call Options in a Binary Tree Model
The European call option prices have well-known formulae in the Cox-RossRubinstein model [2], depending on the volatility of the underlying asset. Nevertheless it is hard to give ...
Huguette Reynaerts, Michèle Vanmaele