Sciweavers

444 search results - page 38 / 89
» Termination by Abstraction
Sort
View
ESOP
2008
Springer
13 years 10 months ago
Iterative Specialisation of Horn Clauses
Abstract. We present a generic algorithm for solving Horn clauses through iterative specialisation. The algorithm is generic in the sense that it can be instantiated with any decid...
Christoffer Rosenkilde Nielsen, Flemming Nielson, ...
CORR
2007
Springer
82views Education» more  CORR 2007»
13 years 9 months ago
Programs as polygraphs: computability and complexity
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
Guillaume Bonfante, Yves Guiraud
IS
2007
13 years 9 months ago
Aldat: A retrospective on a work in progress
level of abstraction which is not only ideally suited for processing data on secondary storage but which also readily absorbs important issues in computational parallelism and in d...
T. H. Merrett
TOPNOC
2010
13 years 3 months ago
Search-Order Independent State Caching
Abstract. State caching is a memory reduction technique used by model checkers to alleviate the state explosion problem. It has traditionally been coupled with a depth-first search...
Sami Evangelista, Lars Michael Kristensen
POPL
2009
ACM
14 years 9 months ago
A combination framework for tracking partition sizes
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...
Sumit Gulwani, Tal Lev-Ami, Mooly Sagiv