Sciweavers

22 search results - page 4 / 5
» Control-flow analysis of function calls and returns by abstr...
Sort
View
CORR
2004
Springer
151views Education» more  CORR 2004»
13 years 6 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
AUSAI
2005
Springer
14 years 3 days ago
Finding Similar Patterns in Microarray Data
Abstract. In this paper we propose a clustering algorithm called sCluster for analysis of gene expression data based on pattern-similarity. The algorithm captures the tight cluster...
Xiangsheng Chen, Jiuyong Li, Grant Daggard, Xiaodi...
SEFM
2006
IEEE
14 years 17 days ago
Automatic Property Checking for Software: Past, Present and Future
tic analysis tools based on abstraction are sound but not complete. Several practical static analysis tools are heuristic in nature —they are neither sound nor complete, but have...
Sriram K. Rajamani
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 6 months ago
Dist-Orc: A Rewriting-based Distributed Implementation of Orc with Formal Analysis
Abstract. Orc is a theory of orchestration of services that allows structured programming of distributed and timed computations. Several formal semantics have been proposed for Orc...
Musab AlTurki, José Meseguer
PASTE
1999
ACM
13 years 11 months ago
Identifying Procedural Structure in Cobol Programs
The principal control-flow abstraction mechanism in the Cobol language is the PERFORM statement. Normally, PERFORM statements are used in a straightforward manner to define para...
John Field, G. Ramalingam