×

Found 27 Documents (Results 1–27)

100
MathJax

Structural sparsity. (English. Russian original) Zbl 1367.03065

Russ. Math. Surv. 71, No. 1, 79-107 (2016); translation from Usp. Mat. Nauk 71, No. 1, 85-116 (2016).
PDF BibTeX XML Cite
Full Text: DOI

Complexity of propositional independence and inclusion logic. (English) Zbl 1465.68104

Italiano, F. (ed.) et al., Mathematical foundations of computer science 2015. 40th international symposium, MFCS 2015, Milan, Italy, August 24–28, 2015. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 9234, 269-280 (2015).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Using the autodependogram in model diagnostic checking. (English) Zbl 1300.62066

Torelli, Nicola (ed.) et al., Advances in theoretical and applied statistics. Selected papers based on the presentations at the 45th meeting of the Italian Statistical Society (SIS), Padua, Italy, June 16–18, 2010. Berlin: Springer (ISBN 978-3-642-35587-5/hbk; 978-3-642-35588-2/ebook). Studies in Theoretical and Applied Statistics. Selected Papers of the Statistical Societies, 129-139 (2013).
MSC:  62M10 62P05
PDF BibTeX XML Cite
Full Text: DOI

A semantic condition for data independence and applications in hardware verification. (English) Zbl 1339.68164

Goldsmith, Michael (ed.) et al., Proceedings of the 7th international workshop on automated verification of critical systems (AVoCS 2007), Oxford, UK, September 10–12, 2007. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 250, No. 1, 39-54 (2009).
MSC:  68Q60
PDF BibTeX XML Cite
Full Text: DOI

Using matrix graph grammars for the analysis of behavioural specifications: sequential and parallel independence. (English) Zbl 1278.68126

Pimentel, Ernesto (ed.), Proceedings of the seventh Spanish conference on programming and computer languages (PROLE 2007), Zaragoza, Spain, September 12–14, 2007. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 206, 133-152 (2008).
MSC:  68Q42 68Q60
PDF BibTeX XML Cite
Full Text: Link

The complexity of independence-friendly fixpoint logic. (English) Zbl 1148.03323

Bold, Stefan (ed.) et al., Foundations of the formal sciences V. Infinite games. Papers of the 5th conference, FotFS V, Bonn, Germany, November 26–29, 2004. London: King’s College Publications (ISBN 978-1-904987-75-8/pbk). Studies in Logic (London) 11, 39-61 (2007).
PDF BibTeX XML Cite

On model checking data-independent systems with arrays with whole-array operations. (English) Zbl 1081.68649

Abdallah, Ali E. (ed.) et al., Communicating sequential processes. The first 25 years. Symposium on the occasion of 25 years of CSP, London, UK, July 7–8, 2004. Revised invited papers. Berlin: Springer (ISBN 3-540-25813-2/pbk). Lecture Notes in Computer Science 3525, 275-291 (2005).
MSC:  68Q85 68Q60
PDF BibTeX XML Cite
Full Text: DOI

Relating data independent trace checks in CSP with UNITY reachability under a normality assumption. (English) Zbl 1196.68145

Boiten, Eerke A. (ed.) et al., Integrated formal methods. 4th international conference, IFM 2004, Canterbury, UK, April 4–7, 2004. Proceedings. Berlin: Springer (ISBN 3-540-21377-5/pbk). Lecture Notes in Computer Science 2999, 247-266 (2004).
MSC:  68Q60 68N30 68Q85
PDF BibTeX XML Cite
Full Text: DOI

On a semantic definition of data independence. (English) Zbl 1039.68035

Hofmann, Martin (ed.), Typed lambda calculi and applications. 6th international conference, TLCA 2003, Valencia, Spain, June 10–12, 2003. Proceedings. Berlin: Springer (ISBN 3-540-40332-9/pbk). Lect. Notes Comput. Sci. 2701, 226-240 (2003).
MSC:  68N18 68Q60
PDF BibTeX XML Cite
Full Text: Link

Filter Results by …

Document Type

Reviewing State

all top 5

Year of Publication

all top 3

Classification

all top 3

Software