Sciweavers

606 search results - page 93 / 122
» Constraint Hierarchies and Logic Programming
Sort
View
TLDI
2010
ACM
225views Formal Methods» more  TLDI 2010»
14 years 4 months ago
Race-free and memory-safe multithreading: design and implementation in cyclone
We present the design of a formal low-level multi-threaded language with advanced region-based memory management and synchronization primitives, where well-typed programs are memo...
Prodromos Gerakios, Nikolaos Papaspyrou, Konstanti...
IFM
2009
Springer
107views Formal Methods» more  IFM 2009»
14 years 2 months ago
Incremental Reasoning for Multiple Inheritance
Object-orientation supports code reuse and incremental programming. Multiple inheritance increases the power of code reuse, but complicates the binding of method calls and thereby ...
Johan Dovland, Einar Broch Johnsen, Olaf Owe, Mart...
SIGSOFT
2005
ACM
14 years 8 months ago
Relational analysis of algebraic datatypes
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
Viktor Kuncak, Daniel Jackson
ICLP
2001
Springer
14 years 5 days ago
Higher-Precision Groundness Analysis
Abstract. Groundness analysis of logic programs using Pos-based abstract interpretation is one of the clear success stories of the last decade in the area of logic program analysis...
Michael Codish, Samir Genaim, Harald Sønder...
ASPLOS
2011
ACM
12 years 11 months ago
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
Joel Coburn, Adrian M. Caulfield, Ameen Akel, Laur...