Sciweavers

12272 search results - page 75 / 2455
» Experimental program analysis
Sort
View
98
Voted
CORR
2004
Springer
151views Education» more  CORR 2004»
15 years 18 days 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...
108
Voted
SAC
2005
ACM
15 years 6 months ago
Formal modeling and quantitative analysis of KLAIM-based mobile systems
KLAIM is an experimental language designed for modeling and programming distributed systems composed of mobile components where distribution awareness and dynamic system architect...
Rocco De Nicola, Diego Latella, Mieke Massink
102
Voted
ICSE
2010
IEEE-ACM
15 years 2 months ago
Efficient hybrid typestate analysis by determining continuation-equivalent states
Typestate analysis determines whether a program violates a set of finite-state properties. Because the typestate-analysis problem is statically undecidable, researchers have propo...
Eric Bodden
95
Voted
SIGSOFT
2008
ACM
16 years 1 months ago
A scalable technique for characterizing the usage of temporaries in framework-intensive Java applications
Framework-intensive applications (e.g., Web applications) heavily use temporary data structures, often resulting in performance bottlenecks. This paper presents an optimized blend...
Bruno Dufour, Barbara G. Ryder, Gary Sevitsky
CAV
2011
Springer
253views Hardware» more  CAV 2011»
14 years 4 months ago
HAMPI: A String Solver for Testing, Analysis and Vulnerability Detection
Abstract. Many automatic testing, analysis, and verification techniques for programs can effectively be reduced to a constraint-generation phase followed by a constraint-solving ...
Vijay Ganesh, Adam Kiezun, Shay Artzi, Philip J. G...