1055 search results - page 86 / 211 » Enumerations in computable structure theory |
139
click to vote
LANMR
2007
15 years 5 months ago
2007
Teaching engineering students courses such as computer science theory, automata theory and discrete mathematics took us to realize that introducing basic notions of logic, especial...
126
click to vote
JUCS
2007
15 years 4 months ago
2007
: Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures...
236
click to vote
POPL
2003
ACM
16 years 4 months ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
134
click to vote
WSC
2000
15 years 5 months ago
2000
Input modeling that involves fitting standard univariate parametric probability distributions is typically performed using an input modeling package. These packages typically fit ...
149
click to vote
ESOP
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...