Sciweavers

1128 search results - page 113 / 226
» Little Engines of Proof
Sort
View
CBSE
2004
Springer
15 years 6 months ago
Correctness of Component-Based Adaptation
Abstract. Long running applications often need to adapt due to changing requirements or changing environment. Typically, such adaptation is performed by dynamically adding or remov...
Sandeep S. Kulkarni, Karun N. Biyani
93
Voted
FOSSACS
2004
Springer
15 years 6 months ago
Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting
Abstract. Motivated by recent work on the derivation of labelled transitions and bisimulation congruences from unlabelled reaction rules, we show how to solve this problem in the D...
Hartmut Ehrig, Barbara König
138
Voted
FOSSACS
2004
Springer
15 years 6 months ago
Polynomials for Proving Termination of Context-Sensitive Rewriting
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
Salvador Lucas
FSTTCS
2004
Springer
15 years 6 months ago
Visibly Pushdown Games
The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We stu...
Christof Löding, P. Madhusudan, Olivier Serre
GCC
2004
Springer
15 years 6 months ago
State Management Issues and Grid Services
Defining the ways for components around the world to collaborate with each other to execute applications over the internet is one of the biggest challenges for computer scientists...
Yong Xie, Yong Meng Teo