Sciweavers

298 search results - page 27 / 60
» Abstract Models of Transfinite Reductions
Sort
View
FCT
2005
Springer
15 years 3 months ago
A Self-dependency Constraint in the Simply Typed Lambda Calculus
We consider terms of simply typed lambda calculus in which copy of a subterm may not be inserted to the argument of itself during the reduction. The terms form wide class which inc...
Aleksy Schubert
WFLP
2009
Springer
255views Algorithms» more  WFLP 2009»
15 years 2 months ago
Constraint Based Strategies
Numerous computational and deductive frameworks use the notion of strategy to guide reduction and search space exploration, making the macro scale control of micro operations an ex...
Claude Kirchner, Florent Kirchner, Hél&egra...
STTT
2010
116views more  STTT 2010»
14 years 5 months ago
LTL satisfiability checking
Abstract. We report here on an experimental investigation of LTL satisfiability checking via a reduction to model checking. By using large LTL formulas, we offer challenging model-...
Kristin Y. Rozier, Moshe Y. Vardi
INFOCOM
2002
IEEE
15 years 3 months ago
Restoration Algorithms for Virtual Private Networks in the Hose Model
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
Giuseppe F. Italiano, Rajeev Rastogi, Bülent ...
SPIN
2001
Springer
15 years 2 months ago
Addressing Dynamic Issues of Program Model Checking
Abstract. Model checking real programs has recently become an active research area. Programs however exhibit two characteristics that make model checking di cult: the complexity of...
Flavio Lerda, Willem Visser