Sciweavers

4767 search results - page 59 / 954
» Structures for Abstract Rewriting
Sort
View
ENTCS
2007
120views more  ENTCS 2007»
13 years 8 months ago
Local Reasoning about Data Update
We present local Hoare reasoning about data update, using Context Logic for analysing structured data. We apply our reasoning to tree update, heap update which is analogous to loc...
Cristiano Calcagno, Philippa Gardner, Uri Zarfaty
CORR
2010
Springer
76views Education» more  CORR 2010»
13 years 9 months ago
Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies
Abstract. We study normalising reduction strategies for infinitary Combinatory Reduction Systems (iCRSs). We prove that all fair, outermost-fair, and needed-fair strategies are nor...
Jeroen Ketema, Jakob Grue Simonsen
ECBS
2009
IEEE
130views Hardware» more  ECBS 2009»
14 years 3 months ago
Validating and Dynamically Adapting and Composing Features in Concurrent Product-Lines Applications
With the pressing in-time-market towards customized services, software product lines (SPL) are increasingly characterizing most of software landscape. SPL are mainly structured th...
Nasreddine Aoumeur, Kamel Barkaoui, Gunter Saake
ACSD
2006
IEEE
106views Hardware» more  ACSD 2006»
14 years 2 months ago
Synchronous + Concurrent + Sequential = Earlier than + Not later than
In this paper, we show how to obtain causal semantics distinguishing ”earlier than” and ”not later than” causality between events from algebraic semantics of Petri nets. J...
Gabriel Juhás, Robert Lorenz, Sebastian Mau...
TAPSOFT
1993
Springer
14 years 27 days ago
Optimal Reductions in Interaction Systems
Lamping's optimalgraph reduction technique for the -calculus is generalized to a new class of higher order rewriting systems, called Interaction Systems. Interaction Systems ...
Andrea Asperti, Cosimo Laneve