Sciweavers

96 search results - page 16 / 20
» An Optimization for Reasoning with Forest Logic Programs
Sort
View
POPL
2012
ACM
12 years 3 months ago
The ins and outs of gradual type inference
Gradual typing lets programmers evolve their dynamically typed programs by gradually adding explicit type annotations, which confer benefits like improved performance and fewer r...
Aseem Rastogi, Avik Chaudhuri, Basil Hosmer
DLOG
2008
13 years 10 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer
ICFEM
2009
Springer
13 years 5 months ago
Implementing a Direct Method for Certificate Translation
Abstract. Certificate translation is a method that transforms certificates of source programs into certificates of their compilation. It provides strong guarantees on low-level cod...
Gilles Barthe, Benjamin Grégoire, Sylvain H...
SIGSOFT
2004
ACM
14 years 8 months ago
Efficient incremental algorithms for dynamic detection of likely invariants
Dynamic detection of likely invariants is a program analysis that generalizes over observed values to hypothesize program properties. The reported program properties are a set of ...
Jeff H. Perkins, Michael D. Ernst
SPIN
2000
Springer
13 years 11 months ago
Verification and Optimization of a PLC Control Schedule
Abstract. We report on the use of model checking techniques for both the verification of a process control program and the derivation of optimal control schedules. Most of this wor...
Ed Brinksma, Angelika Mader