3053 search results - page 488 / 611 » A Logic of Abstract Argumentation |
LPAR
2012
Springer
12 years 4 months ago
2012
Springer
Abstract. We present a novel counterexample generator for the interactive theorem prover Isabelle based on a compiler that synthesizes test data generators for functional programmi...
VMCAI
2012
Springer
12 years 4 months ago
2012
Springer
Abstract. Recently, a general framework on characteristic formulae was proposed by Aceto et al. It offers a simple theory that allows one to easily obtain characteristic formulae o...
POPL
2007
ACM
14 years 9 months ago
2007
ACM
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
EMSOFT
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. We classify component-based models of computation into component models and interface models. A component model speci es for each component how the component behaves in a...
CORR
2002
Springer
13 years 9 months ago
2002
Springer
for data abstraction and justifies reasoning by simulation. Representation independence has been shown for a variety of languages and constructs but not for shared references to mu...