Sciweavers

88 search results - page 5 / 18
» The Dependency Triple Framework for Termination of Logic Pro...
Sort
View
POPL
2005
ACM
14 years 7 months ago
Transition predicate abstraction and fair termination
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
Andreas Podelski, Andrey Rybalchenko
PLPV
2009
ACM
14 years 4 months ago
Embedding a logical theory of constructions in Agda
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...
Ana Bove, Peter Dybjer, Andrés Sicard-Ram&i...
WFLP
2009
Springer
277views Algorithms» more  WFLP 2009»
14 years 2 months ago
Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...
Stephan Falke, Deepak Kapur
IJMSO
2006
105views more  IJMSO 2006»
13 years 7 months ago
A framework for context-sensitive metadata description
Recent expectations regarding the new generation of Web strongly depend on the success of Semantic Web technology. Resource Description Framework (RDF) is a basis for an explicit a...
Oleksiy Khriyenko, Vagan Y. Terziyan
CORR
2002
Springer
93views Education» more  CORR 2002»
13 years 7 months ago
Logic program specialisation through partial deduction: Control issues
Program specialisation aims at improving the overall performance of programs by performing source to source transformations. A common approach within functional and logic programm...
Michael Leuschel, Maurice Bruynooghe