Sciweavers

1914 search results - page 120 / 383
» Verification by Abstract Interpretation
Sort
View
115
Voted
CADE
2007
Springer
16 years 1 months ago
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...
Yeting Ge, Clark Barrett, Cesare Tinelli
ICTAC
2010
Springer
14 years 10 months ago
Mechanized Verification with Sharing
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
J. Gregory Malecha, Greg Morrisett
111
Voted
TCAD
2008
90views more  TCAD 2008»
15 years 18 days ago
Application and Verification of Local Nonsemantic-Preserving Transformations in System Design
Due to the increasing abstraction gap between the initial system model and a final implementation, the verification of the respective models against each other is a formidable task...
Tarvo Raudvere, Ingo Sander, Axel Jantsch
89
Voted
JFP
2008
75views more  JFP 2008»
15 years 20 days ago
Exploiting reachability and cardinality in higher-order flow analysis
t two complementary improvements for abstract-interpretation-based flow analysis r-order languages: (1) abstract garbage collection and (2) abstract counting.1,2 garbage collecti...
Matthew Might, Olin Shivers
117
Voted
APLAS
2007
ACM
15 years 4 months ago
Finally Tagless, Partially Evaluated
We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, general...
Jacques Carette, Oleg Kiselyov, Chung-chieh Shan