Sciweavers

2273 search results - page 404 / 455
» On the Expressiveness and Complexity of ATL
Sort
View
81
Voted
ICSE
2003
IEEE-ACM
15 years 10 months ago
ViewPoints: meaningful relationships are difficult!
The development of complex systems invariably involves many stakeholders who have different perspectives on the problem they are addressing, the system being developed, and the pr...
Bashar Nuseibeh, Jeff Kramer, Anthony Finkelstein
ICFP
2005
ACM
15 years 9 months ago
PolyAML: a polymorphic aspect-oriented functional programming language
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type a...
Daniel S. Dantas, David Walker, Geoffrey Washburn,...
ICFP
2003
ACM
15 years 9 months ago
Software is discrete mathematics
A three-year study collected information bearing on the question of whether studying mathematics improves programming skills. An analysis of the data revealed significant differen...
Rex L. Page
POPL
2010
ACM
15 years 7 months ago
Dependent types and program equivalence
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
Jianzhou Zhao, Limin Jia, Stephanie Weirich, Vilhe...
SODA
2010
ACM
235views Algorithms» more  SODA 2010»
15 years 7 months ago
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...