Sciweavers

796 search results - page 139 / 160
» The Semantics of Abstract Program Slicing
Sort
View
ATVA
2010
Springer
128views Hardware» more  ATVA 2010»
13 years 9 months ago
What's Decidable about Sequences?
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
Carlo A. Furia
ENTCS
2006
151views more  ENTCS 2006»
13 years 8 months ago
Extending C for Checking Shape Safety
The project Safe Pointers by Graph Transformation at the University of York has developed a method for specifying the shape of pointer-data structures by graph reduction, and a st...
Mike Dodds, Detlef Plump
JAR
2008
89views more  JAR 2008»
13 years 7 months ago
An Extensible Encoding of Object-oriented Data Models in hol
Abstract We present an extensible encoding of object-oriented data models into higherorder logic (HOL). Our encoding is supported by a datatype package that leverages the use of th...
Achim D. Brucker, Burkhart Wolff
JUCS
2008
138views more  JUCS 2008»
13 years 7 months ago
A Lightweight and Extensible AspectJ Implementation
Abstract: Extending AspectJ to experiment with new language features can be cumbersome, even with an extensible implementation. Often, a language designer only needs a rapid protot...
Rodolfo Toledo, Éric Tanter
UTP
2010
13 years 5 months ago
Specification Coverage for Testing in Circus
Abstract. The Unifying Theories of Programming underpins the development of Circus, a state-rich process algebra for refinement. We have previously presented a theory of testing fo...
Ana Cavalcanti, Marie-Claude Gaudel