365 search results - page 59 / 73 » Using Types as Approximations for Type Checking Prolog Progr... |
VSTTE
2005
Springer
14 years 1 months ago
2005
Springer
How close are we to a world in which mechanically verified software is commonplace? A world in which theorem proving technology is used routinely by both software developers and p...
ESOP
2005
Springer
14 years 1 months ago
2005
Springer
Are computing systems trustworthy? To answer this, we need to know three things: what the systems are supposed to do, what they are not supposed to do, and what they actually do. A...
BIRTHDAY
2009
Springer
14 years 2 months ago
2009
Springer
We propose a naive version of action semantics that begins with a selection of “transient” and “persistent” facets, each characterized as a partial monoid. Yielders are de...
CASSIS
2004
Springer
14 years 29 days ago
2004
Springer
Abstract. This paper addresses the problem of static checking of programs to ensure that they satisfy confidentiality policies in the presence of dynamic access control in the for...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
This research concerns a noncooperative dynamic game with large number of oscillators. The states are interpreted as the phase angles for a collection of non-homogeneous oscillator...