Sciweavers

388 search results - page 37 / 78
» Program Analysis Using Symbolic Ranges
Sort
View
POPL
2011
ACM
14 years 17 days ago
Making prophecies with decision predicates
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
Byron Cook, Eric Koskinen
SAS
2010
Springer
134views Formal Methods» more  SAS 2010»
14 years 8 months ago
Strictness Meets Data Flow
Abstract. Properties of programs can be formulated using various techdataflow analysis, abstract interpretation and type-like inference systems. This paper reconstructs strictness...
Tom Schrijvers, Alan Mycroft
ICLP
2005
Springer
15 years 3 months ago
Modeling Systems in CLP
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its ...
Joxan Jaffar, Andrew E. Santosa, Razvan Voicu
ENTCS
2002
181views more  ENTCS 2002»
14 years 9 months ago
Alias verification for Fortran code optimization
Abstract: Alias analysis for Fortran is less complicated than for programming languages with pointers but many real Fortran programs violate the standard: a formal parameter or a c...
Thi Viet Nga Nguyen, François Irigoin
ECOOP
2005
Springer
15 years 3 months ago
Attached Types and Their Application to Three Open Problems of Object-Oriented Programming
The three problems of the title — the first two widely discussed in the literature, the third less well known but just as important for further development of object technology ...
Bertrand Meyer