1948 search results - page 287 / 390 » Formalizing Mirror Theory |
LATA
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Learnability is a vital property of formal grammars: representation classes should be defined in such a way that they are learnable. One way to build learnable represent...
AINA
2009
IEEE
15 years 6 months ago
2009
IEEE
This paper presents a modeling method particularly suited to analyze interactions between Message Passing Interface MPI library execution and distributed cache coherence protocol....
110
click to vote
SAC
2009
ACM
15 years 6 months ago
2009
ACM
A wide range of web service choreography constraints on the content and sequentiality of messages can be translated into Linear Temporal Logic (LTL). Although they can be statical...
CCS
2009
ACM
15 years 6 months ago
2009
ACM
We describe CoSP, a general framework for conducting computational soundness proofs of symbolic models and for embedding these proofs into formal calculi. CoSP considers arbitrary...
CSFW
2009
IEEE
15 years 6 months ago
2009
IEEE
—Formal methods have proved their usefulness for analyzing the security of protocols. Most existing results focus on trace properties like secrecy (expressed as a reachability pr...