Sciweavers

395 search results - page 35 / 79
» Predicate Abstraction with Minimum Predicates
Sort
View
DAC
1999
ACM
15 years 10 months ago
Parametric Representations of Boolean Constraints
Abstract We describe the use of parametric representations of Boolean predicates to encode data-space constraints and signi cantly extend the capacity of formal veri cation. The co...
Mark Aagaard, Robert B. Jones, Carl-Johan H. Seger
PEPM
1993
ACM
15 years 10 months ago
The Correctness of an Optimized Code Generation
For a functional programming language with a lazy standard semantics, we define a strictness analysis by means of abstract interpretation. Using the information from the strictne...
Torben Poort Lange
AIMSA
2006
Springer
15 years 9 months ago
Using Verbs to Characterize Noun-Noun Relations
Abstract. We present a novel, simple, unsupervised method for characterizing the semantic relations that hold between nouns in noun-noun compounds. The main idea is to discover pre...
Preslav Nakov, Marti A. Hearst
WCRE
1995
IEEE
15 years 9 months ago
Strongest Postcondition Semantics as the Formal Basis for Reverse Engineering
Reverse engineering of program code is the process of constructing a higher level abstraction of an implementation in order to facilitate the understanding of a system that may be...
Gerald C. Gannod, Betty H. C. Cheng
WOODPECKER
2001
15 years 7 months ago
Proposal for a formal foundation of RM-ODP concepts
Abstract. This paper presents an approach for formalizing the RM-ODP (Reference Model for Open Distributed Processing), an ISO and ITU standard. The goal of this formalization is t...
Andrey Naumenko, Alain Wegmann, Guy Genilloud, Wil...