Sciweavers

365 search results - page 3 / 73
» Using Types as Approximations for Type Checking Prolog Progr...
Sort
View
CAV
2006
Springer
165views Hardware» more  CAV 2006»
13 years 11 months ago
Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study
Many multithreaded programs employ concurrent data types to safely share data among threads. However, highly-concurrent algorithms for even seemingly simple data types are difficul...
Sebastian Burckhardt, Rajeev Alur, Milo M. K. Mart...
ESOP
2007
Springer
13 years 11 months ago
Type Reconstruction for General Refinement Types
Abstract. General refinement types allow types to be refined by predicates written in a general-purpose programming language, and can express function pre- and postconditions and d...
Kenneth W. Knowles, Cormac Flanagan
ECOOP
2012
Springer
11 years 10 months ago
Inference and Checking of Object Ownership
Ownership type systems describe a heap topology and enforce an encapsulation discipline; they aid in various program correctness and understanding tasks. However, the annotation ov...
Wei Huang, Werner Dietl, Ana Milanova, Michael D. ...
JFP
2008
125views more  JFP 2008»
13 years 7 months ago
Types and trace effects of higher order programs
This paper shows how type effect systems can be combined with model-checking techniques to produce powerful, automatically verifiable program logics for higher order programs. The...
Christian Skalka, Scott F. Smith, David Van Horn
ENTCS
2000
83views more  ENTCS 2000»
13 years 7 months ago
Typed Logical Variables in Haskell
We describe how to embed a simple typed functional logic programming language in Haskell. The embedding is a natural extension of the Prolog embedding by Seres and Spivey [16]. To...
Koen Claessen, Peter Ljunglöf