1291 search results - page 49 / 259 » Arithmetic program paths |
132
click to vote
IFIP
2010
Springer
14 years 11 months ago
2010
Springer
We present a new approach to information flow control (IFC), ploits counterexample-guided abstraction refinement (CEGAR) technology. The CEGAR process is built on top of our existi...
126
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
119
click to vote
COMPSAC
2009
IEEE
15 years 9 months ago
2009
IEEE
Non-terminating programs are programs that legally perform unbounded computations. Though they are ubiquitous in real-world applications, testing these programs requires new theor...
142
Voted
ICFP
2008
ACM
16 years 4 months ago
2008
ACM
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
145
Voted
ISSRE
2006
IEEE
15 years 10 months ago
2006
IEEE
BPEL is a language that could express complex concurrent behaviors. This paper presents a novel method of BPEL test case generation, which is based on concurrent path analysis. Th...