Sciweavers

126 search results - page 2 / 26
» Pattern-Based Verification for Trees
Sort
View
EUROPAR
2003
Springer
15 years 2 months ago
Why Not Use a Pattern-Based Parallel Programming System?
Parallel programming is seen as an effective technique to improve the performance of computationally-intensive programs. This is done at the cost of increasing the complexity of t...
John Anvik, Jonathan Schaeffer, Duane Szafron, Kai...
ICEIS
2009
IEEE
14 years 7 months ago
Pattern-Based Refactoring of Legacy Software Systems
Rearchitecturing large software systems becomes more and more complex after years of development and a growing size of the code base. Nonetheless, a constant adaptation of software...
Sascha Hunold, Björn Krellner, Thomas Rauber,...
POPL
2010
ACM
15 years 6 months ago
Higher-Order Multi-Parameter Tree Transducers and Recursion Schemes for Program Verification
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno
ACTA
2010
191views more  ACTA 2010»
14 years 9 months ago
Automata-based verification of programs with tree updates
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
Peter Habermehl, Radu Iosif, Tomás Vojnar
72
Voted
FORTE
2008
14 years 11 months ago
Parameterized Tree Systems
Abstract. Several recent works have considered parameterized verification, i.e. automatic verification of systems consisting of an arbitrary number of finite-state processes organi...
Parosh Aziz Abdulla, Noomene Ben Henda, Giorgio De...