Sciweavers

2137 search results - page 6 / 428
» Proving Abstract Non-interference
Sort
View
110
Voted
LOPSTR
2004
Springer
15 years 6 months ago
Proving Termination for Logic Programs by the Query-Mapping Pairs Approach
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Ser...
108
Voted
FASE
2010
Springer
15 years 7 months ago
Proving Consistency and Completeness of Model Classes Using Theory Interpretation
Abstract. Abstraction is essential in the formal specification of programs. A common way of writing abstract specifications is to specify implementations in terms of basic mathem...
Ádám Darvas, Peter Müller
98
Voted
SEFM
2007
IEEE
15 years 7 months ago
Automatically Proving Concurrent Programs Correct
of abstract interpretations in formal methods It is always very satisfying to hear about a theory, in the case at hand it is the theory of abstract interpretations, that explains i...
Byron Cook
112
Voted
ENTCS
2010
95views more  ENTCS 2010»
14 years 10 months ago
Quadtrees as an Abstract Domain
s as an Abstract Domain Jacob M. Howe1,4 Dept of Computing, City University London, UK Andy King1,3,5 School of Computing, University of Kent, Canterbury, UK Charles Lawrence-Jones...
Jacob M. Howe, Andy King, Charles Lawrence-Jones
60
Voted
CDC
2010
IEEE
127views Control Systems» more  CDC 2010»
14 years 8 months ago
Exact boundary controllability of an abstract Mead-Marcus sandwich beam model
undary controllability of an abstract Mead-Marcus sandwich beam model Scott W. Hansen and A. Ozkan Ozer Abstract-- In this paper we prove the exact boundary conlity of an abstract ...
Scott W. Hansen, A. Ozkan Ozer