383 search results - page 26 / 77 » Abstracting Complex Languages through Transformation and Com... |
110
click to vote
ICLP
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. The many approaches which have been proposed in the literature for proving the correctness of unfold/fold program transformations, consist in associating suitable well-fo...
126
click to vote
ECAI
2010
Springer
15 years 2 months ago
2010
Springer
Artificial agents trying to achieve communicative goals in situated interactions in the real-world need powerful computational systems for conceptualizing their environment. In ord...
129
click to vote
VMCAI
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We present a context-sensitive compositional analysis of information flow for full (mono-threaded) Java bytecode. Our idea consists in transforming the Java bytecode int...
118
click to vote
ATVA
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
100
click to vote
ESOP
2007
Springer
15 years 7 months ago
2007
Springer
In this paper we present an alternative approach to interprocedurally g linear inequality relations. We propose an abstraction of the effects of procedures through convex sets of t...