Sciweavers

1147 search results - page 156 / 230
» Termination in language-based systems
Sort
View
ESOP
2001
Springer
14 years 2 months ago
Proof-Directed De-compilation of Low-Level Code
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
Shin-ya Katsumata, Atsushi Ohori
AOSD
2007
ACM
14 years 2 months ago
Tribe: a simple virtual class calculus
Beginning with BETA, a range of programming language mechanisms such as virtual classes (class-valued attributes of objects) have been developed to allow inheritance in the presen...
Dave Clarke, Sophia Drossopoulou, James Noble, Tob...
IADIS
2003
13 years 11 months ago
Querying Databases and XML Documents: Comparative Study and a New Proposal
XML has become the most useful standard of data interchange in the web and e-business world and there is a large amount of information stored in this format. Nonetheless, a large ...
Ana Fermoso García, María José...
SAC
2010
ACM
13 years 10 months ago
Data-aware design and verification of service compositions with Reo and mCRL2
Service-based systems can be modeled as stand-alone services coordinated by external connectors. Reo is a channelbased coordination language with well-defined semantics that enabl...
Natallia Kokash, Christian Krause, Erik P. de Vink
SAC
2006
ACM
14 years 4 months ago
Proactive resilience through architectural hybridization
In a recent work, we have shown that it is not possible to dependably build any type of distributed f fault or intrusiontolerant system under the asynchronous model. This result f...
Paulo Sousa, Nuno Ferreira Neves, Paulo Verí...