Sciweavers

1023 search results - page 52 / 205
» A Formal Method for Program Slicing
Sort
View
CAV
2004
Springer
159views Hardware» more  CAV 2004»
14 years 2 months ago
Static Program Analysis via 3-Valued Logic
This paper reviews the principles behind the paradigm of “abstract interpretation via § -valued logic,” discusses recent work to extend the approach, and summarizes ongoing re...
Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm
TLDI
2005
ACM
126views Formal Methods» more  TLDI 2005»
14 years 2 months ago
Type inference for atomicity
Atomicity is a fundamental correctness property in multithreaded programs. This paper presents an algorithm for verifying atomicity via type inference. The underlying type system ...
Cormac Flanagan, Stephen N. Freund, Marina Lifshin
CPAIOR
2004
Springer
14 years 13 days ago
Building Models through Formal Specification
Abstract. Over the past years, a number of increasingly expressive languages for modelling constraint and optimisation problems have evolved. In developing a strategy to ease the c...
Gerrit Renker, Hatem Ahriz
COMPSAC
2007
IEEE
14 years 3 months ago
Specifying Pointcuts in AspectJ
Program verification is a promising approach to improving program quality. To formally verify aspectoriented programs, we have to find a way to formally specify programs written i...
Yi Wang, Jianjun Zhao
SAS
2005
Springer
118views Formal Methods» more  SAS 2005»
14 years 2 months ago
Inference of Well-Typings for Logic Programs with Application to Termination Analysis
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...
Maurice Bruynooghe, John P. Gallagher, Wouter Van ...