Sciweavers

12981 search results - page 531 / 2597
» Model Checking (Abstract)
Sort
View
149
Voted
FOSSACS
2007
Springer
16 years 26 days ago
Polynomial Constraints for Sets with Cardinality Bounds
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
Bruno Marnette, Viktor Kuncak, Martin C. Rinard
170
Voted
ICLP
2007
Springer
16 years 26 days ago
Automatic Binding-Related Error Diagnosis in Logic Programs
Abstract. This paper proposes a diagnosis algorithm for locating a certain kind of errors in logic programs: variable binding errors that result act symptoms during compile-time ch...
Pawel Pietrzak, Manuel V. Hermenegildo
202
Voted
SLS
2007
Springer
117views Algorithms» more  SLS 2007»
16 years 24 days ago
An Algorithm Portfolio for the Sub-graph Isomorphism Problem
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
Roberto Battiti, Franco Mascia
TSD
2007
Springer
16 years 24 days ago
Pitch Marks at Peaks or Valleys?
Abstract. This paper deals with the problem of speech waveform polarity. As the polarity of speech waveform can influence the performance of pitch marking algorithms (see Sec. 4),...
Milan Legát, Daniel Tihelka, Jindrich Matou...
VMCAI
2007
Springer
16 years 24 days ago
On Flat Programs with Lists
Abstract. In this paper we analyze the complexity of checking safety and termination properties, for a very simple, yet non-trivial, class of programs with singly-linked list data ...
Marius Bozga, Radu Iosif