Sciweavers

238 search results - page 24 / 48
» Program Abstraction in a Higher-Order Logic Framework
Sort
View
SIGGRAPH
1994
ACM
13 years 11 months ago
Drawing and animation using skeletal strokes
strokes makes it particularly attractive in terms of storage size and transmission efficiency. Its efficient implementation is favourable for incorporation into windowing systems a...
Siu Chi Hsu, Irene H. H. Lee
TOPLAS
2008
138views more  TOPLAS 2008»
13 years 7 months ago
Decomposing bytecode verification by abstract interpretation
act Interpretation C. BERNARDESCHI, N. DE FRANCESCO, G. LETTIERI, L. MARTINI, and P. MASCI Universit`a di Pisa Bytecode verification is a key point in the security chain of the Jav...
Cinzia Bernardeschi, Nicoletta De Francesco, Giuse...
INFORMS
1998
150views more  INFORMS 1998»
13 years 7 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
CAISE
2005
Springer
14 years 1 months ago
The Logic of Correctness in Software Engineering
Abstract. This paper uses a framework drawn from work in the philosophy of science to characterize the concepts of program correctness that have been used in software engineering, ...
Mark Priestly
TPHOL
2009
IEEE
14 years 2 months ago
A Formalisation of Smallfoot in HOL
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
Thomas Tuerk