Sciweavers

TFM
2004
Springer
130views Formal Methods» more  TFM 2004»
14 years 24 days ago
Advertising Formal Methods and Organizing Their Teaching: Yes, but ...
This position paper aims to address most of the “challenges” suggested by the conference’s CFP plus a few others. The style is deliberately informal and colloquial, occasiona...
Dino Mandrioli
TFM
2004
Springer
118views Formal Methods» more  TFM 2004»
14 years 24 days ago
A Beginner's Course on Reasoning About Imperative Programs
Formal Methods teaching at undergraduate level has been going on at Manchester for a good number of years.We have introduced various courses based on different approaches.We have e...
Kung-Kiu Lau
SAS
2004
Springer
109views Formal Methods» more  SAS 2004»
14 years 24 days ago
Pointer-Range Analysis
Array-Range Analysis computes at compile time the range of possible index values for each array-index expression in a program. This information can be used to detect potential out-...
Suan Hsi Yong, Susan Horwitz
SAS
2004
Springer
136views Formal Methods» more  SAS 2004»
14 years 24 days ago
Constraint-Based Linear-Relations Analysis
Abstract. Linear-relations analysis of transition systems discovers linear invariant relationships among the variables of the system. These relationships help establish important s...
Sriram Sankaranarayanan, Henny B. Sipma, Zohar Man...
SAS
2004
Springer
103views Formal Methods» more  SAS 2004»
14 years 24 days ago
A Scalable Nonuniform Pointer Analysis for Embedded Programs
Abstract. In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively defined data structures and e...
Arnaud Venet
SAS
2004
Springer
132views Formal Methods» more  SAS 2004»
14 years 24 days ago
Modular and Constraint-Based Information Flow Inference for an Object-Oriented Language
Abstract. This paper addresses the problem of checking programs written in an object-oriented language to ensure that they satisfy the information flow policies, confidentiality ...
Qi Sun, Anindya Banerjee, David A. Naumann
SAS
2004
Springer
123views Formal Methods» more  SAS 2004»
14 years 24 days ago
Non-termination Inference for Constraint Logic Programs
Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given...
Étienne Payet, Frédéric Mesna...