Sciweavers

4814 search results - page 39 / 963
» Combining abstract interpreters
Sort
View
FM
2009
Springer
98views Formal Methods» more  FM 2009»
14 years 4 months ago
Recursive Abstractions for Parameterized Systems
e Abstractions for Parameterized Systems JOXAN JAFFAR and ANDREW E. SANTOSA Department of Computer Science, National University of Singapore Singapore 117590 {joxan,andrews}comp.nu...
Joxan Jaffar, Andrew E. Santosa
POPL
2007
ACM
14 years 10 months ago
Extracting queries by static analysis of transparent persistence
Transparent persistence promises to integrate programming languages and databases by allowing procedural programs to access persistent data with the same ease as non-persistent da...
Ben Wiedermann, William R. Cook
AGP
1993
IEEE
14 years 2 months ago
Static Analysis of Prolog with Cut
Abstract. This paper presents a general approach to the Abstract Interpretation of Prolog programs with cut. In most of previous approaches the cut primitive is merely ignored. Our...
Gilberto Filé, Sabina Rossi
FASE
2010
Springer
14 years 4 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
ECAL
2005
Springer
14 years 3 months ago
A Developmental Model for Generative Media
Abstract. Developmental models simulate the spatio-temporal development of a complex system. The system described in this paper combines the advantages of a number of previously di...
Jon McCormack