1020 search results - page 175 / 204 » Tight Semantics for Logic Programs |
ECOOP
1998
Springer
14 years 2 months ago
1998
Springer
Predicate dispatching generalizes previous method dispatch mechanisms by permitting arbitrary predicates to control method applicability and by using logical implication between pr...
TYPES
1998
Springer
14 years 2 months ago
1998
Springer
Investigating soundness and completeness of verification calculi for imperative programming languages is a challenging task. Incorrect results have been published in the past. We t...
CAP
2010
13 years 5 months ago
2010
How much of existing computer algebra libraries is amenable to automatic parallelization? This is a difficult topic, yet of practical importance in the era of commodity multicore ...
FMCAD
2008
Springer
13 years 11 months ago
2008
Springer
We present a method for verifying information flow properties of software programs using inductive assertions and theorem proving. Given a program annotated with information flow a...
POPL
2006
ACM
14 years 10 months ago
2006
ACM
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...