Sciweavers

1715 search results - page 200 / 343
» Domain-Specific Program Checking
Sort
View
POPL
1990
ACM
15 years 4 months ago
Higher-Order Modules and the Phase Distinction
Typed -calculus is an important tool in programming language research because it provides an extensible framework for studying language features both in isolation and in their rel...
Robert Harper, John C. Mitchell, Eugenio Moggi
99
Voted
CONCUR
2006
Springer
15 years 4 months ago
Proving Liveness by Backwards Reachability
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, ...
105
Voted
FLOPS
2008
Springer
15 years 2 months ago
Integrating Answer Set Reasoning with Constraint Solving Techniques
Abstract. The paper introduces a collection of knowledge representation languages, V(C), parametrised over a class C of constraints. V(C) is an extension of both CR-Prolog and CASP...
Veena S. Mellarkod, Michael Gelfond
GPCE
2009
Springer
14 years 10 months ago
Generating safe template languages
Template languages are widely used within generative programming, because they provide intuitive means to generate software artefacts expressed in a specific object language. Howe...
Florian Heidenreich, Jendrik Johannes, Mirko Seife...
113
Voted
POPL
2010
ACM
15 years 10 months ago
Contracts Made Manifest
Since Findler and Felleisen [2002] introduced higher-order contracts, many variants have been proposed. Broadly, these fall into two groups: some follow Findler and Felleisen in u...
Benjamin C. Pierce, Michael Greenberg, Stephanie W...