1715 search results - page 236 / 343 » How Space Structures Language |
209
Voted
CP
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some do...
121
Voted
SAS
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
97
Voted
HICSS
2009
IEEE
15 years 9 months ago
2009
IEEE
Most software-intensive systems rely on a componentbased design and are therefore made up of encapsulated structural units which are hierarchically composed of one another. In thi...
120
Voted
ESAW
2009
Springer
15 years 9 months ago
2009
Springer
Organizational notions such as roles, norms (e.g., obligations and permissions), and services are increasingly viewed as natural concepts to manage the complexity of software devel...
118
Voted
SEFM
2007
IEEE
15 years 9 months ago
2007
IEEE
We give a formal account of a calculus for modeling service-based systems, suitable to describe both service composition (orchestration) and the protocol that services run when in...