Sciweavers

4036 search results - page 500 / 808
» Formal Methods
Sort
View
FMCO
2005
Springer
153views Formal Methods» more  FMCO 2005»
16 years 6 days ago
Smallfoot: Modular Automatic Assertion Checking with Separation Logic
Abstract. Separation logic is a program logic for reasoning about programs that manipulate pointer data structures. We describe Smallfoot, a tool for checking certain lightweight s...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
FORMATS
2005
Springer
16 years 6 days ago
Implementation of Timed Automata: An Issue of Semantics or Modeling?
Abstract. We examine to what extent implementation of timed automata can be achieved using the standard semantics and appropriate modeling, instead of introducing new semantics. We...
Karine Altisen, Stavros Tripakis
FORMATS
2005
Springer
16 years 6 days ago
Reachability Problems on Extended O-Minimal Hybrid Automata
Within hybrid systems theory, o-minimal automata are often considered on the border between decidability and undecidability. In such classes of hybrid automata, the constraint of h...
Raffaella Gentilini
IFL
2005
Springer
155views Formal Methods» more  IFL 2005»
16 years 5 days ago
A Binding Scope Analysis for Generic Programs on Arrays
Performance of generic array programs crucially relies on program specialization wrt. shape information. Traditionally, this is done in a rather adhoc fashion by propagating all sh...
Clemens Grelck, Sven-Bodo Scholz, Alexander V. Sha...
153
Voted
IFL
2005
Springer
103views Formal Methods» more  IFL 2005»
16 years 5 days ago
The Implementation of iData
The iData Toolkit is a toolkit that allows programmers to create interactive, type-safe, dynamic web applications with state on a high level of abstraction. The key element of this...
Rinus Plasmeijer, Peter Achten