Sciweavers

4211 search results - page 199 / 843
» A formal approach to MASQ
Sort
View
SAS
2005
Springer
16 years 2 days 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
EWSA
2004
Springer
15 years 12 months ago
Correct Development of Embedded Systems
This paper provides an overview on the approach of the IST OMEGA project for the development of correct software for embedded systems based on the use of UML as modelling language....
Susanne Graf, Jozef Hooman
SAS
1993
Springer
126views Formal Methods» more  SAS 1993»
15 years 10 months ago
Finiteness Conditions for Strictness Analysis
We give upper bounds on the number of times the fixed point operator needs to be unfolded for strictness analysis of functional languages with lists. This extends previous work b...
Flemming Nielson, Hanne Riis Nielson
ISSAC
1990
Springer
83views Mathematics» more  ISSAC 1990»
15 years 10 months ago
Resolution Proof Systems with Weak Transformation Rules
In the previous papers [7-101we defined and explored a formal methodological framework on the basis of which resolution proof systems for strongly-finite logics can be introduced ...
Zbigniew Stachniak
ECAI
2004
Springer
15 years 10 months ago
Paraconsistent Preferential Reasoning by Signed Quantified Boolean Formulae
We introduce a uniform approach of representing a variety of paraconsistent non-monotonic formalisms by quantified Boolean formulae (QBFs) in the context of four-valued semantics. ...
Ofer Arieli