419 search results - page 54 / 84 » Translation of Aggregate Programs to Normal Logic Programs |
OOPSLA
2010
Springer
13 years 6 months ago
2010
Springer
Given a high-level specification and a low-level programming language, our goal is to automatically synthesize an efficient program that meets the specification. In this paper,...
POPL
1998
ACM
13 years 12 months ago
1998
ACM
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
CONCUR
2011
Springer
12 years 7 months ago
2011
Springer
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
LFCS
2009
Springer
14 years 2 months ago
2009
Springer
We explore an intuitionistic fragment of Art¨emov’s Logic of Proofs as a type system for a programming language for mobile units. Such units consist of both a code and certific...
CONCUR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Reactive Systems `a la Leifer and Milner allow to derive from a reaction semantics definition an LTS equipped with a bisimilarity relation which is a congruence. This th...