Sciweavers

632 search results - page 96 / 127
» Explicit Substitutions and Programming Languages
Sort
View
ICFP
2007
ACM
14 years 7 months ago
Bidirectionalization transformation based on automatic derivation of view complement functions
Bidirectional transformation is a pair of transformations: a view function and a backward transformation. A view function maps one data structure called source onto another called...
Kazutaka Matsuda, Zhenjiang Hu, Keisuke Nakano, Ma...
ICTAC
2004
Springer
14 years 29 days ago
A Proof of Weak Termination Providing the Right Way to Terminate
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
Olivier Fissore, Isabelle Gnaedig, Hél&egra...
TOOLS
2008
IEEE
14 years 1 months ago
Modeling of Component Environment in Presence of Callbacks and Autonomous Activities
Abstract. A popular approach to compositional verification of component-based applications is based on the assume-guarantee paradigm, where an assumption models behavior of an env...
Pavel Parizek, Frantisek Plasil
TOOLS
2000
IEEE
13 years 12 months ago
Design and Implementation of CORBA-Based Subscription Server
The standard CORBA operation invocation model supports synchronous, one-way, and deferred synchronous interactions between clients and servers. However, this model is too restrict...
R. Maheshwari, R. Fatoohi
ECOOP
2009
Springer
14 years 8 months ago
Type-Based Object Immutability with Flexible Initialization
We present a type system for checking object immutability, read-only references, and class immutability in an open or closed world. To allow object initialization outside object co...
Christian Haack, Erik Poll