text:
9-1_4},
editor = {Kuty{\l}owski, Miros{\l}aw and Charatonik, Witold and G{\c{e}}bala, Maciej},
pages = {26--37},
publisher = {Springer, Berlin, Heidelberg},
series = {Lecture Notes in Computer Science},
title = {The $k$-Anonymity Problem Is Hard},
volume = {5699},
year = {2009}
}
@incollection{Huber2013,
abstract = {In contrast to classical cryptography, the challenge of privacy in the context of databases is to find a trade-off between a security guarantee and utility. Individuals in a database have to be protected while preseving the usefullnes of the data. In this paper, we provide an overview over the results in the field of database privacy with focus on privacy notions. On the basis of these notions, we provide a framework that allows for the definition meaningful guarantees based on the distribution on privacy breaches and sesitive predicates. Interestingly, these notions do not fulfill the privacy axioms defined by Kifer et al. in [1,2].},
author = {Huber, Matthias and M{\"{u}}ller-Quade, J{\"{o}}rn and Nilges, Tobias},
booktitle = {Number Theory Cryptogr.},
doi = {10.1007/978-3-642-42001-6_15},
editor = {Fischlin, Marc and Katzenbeisser, Stefan},
isbn = {9783642420009},
issn = {03029743},
pages = {211--225},
publisher = {Springer, Berlin, Heidelberg},
series = {Lecture Notes in Computer Science},
title = {Defining Privacy Based on Distributions of Privacy Breaches},
volume = {8260},
year = {2013}
}
@article{Nykanen2011,
abstract = {O'Neill (The genuine Sieve of Eratosthenes. J. Funct. Program. 19(1), 2009, 95–106) has\n\npreviously considered a functional implementation for the genuine Sieve of Eratosthenes,\n\nbased on the well-known heap data structure. Here, we develop it further by adapting this\n\ndata structure to this particular application.},
author = {NYK{\"{A}}NEN, MATTI},
doi = {10.1017/S0956796811000128},
issn = {0956-7968},
journal = {J. Funct. Program.},
month = may,
number = {6},
pages = {1--10},
title = {A note on the genuine Sieve of Eratosthenes},
volume = {21},
year = {2011}
}
@incollection{Gorin2012,
abstract = {Modal languages are well-known for their robust decidability and relatively low complexity. However, as soon as one adds a self-referencing construct, like hybrid logic's down-arrow binder, to the basic modal language, decidability is lost, even if one restricts binding to a single variable. Here, we concentrate on the latter case and investigate the logics obtained by restricting the nesting depth of modalities between binding and use. In particular, for distances strictly below 3 we obtain well-behaved logics with a relatively high descriptive power. We investigate the fragment with distance 1 in the framework of coalgebraic modal logic, for which we provide very general decidability and complexity results. For the fragment with distance 2 we focus on the case of Kripke semantics and obtain optimum complexity bounds (no harder than the base logic). We show that this fragment is expressive enough to accommodate the guarded fragment over the correspondence language.},
author = {Gor{\'{i}}n, Daniel and Schr{\"{o}}der, Lutz},
booktitle = {Found. Softw. Sci. Comput. Struct.},
editor = {Birkedal, Lars},
isbn = {978-3-642-28728-2},
pages = {240--254},
publisher = {Springer Berlin / Heidelberg},
series = {Lecture Notes in Computer Science},
title = {Narcissists are easy, stepmothers are hard},
volume = {7213},
year = {2012}
}
@article{Olkhovikov2012,
abstract = {Notions of k-asimulation and asimulation are introduced as asymmetric counterparts to k-bisimulation and bisimulation, respectively. It is proved that a first-order formula is equivalent to a standard translation of an intuitionistic propositional formula iff it is invariant with respect to k-asimulations for some k, and then that a first-order formula is equivalent to a standard translation of an intuitionistic propositional formula iff it is invariant with respect to asimulations. Finally, it is proved that a first-order formula is intuitionistically equivalent to a standard translation of an intuitionistic propositional formula iff it is invariant with respect to asimulations between intuitionistic models.},
archivePrefix = {arXiv},
arxivId = {1207.4414},
author = {Olkhovikov, Grigory K},
eprint = {1207.4414},
journal = {ArXiv e-prints},
keywords = {a modal,a standard translation of,bisimu-,formula is equivalent to,intuitionistic logic,lation,model theory,propositional logic,s theorem,s well-known modal characterization,states that a first-order,theorem,theorem 3 below,van benthem},
month = jul,
pages = {16},
title = {Model-theoretic characterization of intuitionistic propositional formulas},
year = {2012}
}
@article{Bauer2014,
author = {Bauer, Andrej and Plotkin, Gordon D. and Scott, Dana S.},
doi = {10.1016/j.tcs.2014.02.042},
issn = {03043975},
journal = {Theor. Comput. Sci.},
month = aug,
pages = {17--29},
publisher = {Elsevier B.V.},
title = {Cartesian closed categories of separable Scott domains},
volume = {546},
year = {2014}
}
@book{Statistik2014,
abstract = {The objective of this case study was to obtain some first-hand information about the functional consequences of a cosmetic tongue split operation for speech and tongue motility. One male patient who had performed the operation on himself was interviewed and underwent a tongue motility assessment, as well as an ultrasound examination. Tongue motility was mildly reduced as a result of tissue scarring. Speech was rated to be fully intelligible and highly acceptable by 4 raters, although 2 raters noticed slight distortions of the sibilants /s/ and /z/. The 3-dimensional ultrasound demonstrated that the synergy of the 2 sides of the tongue was preserved. A notably deep posterior genioglossus furrow indicated compensation for the reduced length of the tongue blade. It is concluded that the tongue split procedure did not significantly affect the participant's speech intelligibility and tongue motility.},
address = {Berlin, Heidelberg},
doi = {10.1007/BFb0079380},
editor = {Hilton, Peter J.},
isbn = {978-3-540-04605-9},
keywords = {12,2007,3,Adolescence,Adolescencia,Adolescent,Adolescent Behavior,Adolescent Behavior: psychology,Adult,Agresiones al cuerpo,Attachment to the body,Attaque au corps,Autolesiones deliberadas,Automutilation d{\'{e}}lib{\'{e}}r{\'{e}}e,Body Piercing,Body Piercing: psychology,Body Piercing: statistics & numerical data,Body image,CUERPO,Chile,Chile: epidemiology,Cornway,Corporate Finance,Cosmetic Techniques,Deliberate self-harm,Epidemiologic Methods,Female,Humans,Image corporelle,Imagen corporal,Industrial Organization,J.,JUVENTUD,Lumb,MODIFICACIONES CORPORALES,Male,Masood,Motivation,Movement,Public,R.,Risk-Taking,S.,S.K.,Self Mutilation,Self Mutilation: physiopathology,Self Mutilation: ultrasonography,Sex Distribution,Skan,Speech Articulation Tests,Speech Intelligibility,Tattooing,Tattooing: psychology,Tattooing: statistics & numerical data,Tongue,Tongue: injuries,Tongue: physiopathology,Tongue: ultrasonography,advantages,aesthetics,and e-banking,and on cor-,anomaly detection,as none were found,authentication,autoinjury and health,body,business model,candidate,classification,collaboration,competition,complications did not,complications from inserting a,constituci{\'{o}}n del yo,control postural- estabilizaci{\'{o}}n- v{\'{i}}as,corporal modifications,corps,credit access,credit financing,credit score,credit scoring,critical success factors,cuerpo,culturas juveniles,cultures juv{\'{e}}niles,customer satisfaction,customer scoring,data mining,decision tree,department of economics at,e-,e- banking,e-banking,e-commerce,e-payment,e-trading,electronic communication and computation,emergency,endogenous tie,epidural,esth{\'{e}}tique,est{\'{e}}tica,feature sim-,finance includes e-payment,financial fervices technology,financial services innovation,find any reports of,fintech,fintech analysis,fintech start-ups,functions,genetic programming,global fintech comparison,high resolution images,if neuraxial anes-,in practice,indonesia,information technology,ing with neuraxial anesthesia,internet bank,internet primary bank,jarunee wonglimpiyarat,jeunesse,jibc december 2007,juvenile cultures,juventud,limitations,luation of non-urgent visits,m-commerce,mecanismos de anteroalimentaci{\'{o}}n y,modificacio -,multimodal biometric,needle through a,nes corporales,network security,networks,neural networks,no,patents analysis,perforaci{\'{o}}n corporal,piel,professor of marketing,professor of marketing at,pr{\'{a}}ctica autolesiva,psicoan{\'{a}}lisis,recommender system,research,retroalimentaci{\'{o}}n,risks management,segunda piel,sensitivas y motoras,smart cards,social network analysis,social networks,social status,spinal,strategic,strategy,support vector machine,sustainable reconstruction,sydney fintech,sydney start-ups,tattoo,tattooing,tattoos,tatuaje,the literature on tattoos,the university of pennsylvania,the wharton school of,to a busy urban,traditional banking services,unimodal biometric,university of pennsylvania,vol,was reviewed to see,youth},
number = {2},
pages = {81--87},
publisher = {Springer Berlin Heidelberg},
series = {Lecture Notes in Mathematics},
title = {Category Theory, Homology Theory and their Applications I},
volume = {86},
year = {1969}
}
@article{Kelly1993a,
author = {Kelly, Gregory Maxwell and Lack, Stephen},
doi = {10.1007/BF00872987},
issn = {0927-2852},
journal = {Appl. Categ. Struct.},
keywords = {2-monads,categories with structure,finite-product-preserving functors,kan extensions},
number = {1},
pages = {85--94},
title = {Finite-product-preserving functors, Kan extensions, and strongly-finitary 2-monads},
volume = {1},
year = {1993}
}
@article{Marmolejo2010,
author = {Marmolejo, F. and Wood, R. J.},
issn = {1201561X},
journal = {Theory Appl. Categ.},
keywords = {Distributive laws,Extension systems,Monads,Profunctors,Wreaths},
number = {4},
pages = {84--113},
title = {Monads as extension systems - No iteration is necessary},
volume = {24},
year = {2010}
}
@article{Power2009,
author = {Power, A. John},
doi = {10.1007/s10485-009-9202-7},
issn = {0927-2852},
journal = {Appl. Categ. Struct.},
keywords = {18c10,18c15,18c20,18c30,2000,cotensors,enrichment,mathematics subject classifications,monads,tensors},
month = may,
number = {1},
pages = {293--299},
title = {Unicity of Enrichment over Cat or Gpd},
volume = {19},
year = {2009}
}
@incollection{Freyd1991,
author = {Freyd, Peter},
booktitle = {Categ. Theory},
doi = {10.1007/BFb0084215},
editor = {Carboni, Aurelio and Pedicchio, Maria and Rosolini, Guiseppe},
isbn = {978-3-540-54706-8},
pages = {95--104},
publisher = {Springer Berlin / Heidelberg},
series = {Lecture Notes in Mathematics},
title = {Algebraically complete categories},
type = {Book part (with own title)},
volume = {1488},
year = {1991}
}
@book{Borceux1994,
author = {Borceux, Francis},
isbn = {9780521441797},
pages = {443},
publisher = {Cambridge University Press},
series = {Encyclopedia of Mathematics and its Applications},
title = {Handbook of Categorical Algebra 1: Basic Category Theory},
type = {Book},
year = {1994}
}
@article{Hermida1998,
abstract = {We present a categorical logic formulation of induction and coinduction principles for reasoning about inductively and coinductively defined types. Our main results provide sufficient criteria for the validity of such principles: in the presence of comprehension, the induction principle for initial algebras is admissible, and dually, in the presence of quotient types, the coinduction principle for terminal coalgebras is admissible. After giving an alternative formulation of induction in terms of binary relations, we combine both principles and obtain a mixed induction/coinduction principle which allows us to reason about minimal solutionsX≅$\sigma$(X) whereXmay occur both positively and negatively in the type constructor $\sigma$. We further strengthen these logical principles to deal with contexts and prove that such strengthening is valid when the (abstract) logic we consider is contextually/functionally complete. All the main results follow from a basic result about adjunctions between “categories of algebras” (inserters).},
author = {Hermida, Claudio and Jacobs, Bart},
doi = {10.1006/inco.1998.2725},
issn = {08905401},
journal = {Inf. Comput.},
number = {2},
pages = {107--152},
title = {Structural induction and coinduction in a fibrational setting},
volume = {145},
year = {1998}
}
@article{Plotkin1977,
author = {Plotkin, Gordon D.},
doi = {10.1016/0304-3975(77)90044-5},
issn = {03043975},
journal = {Theor. Comput. Sci.},
month = dec,
number = {3},
pages = {223--255},
title = {LCF considered as a programming language},
volume = {5},
year = {1977}
}
@article{Balan2011,
author = {Balan, Adriana and Kurz, Alexander},
doi = {10.1016/j.tcs.2011.03.021},
issn = {03043975},
journal = {Theor. Comput. Sci.},
month = sep,
number = {38},
pages = {4989--5005},
publisher = {Elsevier B.V.},
title = {On coalgebras over algebras},
volume = {412},
year = {2011}
}
@book{Manes1976,
author = {Manes, Ernest G.},
doi = {10.1007/978-1-4612-9860-1},
pages = {341},
publisher = {Springer-Verlag},
series = {Graduate Texts in Mathematics},
title = {Algebraic Theories},
volume = {26},
year = {1976}
}
@article{Davey2011,
author = {Davey, Brian A. and Gouveia, M. J. and Haviar, M. and Priestley, Hilary A.},
doi = {10.1007/s00012-011-0155-y},
issn = {00025240},
journal = {Algebr. Universalis},
keywords = {Canonical extension,Natural duality,Natural extension,Profinite completion,Residually finite},
pages = {205--241},
title = {Natural extensions and profinite completions of algebras},
volume = {66},
year = {2011}
}
@article{Dimitrakakis2013,
abstract = {Differential privacy formalises privacy-preserving mechanisms that provide access to a database. We pose the question of whether Bayesian inference itself can be used directly to provide private access to data, with no modification. The answer is affirmative: under certain conditions on the prior, sampling from the posterior distribution can be used to achieve a desired level of privacy and utility. To do so, we generalise differential privacy to arbitrary dataset metrics, outcome spaces and distribution families. This allows us to also deal with non-i.i.d or non-tabular datasets. We prove bounds on the sensitivity of the posterior to the data, which gives a measure of robustness. We also show how to use posterior sampling to provide differentially private responses to queries, within a decision-theoretic framework. Finally, we provide bounds on the utility and on the distinguishability of datasets. The latter are complemented by a novel use of Le Cam's method to obtain lower bounds. All our general results hold for arbitrary database metrics, including those for the common definition of differential privacy. For specific choices of the metric, we give a number of examples satisfying our assumptions.},
archivePrefix = {arXiv},
arxivId = {1306.1066},
author = {Dimitrakakis, Christos and Nelson, Blaine and Zhang, and Zuhe and Mitrokotsa, Aikaterini and Rubinstein, Benjamin},
eprint = {1306.1066},
issn = {15337928},
journal = {J. Mach. Learn. Res.},
keywords = {Bayesian inference,adversarial Learning,differential privacy,robustness},
number = {11},
pages = {1--39},
title = {Differential Privacy for Bayesian Inference through Posterior Sampling},
volume = {18},
year = {2017}
}
@article{Hintze2016,
author = {Hintze, Mike},
doi = {10.2139/ssrn.2909121},
issn = {1556-5068},
journal = {SSRN Electron. J.},
number = {October 1995},
pages = {1--22},
title = {Viewing the GDPR through a De-Identification Lens: A Tool for Clarification and Compliance},
year = {2016}
}
@article{Abramsky1991a,
author = {Abramsky, Samson},
doi = {10.1016/0168-0072(91)90065-T},
issn = {01680072},
journal = {Ann. Pure Appl. Log.},
number = {1-2},
pages = {1--77},
title = {Domain theory in logical form},
type = {Journal article},
volume = {51},
year = {1991}
}
@inproceedings{Halpern2009,
address = {New York, New York, USA},
author = {Halpern, Joseph Y. and Pass, Rafael and Raman, Vasumathi},
booktitle = {Proc. 11th Conf. Theor. Asp. Ration. Knowl. - TARK '09},
doi = {10.1145/1562814.1562837},
isbn = {9781605585604},
pages = {156--165},
publisher = {ACM Press},
title = {An epistemic characterization of zero knowledge},
year = {2009}
}
@article{Of1982,
author = {Smyth, Michael B. and Plotkin, Gordon D.},
doi = {10.1137/0211062},
issn = {0097-5397},
journal = {SIAM J. Comput.},
keywords = {1,13,26,39,40,41,and their followers,by scott and strachey,category,computability,data-types,domains,fixed-point,for example,gordon,in denota-,introduction,milne and strachey,partial-order,play a crucial role,recursive specifications of domains,semantics,stoy,tennent,the equation,tional semantics as developed},
month = nov,
number = {4},
pages = {761--783},
title = {The category-theoretic solution of recursive domain equations},
volume = {11},
year = {1982}
}
@phdthesis{Hermida1993,
abstract = {Within the framework of categorical logic/type theory, we provide a category-theoretic account of some logical concepts, i.e. first-order logical predicates for simply typed lambda-calculus, structural induction for inductive data types, and indeterminates for polymorphic calculi. The main concept which underlies the issues above is that of fibration, which gives an abstract presentation of the indexing present in all cases: predicates indexed by types/contexts in first-order logic and types indexed by kinds in polymorphic calculi. The characterisation of the logical concepts in terms of fibrations relies on a fundamental property of adjunctions between fibrations, which in particular relates some structure in the total category of a fibration with that of the fibres. Suitable instances of this property reflect the above-mentioned logical concepts in an abstract way, independently of their syntactic presentation, thereby illuminating their main features.},
author = {Hermida, Claudio},
issn = {0105-8517},
school = {University of Edinburgh},
title = {Fibrations, Logical Predicates and Indeterminates},
type = {PhD Thesis},
year = {1993}
}
@article{Makkai1987a,
author = {Makkai, Michael and Pitts, Andrew M.},
doi = {10.2307/2000508},
issn = {00029947},
journal = {Trans. Am. Math. Soc.},
month = feb,
number = {2},
pages = {473},
title = {Some Results on Locally Finitely Presentable Categories},
volume = {299},
year = {1987}
}
@incollection{Perrin1995,
address = {Dordrecht},
author = {Perrin, Dominique and Pin, Jean-{\'{E}}ric},
booktitle = {Semigroups, Form. Lang. Groups},
doi = {10.1016/j.chiabu.2011.09.001},
editor = {Fountain, John},
issn = {1873-7757},
pages = {49--72},
pmid = {22015205},
publisher = {Kluwer Academic Publishers},
series = {Nato Science Series C: Mathematical and Physical Sciences},
title = {Semigroups and automata on infinite words},
year = {1995}
}
@book{Rhodes2009,
address = {Boston, MA},
author = {Rhodes, John and Steinberg, Benjamin},
doi = {10.1007/b104443},
isbn = {978-0-387-09780-0},
publisher = {Springer US},
series = {Springer Monographs in Mathematics},
title = {The q-theory of Finite Semigroups},
year = {2009}
}
@incollection{Komendantskaya2008,
author = {Komendantskaya, Ekaterina and Power, A. John},
booktitle = {JELIA'08},
doi = {10.1007/978-3-540-87803-2_22},
editor = {H{\"{o}}lldobler, Steffen and Lutz, Carsten and Wansing, Heinrich},
keywords = {categorical logic,fibrational,ground semantics,many-valued logic programs,semantics,sld-resolution},
pages = {258--271},
publisher = {Springer Berlin Heidelberg},
series = {Lecture Notes in Computer Science},
title = {Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness},
year = {2008}
}
@book{Pitts2013,
author = {Pitts, Andrew M.},
isbn = {9781107017788},
month = jul,
pages = {287},
publisher = {Cambridge University Press},
series = {Cambridge Tracts in Theoretical Computer Science},
title = {Nominal Sets},
year = {2013}
}
@article{Jacobs2000,
author = {Jacobs, Bart},
doi = {10.1016/S1571-0661(05)80348-2},
issn = {15710661},
journal = {Electron. Notes Theor. Comput. Sci.},
month = jan,
pages = {160--195},
title = {Towards a Duality Result in Coalgebraic Modal Logic},
volume = {33},
year = {2000}
}
@article{Esik1983,
abstract = {The equational class generated by rational algebraic theories was characterized in Esik, Comput. Linguistics and Comput. Languages XIV (1980), 183-207. Here, this class will be called the class of iteration theories. Also, there is a close connection between Elgot's iterative theories and iteration theories. In this paper we introduce algebras for iteration theories, called iteration algebras. Iteration algebras are natural generalization of regular algebras and they are closely related to iterative algebras as well. It is shown that the absolutely free iteration algebras are the algebras of regular trees. {\textcopyright} 1983.},
author = {{\'{E}}sik, Zolt{\'{a}}n},
doi = {10.1016/0022-0000(83)90044-2},
issn = {00220000},
journal = {J. Comput. Syst. Sci.},
month = oct,
number = {2},
pages = {291--303},
title = {Algebras of iteration theories},
volume = {27},
year = {1983}
}
@article{Sobocinski2016,
abstract = {Compositionality and process equivalence are both standard concepts of process algebra. Compositionality means that the behaviour of a compound system relies only on the behaviour of its components, i.e. there is no emergent behaviour. Process equivalence means that the explicit statespace of a system takes a back seat to its interaction patterns: the information that an environment can obtain though interaction. Petri nets are a classical, yet widely used and understood, model of concurrency. Nevertheless, they have often been described as a non-compositional model, and tools tend to deal with monolithic, globally-specified models. This tutorial paper concentrates on Petri Nets with Boundaries (PNB): a compositional, graphical algebra of 1-safe nets, and its applications to reachability checking within the tool Penrose. The algorithms feature the use of compositionality and process equivalence, a powerful combination that can be harnessed to improve the performance of checking reachability and coverability in several common examples where Petri nets model realistic concurrent systems.},
archivePrefix = {arXiv},
arxivId = {1603.00976},
author = {Soboci{\'{n}}ski, Pawe{\l}},
doi = {10.4204/EPTCS.204.3},
eprint = {1603.00976},
issn = {2075-2180},
journal = {Electron. Proc. Theor. Comput. Sci.},
month = mar,
pages = {19--30},
title = {Compositional model checking of concurrent systems, with Petri nets},
volume = {204},
year = {2016}
}
@incollection{Tschantz2009,
author = {Tschantz, Michael Carl and Wing, Jeannette M},
booktitle = {FM 2009 Form. Methods},
doi = {10.1007/978-3-642-05089-3_1},
editor = {Cavalcanti, Ana and Dams, Dennis R.},
pages = {1--15},
publisher = {Springer, Berlin, Heidelberg},
series = {Lecture Notes in Computer Science},
title = {Formal Methods for Privacy},
volume = {5850},
year = {2009}
}
@article{Komendantskaya2016,
abstract = {Coinductive definitions, such as that of an infinite stream, may often be described by elegant logic programs, but ones for which SLD-refutation is of no value as SLD-derivations fall into infinite loops. Such definitions give rise to questions of lazy corecursive derivations and parallelism, as execution of such logic programs can have both recursive and corecursive features at once. Observational and coalgebraic semantics have been used to study them abstractly. The programming developments have often occurred separately and have usually been implementation-led. Here, we give a coherent semantics-led account of the issues, starting with abstract category theoretic semantics, developing coalgebra to characterise naturally arising trees, and proceeding towards implementation of a new dialect, CoALP, of logic programming, characterised by guarded lazy corecursion and parallelism.},
archivePrefix = {arXiv},
arxivId = {1312.6568},
author = {Komendantskaya, Ekaterina and Power, John and Schmidt, Martin},
doi = {10.1093/logcom/exu026},
eprint = {1312.6568},
issn = {0955-792X},
journal = {J. Log. Comput.},
keywords = {Logic programming,coalgebra,coinduction,corecursion,observational semantics,parallelism},
month = apr,
number = {2},
pages = {745--783},
title = {Coalgebraic logic programming: from Semantics to Implementation},
volume = {26},
year = {2016}
}
@article{Klin2016,
abstract = {We use modal logic as a framework for coalgebraic trace semantics, and show the flexibility of the approach with concrete examples such as the language semantics of weighted, alternating and tree automata, and the trace semantics of generative probabilistic systems. We provide a sufficient condition under which a logical semantics coincides with the trace semantics obtained via a given determinization construction. Finally, we consider a condition that guarantees the existence of a canonical determinization procedure that is correct with respect to a given logical semantics. That procedure is closely related to Brzozowski's minimization algorithm.},
archivePrefix = {arXiv},
arxivId = {1611.05183},
author = {Klin, Bartek and Rot, Jurriaan},
doi = {1611.05183},
eprint = {1611.05183},
isbn = {9783642548611},
issn = {18605974},
journal = {Log. Methods Comput. Sci.},
keywords = {Algebraic theories,Equational logic,Rewriting,Soundness and completeness,Variable binding,$\alpha$-equivalence},
month = nov,
number = {3},
pages = {1--34},
title = {Coalgebraic trace semantics via forgetful logics},
volume = {7},
year = {2016}
}
@article{Su1991,
abstract = {The authors investigate the inference problems due to functional\ndependencies (FD) and multivalued dependencies (MVD) in a multilevel\nrelational database (MDB) with attribute and record classification\nschemes, respectively. The set of functional dependencies to be taken\ninto account in order to prevent FD-compromises is determined. It is\nproven that incurring minimum information loss to prevent compromises is\nan NP-complete problem. An exact algorithm to adjust the attribute\nlevels so that no compromise due to functional dependencies occurs is\ngiven. Some necessary and sufficient conditions for MVD-compromises are\npresented. The set of MVDs to be taken into account for controlling\ninferences is determined. An algorithm to prevent MVD-compromises in a\nrelation with conflict-free MVDs is given},
author = {Su, T.-A. and Ozsoyoglu, Gultekin},
doi = {10.1109/69.109108},
issn = {10414347},
journal = {IEEE Trans. Knowl. Data Eng.},
keywords = {Compromise,NP-complete,data classification,database security,functional dependency,inference control,information loss,multilevel relational database,multivalued dependency},
number = {4},
pages = {474--485},
title = {Controlling FD and MVD inferences in multilevel relational database systems},
volume = {3},
year = {1991}
}
@article{Hansoul2012,
author = {Hansoul, Georges and Teheux, Bruno},
doi = {10.1007/s11225-012-9396-9},
isbn = {1122501293},
issn = {0039-3215},
journal = {Stud. Log.},
keywords = {03b45,03b50,canon-,ical model,kripke semantic,many-valued logic,mathematics subject classification,modal logic,mv-algebras,relational semantic},
month = jun,
number = {3},
pages = {505--545},
title = {Extending {\L}ukasiewicz Logics with a Modality: Algebraic Approach to Relational Semantics},
volume = {101},
year = {2013}
}
@article{Hughes2004a,
abstract = {We propose a new specification framework for information hiding properties such as anonymity and privacy. The framework is based on the concept of a function view, which is a concise representation of the attacker's partial knowledge about a function. We describe system behavior as a set of functions, and formalize different information hiding properties in terms of views of these functions. We present an ex- tensive case study, in which we use the function view framework to systematically classify and rigorously define a rich domain of identity-related properties, and to demonstrate that privacy and anonymity are independent. The key feature of our approach is its modularity. It yields precise, formal specifications of information hiding properties for any protocol formalism and any choice of the attacker model as long as the latter induce an observational equivalence relation on protocol instances. In particular, specifications based on function views are suitable for any cryptographic process calculus that defines some form of indistin- guishability between processes. Our definitions of information hiding properties take into account any feature of the security model, including probabilities, random number generation, timing, etc., to the ex- tent that it is accounted for by the formalism in which the system is specified.},
author = {Hughes, Dominic and Shmatikov, Vitaly},
issn = {0926-227X},
journal = {J. Comput. Secur.},
keywords = {anonymity,information hiding,knowledge,kripke structure,logic,security,verification},
number = {1},
pages = {3--36},
title = {Information Hiding, Anonymity and Privacy: A Modular Approach},
volume = {12},
year = {2004}
}
@book{Milner1989a,
author = {Milner, Robin},
isbn = {0-13-115007-3},
publisher = {Prentice Hall International Ltd.},
title = {Communication and Concurrency},
type = {Book},
year = {1989}
}
@article{Pare2011,
abstract = {We show that any directed colimit of acessible categories and accessible full embeddings is accessible and, assuming the existence of arbitrarily large strongly compact cardinals, any directed colimit of acessible categories and accessible embeddings is accessible.},
archivePrefix = {arXiv},
arxivId = {1110.0767},
author = {Par{\'{e}}, Robert and Rosick{\'{y}}, Jiř{\'{i}}},
eprint = {1110.0767},
journal = {ArXiv e-prints},
keywords = {accessible category,and phrases,compact cardinal,directed colimit},
month = oct,
pages = {1--6},
title = {Colimits of accessible categories},
year = {2011}
}
@article{Bourke2014,
abstract = {We define notions of regularity and (Barr-)exactness for 2-categories. In fact, we define three notions of regularity and exactness, each based on one of the three canonical ways of factorising a functor in Cat: as (surjective on objects, injective on objects and fully faithful), as (bijective on objects, fully faithful), and as (bijective on objects and full, faithful). The correctness of our notions is justified using the theory of lex colimits [12] introduced by Lack and the second author. Along the way, we develop an abstract theory of regularity and exactness relative to a kernel-quotient factorisation, extending earlier work of Street and others [24,3]. ?? 2013 Elsevier B.V.},
author = {Bourke, John and Garner, Richard},
doi = {10.1016/j.jpaa.2013.11.021},
issn = {00224049},
journal = {J. Pure Appl. Algebr.},
number = {7},
pages = {1346--1371},
publisher = {Elsevier B.V.},
title = {Two-dimensional regularity and exactness},
volume = {218},
year = {2014}
}
@article{Adamek2014a,
abstract = {Coproducts of monads on Set have arisen in both the study of computational effects and universal algebra. We describe coproducts of consistent monads on Set by an initial algebra formula, and prove also the converse: if the coproduct exists, so do the required initial algebras. That formula was, in the case of ideal monads, also used by Ghani and Uustalu. We deduce that coproduct embeddings of consistent monads are injective; and that a coproduct of injective monad morphisms is injective. Two consistent monads have a coproduct iff either they have arbitrarily large common fixpoints, or one is an exception monad, possibly modified to preserve the empty set. Hence a consistent monad has a coproduct with every monad iff it is an exception monad, possibly modified to preserve the empty set. We also show other fixpoint results, including that a functor (not constant on nonempty sets) is finitary iff every sufficiently large cardinal is a fixpoint.},
archivePrefix = {arXiv},
arxivId = {1409.3804},
author = {Ad{\'{a}}mek, Jiř{\'{i}} and Bowler, Nathan and Levy, Paul Blain and Milius, Stefan},
eprint = {1409.3804},
journal = {ArXiv e-prints},
month = sep,
title = {Coproducts of Monads on Set},
year = {2014}
}
@article{Wong2009,
abstract = {Data publishing generates much concern over the protection of individual privacy. Recent studies consider cases where the adversary may possess different kinds of knowledge about the data. In this article, we show that knowledge of the mechanism or algorithm of anonymization for data publication can also lead to extra information that assists the adversary and jeopardizes individual privacy. In particular, all known mechanisms try to minimize information loss and such an attempt provides a loophole for attacks. We call such an attack a minimality attack. In this article, we introduce a model called m-confidentiality which deals with minimality attacks, and propose a feasible solution. Our experiments show that minimality attacks are practical concerns on real datasets and that our algorithm can prevent such attacks with very little overhead and information loss.},
author = {Wong, Raymond Chi-wing and Fu, ADA Wai-chee and Wang, KE and Pei, Jian},
doi = {10.1145/1538909.1538910},
journal = {J. ACM Trans. Database Syst.},
number = {2},
title = {Anonymization-Based Attacks in Privacy-Preserving Data Publishing},
volume = {34},
year = {2009}
}
@article{Futamura1999,
abstract = {This paper reports the relationship between formal description of semantics (i.e., intepreter) of a programming language and an actual compiler. The paper also describes a method to automatically generate an actual compiler froma a formal description which is, in some sense, the partial evaluation of a computation process. The compiler-compiler inspired by this method differs from conventional ones in that the compiler-compiler based on our method can describe an evaluation procedure (interpreter) in defining the semantics of a programming language, while the conventional one describes a translation process.},
author = {Futamura, Yoshihiko},
doi = {10.1023/A:1010095604496},
issn = {13883690},
journal = {Higher-Order Symb. Comput.},
keywords = {compiler,futamura projections,interpreter,partial evaluation,program transformation},
number = {4},
pages = {381--391},
title = {Partial evaluation of computation process--an approach to a compiler-compiler},
volume = {12},
year = {1999}
}
@misc{Velebil2010,
abstract = {We generalize the concept of dual adjunctions given by a schizophrenic object to those that are induced by schizophrenic modules. This concept allows one to treat various modal coalgebraic calculi in a uniform way. We show applications to classical modal coalgebraic logics, logics over posets, categories of presheaves etc. This is a joint work with Alexander Kurz.},
address = {Kanazawa, Japan},
author = {Velebil, Jiř{\'{i}}},
title = {Logical Connections in the Many-sorted Setting},
url = {http://www.jaist.ac.jp/rcis/asubl4/},
year = {2010}
}
@book{Johnstone2002,
author = {Johnstone, Peter T.},
isbn = {978-0-19-853425-9},
pages = {562},
publisher = {Oxford University Press},
title = {Sketches of an Elephant: A Topos Theory Compendium},
volume = {1},
year = {2002}
}
@article{Lucyshyn-Wright2014,
abstract = {In a paper of 1974, Brian Day employed a notion of factorization system in the context of enriched category theory, replacing the usual diagonal lifting property with a corresponding criterion phrased in terms of hom-objects. We set forth the basic theory of such enriched factorization systems. In particular, we establish stability properties for enriched prefactorization systems, we examine the relation of enriched to ordinary factorization systems, and we provide general results for obtaining enriched factorizations by means of wide (co)intersections. As a special case, we prove results on the existence of enriched factorization systems involving enriched strong monomorphisms or strong epimorphisms.},
archivePrefix = {arXiv},
arxivId = {1401.0315},
author = {Lucyshyn-Wright, Rory B. B.},
eprint = {1401.0315},
journal = {ArXiv e-prints},
month = jan,
pages = {1--19},
title = {Enriched factorization systems},
year = {2014}
}
@book{Blackburn2002a,
author = {Blackburn, Patrick and de Rijke, Maarten and Venema, Yde},
publisher = {Cambridge University Press},
title = {Modal Logic},
type = {Book},
year = {2002}
}
@article{Adamek2011a,
author = {Ad{\'{a}}mek, Jiř{\'{i}} and Trnkov{\'{a}}, V{\v{e}}ra},
doi = {10.1017/S0960129510000502},
isbn = {0960129510},
issn = {0960-1295},
journal = {Math. Struct. Comput. Sci.},
month = mar,
number = {02},
pages = {481--509},
title = {Initial algebras and terminal coalgebras in many-sorted sets},
volume = {21},
year = {2011}
}
@article{Banaschewski1976,
author = {Banaschewski, Bernhard and Nelson, Evelyn},
doi = {10.4153/CMB-1976-060-2},
issn = {1496-4287},
journal = {Can. Math. Bull.},
month = dec,
number = {4},
pages = {385--402},
title = {Tensor products and biomorphisms},
volume = {19},
year = {1976}
}
@article{Parrow2015,
author = {Parrow, Joachim and Borgstr{\"{o}}m, Johannes and Eriksson, Lars-Henrik and Gutkovas, Ramunas and Weber, Tjark},
doi = {http://dx.doi.org/10.4230/LIPIcs.CONCUR.2015.198},
isbn = {978-3-939897-91-0},
issn = {1868-8969},
journal = {26th Int. Conf. Concurr. Theory},
keywords = {198,2015,4230,and phrases process algebra,bisimulation,concur,digital object identifier 10,lipics,modal logic,nominal sets},
number = {Concur},
pages = {198--211},
title = {Modal logics for nominal transition systems},
volume = {42},
year = {2015}
}
@phdthesis{Verity1992,
author = {Verity, Dominic},
booktitle = {Repr. Theory Appl. Categ.},
keywords = {1992,address,and phrases,australia,b,biadjoints,bicategorical enrichment,c dominic r,change of base,enriched and internal categories,equipments,faculty of science,macquarie university,north ryde,nsw 2109,permission to copy for,persistent and flexible limits,private use granted,profunctors,verity},
number = {20},
pages = {1--266},
school = {Cambridge University},
title = {Enriched categories, internal categories and change of base},
year = {2011}
}
@article{Mossakowski2006,
abstract = {We introduce CoCasl as a light-weight but expressive coalgebraic extension of the algebraic specification language Casl. CoCasl allows the nested combination of algebraic datatypes and coalgebraic process types. Moreover, it provides syntactic sugar for an observer-indexed modal logic that allows e.g. expressing fairness properties. This logic includes a generic definition of modal operators for observers with structured equational result types. We prove existence of final models for specifications in a format that allows the use of equationally specified initial datatypes as observations, as well as modal axioms. The use of CoCasl is illustrated by specifications of the process algebras CSP and CCS.},
author = {Mossakowski, Till and Schr??der, Lutz and Roggenbach, Markus and Reichel, Horst},
doi = {10.1016/j.jlap.2005.09.006},
issn = {15678326},
journal = {J. Log. Algebr. Program.},
keywords = {Algebraic specification,CCS,CSP,Casl,Coalgebra,Process algebra},
number = {1-2},
pages = {146--197},
title = {Algebraic-coalgebraic specification in CoCasl},
volume = {67},
year = {2006}
}
@inproceedings{Blum2005,
abstract = {We consider a statistical database in which a trusted administrator introduces noise to the query responses with the goal of maintaining privacy of individual database entries. In such a database, a query consists of a pair (S, f) where S is a set of rows in the database and f is a function mapping database rows to {0, 1}. The true answer is $\Sigma$i$\epsilon$S f(di), and a noisy version is released as the response to the query. Results of Dinur, Dwork, and Nissim show that a strong form of privacy can be maintained using a surprisingly small amount of noise -- much less than the sampling error -- provided the total number of queries is sublinear in the number of database rows. We call this query and (slightly) noisy reply the SuLQ (Sub-Linear Queries) primitive. The assumption of sublinearity becomes reasonable as databases grow increasingly large.We extend this work in two ways. First, we modify the privacy analysis to real-valued functions f and arbitrary row types, as a consequence greatly improving the bounds on noise required for privacy. Second, we examine the computational power of the SuLQ primitive. We show that it is very powerful indeed, in that slightly noisy versions of the following computations can be carried out with very few invocations of the primitive: principal component analysis, k means clustering, the Perceptron Algorithm, the ID3 algorithm, and (apparently!) all algorithms that operate in the in the statistical query learning model [11].},
address = {New York, New York, USA},
author = {Blum, Avrim and Dwork, Cynthia and McSherry, Frank and Nissim, Kobbi},
booktitle = {Proc. twenty-fourth ACM SIGMOD-SIGACT-SIGART Symp. Princ. database Syst. - Pod. '05},
doi = {10.1145/1065167.1065184},
isbn = {1595930620},
pages = {128},
publisher = {ACM Press},
title = {Practical privacy},
volume = {2},
year = {2005}
}
@incollection{Turi1997,
author = {Turi, Daniele},
booktitle = {7th Int. Conf. CTCS '97},
doi = {10.1007/BFb0026985},
editor = {Moggi, Eugenio and Rosolini, Giuseppe},
isbn = {978-3-540-63455-3},
pages = {127--146},
publisher = {Springer Berlin Heidelberg},
series = {Lecture Notes in Computer Science},
title = {Categorical Modelling of Structural Operational Rules},
year = {1997}
}
@article{Esik1995a,
abstract = {The equational properties of the iteration operation in Lawvere theories are captured by the notion of iteration theories axiomatized by the Conway identities together with a complicated equation scheme, the "commutative identity". The first result of the paper shows that the commutative identity is implied by the Conway identities and the Scott induction principle formulated to involve only equations. Since the Scott induction principle holds in free iteration theories, we obtain a relatively simple first order axiomatization of the equational properties of iteration theories. We show, by means of an example that a simplified version of the Scott induction principle does not suffice for this purpose: There exists a Conway theory satisfying the scalar Scott induction principle which is not an iteration theory. A second example shows that there exists an iteration theory satisfying the scalar version of the Scott induction principle in which the general form fails. Finally, an example is included to verify the expected fact that there exists an iteration theory violating the scalar Scott induction principle. Interestingly, two of these examples are ordered theories in which the iteration operation is defined via least pre-fixed points. ?? 2000.},
author = {{\'{E}}sik, Zolt{\'{a}}n and Bern{\'{a}}tsky, L.},
doi = {10.1016/S1571-0661(04)80009-4},
issn = {15710661},
journal = {Electron. Notes Theor. Comput. Sci.},
number = {C},
pages = {154--181},
publisher = {Elsevier B.V.},
series = {ENTCS},
title = {Scott Induction and Equational Proofs},
volume = {1},
year = {1995}
}
@article{Nguyen1978,
author = {Nguyen, Hung T.},
doi = {10.1016/B978-0-444-88650-7.50019-6},
issn = {0022247X},
journal = {J. Math. Anal. Appl.},
month = oct,
number = {3},
pages = {531--542},
title = {On random sets and belief functions},
volume = {65},
year = {1978}
}
@incollection{Sokolova2004,
abstract = {We survey various notions of probabilistic automata and probabilistic\nbisimulation, accumulating in an expressiveness hierarchy of probabilistic\nsystem types. The aim of this paper is twofold: On the one hand it\nprovides an overview of existing types of probabilistic systems and,\non the other hand, it explains the relationship between these models.\nWe overview probabilistic systems with discrete probabilities only.\nThe expressiveness order used to built the hierarchy is defined via\nthe existence of mappings between the corresponding system types\nthat preserve and reflect bisimilarity. Additionally, we discuss\nparallel composition for the presented types of systems, augmenting\nthe map of probabilistic automata with closedness under this compositional\noperator. Keywords: probabilistic automata (transition systems),\nprobabilistic bisimulation, preservation and reflection of bisimulation,\nnon-determinism, parallel composition.},
author = {Sokolova, Ana and de Vink, Erik P},
booktitle = {Valid. Stoch. Syst.},
doi = {10.1007/978-3-540-24611-4_1},
isbn = {3-540-22265-0},
issn = {03029743},
keywords = {bisimulation,non-determinism,parallel,preservation and reflection of,probabilistic automata,probabilistic bisim-,transition systems,ulation},
pages = {1--43},
title = {Probabilistic Automata: System Types, Parallel Composition and Comparison},
volume = {2925},
year = {2004}
}
@article{Reutenauer1980,
author = {Reutenauer, Christophe},
doi = {10.1016/0021-8693(80)90097-6},
issn = {00218693},
journal = {J. Algebr.},
number = {2},
pages = {448--483},
title = {S{\'{e}}ries formelles et alg{\`{e}}bres syntactiques},
volume = {66},
year = {1980}
}
@techreport{Robinson1986a,
author = {Robinson, Edmund P.},
institution = {University of Cambridge},
issn = {1476-2986},
month = oct,
publisher = {Computer Laboratory, University of Cambridge},
title = {Power-domains, modalities and the Vietoris monad},
type = {Book},
volume = {98},
year = {1986}
}
@article{Ghani2009,
author = {Ghani, Neil and Hancock, Peter and Pattinson, Dirk},
doi = {10.1016/j.entcs.2009.07.081},
issn = {15710661},
journal = {Electron. Notes Theor. Comput. Sci.},
keywords = {containers,continuous functions,final coalgebras},
month = aug,
pages = {3--18},
publisher = {Elsevier B.V.},
title = {Continuous Functions on Final Coalgebras},
volume = {249},
year = {2009}
}
@article{Adamek2002a,
author = {Ad{\'{a}}mek, Jiř{\'{i}} and Borceux, Francis and Lack, Stephen and Rosick{\'{y}}, Jiř{\'{i}}},
doi = {10.1016/S0022-4049(02)00126-3},
issn = {00224049},
journal = {J. Pure Appl. Algebr.},
month = nov,
number = {1-3},
pages = {7--30},
title = {A classification of accessible categories},
volume = {175},
year = {2002}
}
@article{Kock1972,
author = {Kock, Anders},
doi = {10.1007/BF01304852},
issn = {0003-889X},
journal = {Arch. der Math.},
month = dec,
number = {1},
pages = {113--120},
title = {Strong functors and monoidal monads},
volume = {23},
year = {1972}
}
@article{Chorny2012,
author = {Chorny, B. and Rosick{\'{y}}, Jiř{\'{i}}},
doi = {10.1016/j.jpaa.2012.01.015},
issn = {00224049},
journal = {J. Pure Appl. Algebr.},
month = oct,
number = {10},
pages = {2113--2125},
publisher = {Elsevier B.V.},
title = {Class-locally presentable and class-accessible categories},
volume = {216},
year = {2012}
}
@book{Wehrung2015,
address = {Cham},
author = {Wehrung, Friedrich},
doi = {10.1007/978-3-319-61599-8},
isbn = {978-3-319-61598-1},
keywords = {V-congruence,V-homomorphism,group-induced,semig},
publisher = {Springer International Publishing},
series = {Lecture Notes in Mathematics},
title = {Refinement Monoids, Equidecomposability Types, and Boolean Inverse Semigroups},
volume = {2188},
year = {2017}
}
@article{Bohm1985,
abstract = {The notion of iteratively defined functions from and to heterogeneous term algebras is introduced as the solution of a finite set of equations of a special shape. Such a notion has remarkable consequences: (1) Choosing the second-order typed lamdda-calculus ($\Lambda$ for short) as a programming language enables one to represent algebra elements and iterative functions by automatic uniform synthesis paradigms, using neither conditional nor recursive constructs. (2) A completeness theorem for $\Lambda$-terms with type of degree at most two and a companion corollary for $\Lambda$-programs have been proved. (3) A new congruence relation for the last-mentioned $\Lambda$-terms which is stronger than $\Lambda$-convertibility is introduced and proved to have the meaning of a $\Lambda$-program equivalence. Moreover, an extension of the paradigms to the synthesis of functions of higher complexity is considered and exemplified. All the concepts are explained and motivated by examples over integers, list- and tree-structures. {\textcopyright} 1985.},
author = {B{\"{o}}hm, Corrado and Berarducci, Alessandro},
doi = {10.1016/0304-3975(85)90135-5},
issn = {03043975},
journal = {Theor. Comput. Sci.},
number = {C},
pages = {135--154},
title = {Automatic synthesis of typed $\Lambda$-programs on term algebras},
volume = {39},
year = {1985}
}
@article{Kohlas2014,
abstract = {This review examines some particular, but important and basic aspects of information: Information is related to questions and should provide at least partial answers. Information comes in pieces, and it should be possible to aggregate these pieces. Finally, it should be possible to extract that part of a piece of information which relates to a given question. Modeling these concepts leads to an algebraic theory of information. This theory centers around two different but closely related types of information algebras, each containing operations for aggregation or combination of information and for extracting information relevant to a given question. Generic constructions of instances of such algebras are presented. In particular, the close connection of information algebras to logic and domain theory will be exhibited.},
author = {Kohlas, J{\"{u}}rg and Schmid, J{\"{u}}rg},
doi = {10.3390/info5020219},
issn = {2078-2489},
journal = {Information},
keywords = {Domain theory,Information,Information theory,Order theory,Universal logic},
month = apr,
number = {2},
pages = {219--254},
title = {An Algebraic Theory of Information: An Introduction and Survey},
volume = {5},
year = {2014}
}
@inproceedings{Baldan2015,
address = {Dagstuhl, Germany},
author = {Baldan, Paolo and Bonchi, Filippo and Kerstan, Henning and K{\"{o}}nig, Barbara},
booktitle = {6th Conf. Algebr. Coalgebra Comput. Sci. (CALCO 2015)},
doi = {http://dx.doi.org/10.4230/LIPIcs.CALCO.2015.35},
editor = {Moss, Lawrence S and Sobocinski, Pawel},
isbn = {978-3-939897-84-2},
issn = {1868-8969},
pages = {35--49},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
title = {Towards Trace Metrics via Functor Lifting},
volume = {35},
year = {2015}
}
@article{Abramsky2011a,
abstract = {We use the mathematical language of sheaf theory to give a unified treatment of non-locality and contextuality, in a setting which generalizes the familiar probability tables used in non-locality theory to arbitrary measurement covers; this includes Kochen-Specker configurations and more. We show that contextuality, and non-locality as a special case, correspond exactly to obstructions to the existence of global sections. We describe a linear algebraic approach to computing these obstructions, which allows a systematic treatment of arguments for non-locality and contextuality. We distinguish a proper hierarchy of strengths of no-go theorems, and show that three leading examples --- due to Bell, Hardy, and Greenberger, Horne and Zeilinger, respectively --- occupy successively higher levels of this hierarchy. A general correspondence is shown between the existence of local hidden-variable realizations using negative probabilities, and no-signalling; this is based on a result showing that the linear subspaces generated by the non-contextual and no-signalling models, over an arbitrary measurement cover, coincide. Maximal non-locality is generalized to maximal contextuality, and characterized in purely qualitative terms, as the non-existence of global sections in the support. A general setting is developed for Kochen-Specker type results, as generic, model-independent proofs of maximal contextuality, and a new combinatorial condition is given, which generalizes the `parity proofs' commonly found in the literature. We also show how our abstract setting can be represented in quantum mechanics. This leads to a strengthening of the usual no-signalling theorem, which shows that quantum mechanics obeys no-signalling for arbitrary families of commuting observables, not just those represented on different factors of a tensor product.},
archivePrefix = {arXiv},
arxivId = {1102.0264},
author = {Abramsky, Samson and Brandenburger, Adam},
doi = {10.1088/1367-2630/13/11/113036},
eprint = {1102.0264},
issn = {13672630},
journal = {New J. Phys.},
title = {The sheaf-theoretic structure of non-locality and contextuality},
volume = {13},
year = {2011}
}
@article{Hernandez2014,
archivePrefix = {arXiv},
arxivId = {1407.6969},
author = {Hern{\'{a}}ndez, Juan L. L{\'{o}}pez and Cuevas, Luis J. Turcio and V{\'{a}}zquez-M{\'{a}}rquez, Adri{\'{a}}n},
eprint = {1407.6969},
journal = {ArXiv e-prints},
month = jul,
pages = {1--33},
title = {Review on the Kleisli and Eilenberg-Moore 2-adjunctions},
year = {2014}
}
@phdthesis{Viglizzo2005,
author = {Viglizzo, Ignacio Dario},
keywords = {Mathematics,coalgebra,final coalgebra,measurable spaces,probabilities,type space},
number = {August},
publisher = {faculty of the Graduate School in partial fulfillment of the requirements for the degree Doctor of Philosophy in the Department of Mathematics, Indiana University},
school = {Indiana University},
title = {Coalgebras on Measurable Spaces},
year = {2005}
}
@book{Ponse1996,
abstract = {Labelled transition systems are mathematical models for dynamic behaviour, or processes, and thus form a research field of common interest to logicians and theoretical computer scientists. In computer science, this notion is a fundamental one in the formal analysis of programming languages, in particular in process theory. In modal logic, transition systems are the central object of study under the name of Kripke models. This volume collects a number of research papers on modal logic and process theory. Its unifying theme is the notion of a bisimulation. Bisimulations are relations over transition systems, and provide a key tool in identifying the processes represented by these structures. The volume offers an up-to-date overview of perspectives on labelled transition systems and bisimulations.},
editor = {Ponse, Alban and de Rijke, Maarten and Venema, Yde},
isbn = {188152695X},
pages = {352},
publisher = {CSLI Publications Stanford},
title = {Modal Logic and Process Algebra: A Bisimulation Perspective},
year = {1996}
}
@article{Weber2007,
author = {Weber, Mark},
doi = {10.1007/s10485-007-9079-2},
isbn = {1048500790792},
issn = {09272852},
journal = {Appl. Categ. Struct.},
keywords = {2-topos,Fibration,Internal category theory,Yoneda structure},
number = {May},
pages = {259--323},
title = {Yoneda structures from 2-toposes},
volume = {15},
year = {2007}
}
@article{Mariano2004,
abstract = {We establish the following model-theoretic characterization: profinite $L$-structures, the cofiltered limits of finite $L$-structures,are retracts of ultraproducts of finite $L$-structures. As a consequence, any elementary class of $L$-structures axiomatized by $L$-sentences of the form $\forall \vec{x} (\psi_{0}(\vec{x}) \ra \psi_{1}(\vec{x}))$, where $\psi_{0}(\vec{x}),\psi_{1}(\vec{x})$ are existencial-positives $L$-formulas, is closed under the formation of profinite objects in the category {\bf L-mod}, the category of structures suitable for the language $L$ and $L$-homomorphisms.},
archivePrefix = {arXiv},
arxivId = {math/0401095},
author = {Mariano, Hugo Luiz},
eprint = {0401095},
journal = {ArXiv e-prints},
pages = {1--13},
primaryClass = {math},
title = {Profinite Structures are Retracts of Ultraproducts of Finite Structures},
year = {2004}
}
@article{Esik2014,
abstract = {Recently, a novel fixed point operation has been introduced over certain non-monotonic functions between stratified complete lattices and used to give semantics to logic programs with negation and boolean context-free grammars. We prove that this new operation satisfies `the standard' identities of fixed point operations as described by the axioms of iteration theories. We also study this new fixed point operation in connection with lambda-abstraction.},
archivePrefix = {arXiv},
arxivId = {1410.8111},
author = {{\'{E}}sik, Zolt{\'{a}}n},
eprint = {1410.8111},
journal = {ArXiv e-prints},
month = oct,
pages = {1--22},
title = {Equational properties of stratified least fixed points},
year = {2014}
}
@article{Zawadowski2012,
abstract = {We give a 3-categorical, purely formal argument explaining why on the category of Kleisli algebras for a lax monoidal monad, and dually on the category of Eilenberg-Moore algebras for an oplax monoidal monad, we always have a natural monoidal structures. The key observation is that the 2-category of lax monoidal monads in any 2-category D with finite products is isomorphic to the 2-category of monoidal objects with oplax morphisms in the 2-category of monads with lax morphisms in D. We explain at the end of the paper that a similar phenomenon occurs in many other situations. ?? 2012 Elsevier B.V..},
archivePrefix = {arXiv},
arxivId = {1012.0547},
author = {Zawadowski, Marek},
doi = {10.1016/j.jpaa.2012.02.030},
eprint = {1012.0547},
issn = {00224049},
journal = {J. Pure Appl. Algebr.},
month = aug,
number = {8-9},
pages = {1932--1942},
publisher = {Elsevier B.V.},
title = {The formal theory of monoidal monads},
volume = {216},
year = {2012}
}
@article{Bezhanishvili2001,
author = {Bezhanishvili, Guram},
doi = {10.1007/PL00000358},
issn = {0002-5240},
journal = {Algebr. Universalis},
month = nov,
number = {4},
pages = {531--548},
title = {Locally finite varieties},
volume = {46},
year = {2001}
}
@incollection{Giry1982a,
author = {Giry, Mich{\`{e}}le},
booktitle = {Categ. Asp. Topol. Anal.},
doi = {10.1007/BFb0092872},
editor = {Banaschewski, Bernhard},
pages = {68--85},
publisher = {Springer Berlin Heidelberg},
series = {Lecture Notes in Mathematics},
title = {A categorical approach to probability theory},
year = {1982}
}
@article{Odintsov2012,
author = {Odintsov, Sergei P. and Latkin, E. I.},
doi = {10.1007/s11225-012-9380-4},
isbn = {1122501293},
issn = {0039-3215},
journal = {Stud. Log.},
keywords = {belnapian modal logic,bk-lattice,lattice of subvarieties,twist-structure},
month = feb,
number = {1-2},
pages = {319--338},
title = {BK-lattices. Algebraic Semantics for Belnapian Modal Logics},
volume = {100},
year = {2012}
}
@inproceedings{Wang2009,
address = {New York, New York, USA},
author = {Wang, Rui and Li, Yong Fuga and Wang, Xiaofeng and Tang, Haixu and Zhou, Xiaoyong},
booktitle = {Proc. 16th ACM Conf. Comput. Commun. Secur. - CCS '09},
doi = {10.1145/1653662.1653726},
isbn = {9781605588940},
keywords = {genome wide association study,integer programming,markov model,single nucleotide polymorphism,test statistics},
pages = {534},
publisher = {ACM Press},
title = {Learning your identity and disease from research papers},
year = {2009}
}
@article{Gumm2005,
abstract = {We relate weak limit preservation properties of coalgebraic type functors F to structure theoretic properties of the class of all F -coalgebras. In particular, we give coalgebraic characterizations for the condition that F weakly preserves pullbacks, kernel pairs or preimages. We also describe regular monos and epis. In case that | F (1)| ≠ 1 we show that F preserves preimages iff for every class of F -coalgebras. The case | F (1)| = 1 is left as an open problem.},
author = {Gumm, H. Peter and Schr{\"{o}}der, Tobias},
doi = {10.1007/s00012-005-1888-2},
issn = {0002-5240},
journal = {Algebr. universalis},
keywords = {Mathematics and Statistics},
month = aug,
number = {2-3},
pages = {229--252},
publisher = {Birkh{\"{a}}user Basel},
title = {Types and coalgebraic structure},
volume = {53},
year = {2005}
}
@phdthesis{VanGool2014,
author = {van Gool, Samuel Jacob},
isbn = {9781291759853},
number = {april},
school = {Radboud Universiteit Nijmegen},
title = {On Sheaves and Duality},
year = {2014}
}
@article{Kurz2011,
abstract = {of “algebras” that arise from a schizophrenic object $\Omega$, which is both an “algebra” and a “space”. We call such adjunctions logical connections. We prove that the exact nature of $\Omega$ is that of a module that allows to lift optimally the structure of a “space” and an “algebra” to certain diagrams. Our approach allows to give a unified framework known from logical connections over the category of sets and analyzed, e.g., by Hans Porst and Walter Tholen, with future applications of logical connections in coalgebraic logic and elsewhere, where typically, both the category of “spaces” and the category of “algebras” consist of “structured presheaves”.},
author = {Kurz, Alexander and Velebil, Jiř{\'{i}}},
doi = {10.1007/s10485-011-9267-y},
issn = {0927-2852},
journal = {Appl. Categ. Struct.},
keywords = {logical connection,module,schizophrenic object},
month = sep,
pages = {1--29},
publisher = {Springer Netherlands},
title = {Enriched logical connections},
year = {2011}
}
@article{Jung2012,
author = {Jung, Achim and Rivieccio, Umberto},
doi = {10.1007/s11225-012-9376-0},
issn = {0039-3215},
journal = {Stud. Log.},
keywords = {bilattices,bilattices with,bilattices with conflation,brouwerian bilattices,implication,priestley duality theory},
month = feb,
number = {1-2},
pages = {223--252},
title = {Priestley Duality for Bilattices},
volume = {100},
year = {2012}
}
@article{Lee2007,
author = {Lee, Daniel K. and Crary, Karl and Harper, Robert},
doi = {10.1145/1190215.1190245},
isbn = {1595935754},
issn = {03621340},
journal = {ACM SIGPLAN Not.},
keywords = {anized metatheory,language definitions,logical frameworks,mech-,standard ml,twelf,type safety},
month = jan,
number = {1},
pages = {173},
title = {Towards a mechanized metatheory of standard ML},
volume = {42},
year = {2007}
}
@article{Nelson1983,
author = {Nelson, Evelyn},
doi = {10.1016/0304-3975(83)90014-2},
issn = {03043975},
journal = {Theor. Comput. Sci.},
number = {1},
pages = {67--94},
title = {Iterative algebras},
volume = {25},
year = {1983}
}
@article{Moss1999a,
author = {Moss, Lawrence S.},
doi = {10.1016/S0168-0072(99)00027-5},
issn = {01680072},
journal = {Ann. Pure Appl. Log.},
keywords = {characterization,greatest fixed point,infinitary modal logic},
month = aug,
number = {1-3},
pages = {241--259},
title = {Erratum to “coalgebraic logic”},
volume = {99},
year = {1999}
}
@article{Soria-Comas2014,
abstract = {It is not uncommon in the data anonymization literature to oppose the "old" k-anonymity model to the "new" differential privacy model, which offers more robust privacy guarantees. Yet, it is often disregarded that the utility of the anonymized results provided by differential privacy is quite limited, due to the amount of noise that needs to be added to the output, or because utility can only be guaranteed for a restricted type of queries. This is in contrast with k-anonymity mechanisms, which make no assumptions on the uses of anonymized data while focusing on preserving data utility from a general perspective. In this paper, we show that a synergy between differential privacy and {Mathematical expression}-anonymity can be found: {Mathematical expression}-anonymity can help improving the utility of differentially private responses to arbitrary queries. We devote special attention to the utility improvement of differentially private published data sets. Specifically, we show that the amount of noise required to fulfill {Mathematical expression}-differential privacy can be reduced if noise is added to a {Mathematical expression}-anonymous version of the data set, where {Mathematical expression}-anonymity is reached through a specially designed microaggregation of all attributes. As a result of noise reduction, the general analytical utility of the anonymized output is increased. The theoretical benefits of our proposal are illustrated in a practical setting with an empirical evaluation on three data sets.},
author = {Soria-Comas, Jordi and Domingo-Ferrer, Josep and S{\'{a}}nchez, David and Mart{\'{i}}nez, Sergio},
doi = {10.1007/s00778-014-0351-4},
isbn = {0077801403514},
issn = {1066-8888},
journal = {VLDB J.},
keywords = {Data utility,Differential privacy,Microaggregation,Privacy-preserving data publishing,k-Anonymity},
month = oct,
number = {5},
pages = {771--794},
title = {Enhancing data utility in differential privacy via microaggregation-based $k$-anonymity},
volume = {23},
year = {2014}
}
@article{Michael1951,
author = {Michael, Ernest},
journal = {Trans. Am. Math. Soc.},
number = {1},
pages = {152--182},
publisher = {American Mathematical Society},
title = {Topologies on spaces of subsets},
type = {Journal article},
volume = {71},
year = {1951}
}
@incollection{Clarkson2014,
abstract = {Two new logics for verification of hyperproperties are proposed. Hyperproperties characterize security policies, such as noninterference, as a property of sets of computation paths. Standard temporal logics such as LTL, CTL, and CTL* can refer only to a single path at a time, hence cannot express many hyperproperties of interest. The logics proposed here, HyperLTL and HyperCTL*, add explicit and simultaneous quantification over multiple paths to LTL and to CTL*. This kind of quantification enables expression of hyperproperties. A model checking algorithm for the proposed logics is given. For a fragment of HyperLTL, a prototype model checker has been implemented.},
archivePrefix = {arXiv},
arxivId = {1401.4492},
author = {Clarkson, Michael R. and Finkbeiner, Bernd and Koleini, Masoud and Micinski, Kristopher K. and Rabe, Markus N. and S{\'{a}}nchez, C{\'{e}}sar},
booktitle = {Proc. 3rd Int. Conf. Princ. Secur. Trust},
doi = {10.1007/978-3-642-54792-8_15},
editor = {Abadi, Mart{\'{i}}n and Kremer, Steve},
eprint = {1401.4492},
isbn = {9783642547911},
issn = {16113349},
pages = {265--284},
publisher = {Springer Berlin Heidelberg},
series = {Lecture Notes in Computer Science},
title = {Temporal logics for hyperproperties},
volume = {8414},
year = {2014}
}
@article{Kohlas2017,
abstract = {The basic idea behind information algebras is that information comes in pieces, each referring to a certain question, that these pieces can be combined or aggregated and that the part relating to a given question can be extracted. This algebraic structure can be given different forms. Questions were originally represented by subsets of variables. Pieces of information were then represented by valuations associated with the domains of variables. This leads to an algebraic structure called valuation algebras. The basic axiomatics of this algebraic structure was in essence proposed by Shenoy and Shafer. Here a much more general view of systems of questions is proposed and pieces of information are related to the elements of this system of questions. This leads to a new and extended system of axioms for information algebras. Classical valuation algebras are essentially a special case of this new system. A full discussion of the algebraic theory of this new information algebras is given, including local computation, duality between labeled and domain-free versions of the algebras, order of information, finiteness of information and approximation, compact and continuous information algebras. Finally a rather complete discussion of uncertain information, based on random maps into information algebras is presented. This is shown to represent a generalisation of classical Dempster-Shafer theory.},
archivePrefix = {arXiv},
arxivId = {1701.02658},
author = {Kohlas, Juerg},
eprint = {1701.02658},
journal = {ArXiv Prepr.},
month = jan,
title = {Algebras of Information: {A} New and Extended Axiomatic Foundation},
year = {2017}
}
@article{Hansen2004,
author = {Hansen, Helle Hvid and Kupke, Clemens},
doi = {10.1016/j.entcs.2004.02.028},
issn = {15710661},
journal = {Electron. Notes Theor. Comput. Sci.},
keywords = {bisimulation,coalgebra,frame,modal logic},
month = dec,
pages = {121--143},
title = {A coalgebraic perspective on monotone modal logic},
volume = {106},
year = {2004}
}
@article{Day1979,
author = {Day, Brian J.},
doi = {10.1017/S0004972700009096},
issn = {0004-9727},
journal = {Bull. Aust. Math. Soc.},
number = {01},
pages = {71},
title = {On profiniteness of compact totally disconnected algebras},
volume = {20},
year = {1979}
}
@article{Kohlas2007,
abstract = {Random sets can be considered as random variables with values in a Boolean algebra, in particular in a field of sets. Many properties of random sets, in particular those relative to belief functions, can also be obtained by relaxing the algebraic structure of the domain. In fact, functions monotone to order ∞, like Choquet capacities, can be defined on semilattices. In this paper random variables with values in some kind of graded semilattices are studied. It is shown that this algebraic structure models important operations regarding information. It turns out that random variables in this algebra form themselves an algebra of the same kind. Their probability distribution corresponds to functions monotone of order ∞ or to belief functions in the sense of Dempster-Shafer theory of evidence. This paper proposes therefore a natural generalization of evidence theory to a general structure related to probabilistic argumentation systems. Those systems have many interesting models like probabilistic assumption-based reasoning with different kind of logics, systems of linear equations and inequalities with stochastic disturbances, etc. The theory presented leads thus to an interesting and novel way of combining logic and probability. {\textcopyright} 2007 Elsevier Inc. All rights reserved.},
author = {Kohlas, J{\"{u}}rg},
doi = {10.1016/j.ijar.2006.12.005},
issn = {0888613X},
journal = {Int. J. Approx. Reason.},
month = sep,
number = {1},
pages = {17--34},
title = {Uncertain information: Random variables in graded semilattices},
volume = {46},
year = {2007}
}
@article{Johnstone2001a,
author = {Johnstone, Peter T. and Power, A. John and Tsujishita, Toru and Watanabe, Hiroshi and Worrell, James},
doi = {doi:%20DOI:%2010.1016/S0304-3975(00)00124-9},
issn = {0304-3975},
journal = {Theor. Comput. Sci.},
keywords = {Classifier,Coalgebra,Cofree comonad,Subobject,Topos,Weak pullback,classifier,coalgebra,cofree,comonad,pullback,subobject,topos,weak},
mendeley-tags = {classifier,coalgebra,cofree,comonad,pullback,subobject,topos,weak},
month = jun,
number = {1-2},
pages = {87--117},
title = {On the structure of categories of coalgebras},
type = {Journal article},
volume = {260},
year = {2001}
}
@article{Pavlovic2013,
abstract = {Abstract\nWe present a new model of computation, described in terms of monoidal categories. It conforms to the Church–Turing Thesis, and captures the same computable functions as the standard models. It provides a succinct categorical interface to most of them, free of their diverse implementation details, using the ideas and structures that in the meantime emerged from research in semantics of computation and programming. The salient feature of the language of monoidal categories is that it is supported by a sound and complete graphical formalism, string diagrams, which provide a concrete and intuitive interface for abstract reasoning about computation. The original motivation and the ultimate goal of this effort is to provide a convenient high level programming language for a theory of computational resources, such as one-way functions, and trapdoor functions, by adopting the methods for hiding the low level implementation details that emerged from practice.},
archivePrefix = {arXiv},
arxivId = {1208.5205},
author = {Pavlovi{\'{c}}, Dusko},
doi = {10.1016/j.ic.2013.03.007},
eprint = {1208.5205},
issn = {0890-5401},
journal = {Inf. Comput.},
pages = {94--116},
publisher = {Elsevier Inc.},
title = {Monoidal computer I: Basic computability by string diagrams},
volume = {226},
year = {2013}
}
@article{Ghani2015,
abstract = {There is a huge number of problems, from various areas, being solved by reducing them to SAT. However, for most applications, translations into SAT are performed by specialized, problem-specific tools. In this paper we describe a novel approach for uniform solving of a wide class of problems by reducing them to SAT. The approach uses a new specification language that combines imperative and declarative programming paradigms. A problem is specified by a test (expressed in an imperative form) that a given set of values indeed makes a solution to the problem. In the solving phase, parameters of the problem are represented by (finite) vectors of propositional formulae and the specification is symbolically executed. An assertion that given values make a solution is transformed to an instance of the SAT problem and passed to a SAT solver. If the formula is satisfiable, its model is transformed back to variables describing the problem, i.e., to a solution of the problem. We also describe a system URSA that implements the described approach. The experiments show that the system is competitive to state-of-the related modelling systems.},
archivePrefix = {arXiv},
arxivId = {1502.05561},
author = {Ghani, Neil and Malatesta, Lorenzo and Forsberg, Fredrik Nordvall},
eprint = {1502.05561},
journal = {ArXiv e-prints},
pages = {50},
title = {Positive inductive-recursive definitions},
year = {2015}
}
@phdthesis{Lawler2014,
archivePrefix = {arXiv},
arxivId = {1502.08017},
author = {Lawler, Finn},
eprint = {1502.08017},
number = {September},
school = {Trinity College, Dublin},
title = {Fibrations of Predicates and Bicategories of Relations},
type = {PhD Thesis},
year = {2014}
}
@article{Kokkinis2016,
author = {Lurie, Joseph},
doi = {10.3390/philosophies3010002},
issn = {2409-9287},
journal = {Philosophies},
keywords = {epistemic logic,epistemology,evidentialism,fuzzy logic,justification,justification logic,logic,probabilistic},
month = feb,
number = {1},
pages = {2},
title = {Probabilistic Justification Logic},
volume = {3},
year = {2018}
}
@article{Power2003,
abstract = {Turi and Plotkin gave a precise mathematical formulation of a notion of structural operational semantics in their paper “Towards a mathematical operational semantics.” Starting from that definition and at the level of generality of that definition, we give a mathematical formulation of some of the basic constructions one makes with structural operational semantics. In particular, given a single-step operational semantics, as is the spirit of their work, one composes transitions and considers streams of transitions in order to study the dynamics induced by the operational semantics. In all their leading examples, it is obvious that one can do that and it is obvious how to do it. But if their definition is to be taken seriously, one needs to be able to make such constructions at the level of generality of their definition rather than case-by-case. So this paper does so for several of the basic constructions associated with structural operational semantics, in particular those required in order to speak of a stream of transitions and hence of dynamics.},
author = {Power, A. John},
doi = {10.1016/S1571-0661(04)80643-1},
issn = {15710661},
journal = {Electron. Notes Theor. Comput. Sci.},
month = jul,
number = {1},
pages = {257--272},
title = {Towards a theory of mathematical operational semantics},
volume = {82},
year = {2003}
}
@inbook{Islam1994,
abstract = {This paper uses category theory to provide a formal mathematical framework for specifying and integrating relational database schemas; it builds on the work of Buneman et al. [2], who develop a domain-theoretic version of relational database theory. We generalize their setting in the following way: we let a schema be a functor V from a category L of attribute names to the category of domains; this reflects the fact that attributes may take values of different types, and that there may be functional constraints between attributes. As an application, we show how the process of schema integration and the resolution of conflicts between schemas may be carried out in a mathematically rigorous setting, using simple concepts from category theory; this proposal is shown to be consistent with the way in which queries on a federated database are processed (by `distributing' them among its component databases).},
address = {Berlin, Heidelberg},
author = {Islam, Amitavo and Phoa, Wesley},
booktitle = {Theor. Asp. Comput. Softw. Int. Symp. TACS '94 Sendai, Japan, April 19--22, 1994 Proc.},
doi = {10.1007/3-540-57887-0_118},
editor = {Hagiya, Masami and Mitchell, John C},
isbn = {978-3-540-48383-0},
pages = {618--641},
publisher = {Springer Berlin Heidelberg},
title = {Categorical models of relational databases I: Fibrational formulation, schema integration},
year = {1994}
}
@article{Bonchi2012a,
author = {Bonchi, Filippo and Bonsangue, Marcello M. and Boreale, Michele and Rutten, Jan J.M.M. and Silva, Alexandra},
doi = {10.1016/j.ic.2011.12.002},
issn = {08905401},
journal = {Inf. Comput.},
month = feb,
pages = {77--105},
publisher = {Elsevier Inc.},
title = {A coalgebraic perspective on linear weighted automata},
volume = {211},
year = {2012}
}
@article{Adamek2002,
abstract = {Weak factorization systems, important in homotopy theory, are related to injective objects in comma-categories. Our main result is that full functors and topological functors form a weak factorization system in the category of small categories, and that this is not cofibrantly generated. We also present a weak factorization system on the category of posets which is not cofibrantly generated. No such weak factorization systems were known until recently. This answers an open problem posed by M. Hovey.},
author = {Ad{\'{a}}mek, Jiř{\'{i}} and Herrlich, Horst and Rosick{\'{y}}, Jiř{\'{i}} and Tholen, Walter},
doi = {10.1023/A:1015270120061},
issn = {0927-2852},
journal = {Appl. Categ. Struct.},
keywords = {Mathematics and Statistics},
month = jun,
number = {3},
pages = {237--249},
publisher = {Springer Netherlands},
title = {Weak Factorization Systems and Topological Functors},
volume = {10},
year = {2002}
}
@article{Cirstea2010,
author = {C{\^{i}}rstea, Corina},
doi = {10.1016/j.entcs.2010.07.015},
issn = {15710661},
journal = {Electron. Notes Theor. Comput. Sci.},
keywords = {coalgebra,nondeterminism,probability,temporal logic,trace semantics},
number = {2},
pages = {83--103},
publisher = {Elsevier B.V.},
title = {Generic infinite traces and path-based coalgebraic temporal logics},
volume = {264},
year = {2010}
}
@article{Makkai1987,
author = {Makkai, Michael},
doi = {10.1016/0001-8708(87)90020-X},
issn = {00018708},
journal = {Adv. Math. (N. Y).},
month = aug,
number = {2},
pages = {97--170},
title = {Stone duality for first order logic},
volume = {65},
year = {1987}
}
@article{Milius2005,
author = {Milius, Stefan},
doi = {10.1016/j.ic.2004.05.003},
issn = {08905401},
journal = {Inf. Comput.},
keywords = {coalgebra,completely iterative algebra,completely iterative theory,monad},
month = jan,
number = {1},
pages = {1--41},
title = {Completely iterative algebras and completely iterative monads},
volume = {196},
year = {2005}
}
@book{Girard1989a,
author = {Girard, Jean-Yves and Taylor, Paul and Lafont, Yves},
isbn = {0 521 37181 3},
issn = {00224812},
month = jun,
number = {2},
pages = {192},
publisher = {Cambridge University Press},
series = {Cambridge Tracts in Theoretical Computer Science},
title = {Proofs and Types},
volume = {56},
year = {1989}
}
@article{Ghani2003,
author = {Ghani, Neil and Lth, Christoph and {De Marchi}, Federico and Power, A. John},
doi = {10.1017/S0960129502003912},
isbn = {0960129502},
issn = {09601295},
journal = {Math. Struct. Comput. Sci.},
month = apr,
number = {2},
pages = {349--370},
title = {Dualising initial algebras},
volume = {13},
year = {2003}
}
@article{Fiore2004,
archivePrefix = {arXiv},
arxivId = {math/0408298},
author = {Fiore, Thomas M.},
eprint = {0408298},
journal = {ArXiv e-prints},
month = aug,
primaryClass = {math},
title = {Pseudo Limits, Biadjoints, and Pseudo Algebras: Categorical Foundations of Conformal Field Theory},
year = {2004}
}
@book{Borceux1994c,
author = {Borceux, Francis},
isbn = {9780521061247},
pages = {544},
publisher = {Cambridge University Press},
series = {Encyclopedia of Mathematics and its Applications},
title = {Handbook of Categorical Algebra 3: Sheaf Theory},
year = {1994}
}
@article{Carboni1991a,
abstract = {Motivated by the problem of internalizing Enriched Category Theory in a topos, we investigate the notion of a lax monad T on a bicategory B for which we can construct the bicategory BT of 'matrices of T-algebras' and we prove a factorization theorem to this effect. ?? 1991.},
author = {Carboni, Aurelio and Rosebrugh, Robert},
doi = {10.1016/0022-4049(91)90094-I},
issn = {00224049},
journal = {J. Pure Appl. Algebr.},
month = nov,
number = {1},
pages = {13--32},
title = {Lax monads},
volume = {76},
year = {1991}
}
@article{Geun1986,
author = {Geun, Bin Im and Kelly, Gregory Maxwell},
journal = {J. Korean Math. Soc.},
number = {1},
pages = {1--18},
title = {On classes of morpbisms closed under limits},
volume = {23},
year = {1986}
}
@article{Gehrke2014,
author = {Gehrke, Mai and Krebs, Andreas and Pin, Jean-{\'{E}}ric},
doi = {10.1016/j.tcs.2015.08.007},
issn = {03043975},
journal = {Theor. Comput. Sci.},
number = {1},
pages = {1--29},
publisher = {Elsevier B.V.},
title = {Ultrafilters on words for a fragment of logic},
volume = {610},
year = {2014}
}
@inproceedings{Meng2008,
abstract = {If, as a well-known aphorism states, modelling is for reasoning, this paper is an attempt to define and apply a formal semantics to UML sequence diagrams in order to enable rigourous reasoning about them. Actually, model transformation plays a fundamental role in the process of software development, in general, and in model driven engineering in particular. Being a de facto standard in this area, UML is no exception, even if the number and diversity of diagrams expressing UML models makes it difficult to base its semantics on a single framework. This paper builds on previous attempts to base UML semantics in a coalgebraic setting and illustrates the application of the proposed framework to reason about composition and re factoring of sequence diagrams.},
author = {Meng, Sun and Barbosa, Lu{\'{i}}s S.},
booktitle = {2008 Eighth Int. Conf. Qual. Softw.},
doi = {10.1109/QSIC.2008.13},
isbn = {978-0-7695-3312-4},
issn = {15506002},
month = aug,
pages = {17--26},
publisher = {IEEE},
title = {A coalgebraic semantic framework for reasoning about UML sequence diagrams},
year = {2008}
}
@article{Balan2015,
author = {Balan, Adriana and Kurz, Alexander and Velebil, Jiř{\'{i}}},
doi = {10.2168/LMCS-11(3:18)2015},
journal = {Log. Methods Comput. Sci.},
number = {3},
pages = {1--50},
title = {Positive fragments of coalgebraic logics},
volume = {11},
year = {2015}
}
@article{Gabbay2010,
author = {Gabbay, Murdoch J. and Mathijssen, Aad},
doi = {10.1093/logcom/exp049},
issn = {0955-792X},
journal = {J. Log. Comput.},
keywords = {Equational logic,Lambda calculus,Nominal techniques},
month = apr,
number = {2},
pages = {501--531},
title = {A nominal axiomatization of the lambda calculus},
volume = {20},
year = {2010}
}
@incollection{Danielsson2011,
abstract = {A simple grammar scheme for expressions containing mixfix operators is presented. The scheme is parameterised by a precedence relation which is only restricted to be a directed acyclic graph; this makes it possible to build up precedence relations in a modular way. Efficient and simple implementations of parsers for languages with user-defined mixfix operators, based on the grammar scheme, are also discussed. In the future we plan to replace the support for mixfix operators in the language Agda with a grammar scheme and an implementation based on this work.},
author = {Danielsson, Nils Anders and Norell, Ulf},
booktitle = {Implement. Appl. Funct. Lang. IFL 2008},
doi = {10.1007/978-3-642-24452-0_5},
editor = {Scholz, Sven-Bodo and Chitil, Olaf},
isbn = {9783642244513},
issn = {03029743},
pages = {80--99},
publisher = {Springer, Berlin, Heidelberg},
series = {Lecture Notes in Computer Science},
title = {Parsing Mixfix Operators},
volume = {5836},
year = {2011}
}
@incollection{Klima2010,
author = {Kl{\'{i}}ma, Ondřej and Pol{\'{a}}k, Libor},
booktitle = {Proc. 14th Int. Conf. Dev. Lang. Theory},
doi = {10.1007/978-3-642-14455-4_26},
editor = {Gao, Yuan and Lu, Hanlin and Seki, Shinnosuke and Yu, Sheng},
keywords = {idempotent,of languages,polynomial operators on classes},
number = {201},
pages = {279--290},
publisher = {Springer Berlin Heidelberg},
series = {Lecture Note in Computer Science},
title = {On Sch{\"{u}}tzenberger products of semirings},
year = {2010}
}
@techreport{Stanley2003,
abstract = {Americans need to step back from the daily drum of privacy stories and absorb the big picture: the United States is at risk of turning into a full-fledged surveillance society. The fact is, Orwell's vision of "Big Brother" is now, for the first time, technologically possible.},
author = {Stanley, J. and Steinhardt, Barry},
institution = {American Civil Liberties Union},
pages = {53--79},
title = {Bigger Monster, Weaker Chains: The Growth of an American Surveillance Society},
year = {2003}
}
@article{Adamek2006b,
abstract = {Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purposes: some are better suited for extracting data, some for expressing navigational properties, and some make it easy to relate complex properties of trees to the existence of tree automata for those properties. Furthermore, logics differ significantly in their model-checking properties, their automata models, and their behavior on ordered and unordered trees. In this paper we present a survey of logics for unranked trees.},
archivePrefix = {arXiv},
arxivId = {cs/0606062},
author = {Ad{\'{a}}mek, Jiř{\'{i}} and Milius, Stefan and Velebil, Jiř{\'{i}}},
doi = {10.2168/LMCS-2(5:4)2006},
editor = {unknown Anonymous},
eprint = {0606062},
issn = {18605974},
journal = {Log. Methods Comput. Sci.},
keywords = {and phrases,automata,logic,logics,navigation,query evaluation,query languages,schemas,streaming,temporal,unranked trees,xml,xpath},
month = nov,
number = {5},
pages = {1--31},
primaryClass = {cs},
title = {Elgot algebras},
volume = {2},
year = {2006}
}
@incollection{Rutten1998,
author = {Rutten, Jan J.M.M.},
booktitle = {CONCUR'98 Concurr. Theory},
doi = {10.1007/BFb0055624},
editor = {Sangiorgi, Davide and Simone, Robert},
isbn = {978-3-540-64896-3},
pages = {193--217},
publisher = {Springer Berlin / Heidelberg},
series = {Lecture Notes in Computer Science},
title = {Automata and coinduction (an exercise in coalgebra)},
year = {1998}
}
@article{Cox2010,
author = {Cox, Lawrence H},
journal = {J. Priv. Confidentiality},
keywords = {controlled tabular adjustment,exact intervals,magnitude data,p,p-percent rule,q-ambiguity rule,sensitivity measure,statistical disclo-,sure},
number = {2},
pages = {8},
title = {Vulnerability of Complementary Cell Suppression to Intruder Attack},
volume = {1},
year = {2010}
}
@article{Soria-comas2013,
author = {Soria-comas, Jordi and Domingo-ferrer, Josep},
isbn = {9781467358392},
journal = {Privacy, Secur. Trust (PST), 2013 Elev. Annu. Int. Conf.},
pages = {27--35},
title = {Differential Privacy via $t$-Closeness in Data Publishing},
year = {2013}
}
@phdthesis{Turi1996a,
author = {Turi, Daniele},
month = jun,
school = {Free University},
title = {Functional Operational Semantics and its Denotational Dual},
type = {Thesis (PhD)},
year = {1996}
}
@inproceedings{Saito2016,
author = {Saito, Kenji and Yamada, Hiroyuki},
booktitle = {2016 IEEE 36th Int. Conf. Distrib. Comput. Syst. Work.},
doi = {10.1109/ICDCSW.2016.28},
isbn = {978-1-5090-3686-8},
month = jun,
pages = {168--175},
publisher = {IEEE},
title = {What's so Different about blockchain? — blockchain is a probabilistic state machine},
year = {2016}
}
@book{Adamek2010,
author = {Ad{\'{a}}mek, Jiř{\'{i}} and Rosick{\'{y}}, Jiř{\'{i}} and Vitale, Enrico M.},
doi = {10.1017/CBO9780511760754},
isbn = {9780511760754},
publisher = {Cambridge University Press},
title = {Algebraic Theories},
year = {2010}
}
@inproceedings{Wilkinson2012,
author = {Wilkinson, Toby},
booktitle = {Proc. 11th Int. Work. Coalgebraic Methods Comput. Sci.},
title = {Internal Models for Coalgebraic Modal Logics},
year = {2012}
}
@article{Holohan2015,
abstract = {We study differential privacy in the abstract setting of probability on metric spaces. Numerical, categorical and functional data can be handled in a uniform manner in this setting. We demonstrate how mechanisms based on data sanitisation and those that rely on adding noise to query responses fit within this framework. We prove that once the sanitisation is differentially private, then so is the query response for any query. We show how to construct sanitisations for high-dimensional databases using simple 1-dimensional mechanisms. We also provide lower bounds on the expected error for differentially private sanitisations in the general metric space setting. Finally, we consider the question of sufficient sets for differential privacy and show that for relaxed differential privacy, any algebra generating the Borel $\sigma$-algebra is a sufficient set for relaxed differential privacy.},
archivePrefix = {arXiv},
arxivId = {1402.6124},
author = {Holohan, Naoise and Leith, Douglas J. and Mason, Oliver},
doi = {10.1016/j.ins.2015.01.021},
eprint = {1402.6124},
issn = {00200255},
journal = {Inf. Sci. (Ny).},
keywords = {Categorical data,Data sanitisation,Differential privacy,Functional data,Metric space},
month = jun,
pages = {256--268},
publisher = {Elsevier Inc.},
title = {Differential privacy in metric spaces: Numerical, categorical and functional data under the one roof},
volume = {305},
year = {2015}
}
@article{Wang2017,
author = {Wang, Victoria and Tucker, John V},
doi = {10.1093/cybsec/tyx010},
issn = {2057-2085},
journal = {J. Cybersecurity},
keywords = {abstract data types,formal methods,identity,social sorting,surveillance},
month = dec,
number = {December},
pages = {1--14},
title = {Surveillance and identity: conceptual framework and formal models},
volume = {0},
year = {2017}
}
@article{Moss1999b,
abstract = {This paper is concerned with the equational logic of corecursion, that is of definitions involving final coalgebra maps. The framework for our study is iteration theories (cf. e.g. [1,2]), recently reintroduced as models of the FLR0 fragment of the Formal Language of Recursion [5-7]. We present a new class of iteration theories derived from final coalgebras. This allows us to reason with a number of types of fixed-point equations which heretofore seemed to require to metric or order-theoretic ideas. All of the work can be done using finality properties and equational reasoning. Having a semantics, we obtain the following completeness result: the equations involving fixed-point terms which are valid for final coalgebra interpretations are exactly those valid in a number of contexts pertaining to recursion. For example, they coincide with the equations valid for least-fixed point recursion on cpo's. ??1999 Published by Elsevier Science B. V.},
author = {Moss, Lawrence S.},
doi = {10.1016/S1571-0661(04)80086-0},
issn = {15710661},
journal = {Electron. Notes Theor. Comput. Sci.},
pages = {413--432},
title = {Recursion and Corecursion Have the Same Equational Logic},
volume = {20},
year = {1999}
}
@article{Rioul2014,
abstract = {In the information theory community, the following ``historical'' statements are generally well accepted: (1) Hartley did put forth his rule twenty years before Shannon; (2) Shannon's formula as a fundamental tradeoff between transmission rate, bandwidth, and signal-to-noise ratio came out unexpected in 1948; (3) Hartley's rule is inexact while Shannon's formula is characteristic of the additive white Gaussian noise channel; (4) Hartley's rule is an imprecise relation that is not an appropriate formula for the capacity of a communication channel. We show that all these four statements are somewhat wrong. In fact, a careful calculation shows that ``Hartley's rule'' in fact coincides with Shannon's formula. We explain this mathematical coincidence by deriving the necessary and sufficient conditions on an additive noise channel such that its capacity is given by Shannon's formula and construct a sequence of such channels that makes the link between the uniform (Hartley) and Gaussian (Shannon) channels.},
author = {Rioul, Olivier and Magossi, Jos{\'{e}} Carlos},
doi = {10.3390/e16094892},
isbn = {9780735412804},
issn = {10994300},
journal = {Entropy},
keywords = {Additive noise channel,Additive white Gaussian noise (AWGN) channel,Central limit theorem,Channel capacity,Characteristic function,Differential entropy,Hartley's rule,Pulse-amplitude modulation (PAM),Shannon's formula,Signal-to-noise ratio,Uniform B-spline function,Uniform noise channel,Uniform sum distribution},
number = {9},
pages = {4892--4910},
title = {On {S}hannon's formula and {H}artley's rule: Beyond the mathematical coincidence},
volume = {16},
year = {2014}
}
@article{Lamport1977,
abstract = {The inductive assertion method is generalized to permit formal, machine-verifiable proofs of correctness for multiprocess programs. Individual processes are represented by ordinary flowcharts, and no special synchronization mechanisms are assumed, so the method can be applied to a large class of multiprocess programs. A correctness proof can be designed together with the program by a hierarchical process of stepwise refinement, making the method practical for larger programs. The resulting proofs tend to be natural formalizations of the informal proofs that are now used.},
author = {Lamport, Leslie},
doi = {10.1109/TSE.1977.229904},
isbn = {10.1109/TSE.1977.229904},
issn = {0098-5589},
journal = {IEEE Trans. Softw. Eng.},
keywords = {assertions,concufrent programming,correctness,multiprocessing,synchronization},
month = mar,
number = {2},
pages = {125--143},
title = {Proving the correctness of multiprocess programs},
volume = {SE-3},
year = {1977}
}
@article{Milius2018,
author = {Ad{\'{a}}mek, Jiř{\'{i}} and Milius, Stefan and Moss, Lawrence S.},
doi = {10.1016/j.jlamp.2017.11.003},
issn = {23522208},
journal = {J. Log. Algebr. Methods Program.},
keywords = {fixed points of functors},
month = feb,
pages = {41--81},
title = {Fixed points of functors},
volume = {95},
year = {2018}
}
@article{Courcelle1983,
abstract = {Infinite trees naturally arise in the formalization and the study of the semantics of programming languages. This paper investigates some of their combinatorial and algebraic properties that are especially relevant to semantics. This paper is concerned in particular with regular and algebraic infinite trees, not with regular or algebraic sets of infinite trees. For this reason most of the properties stated in this work become trivial when restricted either to finite trees or to infinite words. It presents a synthesis of various aspects of infinite trees, investigated by different authors in different contexts and hopes to be a unifying step towards a theory of infinite trees that could take place near the theory of formal languages and the combinatorics of thefree monoid. {\textcopyright} 1983.},
author = {Courcelle, Bruno},
doi = {10.1016/0304-3975(83)90059-2},
issn = {03043975},
journal = {Theor. Comput. Sci.},
month = mar,
number = {2},
pages = {95--169},
title = {Fundamental properties of infinite trees},
volume = {25},
year = {1983}
}
@article{Karazeris2011a,
abstract = {We give conditions on a finitary endofunctor of a finitely accessible category to admit a final coalgebra. Our conditions always apply to the case of a finitary endofunctor of a locally finitely presentable (l.f.p.) category and they bring an explicit construction of the final coalgebra in this case. On the other hand, there are interesting examples of final coalgebras beyond the realm of l.f.p. categories to which our results apply. We rely on ideas developed by Tom Leinster for the study of self-similar objects in topology.},
archivePrefix = {arXiv},
arxivId = {0905.4883},
author = {Karazeris, Panagis and Matzaris, Apostolos and Velebil, Jiř{\'{i}}},
doi = {10.1017/S0960129511000351},
eprint = {0905.4883},
issn = {0960-1295},
journal = {Math. Struct. Comput. Sci.},
month = jul,
number = {05},
pages = {1067--1108},
title = {Final coalgebras in accessible categories},
volume = {21},
year = {2011}
}
@incollection{Priestley2002,
author = {Priestley, Hilary A.},
booktitle = {Algebr. Coalgebraic Methods},
doi = {10.1007/3-540-47797-7_2},
editor = {Backhouse, Roland and Crole, Roy and Gibbons, Jeremy},
isbn = {978-3-540-43613-3},
pages = {21--78},
publisher = {Springer Berlin Heidelberg},
series = {Lecture Notes in Computer Science},
title = {Ordered Sets and Complete Lattices},
volume = {2297},
year = {2002}
}
@article{Cancila2006,
author = {Cancila, Daniela and Honsell, Furio and Lenisa, Marina},
doi = {10.1016/j.entcs.2006.06.005},
issn = {15710661},
journal = {Electron. Notes Theor. Comput. Sci.},
keywords = {category of sets,final coalgebra,functor,functor uniform on maps,inclusion preserving functor,set functor,$\kappa$-based functor,$\kappa$-reachable},
month = oct,
number = {1},
pages = {67--84},
title = {Some Properties and Some Problems on Set Functors},
volume = {164},
year = {2006}
}
@article{Baez2009,
abstract = {In physics, Feynman diagrams are used to reason about quantum processes. In the 1980s, it became clear that underlying these diagrams is a powerful analogy between quantum physics and topology: namely, a linear operator behaves very much like a "cobordism". Similar diagrams can be used to reason about logic, where they represent proofs, and computation, where they represent programs. With the rise of interest in quantum cryptography and quantum computation, it became clear that there is extensive network of analogies between physics, topology, logic and computation. In this expository paper, we make some of these analogies precise using the concept of "closed symmetric monoidal category". We assume no prior knowledge of category theory, proof theory or computer science.},
archivePrefix = {arXiv},
arxivId = {0903.0340},
author = {Baez, John C. and Stay, Mike},
eprint = {0903.0340},
journal = {ArXiv e-prints},
month = mar,
pages = {73},
title = {Physics, Topology, Logic and Computation: A Rosetta Stone},
year = {2009}
}
@incollection{Chen2014,
author = {Chen, Liang-Ting and Jung, Achim},
booktitle = {Proc. 30th Conf. Math. Found. Program. Semant. (MFPS XXX)},
doi = {10.1016/j.entcs.2014.10.007},
issn = {15710661},
pages = {109--128},
publisher = {Elsevier},
series = {ENTCS},
title = {On a categorical framework for coalgebraic modal logic},
volume = {308},
year = {2014}
}
@article{Cubric1998,
author = {{\v{C}}ubri{\'{c}}, Djordje},
doi = {10.1016/S0022-4049(96)00137-5},
issn = {00224049},
journal = {J. Pure Appl. Algebr.},
month = apr,
number = {1-3},
pages = {121--147},
title = {Embedding of a free cartesian-closed category into the category of sets},
volume = {126},
year = {1998}
}
@article{Menni2003,
abstract = {We characterize the categories with finite limits whose exact completions are toposes and discuss some examples and counter-examples. {\textcopyright} 2002 Elsevier Science B.V. All rights reserved.},
author = {Menni, Mat{\'{i}}as},
doi = {10.1016/S0022-4049(02)00261-X},
issn = {00224049},
journal = {J. Pure Appl. Algebr.},
pages = {287--301},
title = {A characterization of the left exact categories whose exact completions are toposes},
volume = {177},
year = {2003}
}
@incollection{Murawski2014,
author = {Murawski, Andrzej S. and Tzevelekos, Nikos},
booktitle = {Found. Softw. Sci. Comput. Struct.},
doi = {10.1007/978-3-642-54830-7_11},
editor = {Muscholl, Anca},
isbn = {978-3-642-54829-1},
pages = {164--179},
publisher = {Springer Berlin Heidelberg},
series = {Lecture Notes in Computer Science},
title = {Game Semantics for Nominal Exceptions},
year = {2014}
}
@article{Kianpi2010,
author = {Kianpi, Maurice and Jugnia, Celestin Nkuimi},
journal = {Arab. J. Sci. Eng.},
keywords = {behavioral,bisimulation,coalgebra,complete lattice,congruence,extensional,extensionalization,extensionally split,horn covariety,orthogonal,simple,simplification,simply split,subcoalgebra,topos,unitary},
number = {2},
pages = {295--313},
title = {On Simple and Extensional Coalgebras Beyond Set},
volume = {33},
year = {2010}
}
@article{Dalenius1977,
author = {Dalenius, T.},
journal = {Stat. Tidskr.},
number = {429},
title = {Towards a methodology for statistical disclosure control},
volume = {15},
year = {1977}
}
@article{Lin2014,
author = {Lin, Hanti},
doi = {10.1007/s11229-014-0398-1},
issn = {0039-7857},
journal = {Synthese},
keywords = {Adaptive rationality,Bayesian theory of rationality,Bounded rationality,Deciding how to decide,Deliberation costs,Externalism,Internalism,Rational choice},
month = mar,
number = {4},
pages = {661--670},
title = {On the regress problem of deciding how to decide},
volume = {191},
year = {2014}
}
@article{DeMontjoye2013,
abstract = {We study fifteen months of human mobility data for one and a half million individuals and find that human mobility traces are highly unique. In fact, in a dataset where the location of an individual is specified hourly, and with a spatial resolution equal to that given by the carrier's antennas, four spatio-temporal points are enough to uniquely identify 95% of the individuals. We coarsen the data spatially and temporally to find a formula for the uniqueness of human mobility traces given their resolution and the available outside information. This formula shows that the uniqueness of mobility traces decays approximately as the 1/10 power of their resolution. Hence, even coarse datasets provide little anonymity. These findings represent fundamental constraints to an individual's privacy and have important implications for the design of frameworks and institutions dedicated to protect the privacy of individuals.},
author = {de Montjoye, Yves-Alexandre and Hidalgo, C{\'{e}}sar A. and Verleysen, Michel and Blondel, Vincent D.},
doi = {10.1038/srep01376},
isbn = {2045-2322 (Electronic)\r2045-2322 (Linking)},
issn = {2045-2322},
journal = {Sci. Rep.},
month = dec,
number = {1},
pages = {1376},
pmid = {23524645},
title = {Unique in the Crowd: The privacy bounds of human mobility},
volume = {3},
year = {2013}
}
@incollection{Kick2002,
author = {Kick, Marco},
booktitle = {Proc. 29th Int. Collogquium Autom. Lang. Program. Part II},
doi = {10.1007/3-540-45465-9_45},
pages = {525--536},
title = {Bialgebraic Modelling of Timed Processes},
year = {2002}
}
@techreport{Bonchi2012,
abstract = {We introduce \\emphbisimulation up to congruence as a technique for proving language equivalence of non-deterministic finite automata. Exploiting this technique, we devise an optimisation of the classical algorithm by Hopcroft and Karp\\$\sim$\\citeHopcroftKarp that, instead of computing the whole determinised automata, explores only a small portion of it. Although the optimised algorithm remains exponential in worst case (the problem is PSPACE-complete), experimental results show improvements of several orders of magnitude over the standard algorithm.},
author = {Bonchi, Filippo and Pous, Damien},
keywords = {Language Equivalence,Non-deterministic Finite Au,automata,bisimulation,coinduction,congruence,equivalence,finite,language,non-deterministic,techniques,up-to},
mendeley-tags = {automata,bisimulation,coinduction,congruence,equivalence,finite,language,non-deterministic,techniques,up-to},
title = {Checking NFA equivalence with bisimulations up to congruence},
type = {Technical report},
year = {2012}
}
@inproceedings{Bell2005a,
author = {Bell, D.E.},
booktitle = {21st Annu. Comput. Secur. Appl. Conf.},
doi = {10.1109/CSAC.2005.37},
isbn = {0-7695-2461-3},
number = {Acsac},
pages = {337--351},
publisher = {IEEE},
title = {Looking Back at the Bell-La Padula Model},
year = {2005}
}
@article{Rutten1998a,
abstract = {Coalgebras of set functors preserving weak pullbacks are particularly well-behaved. Invoking a result by Carboni, Kelly, and Wood (1990), we show that this can be explained by the fact that such functors can be uniquely extended to a relator. This insight next suggests a definition of metric bisimulation. CC?? 1998 Published by Elsevier Science B.V.},
author = {Rutten, J.J.M.M.},
doi = {10.1016/S1571-0661(04)00063-5},
issn = {15710661},
journal

license_type: permissive

branch_name: refs/heads/master

extension: bib