Sciweavers

39 search results - page 7 / 8
» Inferring Disjunctive Postconditions
Sort
View
CAV
2011
Springer
202views Hardware» more  CAV 2011»
13 years 1 months ago
Simplifying Loop Invariant Generation Using Splitter Predicates
Abstract. We present a novel static analysis technique that substantially improves the quality of invariants inferred by standard loop invariant generation techniques. Our techniqu...
Rahul Sharma 0001, Isil Dillig, Thomas Dillig, Ale...
ICFP
2005
ACM
14 years 9 months ago
Types with semantics: soundness proof assistant
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...
Olha Shkaravska
CP
2000
Springer
14 years 2 months ago
Automatic Generation of Propagation Rules for Finite Domains
plexity Theorems: Talk Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 David McAllester Regular Papers Automatic Generation of Propagation Rules for F...
Slim Abdennadher, Christophe Rigotti
IJCAI
2007
13 years 11 months ago
Recursive Random Fields
A formula in first-order logic can be viewed as a tree, with a logical connective at each node, and a knowledge base can be viewed as a tree whose root is a conjunction. Markov l...
Daniel Lowd, Pedro Domingos
IJCAI
2003
13 years 11 months ago
In Defense of PDDL Axioms
There is controversy as to whether explicit support for PDDL-like axioms and derived predicates is needed for planners to handle real-world domains effectively. Many researchers h...
Sylvie Thiébaux, Jörg Hoffmann, Bernha...