Sciweavers

2976 search results - page 267 / 596
» On the bounded integer programming
Sort
View
ESOP
2009
Springer
15 years 9 months ago
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
Matthew R. Lakin, Andrew M. Pitts
128
Voted
FOSAD
2009
Springer
15 years 9 months ago
Verification of Concurrent Programs with Chalice
A program verifier is a tool that allows developers to prove that their code satisfies its specification for every possible input and every thread schedule. These lecture notes des...
K. Rustan M. Leino, Peter Müller, Jan Smans
TACAS
2010
Springer
181views Algorithms» more  TACAS 2010»
15 years 12 months ago
Boom: Taking Boolean Program Model Checking One Step Further
Abstract. We present Boom, a comprehensive analysis tool for Boolean programs. We focus in this paper on model-checking non-recursive concurrent programs. Boom implements a recent ...
Gérard Basler, Matthew Hague, Daniel Kroeni...
151
Voted
JISBD
2003
15 years 6 months ago
Using Contextual Logic Programming for Temporal Reasoning
The importance of temporal representation and reasoning is well known to the database community. Examples of such significance are the languages TSQL2 and its follow up, SQL/Tempo...
Vítor Nogueira, Salvador Abreu, Gabriel Dav...
ESOP
2007
Springer
15 years 11 months ago
Dependent Types for Low-Level Programming
In this paper, we describe the key principles of a dependent type system for low-level imperative languages. The major contributions of this work are (1) a sound type system that c...
Jeremy Condit, Matthew Harren, Zachary R. Anderson...