1175 search results - page 67 / 235 » Abstract computability and algebraic specification |
107
click to vote
FM
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Bounding resource usage is important for a number of areas, notably real-time embedded systems and safety-critical systems. In this paper, we present a fully automatic st...
104
click to vote
CIE
2006
Springer
15 years 5 months ago
2006
Springer
In Bishop-style constructive algebra it is known that if a module over a commutative ring has a Noetherian basis function, then it is Noetherian. Using countable choice we prove th...
134
click to vote
CDC
2009
IEEE
15 years 27 days ago
2009
IEEE
Abstract-- We consider the problem of controlling a discretetime piecewise affine (PWA) system from a specification given as a Linear Temporal Logic (LTL) formula over linear predi...
119
click to vote
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We present a finite ω-complete axiomatization for the process algebra BCCSP modulo failure semantics, in case of a finite alphabet. This solves an open question by Gro...
130
click to vote
ESORICS
2010
Springer
15 years 4 months ago
2010
Springer
Due to their nature, Peer-to-Peer (P2P) systems are subject to a wide range of security issues. In this paper, we focus on a specific security property, called the root authenticit...