365 search results - page 26 / 73 » Using Types as Approximations for Type Checking Prolog Progr... |
RV
2010
Springer
13 years 6 months ago
2010
Springer
We describe a combination of runtime information and static analysis for checking properties of complex and configurable systems. The basic idea of our approach is to 1) let the p...
IJCAI
1993
13 years 9 months ago
1993
SEQUEL is a new-generation functional programming language, which allows the specification of types in a notation based on the sequent calculus. The sequent calculus notation suff...
SPIN
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Software model checking problems generally contain two different types of non-determinism: 1) non-deterministically chosen values; 2) the choice of interleaving among th...
DBPL
1999
Springer
13 years 12 months ago
1999
Springer
Semistructured databases are treated as dynamically typed: they come equipped with no independent schema or type system to constrain the data. Query languages that are designed fo...
ECOOP
2011
Springer
12 years 7 months ago
2011
Springer
Abstract. An active area of research in computer science is the prevention of violations of object protocols, i.e., restrictions on temporal orderings of method calls on an object....