Sciweavers

1175 search results - page 67 / 235
» Abstract computability and algebraic specification
Sort
View
FM
2009
Springer
123views Formal Methods» more  FM 2009»
14 years 2 months ago
"Carbon Credits" for Resource-Bounded Computations Using Amortised Analysis
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...
Steffen Jost, Hans-Wolfgang Loidl, Kevin Hammond, ...
CIE
2006
Springer
13 years 9 months ago
Do Noetherian Modules Have Noetherian Basis Functions?
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...
Peter Schuster, Júlia Zappe
CDC
2009
IEEE
132views Control Systems» more  CDC 2009»
13 years 5 months ago
Temporal logic control of discrete-time piecewise affine systems
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...
Boyan Yordanov, Calin Belta
ICALP
2005
Springer
14 years 1 months ago
A Finite Basis for Failure Semantics
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...
Wan Fokkink, Sumit Nain
ESORICS
2010
Springer
13 years 8 months ago
Verifying Security Property of Peer-to-Peer Systems Using CSP
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...
Tien Tuan Anh Dinh, Mark Ryan