Sciweavers

162 search results - page 3 / 33
» Flow Logics for Constraint Based Analysis
Sort
View
SAS
2001
Springer
117views Formal Methods» more  SAS 2001»
13 years 9 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages
Abstract. 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 omission of t...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
CORR
2004
Springer
151views Education» more  CORR 2004»
13 years 4 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...
ICSM
2005
IEEE
13 years 10 months ago
Annotated Inclusion Constraints for Precise Flow Analysis
Program flow analysis has many applications in software tools for program understanding, restructuring, verification, testing and reverse engineering. There are two important re...
Ana Milanova, Barbara G. Ryder
CODES
1998
IEEE
13 years 9 months ago
A path analysis based partitioning for time constrained embedded systems
The HW/SW partitioning problem addressed in this paper is one of the key steps in the co-design flow of heterogeneous embedded systems. Generally the aim is to provide solutions t...
Luc Bianco, Michel Auguin, Guy Gogniat, Alain Pega...
ICFP
2007
ACM
14 years 4 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson