3663 search results - page 347 / 733 » Problems in the ontology of computer programs |
207
click to vote
LICS
2005
IEEE
16 years 11 days ago
2005
IEEE
We provide a uniform solution to the problem of synthesizing a finite-state distributed system. An instance of the synthesis problem consists of a system architecture and a tempo...
210
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
—The article describes a course on system design (structural approach) which involves the following: issues of systems engineering; structural models; basic technological problem...
201
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
151
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
—What is reachability in higher-order functional programs? We formulate reachability as a decision problem in the setting of the prototypical functional language PCF, and show th...
177
click to vote
TIME
1994
IEEE
15 years 11 months ago
1994
IEEE
We formulate an algebra of binary temporal relations between events the number of occurrences of which is unknown, but which are known to recur in time. Ontologically, we view the...