171
click to vote
FOSSACS
15 years 10 months ago
2009 Springer 
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
112
click to vote
FOSSACS
15 years 10 months ago
2009 Springer
There is growing interest in quantitative theories of information flow in a variety of contexts, such as secure information flow, anonymity protocols, and side-channel analysis. ...
134
click to vote
FOSSACS
15 years 10 months ago
2009 Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
118
click to vote
FOSSACS
15 years 10 months ago
2009 Springer
Abstract. We introduce a generic framework for hybrid logics, i.e. modal logics additionally featuring nominals and satisfaction operators, thus providing the necessary facilities ...
122
click to vote
FOSSACS
15 years 10 months ago
2009 Springer 
Standard analysis on recursive data structures restrict their attention to shape properties (for instance, a program that manipulates a list returns a list), excluding properties t...
|
Software Engineering