Sciweavers

264 search results - page 34 / 53
» entcs 2008
Sort
View
ENTCS
2008
87views more  ENTCS 2008»
13 years 7 months ago
The Complexity of Satisfiability for Fragments of CTL and CTL*
The satisfiability problems for CTL and CTL are known to be EXPTIME-complete, resp. 2EXPTIMEcomplete (Fischer and Ladner (1979), Vardi and Stockmeyer (1985)). For fragments that u...
Arne Meier, Martin Mundhenk, Michael Thomas, Herib...
ENTCS
2008
62views more  ENTCS 2008»
13 years 7 months ago
Undecidable Control Conditions in Graph Transformation Units
Graph transformation units are an approach-independent concept for programming by applying rules and imported transformation units to graphs, starting in an initial and ending in ...
Karsten Hölscher, Renate Klempien-Hinrichs, P...
ENTCS
2008
91views more  ENTCS 2008»
13 years 7 months ago
Implementing Real Numbers With RZ
RZ is a tool which translates axiomatizations of mathematical structures to program specifications using the realizability interpretation of logic. This helps programmers correctl...
Andrej Bauer, Iztok Kavkler
ENTCS
2008
71views more  ENTCS 2008»
13 years 7 months ago
Implementing a Domain-Specific Language Using Stratego/XT: An Experience Paper
We describe the experience of implementing a Domain-Specific Language using transformation to a General Purpose Language. The domain of application is image processing and low-lev...
Leonard G. C. Hamey, Shirley Goldrei
ENTCS
2008
118views more  ENTCS 2008»
13 years 7 months ago
Barbed Model-Driven Software Development: A Case Study
When thinking of MDE, the immediate understanding is that models drive software development, in the at the software is constructed by transforming models from higher levels of abs...
Carlo Montangero, Laura Semini