Sciweavers

1821 search results - page 266 / 365
» Security-Aware Program Transformations
Sort
View
AGP
1999
IEEE
15 years 5 months ago
ACI1 constraints
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
Agostino Dovier, Carla Piazza, Enrico Pontelli, Gi...
88
Voted
PEPM
1994
ACM
15 years 4 months ago
The Essence of Eta-Expansion in Partial Evaluation
Abstract. Selective eta-expansion is a powerful "binding-time improvement", i.e., a sourceprogram modification that makes a partial evaluator yield better results. But li...
Olivier Danvy, Karoline Malmkjær, Jens Palsb...
AMAST
2008
Springer
15 years 2 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...
114
Voted
ATAL
2008
Springer
15 years 2 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
100
Voted
WSC
2004
15 years 2 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