Sciweavers

3516 search results - page 521 / 704
» Programming Languages: Application and Interpretation
Sort
View
FLOPS
2008
Springer
15 years 8 months ago
On-Demand Refinement of Dependent Types
Dependent types are useful for statically checking detailed specifications of programs and detecting pattern match or array bounds errors. We propose a novel approach to applicatio...
Hiroshi Unno, Naoki Kobayashi
APAL
2008
104views more  APAL 2008»
15 years 6 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy
JAIR
2006
113views more  JAIR 2006»
15 years 6 months ago
Generative Prior Knowledge for Discriminative Classification
We present a novel framework for integrating prior knowledge into discriminative classifiers. Our framework allows discriminative classifiers such as Support Vector Machines (SVMs...
Arkady Epshteyn, Gerald DeJong
ACTAC
2002
102views more  ACTAC 2002»
15 years 6 months ago
Handling Pointers and Unstructured Statements in the Forward Computed Dynamic Slice Algorithm
Different program slicing methods are used for debugging, testing, reverse engineering and maintenance. Slicing algorithms can be classified as a static slicing or dynamic slicing...
Csaba Faragó, Tamás Gergely
ISSE
2010
15 years 4 months ago
Software model checking without source code
We present a framework, called AIR, for verifying safety properties of assembly language proa software model checking. AIR extends the applicability of predicate abstraction and x...
Sagar Chaki, James Ivers