Sciweavers

446 search results - page 3 / 90
» Abstract Interpretation Using Typed Decision Graphs
Sort
View
FLOPS
1999
Springer
13 years 11 months ago
Using Types as Approximations for Type Checking Prolog Programs
Abstract. Subtyping tends to undermine the effects of parametric polymorphism as far as the static detection of type errors is concerned. Starting with this observation we present...
Christoph Beierle, Gregor Meyer
DAGSTUHL
2007
13 years 9 months ago
Graph matching with type constraints on nodes and edges
Abstract. In this paper, we consider two particular problems of directed graph matching. The first problem concerns graphs with nodes that have been subdivided into classes of di...
Catherine Fraikin, Paul Van Dooren
CAV
1998
Springer
138views Hardware» more  CAV 1998»
13 years 11 months ago
Model Checking for a First-Order Temporal Logic Using Multiway Decision Graphs
bstract description of state machines (ASMs), in which data and data operations are d using abstract sort and uninterpreted function symbols. ASMs are suitable for describing Regis...
Ying Xu, Eduard Cerny, Xiaoyu Song, Francisco Core...
IOR
2002
179views more  IOR 2002»
13 years 7 months ago
Decision Analysis: A Personal Account of How It Got Started and Evolved
Then these analytically motivated abstractions were gradually made more intricate as the body of mathematical techniques grew. The trend went from elementary analysis of complex, i...
Howard Raiffa
IFL
2007
Springer
158views Formal Methods» more  IFL 2007»
14 years 1 months ago
Checking Dependent Types Using Compiled Code
Abstract. Type checkers for dependent types need to evaluate user defined functions during type checking. For this, current implementations typically use an interpreter, which has...
Dirk Kleeblatt