Sciweavers

61 search results - page 7 / 13
» Invariant Checking for Programs with Procedure Calls
Sort
View
ESOP
2006
Springer
15 years 3 months ago
Inference of User-Defined Type Qualifiers and Qualifier Rules
Abstract. In previous work, we described a new approach to supporting userdefined type qualifiers, which augment existing types to specify and check additional properties of intere...
Brian Chin, Shane Markstrum, Todd D. Millstein, Je...
ICSE
2011
IEEE-ACM
14 years 3 months ago
Inference of field initialization
A raw object is partially initialized, with only some fields set to legal values. It may violate its object invariants, such as that a given field is non-null. Programs often ma...
Fausto Spoto, Michael D. Ernst
CAV
2008
Springer
96views Hardware» more  CAV 2008»
15 years 1 months ago
Implied Set Closure and Its Application to Memory Consistency Verification
Hangal et. al. [3] have developed a procedure to check if an instance of the execution of a shared memory multiprocessor program, is consistent with the Total Store Order (TSO) mem...
Surender Baswana, Shashank K. Mehta, Vishal Powar
ATVA
2006
Springer
162views Hardware» more  ATVA 2006»
15 years 3 months ago
Predicate Abstraction of Programs with Non-linear Computation
e Abstraction of Programs With Non-linear Computation Songtao Xia1 Ben Di Vito2 Cesar Munoz3 1 NASA Postdoc at NASA Langley Research Center, Hampton, VA 2 NASA Langley Research Cen...
Songtao Xia, Ben Di Vito, César Muño...
VMCAI
2009
Springer
15 years 6 months ago
An Abort-Aware Model of Transactional Programming
There has been a lot of recent research on transaction-based concurrent programming, aimed at offering an easier concurrent programming paradigm that enables programmers to better...
Kousha Etessami, Patrice Godefroid