852 search results - page 150 / 171 » entcs 2010 |
ENTCS
2007
14 years 10 months ago
2007
The dependency pairs method is one of the most powerful technique for proving termination of rewriting and it is currently central in most automatic termination provers. Recently,...
ENTCS
2007
14 years 10 months ago
2007
The timed concurrent constraint programming language (tccp in short) was introduced for modeling reactive systems. This language allows one to model in a very intuitive way typica...
ENTCS
2007
14 years 10 months ago
2007
Formal sequentialization is introduced as a rewriting process for the reduction of parallelism and internal communication statements of distributed imperative programs. It constru...
83
Voted
ENTCS
2007
14 years 10 months ago
2007
In the domain of software engineering, the use of software components is now a well established approach. However, it raises problems about the dynamic adaptation of these compone...
ENTCS
2007
14 years 10 months ago
2007
We define a logic EpCTL for reasoning about the evolution of probabilistic systems. System states correspond to probability distributions over classical states and the system evo...