Sciweavers

6167 search results - page 24 / 1234
» Can Refinement be Automated
Sort
View
KR
1998
Springer
14 years 2 months ago
A Planning Algorithm not based on Directional Search
The initiative in STRIPS planning has recently been taken by work on propositional satisfiability. Best current planners, like Graphplan, and earlier planners originating in the p...
Jussi Rintanen
CADE
2008
Springer
14 years 10 months ago
Bitfields and Tagged Unions in C: Verification through Automatic Generation
We present a tool for automatic generation of packed bitfields and tagged unions for systems-level C, along with automatic, machine checked refinement proofs in Isabelle/HOL. Our a...
David Cock
OOPSLA
2009
Springer
14 years 4 months ago
Model transformation by demonstration
Model transformations provide a powerful capability to automate model refinements. However, the use of model transformation languages may present challenges to those who are unfami...
Yu Sun
CP
2001
Springer
14 years 2 months ago
Collaborative Learning for Constraint Solving
Abstract. Although constraint programming offers a wealth of strong, generalpurpose methods, in practice a complex, real application demands a person who selects, combines, and ref...
Susan L. Epstein, Eugene C. Freuder
CONCUR
2006
Springer
14 years 1 months ago
A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems
We describe an incomplete but sound and efficient livelock freedom test for infinite state asynchronous reactive systems. The method s a system into a set of simple control flow cy...
Stefan Leue, Alin Stefanescu, Wei Wei