Sciweavers

192 search results - page 25 / 39
» Using Call Exit Analysis for Logic Program Transformation
Sort
View
ER
1995
Springer
152views Database» more  ER 1995»
13 years 11 months ago
A Logic Framework for a Semantics of Object-Oriented Data Modeling
We describe a (meta) formalism for defining a variety of (object oriented) data models in a unified framework based on a variation of first-order logic. As specific example we use...
Olga De Troyer, Robert Meersman
RTA
2011
Springer
12 years 10 months ago
Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
Marc Brockschmidt, Carsten Otto, Jürgen Giesl
SIGCSE
2009
ACM
194views Education» more  SIGCSE 2009»
14 years 8 months ago
Integrating pedagogical code reviews into a CS 1 course: an empirical study
Formal code inspections are employed by teams of professional software engineers to identify software defects and improve the quality of software. After reviewing a piece of code ...
Christopher D. Hundhausen, Anukrati Agrawal, Dana ...
PASTE
2010
ACM
13 years 6 months ago
Property-aware program sampling
Monitoring or profiling programs provides us with an understanding for its further improvement and analysis. Typically, for monitoring or profiling, the program is instrumented ...
Harish Narayanappa, Mukul S. Bansal, Hridesh Rajan
VIROLOGY
2008
121views more  VIROLOGY 2008»
13 years 7 months ago
Constructing malware normalizers using term rewriting
A malware mutation engine is able to transform a malicious program to create a different version of the program. Such mutation engines are used at distribution sites or in self-pro...
Andrew Walenstein, Rachit Mathur, Mohamed R. Chouc...