Sciweavers

1941 search results - page 275 / 389
» Reasoning about Computations Using Two-Levels of Logic
Sort
View
128
Voted
FOSSACS
2009
Springer
15 years 10 months ago
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
Lars Birkedal, Kristian Støvring, Jacob Tha...
140
Voted
CADE
2007
Springer
15 years 9 months ago
Semantic Selection of Premisses for Automated Theorem Proving
We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in first-order logic. The algorithm uses interpret...
Petr Pudlak
OOPSLA
2007
Springer
15 years 9 months ago
A rewriting approach to the design and evolution of object-oriented languages
Abstract. Object-oriented language concepts have been highly successful, resulting in a large number of object-oriented languages and language extensions. Unfortunately, formal met...
Mark Hills, Grigore Rosu
143
Voted
ECCV
2006
Springer
15 years 7 months ago
Tracking of Multiple Objects Using Optical Flow Based Multiscale Elastic Matching
Abstract. A novel hybrid region-based and contour-based multiple object tracking model using optical flow based elastic matching is proposed. The proposed elastic matching model is...
Xingzhi Luo, Suchendra M. Bhandarkar
166
Voted
PEPM
2010
ACM
15 years 5 months ago
A3PAT, an approach for certified automated termination proofs
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
Evelyne Contejean, Andrey Paskevich, Xavier Urbain...