232 search results - page 28 / 47 » Symbolic Bounded Conformance Checking of Model Programs |
FSTTCS
2010
Springer
13 years 6 months ago
2010
Springer
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
IPPS
1998
IEEE
14 years 27 days ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
TPHOL
2008
IEEE
14 years 3 months ago
2008
IEEE
Systems that can immediately react to their inputs may suffer from cyclic dependencies between their actions and the corresponding trigger conditions. For this reason, causality an...
ENTCS
2010
13 years 8 months ago
2010
Program debugging is an extremely time-consuming process, and it takes up a large portion of software development time. In practice, debugging is still very much of an art, with t...
ICTAI
2005
IEEE
14 years 2 months ago
2005
IEEE
Stochastic Shortest Path problems (SSPs) can be efficiently dealt with by the Real-Time Dynamic Programming algorithm (RTDP). Yet, RTDP requires that a goal state is always reach...