756 search results - page 142 / 152 » Can Abstract State Machines Be Useful in Language Theory |
RV
2010
Springer
13 years 6 months ago
2010
Springer
The RV system is the first system to merge the benefits of Runtime Monitoring with Predictive Analysis. The Runtime Monitoring portion of RV is based on the successful Monitoring O...
EUROCRYPT
2007
Springer
14 years 4 days ago
2007
Springer
Abstract. We introduce a notion of instance-dependent verifiable random functions (InstD-VRFs for short). Informally, an InstD-VRF is, in some sense, a verifiable random function [...
FMOODS
2006
13 years 9 months ago
2006
Abstract. The usual context of service oriented computing is characterized by several services offering the same functionalities, new services that are continuosly deployed and oth...
WISE
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
SPIN
2007
Springer
14 years 2 months ago
2007
Springer
d Abstract) Luboˇs Brim and Jiˇr´ı Barnat Faculty of Informatics, Masaryk University, Brno, Czech Republic With the increase in the complexity of computer systems, it becomes e...