Sciweavers

23 search results - page 3 / 5
» Constraint-Based Invariant Inference over Predicate Abstract...
Sort
View
ESOP
2007
Springer
13 years 9 months ago
Type Reconstruction for General Refinement Types
Abstract. General refinement types allow types to be refined by predicates written in a general-purpose programming language, and can express function pre- and postconditions and d...
Kenneth W. Knowles, Cormac Flanagan
ICST
2011
IEEE
12 years 9 months ago
Constraint-Based Program Debugging Using Data Structure Repair
—Developers have used data structure repair over the last few decades as an effective means to recover on-the-fly from errors in program state. Traditional repair techniques wer...
Muhammad Zubair Malik, Junaid Haroon Siddiqui, Sar...
ESOP
2006
Springer
13 years 9 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...
NFM
2011
303views Formal Methods» more  NFM 2011»
13 years 7 days ago
Instantiation-Based Invariant Discovery
Abstract. We present a general scheme for automated instantiation-based invariant discovery. Given a transition system, the scheme produces k-inductive invariants from templates re...
Temesghen Kahsai, Yeting Ge, Cesare Tinelli
ICFEM
2010
Springer
13 years 4 months ago
Loop Invariant Synthesis in a Combined Domain
Abstract. Automated verification of memory safety and functional correctness for heap-manipulating programs has been a challenging task, especially when dealing with complex data ...
Shengchao Qin, Guanhua He, Chenguang Luo, Wei-Ngan...