1143 search results - page 184 / 229 » Abstract Syntax and Logic Programming |
149
click to vote
ESOP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
136
click to vote
ACSAC
1999
IEEE
15 years 10 months ago
1999
IEEE
Secure enterprise programming is a difficult and tedious task. Programmers need tools that support t levels of abstraction and that track all the components that participate in di...
175
click to vote
CAEPIA
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. The following problem will be considered: from scattered examples on the behavior of a dynamic system induce a description of the system. For the induced description to b...
182
click to vote
FOIKS
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. In this paper we recast the formalism of argumentation formalism known as DeLP (Defeasible Logic Programming) in game-theoretic terms. By considering a game between a Pro...
185
click to vote
VMCAI
2009
Springer
16 years 1 months ago
2009
Springer
Given a 3-valued abstraction of a program (possibly generated using rogram analysis and predicate abstraction) and a temporal logic formula, generalized model checking (GMC) checks...