Sciweavers

597 search results - page 72 / 120
» Formal Techniques for Java-Like Programs
Sort
View
FM
2003
Springer
174views Formal Methods» more  FM 2003»
14 years 25 days ago
Model-Checking TRIO Specifications in SPIN
We present a novel application on model checking through SPIN as a means for verifying purely descriptive specifications written in TRIO, a first order, linear-time temporal logic ...
Angelo Morzenti, Matteo Pradella, Pierluigi San Pi...
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
13 years 11 months ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig
SAS
1997
Springer
162views Formal Methods» more  SAS 1997»
13 years 11 months ago
Exact Flow Analysis
We present a type-based flow analysis for simply typed lambda calculus with booleans, data-structures and recursion. The analysis is exact in the following sense: if the analysis ...
Christian Mossin
SAS
1997
Springer
111views Formal Methods» more  SAS 1997»
13 years 11 months ago
Fast and Effective Procedure Inlining
is an important optimization for programs that use procedural abstraction. Because inlining trades code size for execution speed, the effectiveness of an inlining algorithm is det...
Oscar Waddell, R. Kent Dybvig
FORMATS
2008
Springer
13 years 9 months ago
A Framework for Distributing Real-Time Functions
Abstract. The design of critical embedded real-time systems requires high confidence in the architecture and the implemented functionalities. Classically, such functions are suppor...
Frédéric Boniol, Pierre-Emmanuel Hla...