Sciweavers

677 search results - page 3 / 136
» Dependent Types from Counterexamples
Sort
View
TPHOL
2003
IEEE
13 years 11 months ago
A Coverage Checking Algorithm for LF
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
Carsten Schürmann, Frank Pfenning
FLAIRS
2008
13 years 8 months ago
Causal Reasoning with Contexts Using Dependent Types
In Artificial Intelligence, a crucial requirement is the ability to reason about actions and their effects on the environment. Traditional approaches which rely on classical logic...
Richard Dapoigny, Patrick Barlatier
CONCUR
2006
Springer
13 years 9 months ago
A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems
We describe an incomplete but sound and efficient livelock freedom test for infinite state asynchronous reactive systems. The method s a system into a set of simple control flow cy...
Stefan Leue, Alin Stefanescu, Wei Wei
FLOPS
2008
Springer
13 years 7 months ago
On-Demand Refinement of Dependent Types
Dependent types are useful for statically checking detailed specifications of programs and detecting pattern match or array bounds errors. We propose a novel approach to applicatio...
Hiroshi Unno, Naoki Kobayashi
CSL
2004
Springer
13 years 11 months ago
A Dependent Type Theory with Names and Binding
We consider the problem of providing formal support for working tract syntax involving variable binders. Gabbay and Pitts have shown in their work on Fraenkel-Mostowski (FM) set th...
Ulrich Schöpp, Ian Stark