Sciweavers

2000 search results - page 276 / 400
» Program Transformation and Proof Transformation
Sort
View
152
Voted
AMAST
2008
Springer
15 years 5 months ago
Towards an Efficient Implementation of Tree Automata Completion
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
Emilie Balland, Yohan Boichut, Thomas Genet, Pierr...
ATAL
2008
Springer
15 years 5 months ago
A domain specific modeling language for multiagent systems
Software systems are becoming more and more complex with a large number of interacting partners often distributed over a network. A common dilemma faced by software engineers in b...
Christian Hahn
128
Voted
WSC
2004
15 years 5 months ago
Computer Automated Multi-Paradigm Modelling for Analysis and Design of Traffic Networks
Computer Automated Multi-Paradigm Modelling (CAMPaM) is an enabler for domain-specific analysis and design. Traffic, a new untimed visual formalism for vehicle traffic networks, i...
Hans Vangheluwe, Juan de Lara
DAGSTUHL
1996
15 years 5 months ago
A Self-Applicable Supercompiler
A supercompiler is a program which can performa deep transformation of programsusing a principle which is similarto partial evaluation, and can be referred to as metacomputation. ...
Andrei P. Nemytykh, Victoria A. Pinchuk, Valentin ...
GG
2008
Springer
15 years 4 months ago
Workshop on Graph Computation Models
A variety of computation models have been developed using graphs and graph transformations. These include models for sequential, distributed, parallel or mobile computation. A grap...
Mohamed Mosbah, Annegret Habel