Sciweavers

2702 search results - page 324 / 541
» Practically Applicable Formal Methods
Sort
View
126
Voted
FM
2003
Springer
98views Formal Methods» more  FM 2003»
15 years 7 months ago
Generating Counterexamples for Multi-valued Model-Checking
Counterexamples explain why a desired temporal logic property fails to hold, and as such are considered to be the most useful form of output from model-checkers. Multi-valued model...
Arie Gurfinkel, Marsha Chechik
113
Voted
IFL
2003
Springer
128views Formal Methods» more  IFL 2003»
15 years 7 months ago
With-Loop Scalarization - Merging Nested Array Operations
Construction of complex array operations by composition of more basic ones allows for abstract and concise specifications of algorithms. Unfortunately, na¨ıve compilation of suc...
Clemens Grelck, Sven-Bodo Scholz, Kai Trojahner
116
Voted
WCRE
1998
IEEE
15 years 6 months ago
Type Inference for COBOL Systems
Types are a good starting point for various software reengineering tasks. Unfortunately, programs requiring reengineering most desperately are written in languages without an adeq...
Arie van Deursen, Leon Moonen
105
Voted
POPL
1998
ACM
15 years 6 months ago
A Functional Representation of Data Structures with a Hole
Data structures with a hole, in other words data structures with an uninitialized field, are useful to write efficient programs: they enable us to construct functional data stru...
Yasuhiko Minamide
133
Voted
SIGSOFT
1998
ACM
15 years 6 months ago
Reengineering Class Hierarchies Using Concept Analysis
The design of a class hierarchy may be imperfect. For example, a class C may contain a member m not accessed in any C-instance, an indication that m could be eliminated, or moved ...
Gregor Snelting, Frank Tip