Sciweavers

850 search results - page 127 / 170
» A Logic Programming Language Based on Binding Algebras
Sort
View
ERLANG
2008
ACM
15 years 3 months ago
Gradual typing of erlang programs: a wrangler experience
Currently most Erlang programs contain no or very little type information. This sometimes makes them unreliable, hard to use, and difficult to understand and maintain. In this pap...
Konstantinos F. Sagonas, Daniel Luna
APSEC
2008
IEEE
15 years 7 months ago
A Heap Model for Java Bytecode to Support Separation Logic
Memory usage analysis is an important problem for resource-constrained mobile devices, especially under mission- or safety-critical circumstances. Program codes running on or bein...
Chenguang Luo, Guanhua He, Shengchao Qin
CORR
2004
Springer
176views Education» more  CORR 2004»
15 years 1 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard
IGPL
2010
91views more  IGPL 2010»
14 years 8 months ago
A reason maintenance perspective on relevant Ramsey conditionals
This paper presents a Ramsey account of conditionals within the framework of an implemented reason maintenance system. The reason maintenance system is built on top of a deductive...
Haythem O. Ismail
KI
2004
Springer
15 years 6 months ago
Model Based Deduction for Database Schema Reasoning
Abstract. We aim to demonstrate that automated deduction techniques, in particular those following the model computation paradigm, are very well suited for database schema/query re...
Peter Baumgartner, Ulrich Furbach, Margret Gro&szl...