153 search results - page 20 / 31 » Solving Demand Versions of Interprocedural Analysis Problems |
FOCS
1998
IEEE
13 years 11 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
JSAC
2007
13 years 7 months ago
2007
— This paper studies the conditions under which P2P sharing can increase the capacity of IPTV services over FTTN networks. For a typical FTTN network, our study shows a) P2P shar...
STOC
1994
ACM
13 years 11 months ago
1994
ACM
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
ICSE
2000
IEEE-ACM
13 years 11 months ago
2000
IEEE-ACM
We present Galileo, an innovative engineering modeling and analysis tool built using an approach we call packageoriented programming (POP). Galileo represents an ongoing evaluatio...
CAV
2006
Springer
13 years 11 months ago
2006
Springer
Fast is a tool designed for the analysis of counter systems, i.e. automata extended with unbounded integer variables. Despite the reachability set is not recursive in general, Fast...