Sciweavers

12 search results - page 2 / 3
» Automatic Induction of Abduction and Abstraction Theories fr...
Sort
View
JUCS
2006
131views more  JUCS 2006»
13 years 4 months ago
Verification of CRWL Programs with Rewriting Logic
Abstract: We present a novel approach to the verification of functional-logic programs. For our verification purposes, equational reasoning is not valid due to the presence of non-...
José Miguel Cleva, Isabel Pita
ICML
2008
IEEE
14 years 5 months ago
Automatic discovery and transfer of MAXQ hierarchies
We present an algorithm, HI-MAT (Hierarchy Induction via Models And Trajectories), that discovers MAXQ task hierarchies by applying dynamic Bayesian network models to a successful...
Neville Mehta, Soumya Ray, Prasad Tadepalli, Thoma...
AINA
2007
IEEE
13 years 9 months ago
Specification Synthesis for Monitoring and Analysis of MANET Protocols
This paper introduces an approach to automatic synthesis of the specification models of routing protocol behavior from the observed flow of the network traffic. In particular, our...
Natalia Stakhanova, Samik Basu, Wensheng Zhang, Xi...
POPL
2006
ACM
14 years 5 months ago
Verifying properties of well-founded linked lists
We describe a novel method for verifying programs that manipulate linked lists, based on two new predicates that characterize reachability of heap cells. These predicates allow re...
Shuvendu K. Lahiri, Shaz Qadeer
ICTAC
2004
Springer
13 years 10 months ago
A Proof of Weak Termination Providing the Right Way to Terminate
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
Olivier Fissore, Isabelle Gnaedig, Hél&egra...