2273 search results - page 233 / 455 » On the Expressiveness and Complexity of ATL |
172
click to vote
ESEC
1997
Springer
15 years 10 months ago
1997
Springer
The decomposition of a software application into components and connectors at the design stage has been promoted as a way to describe and reason about complex software architecture...
191
click to vote
LOPSTR
1997
Springer
15 years 10 months ago
1997
Springer
Synthesis of logic programs is considered as a special instance of logic programming. We describe experience made within a logical metaprogramming environment whose central compone...
165
click to vote
EKAW
1994
Springer
15 years 10 months ago
1994
Springer
Formal knowledge modelling languages have a number of advantages over informal languages, such as their precise meaning and the possibility to derive propertiesthrough formal proof...
203
click to vote
AGTIVE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Since the systematic evolution of graph-like program models has become important in software engineering, graph transformation has gained much attention in this area. For...
173
click to vote
APLAS
2007
ACM
15 years 10 months ago
2007
ACM
Abstract. We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete lattices. This theory improves over existing results by providing a way to c...