Sciweavers

1226 search results - page 25 / 246
» Generating Abstractions from Static Domain Analysis
Sort
View
SCP
2010
108views more  SCP 2010»
13 years 8 months ago
Combining dynamic and static slicing for analysing assembler
One of the most challenging tasks a programmer can face is attempting to analyse and understand a legacy assembler system. Many features of assembler make analysis difficult, and ...
Martin P. Ward, Hussein Zedan
ICSEA
2007
IEEE
14 years 4 months ago
A Novel Framework for Test Domain Reduction using Extended Finite State Machine
Test case generation is an expensive, tedious, and errorprone process in software testing. In this paper, test case generation is accomplished using an Extended Finite State Machi...
Nutchakorn Ngamsaowaros, Peraphon Sophatsathit
KBSE
1998
IEEE
14 years 2 months ago
Automated Integrative Analysis of State-based Requirements
Statically analyzing requirements specifications to assure that they possess desirable properties is an important activity in any rigorous software development project. The analys...
Barbara J. Czerny, Mats Per Erik Heimdahl
CASSIS
2005
Springer
14 years 3 months ago
Modular Proof Principles for Parameterised Concretizations
Abstract. Abstract interpretation is a particularly well-suited methodology to build modular correctness proof of static analysers. Proof modularity becomes essential when correctn...
David Pichardie
LPAR
2000
Springer
14 years 1 months ago
Efficient Structural Information Analysis for Real CLP Languages
We present the rational construction of a generic domain for structural information analysis of real CLP languages called Pattern(D ), where the parameter D is an abstract domain s...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella