2540 search results - page 92 / 508 » Abstract Logics as Dialgebras |
178
click to vote
SPC
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Most attempts at analysing secure information flow in programs are based on domain-specific logics. Though computationally feahese approaches suffer from the need for ...
161
click to vote
TEAA
2005
Springer
15 years 12 months ago
2005
Springer
Enterprise systems are mission critical. As a result, ensuring their correctness is of primary concern. This paper aids to the analysis of Web Applications, focusing on the aspects...
160
click to vote
WADT
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Computational systems are often represented by means of Kripke structures, and related using simulations. We propose rewriting logic as a flexible and executable framewo...
149
click to vote
POPL
2000
ACM
15 years 10 months ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
184
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract-- We present a computational framework for identifying a set of initial states from which all trajectories of a piecewise affine (PWA) system satisfy a Linear Temporal Log...