Sciweavers

4036 search results - page 323 / 808
» Formal Methods
Sort
View
CAV
2009
Springer
104views Hardware» more  CAV 2009»
16 years 7 months ago
SPEED: Symbolic Complexity Bound Analysis
The SPEED project addresses the problem of computing symbolic computational complexity bounds of procedures in terms of their inputs. We discuss some of the challenges that arise a...
Sumit Gulwani
VMCAI
2010
Springer
16 years 1 months ago
An Analysis of Permutations in Arrays
This paper is concerned with the synthesis of invariants in programs with arrays. More specifically, we consider properties concerning array contents up to a permutation. For inst...
Valentin Perrelle, Nicolas Halbwachs
127
Voted
CAV
2007
Springer
127views Hardware» more  CAV 2007»
16 years 26 days ago
CVC3
Abstract. CVC3, a joint project of NYU and U Iowa, is the new and latest version of the Cooperating Validity Checker. CVC3 extends and builds on the functionality of its predecesso...
Clark Barrett, Cesare Tinelli
CAV
2007
Springer
113views Hardware» more  CAV 2007»
16 years 26 days ago
On Synthesizing Controllers from Bounded-Response Properties
In this paper we propose a complete chain for synthesizing controllers from high-level specifications. From real-time properties expressed in the logic MTL we generate, under boun...
Oded Maler, Dejan Nickovic, Amir Pnueli
IFL
2007
Springer
158views Formal Methods» more  IFL 2007»
16 years 25 days ago
Checking Dependent Types Using Compiled Code
Abstract. Type checkers for dependent types need to evaluate user defined functions during type checking. For this, current implementations typically use an interpreter, which has...
Dirk Kleeblatt