4595 search results - page 788 / 919 » Reasoning about Plans |
SAC
2008
ACM
13 years 8 months ago
2008
ACM
se a new abstraction for pointer analysis that represents reads and writes to memory instead of traditional points-to relations. Compared to points-to graphs, our Assign-Fetch Gra...
FUIN
2010
13 years 7 months ago
2010
From an empirical point of view, the hardness of quantified Boolean formulas (QBFs), can be characterized by the (in)ability of current state-of-the-art QBF solvers to decide abo...
ICFEM
2010
Springer
13 years 7 months ago
2010
Springer
Despite the advancements of concurrency theory in the past decades, practical concurrent programming has remained a challenging activity. Fundamental problems such as data races an...
ICSE
2010
IEEE-ACM
13 years 7 months ago
2010
IEEE-ACM
Software clones are identical or similar pieces of code. They are often the result of copy–and–paste activities as ad-hoc code reuse by programmers. Software clones research i...
IGPL
2010
13 years 7 months ago
2010
In this paper we investigate how to represent and reason about legal abrogations and annulments in Defeasible Logic. We examine some options that embed in this setting, and in simi...