1023 search results - page 128 / 205 » A Formal Method for Program Slicing |
115
click to vote
UTP
2010
14 years 12 months ago
2010
In this paper, we present various extensions of Isabelle/HOL by theories that are essential for several formal methods. First, we explain how we have developed an Isabelle/HOL theo...
205
click to vote
POPL
2004
ACM
16 years 1 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
118
click to vote
AGTIVE
2003
Springer
15 years 6 months ago
2003
Springer
Many polygon mesh algorithms operate in a local manner, yet are formally specified using global indexing schemes. This obscures the essence of these algorithms and makes their spe...
CAV
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. TVLA is a parametric framework for shape analysis that can be easily instantiated to create different kinds of analyzers for checking properties of programs that use link...
110
click to vote
IFL
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Refactoring is a technique for improving the design of existing programs without changing their behaviour. Wrangler is a tool built at the University of Kent to support E...