Sciweavers

1023 search results - page 120 / 205
» A Formal Method for Program Slicing
Sort
View
SAS
2005
Springer
15 years 7 months ago
Secure Information Flow as a Safety Problem
The termination insensitive secure information flow problem can be reduced to solving a safety problem via a simple program transformation. Barthe, D’Argenio, and Rezk coined th...
Tachio Terauchi, Alexander Aiken
145
Voted
FM
2003
Springer
174views Formal Methods» more  FM 2003»
15 years 6 months 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
2001
Springer
15 years 6 months ago
Sized Types for Typing Eden Skeletons
The parallel-functional language Eden extends Haskell with constructs to explicitly define and communicate processes. These extensions allow the easy definition of skeletons as h...
Ricardo Pena, Clara Segura
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
15 years 5 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
1993
Springer
139views Formal Methods» more  SAS 1993»
15 years 5 months ago
Compiling FX on the CM-2
Type and effect systems provide a safe and effective means of programming high-performance parallel computers with a high-level language that integrates both functional and impe...
Jean-Pierre Talpin, Pierre Jouvelot