116 search results - page 10 / 24 » Reasoning Symbolically About Partially Matched Cases |
POPL
2010
ACM
15 years 6 months ago
2010
ACM
Software pipelining is a loop optimization that overlaps the execution of several iterations of a loop to expose more instruction-level parallelism. It can result in first-class p...
77
Voted
AIPS
2003
14 years 11 months ago
2003
Planning in nondeterministic domains with temporally extended goals under partial observability is one of the most challenging problems in planning. Subsets of this problem have b...
92
Voted
FM
2003
Springer
15 years 2 months ago
2003
Springer
Counterexamples explain why a desired temporal logic property fails to hold, and as such are considered to be the most useful form of output from model-checkers. Multi-valued model...
122
click to vote
SDB
1995
15 years 1 months ago
1995
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...
SEFM
2005
IEEE
15 years 3 months ago
2005
IEEE
Verification of programs requires reasoning about sets of program states. In case of programs manipulating pointers, program states are pointer graphs. Verification of such prog...