Sciweavers

1036 search results - page 158 / 208
» Verification Programs for Abduction
Sort
View
FOSSACS
2010
Springer
15 years 7 months ago
Untyped Recursion Schemes and Infinite Intersection Types
A new framework for higher-order program verification has been recently proposed, in which higher-order functional programs are modelled as higher-order recursion schemes and then ...
Takeshi Tsukada, Naoki Kobayashi
DASFAA
2008
IEEE
137views Database» more  DASFAA 2008»
15 years 6 months ago
Efficient Mining of Recurrent Rules from a Sequence Database
We study a novel problem of mining significant recurrent rules from a sequence database. Recurrent rules have the form "whenever a series of precedent events occurs, eventuall...
David Lo, Siau-Cheng Khoo, Chao Liu 0001
ISSTA
2010
ACM
15 years 4 months ago
A platform for search-based testing of concurrent software
The paper describes a generic, open-source infrastructure called SearchBestie (or S'Bestie for short) that we propose as a platform for experimenting with search-based techni...
Bohuslav Krena, Zdenek Letko, Tomás Vojnar,...
137
Voted
CORR
2010
Springer
198views Education» more  CORR 2010»
15 years 4 months ago
Space and the Synchronic A-Ram
Space is a spatial programming language designed to exploit the massive parallelism available in a formal model of computation called the Synchronic A-Ram, and physically related ...
Alexander Victor Berka
FAC
2008
100views more  FAC 2008»
15 years 4 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois