22 search results - page 3 / 5 » Towards a Theory of Time-Bounded Verification |
AISC
1998
Springer
13 years 11 months ago
1998
Springer
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
WWW
2002
ACM
14 years 8 months ago
2002
ACM
Web services -- Web-accessible programs and devices ? are a key application area for the Semantic Web. With the proliferation of Web services and the evolution towards the Semanti...
FMOODS
2006
13 years 8 months ago
2006
In this paper we describe an application of the theory of graph transformations to the practise of language design. In particular, we have defined the static and dynamic semantics ...
EMSOFT
2008
Springer
13 years 9 months ago
2008
Springer
We focus on decomposition of hard-masking real-time faulttolerant programs (where safety, timing constraints, and liveness are preserved in the presence of faults) that are design...
POPL
2009
ACM
14 years 8 months ago
2009
ACM
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...