Sciweavers

3342 search results - page 117 / 669
» Automating Abstract Interpretation
Sort
View
CSL
2004
Springer
15 years 4 months ago
Predicate Transformers and Linear Logic: Yet Another Denotational Model
In the refinement calculus, monotonic predicate transformers are used to model specifications for (imperative) programs. Together with a natural notion of simulation, they form a...
Pierre Hyvernat
GI
2005
Springer
15 years 4 months ago
Automated Quality Assurance for UML Models
Abstract: Model based development, like proposed by the OMG’s Model Driven Arre (MDA), aims to raise the level of abstraction from working on the code to working with models. For...
Tilman Seifert, Florian Jug, Günther Rackl
JFP
2008
75views more  JFP 2008»
14 years 11 months 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
APLAS
2007
ACM
15 years 3 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
KBSE
2009
IEEE
15 years 5 months ago
Loopfrog: A Static Analyzer for ANSI-C Programs
—Practical software verification is dominated by two major classes of techniques. The first is model checking, which provides total precision, but suffers from the state space ...
Daniel Kroening, Natasha Sharygina, Stefano Tonett...