232 search results - page 32 / 47 » Symbolic Bounded Conformance Checking of Model Programs |
133
click to vote
ISPAN
2002
IEEE
15 years 4 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
DBPL
2007
Springer
15 years 3 months ago
2007
Springer
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...
SIGSOFT
2007
ACM
16 years 15 days ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
203
click to vote
POPL
2009
ACM
16 years 12 days ago
2009
ACM
We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the mode...
MICAI
2005
Springer
15 years 5 months ago
2005
Springer
Although undirected cycles in directed graphs of Bayesian belief networks have been thoroughly studied, little attention has so far been given to a systematic analysis of directed ...