Sciweavers

4595 search results - page 545 / 919
» Reasoning about Plans
Sort
View
PPDP
2009
Springer
16 years 2 months ago
Dependent type inference with interpolants
We propose a novel type inference algorithm for a dependentlytyped functional language. The novel features of our algorithm are: (i) it can iteratively refine dependent types wit...
Hiroshi Unno, Naoki Kobayashi
APLAS
2009
ACM
16 years 2 months ago
Fractional Ownerships for Safe Memory Deallocation
We propose a type system for a programming language with memory allocation/deallocation primitives, which prevents memory-related errors such as double-frees and memory leaks. The ...
Kohei Suenaga, Naoki Kobayashi
APLAS
2009
ACM
16 years 2 months ago
A Fresh Look at Separation Algebras and Share Accounting
Separation Algebras serve as models of Separation Logics; Share Accounting allows reasoning about concurrent-read/exclusive-write resources in Separation Logic. In designing a Conc...
Robert Dockins, Aquinas Hobor, Andrew W. Appel
FASE
2010
Springer
16 years 2 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
ACSD
2008
IEEE
130views Hardware» more  ACSD 2008»
16 years 2 months ago
BAM: BioAmbient machine
In recent years it has become clear that techniques developed for concurrent programming are in fact very useful for the analysis of complex systems in biology. To some level of i...
Vinod A. Muganthan, Andrew Phillips, Maria Grazia ...