Sciweavers

264 search results - page 20 / 53
» entcs 2008
Sort
View
ENTCS
2008
125views more  ENTCS 2008»
13 years 6 months ago
Can Refinement be Automated?
We automatically verify Back's atomicity refinement law and a classical data refinement law for action systems. Our novel approach mechanises a refinement calculus based on K...
Peter Höfner, Georg Struth
ENTCS
2008
98views more  ENTCS 2008»
13 years 6 months ago
Modifying Contracts with Larissa Aspects
This paper combines two successful techniques from software engineering, aspect-oriented programming and design-by-contract, and applies them in the context of reactive systems. F...
David Stauch
ENTCS
2008
95views more  ENTCS 2008»
13 years 6 months ago
An Experimental Ambiguity Detection Tool
Although programs convey an unambiguous meaning, the grammars used in practice to describe their syntax are often ambiguous, and completed with disambiguation rules. Whether these...
Sylvain Schmitz
ENTCS
2008
85views more  ENTCS 2008»
13 years 6 months ago
Innermost Termination of Rewrite Systems by Labeling
Semantic labeling is a powerful transformation technique for proving termination of term rewrite systems. The semantic part is given by a model or a quasi-model of the rewrite rul...
René Thiemann, Aart Middeldorp
ENTCS
2008
129views more  ENTCS 2008»
13 years 6 months ago
The York Abstract Machine
Abstract Machine Greg Manning1 Detlef Plump2 Department of Computer Science The University of York, UK duce the York Abstract Machine (YAM) for implementing the graph programming ...
Greg Manning, Detlef Plump