Sciweavers

846 search results - page 60 / 170
» Rewrite-Based Decision Procedures
Sort
View
APLAS
2010
ACM
13 years 11 months ago
Automatically Inferring Quantified Loop Invariants by Algorithmic Learning from Simple Templates
Abstract. By combining algorithmic learning, decision procedures, predicate abstraction, and simple templates, we present an automated technique for finding quantified loop invaria...
Soonho Kong, Yungbum Jung, Cristina David, Bow-Yaw...
ICRA
2010
IEEE
101views Robotics» more  ICRA 2010»
13 years 9 months ago
Multirobot coordination by auctioning POMDPs
— We consider the problem of task assignment and execution in multirobot systems, by proposing a procedure for bid estimation in auction protocols. Auctions are of interest to mu...
Matthijs T. J. Spaan, Nelson Gonçalves, Jo&...
JAR
2010
160views more  JAR 2010»
13 years 9 months ago
MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions
Many theorems involving special functions such as ln, exp and sin can be proved automatically by MetiTarski: a resolution theorem prover modified to call a decision procedure for ...
Behzad Akbarpour, Lawrence C. Paulson
LICS
2010
IEEE
13 years 9 months ago
Regular Cost Functions over Finite Trees
We develop the theory of regular cost functions over finite trees: a quantitative extension to the notion of regular languages of trees: Cost functions map each input (tree) to a v...
Thomas Colcombet, Christof Löding
POPL
2011
ACM
13 years 2 months ago
Decidable logics combining heap structures and data
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu