Sciweavers

1023 search results - page 69 / 205
» A Formal Method for Program Slicing
Sort
View
ISSRE
2003
IEEE
14 years 2 months ago
Exploiting Symmetries to Test Programs
Symmetries often appear as properties of many artifical settings. In Program Testing, they can be viewed as properties of programs and can be given by the tester to check the cor...
Arnaud Gotlieb
SAC
2006
ACM
14 years 2 months ago
Union types for object-oriented programming
We propose union types for statically typed class-based objectoriented languages as a means to enhance the flexibility of subtyping. As its name suggests, a union type can be con...
Atsushi Igarashi, Hideshi Nagira
CCS
2005
ACM
14 years 2 months ago
A rewriting-based inference system for the NRL protocol analyzer: grammar generation
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...
Santiago Escobar, Catherine Meadows, José M...
ENTCS
2002
152views more  ENTCS 2002»
13 years 8 months ago
Contract-based mutation testing in the refinement calculus
This article discusses mutation testing strategies in the context of refinement. Here, a novel generalization of mutation testing techniques is presented to be applied to contract...
Bernhard K. Aichernig
POPL
2006
ACM
14 years 9 months ago
Small bisimulations for reasoning about higher-order imperative programs
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
Vasileios Koutavas, Mitchell Wand