Sciweavers

4719 search results - page 334 / 944
» Newtonian program analysis
Sort
View
MICAI
2000
Springer
15 years 10 months ago
Searching for a Solution to Program Verification=Equation Solving in CCS
Unique Fixpoint Induction, UFI, is a chief inference rule to prove the equivalence of recursive processes in CCS [7]. It plays a major role in the equational approach to verificati...
Raul Monroy, Alan Bundy, Ian Green
ACCV
2007
Springer
15 years 8 months ago
A Convex Programming Approach to the Trace Quotient Problem
Abstract. The trace quotient problem arises in many applications in pattern classification and computer vision, e.g., manifold learning, low-dimension embedding, etc. The task is ...
Chunhua Shen, Hongdong Li, Michael J. Brooks
WWW
2009
ACM
16 years 7 months ago
Using static analysis for Ajax intrusion detection
We present a static control-flow analysis for JavaScript programs running in a web browser. Our analysis tackles numerous challenges posed by modern web applications including asy...
Arjun Guha, Shriram Krishnamurthi, Trevor Jim
ESEC
1997
Springer
15 years 10 months ago
Verification of Liveness Properties Using Compositional Reachability Analysis
The software architecture of a distributed program can be represented by a hierarchical composition of subsystems, with interacting processes at the leaves of the hierarchy. Compo...
Shing-Chi Cheung, Dimitra Giannakopoulou, Jeff Kra...
ICFP
2000
ACM
15 years 10 months ago
Fully reflexive intensional type analysis
Compilers for polymorphic languages can use runtime type inspection to support advanced implementation techniques such as tagless garbage collection, polymorphic marshalling, and ...
Valery Trifonov, Bratin Saha, Zhong Shao