Sciweavers

899 search results - page 107 / 180
» A CTL-Based Logic for Program Abstractions
Sort
View
TACAS
2010
Springer
142views Algorithms» more  TACAS 2010»
15 years 7 months ago
Tracking Heaps That Hop with Heap-Hop
Abstract. Heap-Hop is a program prover for concurrent heap-manipulating programs that use Hoare monitors and message-passing synchronization. Programs are annotated with pre and po...
Jules Villard, Étienne Lozes, Cristiano Cal...
PPDP
2001
Springer
15 years 5 months ago
When Do Bounds and Domain Propagation Lead to the Same Search Space?
This paper explores the question of when two propagationbased constraint systems have the same behaviour, in terms of search space. We categorise the behaviour of domain and bound...
Christian Schulte, Peter J. Stuckey
104
Voted
POPL
2010
ACM
15 years 10 months ago
Dependent Types from Counterexamples
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
Tachio Terauchi
113
Voted
GECCO
2008
Springer
120views Optimization» more  GECCO 2008»
15 years 1 months ago
Genetic programming with polymorphic types and higher-order functions
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
Franck Binard, Amy P. Felty
75
Voted
ICSE
2010
IEEE-ACM
15 years 5 months ago
LSdiff: a program differencing tool to identify systematic structural differences
Program differencing tools such as GNU diff identify individual differences but do not determine how those differences are related to each other. For example, an extract super...
Alex Loh, Miryung Kim